ترغب بنشر مسار تعليمي؟ اضغط هنا

Rateless Coding for MIMO Block Fading Channels

240   0   0.0 ( 0 )
 نشر من قبل Yijia Fan
 تاريخ النشر 2008
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes of unit length for parallel channels having rate LR can be transformed directly into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR), to achieve the DMT performance limit.



قيم البحث

اقرأ أيضاً

A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity- achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a practical three-rate code family. We further construct rich sets of near-perfect rateless codes within our architecture that require either significantly fewer layers or lower complexity than their perfect counterparts. Variations of the basic construction are also developed, including one for time-varying channels in which there is no a priori stochastic model.
A rateless transmission architecture is developed for communication over Gaussian intersymbol interference channels, based on the concept of super-Nyquist (SNQ) signaling. In such systems, the signaling rate is chosen significantly higher than the Ny quist rate of the system. We show that such signaling, when used in conjunction with good off-the-shelf base codes, simple linear redundancy, and minimum mean-square error decision feedback equalization, results in capacity-approaching, low-complexity rateless codes for the time-varying intersymbol-interference channel. Constructions for both single-input / single-output (SISO) and multi-input / multi-output (MIMO) ISI channels are developed.
Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable rates of successive decoding (SD) receivers based on the linear minimum mean-squared error (LMMSE) channel estimation are analyzed in the large-system limit, by using the replica method under the assumption of replica symmetry. It is shown that negligible pilot information is best in terms of the achievable rates of the SD receivers in the large-system limit. The obtained analytical formulas of the achievable rates can improve the existing lower bound on the capacity of the MIMO channel with no channel state information (CSI), derived by Hassibi and Hochwald, for all signal-to-noise ratios (SNRs). The comparison between the obtained bound and a high SNR approximation of the channel capacity, derived by Zheng and Tse, implies that the high SNR approximation is unreliable unless quite high SNR is considered. Energy efficiency in the low SNR regime is also investigated in terms of the power per information bit required for reliable communication. The required minimum power is shown to be achieved at a positive rate for the SD receiver with no CSI, whereas it is achieved in the zero-rate limit for the case of perfect CSI available at the receiver. Moreover, numerical simulations imply that the presented large-system analysis can provide a good approximation for not so large systems. The results in this paper imply that SD schemes can provide a significant performance gain in the low-to-moderate SNR regimes, compared to conventional receivers based on one-shot channel estimation.
Approximate random matrix models for $kappa-mu$ and $eta-mu$ faded multiple input multiple output (MIMO) communication channels are derived in terms of a complex Wishart matrix. The proposed approximation has the least Kullback-Leibler (KL) divergenc e from the original matrix distribution. The utility of the results are demonstrated in a) computing the average capacity/rate expressions of $kappa-mu$/$eta-mu$ MIMO systems b) computing outage probability (OP) expressions for maximum ratio combining (MRC) for $kappa-mu$/$eta-mu$ faded MIMO channels c) ergodic rate expressions for zero-forcing (ZF) receiver in an uplink single cell massive MIMO scenario with low resolution analog-to-digital converters (ADCs) in the antennas. These approximate expressions are compared with Monte-Carlo simulations and a close match is observed.
This paper concerns the maximum coding rate at which data can be transmitted over a noncoherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. A high-SNR normal approximation of the maximum coding rate is presented that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals $L$ over which we code tend to infinity. Numerical analyses suggest that the approximation is accurate at SNR values above 15dB and when the number of coherence intervals is 10 or more.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا