The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, a high throughput pipeline HARQ scheme of polar codes is proposed as the throughput of conventional schemes are to be promoted. In this scheme, we use a pipeline structure that the current HARQ process may combine the source bits of the current process and the retransmission bits of the incorrectly decoded previous HARQ processes and the source bits of the current process may be retransmitted...
In this paper, we study a resource allocation scheme for downlink orthogonal frequency division multiplexing (OFDM) cognitive radio networks (CRNs) in which the cognitive base station (BS) is equipped with multiple antennas. The multiple description coding multicast (MDCM) model and beamforming technique are employed to maximize the total received rate of all cognitive radio (CR) users with the constraint...
Polar codes are a class of codes discovered recently, which are proved to have capacity-achieving performance. The hardware implementations of successive cancellation (SC) decoding and List SC decoding are increasing dramatically now. However, throughput of these hardware structures remain to be improved on the one hand. On the other hand, stochastic computation is now wildly used because it uses...
In this paper, w investigate the achievable throughput of cognitive radio ad hoc networks. The current research on throughput evaluations focus on the average value over spatial distribution of random nodes. However, these average models neglect performance discrepancies resulting from different spatial nodes. In order to overcome this limitation, we derive the achievable rate coverage probability...
A hybrid automatic repeat request scheme with Chase combing (HARQ-CC) of polar codes is proposed. The existing analysis tools of the underlying rate-compatible punctured polar (RCPP) codes for additive white Gaussian noise (AWGN) channels are extended to Rayleigh fading channels. Then, an approximation bound of the throughput efficiency for the polar coded HARQ-CC scheme is derived. Utilizing this...
This paper investigates the asymptotic throughput performance of common data delivery in cognitive radio networks (CRNs). Three schemes, named unicast, conventional multicast (CM) and Multiple Description Coding Multicast (MDCM), are compared by utilizing extreme value theory. The distributions of effective signal-to-noise-ratio (SNR) for unicast and CM belong to Domain of Attraction of Gumbel distribution...
Recently, General-purpose processor (GPP) soft defined radio (SDR) platforms have drawn great attention for their programmability and flexibility, and some high-speed wireless protocol stacks (e.g., IEEE 802.11a/b/g) have been implemented on them using commodity general-purpose PCs. Low-density parity-check (LDPC) codes are optionally used in IEEE 802.11n high throughput (HT) system as a high-performance...
Scheduling with single carrier property restriction has a significant impact on system performance in Long Term Evolution (LTE) uplink (UL). Due to the unavoidable delay of control signaling, the scheduling decisions have great influence on the variation of inter-cell interference (ICI) which affects the performance of adaptive modulation and coding (AMC). Many studies have been carried out on the...
In this paper, resource allocation problem with imperfect channel information in cognitive radio networks (CRNs) is studied concerning the multiple description coding (MDC) multicast transmission. The traditional unicast model is extended to MDC multicast in CRNs, which aims to maximize the total received rate of all cognitive radio (CR) users. Primarily, a new auxiliary variable, named as normalized...
A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (RCP) codes is proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes. Simulation results over binary-input additive white Gaussian noise channels show that, under a low-complexity successive cancellation decoder, the proposed HARQ scheme can perform...
Multimedia Broadcast/Multicast Service (MBMS) based on point-to-multipoint (p-t-m) radio transmission was introduced by 3GPP to deliver broadcast service to a group of user equipments (UEs) in a cellular system. As a broadcast system with uplink feedback, its performance is limited by UEs in poor connections. To utilize the limited radio resource more efficiently, a simple but effective mechanism...
Conventional heterogeneous-traffic scheduling schemes utilize zero-delay constraint for real-time services, which aims to minimize the average packet delay among real-time users. However, in light or moderate load networks this strategy is unnecessary and leads to low data throughput for non-real-time users. In this paper, we propose a heuristic scheduling scheme to solve this problem. The scheme...
In this paper, we proposed a revenue-based low-delay and efficient (R-LDE) algorithm for downlink packet scheduling in OFDMA systems. In actual operation of the network, telecommunication operators always expect the most revenue. Therefore, a simple revenue model is introduced and integrated into our proposed packet scheduling algorithm. The significances of R-LDE algorithm are threefold: firstly,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.