We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

EXIT Chart Optimization for a Serial Concatenation of an SCCC and a Space-time Trellis Code

Published on February 2013 by Amit Hooda, Ankur Aggarwal, Alberto Tarable
journal_cover_thumbnail

Mobile and Embedded Technology International Conference 2013
Foundation of Computer Science USA
MECON - Number 1
February 2013
Authors: Amit Hooda, Ankur Aggarwal, Alberto Tarable
565ccc5b-c56e-4bcc-b739-586989376cdc

Amit Hooda, Ankur Aggarwal, Alberto Tarable . EXIT Chart Optimization for a Serial Concatenation of an SCCC and a Space-time Trellis Code. Mobile and Embedded Technology International Conference 2013. MECON, 1 (February 2013), 8-12.

@article{
author = { Amit Hooda, Ankur Aggarwal, Alberto Tarable },
title = { EXIT Chart Optimization for a Serial Concatenation of an SCCC and a Space-time Trellis Code },
journal = { Mobile and Embedded Technology International Conference 2013 },
issue_date = { February 2013 },
volume = { MECON },
number = { 1 },
month = { February },
year = { 2013 },
issn = 0975-8887,
pages = { 8-12 },
numpages = 5,
url = { /proceedings/mecon/number1/10787-1002/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Mobile and Embedded Technology International Conference 2013
%A Amit Hooda
%A Ankur Aggarwal
%A Alberto Tarable
%T EXIT Chart Optimization for a Serial Concatenation of an SCCC and a Space-time Trellis Code
%J Mobile and Embedded Technology International Conference 2013
%@ 0975-8887
%V MECON
%N 1
%P 8-12
%D 2013
%I International Journal of Computer Applications
Abstract

In this paper, we face the design of a space-time trellis code (STTC) to be used in serial concatenation with an SCCC, in order to be iteratively decoded at the coherent receiver. Both Rayleigh and Rice MIMO fading channels are considered. EXIT charts are the key design tool that has been used to optimize the STTC. Simulation results show indeed the advantage of using a recursive STTC w. r. t. using a nonrecursive STTC or even simple spatial multiplexing.

References
  1. G. J. Foschini and M. J. Gans, "On limits of wireless communications in a fading environment when using multiple antennas," Wirel. Pers. Commun. , vol. 6, pp. 311-335, 1998.
  2. I. E. Telatar, "Capacity of multi-antenna Gaussian channels," Europ. Trans. on Telecommun. , vol. 10, pp. 585-595, Nov. /Dec. 1999.
  3. V. Tarokh, N. Seshadri and A. R. Calderbank, "Space-time codes for high data rate wireless communications: Performance criterion and code construction," IEEE Trans. Inform. Theory, vol. 44, pp. 744-765, Mar. 1998.
  4. L. Zheng and D. Tse, "Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels,'' IEEE Trans. Inform. Theory, vol. 49, pp. 1073 -- 1096, May 2003.
  5. C. Berrou, A. Glavieux and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," ," in Proc. IEEE Int. Conf. Commun. (ICC 1993), pp. 1064-1070, May 1993.
  6. A. Stefanov and T. M. Duman, "Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: system model, decoding approaches, and practical considerations," IEEE J. Select. Areas Commun. , vol. 19, pp. 958-968, May 2001.
  7. A. Tarable, G. Montorsi, and S. Benedetto, "A suboptimum iterative decoder for space-time trellis codes," in Proc. IEEE Int. Conf. Commun. (ICC 2004), pp. 3000-3004, June 2004.
  8. V. Gulati and K. R. Narayanan, "Concatenated codes for fading channels based on recursive space-time trellis codes," IEEE Trans. Wireless Comm. , vol. 2, pp. 118-128, Jan. 2003.
  9. Y. Li, B. Vucetic, Q. Zhang and Y. Huang, "Assembled space-time turbo trellis codes," IEEE Trans. on Veh. Technol. , vol. 54, pp. 1768- 1772, Sept. 2005.
  10. H. Lee, B. Lee, and I. Lee, "Iterative detection and decoding with an improved V-BLAST for MIMO-OFDM systems," IEEE J. Select. Areas Commun. , vol. 24, pp. 504 -513, March 2006.
  11. T. Duman and A. Ghrayeb, Coding for MIMO communication systems. Wiley, 2008, Chapter 7.
  12. S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara, "Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding," IEEE Trans. on Inform. Th. , vol. 44, pp. 909-926, May 1998.
  13. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. on Commun. , vol. 49, pp. 1727-1737, Oct 2001.
  14. S. ten Brink, G. Kramer and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. on Commun. , vol. 52, pp. 670- 678, April 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Mimo Serially Concatenated Convolutional Codes Space-time Trellis Codes Iterative Receivers Exit Charts