Joint Turbo Coding and Source-Controlled Modulation of Cycle-Stationary Sources in the Bandwidth-Limited Regime

  • Idoia Ochoa
  • Pedro M. Crespo
  • Javier Del Ser
  • Mikel Hernaez
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 45)

Abstract

In this paper we propose a novel one-layer coding/shaping transmission system for the bandwidth-limited regime based on single-level codes and sigma-mapping [1]. Specifically, we focus on cycle- stationary information sources with independent symbols. High spectral efficiencies can be achieved by combine at the transmitter a Turbo code with a sigma-mapper. Furthermore, the encoded symbols are modulated by using an asymmetric energy allocation technique before entering the aforementioned sigma-mapper. The corresponding decoder iterates between the Turbo decoder and the sigma-demapper, which exchange progressively refined extrinsic probabilities of the encoded symbols. For the Additive White Gaussian Noise (AWGN) channel, simulation results obtained for very simple Turbo codes show that the proposed system attains low bit error rates at signal-to-noise ratios relatively close to the corresponding Shannon limit. These promising results pave the way for future investigations towards reducing the aforementioned energy gap, e.g. by utilizing more powerful Turbo codes.

Keywords

Turbo codes sigma-mapping bandwidth-limited regime unequal energy allocation cycle-stationary sources 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ma, X., Ping, L.: Coded Modulation Using Superimposed Binary Codes. IEEE Transactions on Information Theory 50(12) (2004)Google Scholar
  2. 2.
    Burrows, M., Wheeler, D.: A Block Sorting Lossless Data Compression Algorithm, Digital Systems Center, Research Report 124 (1994)Google Scholar
  3. 3.
    Visweswariah, K., Kulkarni, S., Verdu, S.: Output Distribution of the Burrows-Wheeler transform. In: IEEE International Symposium on Information Theory, Sorrento, Italy (2000)Google Scholar
  4. 4.
    Shannon, C.E.: A Mathematical Theory of Communication. Bell System Technical Journal 27, 379–423, 623–656 (1948)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Del Ser, J., Crespo, P.M., Esnaola, I., Garcia-Frias, J.: Source-Controlled Turbo Coding of Sources with Memory using the Burrows-Wheeler Transform. In: IEEE International Symposium on Turbo Codes, Munich, Germany (2006)Google Scholar
  6. 6.
    Cabarcas, F., Souza, R.D., Garcia-Frias, J.: Turbo Coding of Strongly Non-Uniform Memoryless Sources with Unequal Energy Allocation and PAM Signaling. IEEE Transactions on Signal Processing 54(5), 1942–1946 (2006)CrossRefGoogle Scholar
  7. 7.
    Kschischang, F.R., Frey, B.J., Loeliger, H.-A.: Factor Graphs and the Sum-Product Algorithm. IEEE Transactions on Information Theory 47(2), 498–519 (2001)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Crespo, P.M., Loyo, E., Del Ser, J.: Uncoded Optimal Binary Communication for Sources with Memory. Elsevier AEU International Journal of Electronics and Communications 62(8), 597–609 (2007)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2010

Authors and Affiliations

  • Idoia Ochoa
    • 1
  • Pedro M. Crespo
    • 1
  • Javier Del Ser
    • 2
  • Mikel Hernaez
    • 1
  1. 1.CEIT and TECNUN (University of Navarra)San SebastianSpain
  2. 2.TECNALIA-TELECOMZamudioSpain

Personalised recommendations