A Joint Improved Irregular Accumulate Concatenated Tree Coding and Frequency Hopping OFDM Modulation Scheme for Wireless Networks

Abstract:

Joint channel coding and spread spectrum modulation technologies bring to wireless networks the tremendous amount of performance improvement, the elimination, and the mitigation of interference. This paper proposes an improved design for irregular accumulate concatenated tree (IACT) codes, which can be viewed as simply precoded by an accumulator. This class of codes belongs to the special turbo-like codes, which combines the advantages of fast encoder structures of turbo codes, and the advantages of parallel high-speed belief-propagation (BP) iterative decoding algorithm of low-density parity-check (LDPC) codes. The improved IACT codes can be coded via a Tanner graph. With these improved codes, we propose a joint IACT coding and frequency hopping orthogonal frequency division multiplexing (FH-OFDM) modulation scheme for wireless networks. We compare the performance of different coding bases such as the irregular concatenated tree (ICT) codes and turbo codes in the scheme by theoretical analysis and simulation. Numerical results are shown that the proposed scheme with these IACT codes has really good performance.

• Periodical: Advanced Materials Research (Volume 902)
• Pages: 364-369
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.902.364
• Online since: February 2014
• Authors: Fu Quan Geng, Zhi Gang Huang, Xuan Jie Ning, Mao Fan Yang
• Keywords: Computer Wireless Networks, Frequency Hopping Orthogonal Frequency Division Multiplexing (FH-OFDM), Tanner Graph, Turbo-Like Codes

References

[1] C. Berrou, A. Glavieux and P. Thitimajshima: Near Shannon limit error-correcting coding and decoding: turbo codes. IEEE ICC'93 vol. 2 (1993), pp.1064-1070.

DOI: 10.1109/icc.1993.397441

[2] R.G. Gallager: Low-density parity-check codes. IRE Trans. Inform. Theory, vol. 8, no. 1 (1962), pp.21-28.

DOI: 10.1109/tit.1962.1057683

[3] D.J.C. MacKay, R.M. Neal: Near Shannon limit performance of low-density parity-check codes. Electron. Lett., vol. 32, no. 18 (1996), p.1645.

DOI: 10.1049/el:19961141

[4] D. Divsalar, H. Jin and R. McEliece: Coding theorms for turbo-like codes. 36th Allerton Conf. '98 (1998), pp.201-210.

[5] L. Ping, K.Y. Wu: Concatenated tree codes: a low-complexity, high-performance approach. IEEE Trans. Inform. Theory, vol. 47, no. 2 (2001), pp.791-799.

DOI: 10.1109/18.910589

[6] K. Stamatiou and J. Proakis: A performance analysis of coded frequency-hopped OFDM. IEEE WCNC'05, vol. 2 (2005), pp.1132-1137.

DOI: 10.1109/wcnc.2005.1424668

[7] M. Speth, S.A. Fechtel, G., Fock and H. Meyr: Optimum receiver design for wireless broad-band systems using OFDM-Part I. IEEE Trans. Commun., vol. 47, no. 1 (1999), pp.1668-1677.

DOI: 10.1109/26.803501

[8] 3GPP TR25. 814 V 7. 1. 0: Technical Specification Group Radio Access Networks. UTRA (2006), pp.4-6.

[9] S.Y. Chung, D. Forney, T. Richardson and R. Urbanke: On the design of low-density parity-check codes within 0. 0045 dB of the Shannon limit. IEEE Commun. Lett., vol. 5, no. 1 (2001), pp.58-60.

DOI: 10.1109/4234.905935

[10] H. Jin, A. Khandekar and R. McEliece: Irregular repeat-accumulate codes. IEEE Trans. Commun., vol. 55, no. 4 (2007), pp.692-702.

[11] W.K. Han, S.Y.L. Goff and B.S. Sharif: Repeat accumulate codes for bit-interleaved coded modulation with iterative demapping. IEEE ICSPC'07 vol. 11 (2007), pp.1543-1546.

DOI: 10.1109/icspc.2007.4728626

[12] A. Abbasfar, D. Divsalar and Y. Kung: Accumulate-repeat-accumulate codes. IEEE Trans. Commun., vol. 55, no. 4 (2007), pp.692-702.

DOI: 10.1109/tcomm.2007.894109

[13] K. Stamatiou and J.G. Proakis: A performance analysis of coded frequency-hopping OFDMA with pilot-assisted channel estimation. IEEE Proc. 16th Int. Symp. PIMRC. Vol. 3, no. 1 (2005), pp.362-366.

DOI: 10.1109/pimrc.2005.1651459