Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
A close-to-capacity dirty paper coding scheme
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this letter, we implement a simplified version of the Cover - van der Meulen - Hajek - Pursley (CMHP) coding originally characterized by Wajcer, Wiesel, and Shamai. The vector Gaussian broadcast channel with imperfect channel state information at the transmitter (CSIT) is considered where the transmitter only knows the channel mean and variance. Our focus is on the implementation and performance analysis of CMHP under the imperfect CSIT model using practical codes. Turbo codes described in IEEE 802.20 draft specification and quadrature amplitude modulation are used to implement CMHP. In order to find the optimal power allocation and beamforming vectors which maximize the sum rate with practical codes, we introduce the SINR penalty factor. The SNRs that achieve various target spectral efficiency are presented and analyzed.