Skip to main content
Top
Published in: Annals of Telecommunications 1-2/2010

01-02-2010

General random coding bounds: AWGN channels to MIMO fading channels

Authors: Heung-No Lee, Jingqiao Zhang, Cheon Won Choi

Published in: Annals of Telecommunications | Issue 1-2/2010

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Random coding bounds are obtained for multiple-input multiple-output (MIMO) fading channels. To derive the result in a compact and easy-to-evaluate form, a series of combinatorial codeword enumeration problems are solved for input-constrained MIMO fading channels. The bounds obtained in this paper are shown useful as performance prediction measures for MIMO systems which employ turbo-like block codes as the outer code to derive the space-time inner code. The error exponents for MIMO channels are also derived from the bounds, and then compared with the classical Gallager error exponents as well as the channel capacities. The random coding bounds associated with the maximum likelihood receiver exhibit good match with the extensive system simulation results obtained with a turbo-iterative receiver.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Footnotes
1
Note that this is a little different from the classical definition of random codes in which repetition is allowed.
 
Literature
1.
go back to reference Telatar IE (1999) Capacity of multi-antenna Gaussian channels. Eur Trans Telecommun 10:585–595CrossRef Telatar IE (1999) Capacity of multi-antenna Gaussian channels. Eur Trans Telecommun 10:585–595CrossRef
2.
go back to reference Foschini GJ, Gans MJ (1998) On limits of wireless communications in a fading environment when using multiple antennas. Wirel Pers Commun 6:311–335CrossRef Foschini GJ, Gans MJ (1998) On limits of wireless communications in a fading environment when using multiple antennas. Wirel Pers Commun 6:311–335CrossRef
3.
go back to reference Berrou C, Glavieux A, Thitimajshima P (1993) Near Shannon limit error-correcting coding and decoding: turbo-codes. In Proc IEEE Int Conf Commun, Geneva, Switzerland, pp. 1064–1070 Berrou C, Glavieux A, Thitimajshima P (1993) Near Shannon limit error-correcting coding and decoding: turbo-codes. In Proc IEEE Int Conf Commun, Geneva, Switzerland, pp. 1064–1070
4.
go back to reference Gallager RG (1963) Low density parity check codes, monograph, M.I.T. Press Gallager RG (1963) Low density parity check codes, monograph, M.I.T. Press
5.
6.
go back to reference Richardson TJ, Amin Shokrollahi M, Urbanke RL (2001) Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans Inf Theory 47(2):619–37MATHCrossRef Richardson TJ, Amin Shokrollahi M, Urbanke RL (2001) Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans Inf Theory 47(2):619–37MATHCrossRef
7.
go back to reference Hochwald BM, ten Brink S (2003) Achieving near-capacity on a multiple-antenna channel. IEEE Trans Commun 51(3):389–399CrossRef Hochwald BM, ten Brink S (2003) Achieving near-capacity on a multiple-antenna channel. IEEE Trans Commun 51(3):389–399CrossRef
8.
go back to reference Zhang J, Lee H-N (2008) Performance analyses on LDPC coded system over quasi-static (MIMO) fading system. IEEE Trans Commun 56(12):2080–2093CrossRefMathSciNet Zhang J, Lee H-N (2008) Performance analyses on LDPC coded system over quasi-static (MIMO) fading system. IEEE Trans Commun 56(12):2080–2093CrossRefMathSciNet
9.
go back to reference Zhang J, Lee H-N (2006) A performance bound on random-coded MIMO systems. IEEE Commun Lett 10(3):168–170CrossRef Zhang J, Lee H-N (2006) A performance bound on random-coded MIMO systems. IEEE Commun Lett 10(3):168–170CrossRef
10.
go back to reference Zhang J, Lee H-N (2005) Union bounds on LDPC coded modulation systems over fast fading MIMO channels. IEEE Commun Lett 9(9):796–798CrossRefMathSciNet Zhang J, Lee H-N (2005) Union bounds on LDPC coded modulation systems over fast fading MIMO channels. IEEE Commun Lett 9(9):796–798CrossRefMathSciNet
11.
go back to reference Litsyn S, Shevelev V (2003) Distance distributions in ensembles of irregular low-density parity-check codes. IEEE Trans Inf Theory 49(12):3140–3159CrossRefMathSciNet Litsyn S, Shevelev V (2003) Distance distributions in ensembles of irregular low-density parity-check codes. IEEE Trans Inf Theory 49(12):3140–3159CrossRefMathSciNet
12.
go back to reference Sason I, Shamai S (2001) On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes. IEEE Trans Inf Theory 47(6):2275–2299MATHCrossRefMathSciNet Sason I, Shamai S (2001) On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes. IEEE Trans Inf Theory 47(6):2275–2299MATHCrossRefMathSciNet
13.
go back to reference Burshtein D, Miller G (2004) Asymptotic enumeration methods for analyzing LDPC codes. IEEE Trans Inf Theory 50(6):1115–1131CrossRefMathSciNet Burshtein D, Miller G (2004) Asymptotic enumeration methods for analyzing LDPC codes. IEEE Trans Inf Theory 50(6):1115–1131CrossRefMathSciNet
14.
go back to reference Berrou C, Vaton S (2002) Computing the minimum distance of linear codes by the error impulse method. Proc IEEE Intl Symp Inform Theory, Lausanne, Switzerland Berrou C, Vaton S (2002) Computing the minimum distance of linear codes by the error impulse method. Proc IEEE Intl Symp Inform Theory, Lausanne, Switzerland
15.
go back to reference Xiao-Yu H, Fossorier MPC, Eleftheriou E (2004) On the computation of the minimum distance of low-density parity-check codes. Proc IEEE Int Conf Comm 2:767–771 Xiao-Yu H, Fossorier MPC, Eleftheriou E (2004) On the computation of the minimum distance of low-density parity-check codes. Proc IEEE Int Conf Comm 2:767–771
16.
go back to reference Perez LC, Seghers J, Costello DJ Jr (1996) A distance spectrum interpretation of turbo codes. IEEE Trans Inf Theory 42(6):1698–1709MATHCrossRefMathSciNet Perez LC, Seghers J, Costello DJ Jr (1996) A distance spectrum interpretation of turbo codes. IEEE Trans Inf Theory 42(6):1698–1709MATHCrossRefMathSciNet
17.
go back to reference Kou Y, Lin S, Fossorier MPC (2001) Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans Inf Theory 47(7):2711–36MATHCrossRefMathSciNet Kou Y, Lin S, Fossorier MPC (2001) Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans Inf Theory 47(7):2711–36MATHCrossRefMathSciNet
18.
go back to reference Vasic B, Milenkovic O (2004) Combinatorial constructions of low-density parity-check codes for iterative decoding. IEEE Trans Inf Theory 50(6):1156–76CrossRefMathSciNet Vasic B, Milenkovic O (2004) Combinatorial constructions of low-density parity-check codes for iterative decoding. IEEE Trans Inf Theory 50(6):1156–76CrossRefMathSciNet
19.
go back to reference Gallager RG (1968) Information theory and reliable communications, Wiley Gallager RG (1968) Information theory and reliable communications, Wiley
20.
go back to reference Baccarelli E (2001) Evaluation of the reliable data rates supported by multiple-antenna coded wireless links for QAM transmissions. IEEE J Sel Areas Commun 19(2):295–304CrossRef Baccarelli E (2001) Evaluation of the reliable data rates supported by multiple-antenna coded wireless links for QAM transmissions. IEEE J Sel Areas Commun 19(2):295–304CrossRef
21.
go back to reference He W, Georghiades CN (2005) Computing the capacity of a MIMO fading channel under PSK signaling. IEEE Trans Inform Theory 51(5):1794–1803CrossRefMathSciNet He W, Georghiades CN (2005) Computing the capacity of a MIMO fading channel under PSK signaling. IEEE Trans Inform Theory 51(5):1794–1803CrossRefMathSciNet
22.
go back to reference Huang J, Meyn SP (2005) Characterization and computation of optimal distributions for channel coding. IEEE Trans Inf Theory 51(7):2336–2351CrossRefMathSciNet Huang J, Meyn SP (2005) Characterization and computation of optimal distributions for channel coding. IEEE Trans Inf Theory 51(7):2336–2351CrossRefMathSciNet
23.
go back to reference Bellorado J, Kavcic A (2003) Approaching the capacity of the MIMO Rayleigh flat-fading channel with QAM constellations, independent across antennas and dimensions, in Proc. IEEE Intl. Symp. Inform. Theory, Yokohama, Japan, pp. 270 Bellorado J, Kavcic A (2003) Approaching the capacity of the MIMO Rayleigh flat-fading channel with QAM constellations, independent across antennas and dimensions, in Proc. IEEE Intl. Symp. Inform. Theory, Yokohama, Japan, pp. 270
24.
go back to reference Tarokh V, Seshadri N, Calderbank AR (1998) Space–time codes for high data rate wireless communication: performance criterion and code construction. IEEE Trans Inf Theory 44(2):744–765MATHCrossRefMathSciNet Tarokh V, Seshadri N, Calderbank AR (1998) Space–time codes for high data rate wireless communication: performance criterion and code construction. IEEE Trans Inf Theory 44(2):744–765MATHCrossRefMathSciNet
25.
go back to reference Jalden J, Skoglund M, Ottersten B (2004) On the random coding exponent of multiple antenna systems using space-time block codes, in Proc IEEE Intl Symposium Inform. Theory, Chicago, IL, pp.188 Jalden J, Skoglund M, Ottersten B (2004) On the random coding exponent of multiple antenna systems using space-time block codes, in Proc IEEE Intl Symposium Inform. Theory, Chicago, IL, pp.188
26.
go back to reference Venkataraman P (2009) Applied optimization with matlab programming. Wiley Venkataraman P (2009) Applied optimization with matlab programming. Wiley
Metadata
Title
General random coding bounds: AWGN channels to MIMO fading channels
Authors
Heung-No Lee
Jingqiao Zhang
Cheon Won Choi
Publication date
01-02-2010
Publisher
Springer-Verlag
Published in
Annals of Telecommunications / Issue 1-2/2010
Print ISSN: 0003-4347
Electronic ISSN: 1958-9395
DOI
https://doi.org/10.1007/s12243-009-0139-5

Other articles of this Issue 1-2/2010

Annals of Telecommunications 1-2/2010 Go to the issue

Acknowledgments

2009 reviewers list

Premium Partner