Abstract
The parallel encoding and decoding structure of turbo codes makes them natural candidate for coded-cooperative scenarios. In this paper, we focus on one of the key components of turbo codes i.e., interleaver, and analyze its effect on the performance of coded-cooperative communication. The impact of an interleaver on the overall performance of cooperative systems depends on the type of an interleaver and its location in the cooperative encoding scheme. We consider code matched interleaver (CMI) as an optimum choice and present its role in a coded-cooperation scenario. The search and convergence of CMI for long interleaver sizes is an issue; therefore, a modification in the search conditions is included without any compromise on the performance of CMI. We also present analytical method to determine maximum S-constraint length for a CMI design. Further, we analyze the performance of two different encoding schemes of turbo codes, i.e., distributed turbo code (DTC) and distributed multiple turbo code (DMTC) after inclusion of CMI. Monte Carlo simulations show that CMI increases the diversity gain relative to other conventional interleavers such as uniform random interleaver. The channel is assumed to be Rayleigh fading among all communication nodes.
References
[1] T. S. Rappaport, Wireless Communications: Principles and Practice, vol. 2. Upper Saddle River, NJ: Prentice Hall PTR, 1996.Search in Google Scholar
[2] W. C. Jakes and D. C. Cox, Microwave Mobile Communications. Hoboken, NJ: Wiley-IEEE Press, 1994.10.1109/9780470545287Search in Google Scholar
[3] S. Alamouti, “A simple transmit diversity technique for wireless communications,”IEEE J. Sel. Areas Commun., vol. 16, pp. 1451–1458, 1998.Search in Google Scholar
[4] E. C. Van Der Meulen, “Three-terminal communication channels,”Adv. Appl. Probab, vol. 3, pp. 120–154, 1971.10.1017/S0001867800037605Search in Google Scholar
[5] T. Cover and A. E. Gamal, “Capacity theorems for the relay channel,”IEEE Trans. Inf. Theory, vol. 25, pp. 572–584, 1979.10.1109/TIT.1979.1056084Search in Google Scholar
[6] A. Host-Madsen, “On the capacity of wireless relaying,” in 56th IEEE 2002 Vehicular Technology Conf., 2002, Proc. VTC 2002-Fall, 2002, pp. 1333–1337.Search in Google Scholar
[7] G. Kramer, M. Gastpar, and P. Gupta, “Capacity theorems for wireless relay channels,” in Proc. of The Ann. Allerton Conf. on Communication Control and Computing, 2003, pp. 1074–1083.Search in Google Scholar
[8] J. N. Laneman, D. N. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,”IEEE Trans. Inf. Theory, vol. 50, pp. 3062–3080, 2004.Search in Google Scholar
[9] J. N. Laneman, G. W. Wornell, and D. N. Tse, “An efficient protocol for realizing cooperative diversity in wireless networks,” in Proc. 2001 IEEE Int. Symp. on Information Theory, 2001, p. 294.Search in Google Scholar
[10] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity. Part I. System description,”IEEE Trans. Commun., vol. 51, pp. 1927–1938, 2003.Search in Google Scholar
[11] T. E. Hunter and A. Nosratinia, “Cooperation diversity through coding,” in Proc. IEEE Int. Symp. on Information Theory, 2002, p. 220.Search in Google Scholar
[12] M. Janani, A. Hedayat, T. E. Hunter, and A. Nosratinia, “Coded cooperation in wireless communications: space-time transmission and iterative decoding,”IEEE Trans. Signal Process., vol. 52, pp. 362–371, 2004.10.1109/TSP.2003.821100Search in Google Scholar
[13] T. E. Hunter and A. Nosratinia, “Diversity through coded cooperation,”IEEE Trans. Wireless Commun., vol. 5, pp. 283–289, 2006.10.1109/TWC.2006.1611050Search in Google Scholar
[14] A. Stefanov and E. Erkip, “Cooperative coding for wireless networks,”IEEE Trans. Commun., vol. 52, pp. 1470–1476, 2004.Search in Google Scholar
[15] S. Yiu, R. Schober, and L. Lampe, “Distributed space-time block coding,”IEEE Trans. Commun., vol. 54, pp. 1195–1206, 2006.Search in Google Scholar
[16] Y. Li and X.-G. Xia, “Full diversity distributed space-time trellis codes for asynchronous cooperative communications,” in Proc. Int. Symp. on Information Theory, ISIT, 2005, pp. 911–915.Search in Google Scholar
[17] A. Chakrabarti, A. De Baynast, A. Sabharwal, and B. Aazhang, “Low density parity check codes for the relay channel,”IEEE J. Sel. Areas Commun., vol. 25, 280–291, 2007.10.1109/JSAC.2007.070205Search in Google Scholar
[18] J. Hu and T. M. Duman, “Low density parity check codes over wireless relay channels,”IEEE Trans. Wireless Commun., vol. 6, pp. 3384–3394, 2007.Search in Google Scholar
[19] B. Zhao and M. C. Valenti, “Distributed turbo coded diversity for relay channel,”Electron. Lett., vol. 39, pp. 786–787, 2003.10.1049/el:20030526Search in Google Scholar
[20] M. C. Valenti and B. Zhao, “Distributed turbo codes: towards the capacity of the relay channel,” in 2003 IEEE 58th Vehicular Technology Conf., 2003, VTC 2003-Fall, 2003, pp. 322–326.10.1109/VETECF.2003.1285032Search in Google Scholar
[21] C. Berrou and A. Glavieux, “Near optimum error correcting coding and decoding: turbo-codes,”IEEE Trans. Commun., vol. 44, pp. 1261–1271, 1996.Search in Google Scholar
[22] Z. Zhang and T. M. Duman, “Capacity-approaching turbo coding and iterative decoding for relay channels,”IEEE Trans. Commun., vol. 53, pp. 1895–1905, 2005.Search in Google Scholar
[23] Z. Zhang and T. M. Duman, “Capacity-approaching turbo coding for half-duplex relaying,”IEEE Trans. Commun., vol. 55, pp. 1895–1906, 2007.Search in Google Scholar
[24] S. Benedetto and G. Montorsi, “Unveiling turbo codes: some results on parallel concatenated coding schemes,”IEEE Trans. Inf. Theory, vol. 42, pp. 409–428, 1996.10.1109/18.485713Search in Google Scholar
[25] G. C. Clark Jr and J. B. Cain, Error-Correction Coding for Digital Communications. Plenum Press, NY: Springer, 1981.10.1007/978-1-4899-2174-1Search in Google Scholar
[26] A. S. Barbulescu and S. S. Pietrobon, “Terminating the trellis of turbo-codes in the same state,”Electron. Lett., vol. 31, pp. 22–23, 1995.10.1049/el:19950008Search in Google Scholar
[27] I. Richer, “A simple interleaver for use with Viterbi decoding,”IEEE Trans. Commun., vol. 26, pp. 406–408, 1978.10.1109/TCOM.1978.1094070Search in Google Scholar
[28] D. Divsalar and F. Pollara, “Turbo codes for PCS applications,” in 1995 IEEE Int. Conf. on Communications, 1995, ICC’95 Seattle, ‘Gateway to Globalization’, 1995, pp. 54–59.Search in Google Scholar
[29] W. Feng, J. Yuan, and B. S. Vucetic, “A code-matched interleaver design for turbo codes,”IEEE Trans. Commun., vol. 50, pp. 926–937, 2002.10.1109/TCOMM.2002.1010612Search in Google Scholar
[30] L. C. Perez, J. Seghers, and D. J. Costello, “A distance spectrum interpretation of turbo codes,”IEEE Trans. Inf. Theory, vol. 42, pp. 1698–1709, 1996.Search in Google Scholar
[31] P. Robertson, E. Villebrun, and P. Hoeher, “A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,” in IEEE Int. Conf. on Communications, 1995. ICC’95 Seattle, ‘Gateway to Globalization’, 1995, pp. 1009–1013.Search in Google Scholar
[32] J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,”IEEE Trans. Inf. Theory, vol. 42, pp. 429–445, 1996.10.1109/18.485714Search in Google Scholar
[33] D. Divsalar and F. Pollara, “Multiple turbo codes,” in Military Communications Conf., 1995, MILCOM’95, Conf. Rec., IEEE, 1995, pp. 279–285.Search in Google Scholar
©2015 by De Gruyter
Articles in the same Issue
- Frontmatter
- Design and Implementation of an Adaptive Space–Time Antenna Array for GPS Receivers
- Novel Compact Mushroom-Type EBG Structure for Electromagnetic Coupling Reduction of Microstrip Antenna array
- Gain Improvement of Microstrip Patch Antenna Using CLS Split Ring Resonator Metamaterial
- Microwave Material Properties of Nanoparticle-Doped Nematic Liquid Crystals
- Attenuation in Superconducting Rectangular Waveguides
- Time–Frequency Distribution Analyses of Ku-Band Radar Doppler Echo Signals
- Optimal Beamforming and Performance Analysis of Wireless Relay Networks with Unmanned Aerial Vehicle
- Cluster-Based Multipolling Sequencing Algorithm for Collecting RFID Data in Wireless LANs
- An Adaptive Cooperative Strategy for Underlay MIMO Cognitive Radio Networks: An Opportunistic and Low-Complexity Approach
- Opportunistic Channel Scheduling for Ad Hoc Networks with Queue Stability
- Turbo Codes with Modified Code Matched Interleaver for Coded-Cooperation in Half-Duplex Wireless Relay Networks
Articles in the same Issue
- Frontmatter
- Design and Implementation of an Adaptive Space–Time Antenna Array for GPS Receivers
- Novel Compact Mushroom-Type EBG Structure for Electromagnetic Coupling Reduction of Microstrip Antenna array
- Gain Improvement of Microstrip Patch Antenna Using CLS Split Ring Resonator Metamaterial
- Microwave Material Properties of Nanoparticle-Doped Nematic Liquid Crystals
- Attenuation in Superconducting Rectangular Waveguides
- Time–Frequency Distribution Analyses of Ku-Band Radar Doppler Echo Signals
- Optimal Beamforming and Performance Analysis of Wireless Relay Networks with Unmanned Aerial Vehicle
- Cluster-Based Multipolling Sequencing Algorithm for Collecting RFID Data in Wireless LANs
- An Adaptive Cooperative Strategy for Underlay MIMO Cognitive Radio Networks: An Opportunistic and Low-Complexity Approach
- Opportunistic Channel Scheduling for Ad Hoc Networks with Queue Stability
- Turbo Codes with Modified Code Matched Interleaver for Coded-Cooperation in Half-Duplex Wireless Relay Networks