Code designs for MIMO broadcast channels

Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. We consider the case in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user. For a fixed transmitter power, we choose the linear transmit precoding matrix such that the SINRs at users are uniformly maximized, thus ensuring the best bit-error rate performance. We start with Cover's simplest two-user Gaussian BC and present a coding scheme that operates 1.44 dB from the boundary of the capacity region at the rate of one bit per real sample (b/s) for each user. We then extend the coding strategy to a two-user MIMO Gaussian BC with two transmit antennas at the base-station and develop the first limit-approaching code design using nested turbo codes for DPC. At the rate of 1 b/s for each user, our design operates 1.48 dB from the capacity region boundary. We also consider the performance of our scheme over a slow fading BC. For two transmit antennas, simulation results indicate a performance loss of only 1.4 dB, 1.64 dB and 1.99 dB from the theoretical limit in terms of the total transmission power for the two, three and four user case, respectively

Distributed video coding for wireless video sensor networks: a review of the state-of-the-art architectures

Distributed video coding (DVC) is a relatively new video coding architecture originated from two fundamental theorems namely, Slepian–Wolf and Wyner–Ziv. Recent research developments have made DVC attractive for applications in the emerging domain of wireless video sensor networks (WVSNs). This paper reviews the state-of-the-art DVC architectures with a focus on understanding their opportunities and gaps in addressing the operational requirements and application needs of WVSNs

Scalable video/image transmission using rate compatible PUM turbo codes

The robust delivery of video over emerging wireless networks poses many challenges due to the heterogeneity of access networks, the variations in streaming devices, and the expected variations in network conditions caused by interference and coexistence. The proposed approach exploits the joint optimization of a wavelet-based scalable video/image coding framework and a forward error correction method based on PUM turbo codes. The scheme minimizes the reconstructed image/video distortion at the decoder subject to a constraint on the overall transmission bitrate budget. The minimization is achieved by exploiting the rate optimization technique and the statistics of the transmission channel

Space-Time Trellis and Space-Time Block Coding Versus Adaptive Modulation and Coding Aided OFDM for Wideband Channels

Abstract—The achievable performance of channel coded spacetime trellis (STT) codes and space-time block (STB) codes transmitted over wideband channels is studied in the context of schemes having an effective throughput of 2 bits/symbol (BPS) and 3 BPS. At high implementational complexities, the best performance was typically provided by Alamouti’s unity-rate G2 code in both the 2-BPS and 3-BPS scenarios. However, if a low complexity implementation is sought, the 3-BPS 8PSK space-time trellis code outperfoms the G2 code. The G2 space-time block code is also combined with symbol-by-symbol adaptive orthogonal frequency division multiplex (AOFDM) modems and turbo convolutional channel codecs for enhancing the system’s performance. It was concluded that upon exploiting the diversity effect of the G2 space-time block code, the channel-induced fading effects are mitigated, and therefore, the benefits of adaptive modulation erode. In other words, once the time- and frequency-domain fades of the wideband channel have been counteracted by the diversity-aided G2 code, the benefits of adaptive modulation erode, and hence, it is sufficient to employ fixed-mode modems. Therefore, the low-complexity approach of mitigating the effects of fading can be viewed as employing a single-transmitter, single-receiver-based AOFDM modem. By contrast, it is sufficient to employ fixed-mode OFDM modems when the added complexity of a two-transmitter G2 scheme is affordable

Rateless Coding for Gaussian Channels

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.Comment: 18 page