Skip to main content
Log in

Codage avec information adjacente pour les canaux de diffusion MIMO

Dirty paper coding schemes for MIMO broadcast channels

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Résumé

Cet article présente des stratégies de codage permettant d’implanter Vidée du codage avec information adjacente (ou dpc, dirty paper coding) dans le cadre du canal de diffusion avec un émetteur et des récepteurs à antennes multiples. Ce travail décrit des stratégies de codage qui utilisent la connaissance du canal à l’émetteur qui s’inspirent de concepts suggérés par la théorie de l’information. La mise en œuvre complète des algorithmes de codage et de décodage nous permet d’évaluer les performances de ces stratégies en termes de taux d’erreurs binaires et non pas en terme de région de débit de codage. Différents codeurs internes et externes sont comparés entre eux. Enfin, nous considérons le codage dpc en tant que stratégie d’accès multiple et le comparons avec l’accès multiple temporel (TDMA). Nous verrons que les résultats obtenus pour les codeurs pratiques proposés ne concordent pas toujours avec les prédictions théoriques pour les codeurs optimaux.

Abstract

We propose several dirty paper coding schemes for the broadcast channel when both the transmitter and receivers are equipped with multiple antennas. These schemes are based on channel state information at the transmitter and inspired from information-theoretic concepts. The proposed end-to-end algorithms allows us to evaluate the performance of the broadcast channel in terms of bit error rates and not in terms of coding rates as it is usually the case in the literature. Different inner coding schemes such as the ZF-DPC and MMSE-DPC and different outer coding schemes such as the THS, SCS and TCQ are compared and discussed. We also consider the DPC idea as a way of implementing a multiple access scheme. In this respect it is compared with the well-known TDMA scheme. Sometimes our conclusions show quite surprising results in comparison to what is expected by pure information-theoretic considerations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Bibliographie

  1. Mohammad-khani (G.R.), Lasaulce (S.), Dumont (J.), “About the performance of practical dirty paper coding schemes in Gaussian MIMO broadcast channels”, in IEEE Proc. of Signal Processing Advances in Wireless Communications, Cannes, 2006.

    Google Scholar 

  2. Mohammad-khani (G. R.), Lasaulce (S.), Dumont (J.), “DPC VS TDMA in SISO broadcast channels: a practical comparison”, in IEEE Proc. of Internat. Symp. on Signal Processing and Inf. Technology, Vancouver, Aug. 2006, pp. 174–179.

    Google Scholar 

  3. Cover (T. M.), “Broadcast channels”, IEEE Trans. on Inf. Theo., vol. 18(1), 1972, pp. 2–14.

    MathSciNet  MATH  Google Scholar 

  4. Weingarten (H.), Steinberg (Y.), Shamai (S.), “The capacity region of the Gaussian multiple-input multiple-output broadcast channel”, IEEE Trans. on Inf. Theo., vol. 52, n° 9, Sep. 2006, pp. 3936–3964.

    MathSciNet  Google Scholar 

  5. Costa (M.H.M.), “Writing on dirty paper”, IEEE Trans. on Inf. Theo., vol. 29, n° 3, 1983, pp. 439–441.

    MATH  Google Scholar 

  6. Caire (G.), Shamai (S.), “On the achievable throughput of a multiantenna Gaussian broadcast channel”, IEEE Trans. on Inf. Theo., vol. 49, n° 7, 2003, pp. 1691–1706.

    MathSciNet  Google Scholar 

  7. Viswanath (P.), Tse (D. N. C.), “Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality”, IEEE Trans. on Inf Theo., vol. 49, n° 8, 2003, pp. 1912–1921.

    MathSciNet  Google Scholar 

  8. Vishwanath (S.), Jindal (N.), Goldsmith (A.), “Duality, achievable rates and sum-rate capacity of Gaussian MIMO broadcast channels”, IEEE Trans. on Inf Theo., vol. 49, n° 10, 2003, pp. 2658–2668.

    MathSciNet  Google Scholar 

  9. Chou (J.), Pradhan (S.), El ghaoui (L.), Ramchandran (K.), “A robust optimization solution to the data hiding problem using distributed source coding principles”, in Proc. SPIE: Image Video Comm. Process, vol. 3974, Jan. 2000.

    Google Scholar 

  10. Yu (W.), Varodoyan (D. P.), Cioffi (J.M.), “Trellis and convolutional precoding for transmitter-based pre-substraction”, IEEE Trans. on Comm., vol. 53, n° 7, July 2005, pp. 1220–1230.

    Google Scholar 

  11. Yu (W.) and Cioffi (J.M.), “Trellis precoding for the broadcast channel”, in IEEE Proc. of Global Telecommunications Conference, San Antonio, TX, USA, vol. 2, 2001, pp: 1344–1348.

    Google Scholar 

  12. Forney (GD.), “Trellis shaping”, IEEE Trans. on Inf. Theo., vol. 38, n° 3, Mar. 1992, pp. 281–300.

    MathSciNet  MATH  Google Scholar 

  13. Zamir (R.), Shamai (S.), Erez (U.), “Nested linear/lattice codes for structured multiterminal binning”, IEEE Trans. on Inf. Theo., vol. 48, n° 6, 2002, pp. 1250–1276.

    MathSciNet  MATH  Google Scholar 

  14. Erez (U.), Zamir (R.), “Achieving 1/2 log(1 + SNR) on the AWGN channel with lattice encoding and decoding”, IEEE Trans,. on Inf. Theo., vol. 50, n° 10, 2004, pp. 2293–2314.

    MathSciNet  Google Scholar 

  15. Tomlinson (M.), “New Automatic Equalizer Employing Modulo Arithmetic”, Elec. Lett., vol. 7, Mar. 1971, pp. 138–139.

    Google Scholar 

  16. Miyakawa (M.), Harashima (H.), “A Method of Code Conversion for a Digital Communication Channel with Intersymbol Interference”, Trans. Inst. Elec. Comm. Eng., Japan, vol. 52-A, June 1969, pp. 272–273.

    Google Scholar 

  17. Eggers (J.), Bauml (R), Tzshoppe (R.), Girod (B.), “Scalar Costa scheme for information embedding”, IEEE Trans. an Sig. Prac, vol. 51, n° 4, 2003, pp. 1003–1019.

    MathSciNet  Google Scholar 

  18. Jindal (N.), Goldsmith (A.), “Dirty-paper coding versus TDMA for MIMO Broadcast channels”, IEEE Trans. An Inf. Theo., vol. 51, n° 5, May 2005, pp. 1783–1794.

    MathSciNet  Google Scholar 

  19. Yang (S.), Belfiore (J.C.), “The Impact of Channel Estimation Error on the DPC Region of the Two-User Gaussian Broadcast Channel”, in Proc. of Allertan Conf., Monticello, Sep. 2005.

    Google Scholar 

  20. Lapidoth (A.), Shamai (S.), Wigger (M. A.), “On the capacity of fading MIMO broadcast channels with imperfect transmitter side-information”, in Proc. of Allertan Conf., Monticello, Sep. 2005.

    Google Scholar 

  21. Spencer (Q. H.), Peel (C. B.), Swindelhurst (A. L.), Haardt (M.), “An introduction to the Multi-User MIMO Downlink”, IEEE Comm. Mag., Oct. 2004, pp. 60–67.

    Google Scholar 

  22. Spencer (Q. H.), Swindlehurst (A. L.), Haardt (M.), “Zero-Forcing Methods for Downlink Spatial Multiplexing in Multiuser MIMO Channels”, IEEE Trans. an Sig. Proc, vol. 52, n° 2, Feb. 2004, pp. 461–471.

    Google Scholar 

  23. Telatar (E.), “Capacity of Multi-antenna Gaussian Channels”, Europ. Trans. Telecom., vol. 10, Nov. 1999, pp. 585–595.

    Google Scholar 

  24. Windpassinger (C.), Fischer (R.F.H.), Huber (J.B.), “Lattice-reduction-aided broadcast precoding”, IEEE Trans. an Communications, vol. 52, n° 12, pp. 2057–2060, Dec. 2004.

    Google Scholar 

  25. Airy (M.), Forenza (A.), Heath (R.W.), Shakkottai (S.), “Practical Costa precoding for the multiple antenna broadcast channel”, Globecom 2004, vol. 6, pp. 3942–3946.

    Google Scholar 

  26. Tu (Z.), Blum (R. S.), “Multiuser diversity for a dirty paper approach”, IEEE Comm. Letters, vol. 7, n° 8, 2003, pp. 370–372.

    Google Scholar 

  27. Yu (W.), Cioffi (J.), “The sum capacity of a Gaussian vector broadcast channel”, IEEE Trans. on Inf. Theo, vol. 50, n° 9, Sep. 2004, pp. 1875–1892.

    Google Scholar 

  28. Pepin (C.), Belfiore (J. C.), Boutros (J.), “Quantization of both stationary and nonstationary Gaussian sources with Voronoi constellations”, in IEEE Proc. of ISIT, 1997, pp. 59.

    Chapter  Google Scholar 

  29. Lasaulce (S.), Sellami (N.), “On the impact of using unreliable data on the bootstrap channel estimation performance”, in IEEE Prac. Sig. Proc. far Advances in Wireless Comm., Rome, Italy, June 2003, pp. 348–352.

    Google Scholar 

  30. Ungerboeck (G.), “Trellis-Coded Modulation with Redundant Signal Sets”, in IEEE Comm. Mag., vol. 25, n°2, 1987, pp. 5–21.

    Google Scholar 

  31. Le guelvouit (G.), “Trellis-Coded Quantization for Public-Key Steganography”, in the IEEE Proc. of the International Conference an Acoustics, Speech and Signal Processing (ICASSP), Philadelphia, 2005.

    Google Scholar 

  32. Chou (J.), “Turbo and Trellis-Based Construction for Source Coding with Side Information”, in the Proc. of the 2003 Data Compression Conference, 2003, pp. 33–42.

    Google Scholar 

  33. Sampath (H.), Stoica (P.), Paulraj (A.), “Generalized Linear Precoder and Decoder Design for MIMO Channels Using the Weighted MMSE Criterion”, IEEE Trans. Comm., vol. 49, pp. 2198–2206, Dec. 2001.

    Google Scholar 

  34. Scaglione (A.), Stoica (P.), Barbarossa (S.), Giannakis (G.B.), Sampath (H.), “Optimal designs for Space-Time linear precoders and decoders”, IEEE Trans. Sig. Proc., vol. 50, pp. 1051–1064, May 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Samson Lasaulce, Julien Dumont, Gholam Reza Mohammad-Khani or Raphaël Visoz.

Additional information

Fr

Ce travail de recherche a été sponsorisé par France Télécom R&D et a été effectué dans le cadre du contrat No 46 127 353 entre France Telecom R&D et le CNRS. Des parties de cet article ont été présentées dans les actes de deux conférences IEEE: [2] et [1].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lasaulce, S., Dumont, J., Mohammad-Khani, G.R. et al. Codage avec information adjacente pour les canaux de diffusion MIMO. Ann. Telecommun. 62, 1143–1170 (2007). https://doi.org/10.1007/BF03253310

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03253310

Mots clés

Key words

Navigation