More Web Proxy on the site http://driver.im/

research-article

A Deterministic Construction for Jointly Designed Quasicyclic LDPC Coded-Relay Cooperation

Authors:

Nauman Ali Khan Academic Editor:

Mohammed El-HajjarAuthors Info & Claims

Wireless Communications and Mobile Computing, Volume 2019

https://doi.org/10.1155/2019/5249373

Published: 01 January 2019 Publication History

Abstract

This correspondence presents a jointly designed quasicyclic (QC) low-density parity-check (LDPC) coded-relay cooperation with joint-iterative decoding in the destination node. Firstly, a design-theoretic construction of QC-LDPC codes based on a combinatoric design approach known as optical orthogonal codes (OOC) is presented. Proposed OOC-based construction gives three classes of binary QC-LDPC codes with no length-4 cycles by utilizing some known ingredients including binary matrix dispersion of elements of finite field, incidence matrices, and circulant decomposition. Secondly, the proposed OOC-based construction gives an effective method to jointly design length-4 cycles free QC-LDPC codes for coded-relay cooperation, where sum-product algorithm- (SPA-) based joint-iterative decoding is used to decode the corrupted sequences coming from the source or relay nodes in different time frames over constituent Rayleigh fading channels. Based on the theoretical analysis and simulation results, proposed QC-LDPC coded-relay cooperations outperform their competitors under same conditions over the Rayleigh fading channel with additive white Gaussian noise.

References

[1]

A. H. Mehana and A. Nosratinia, “Diversity of MMSE MIMO receivers,” IEEE Transactions on Information Theory, vol. 58, no. 11, pp. 6788–6805, 2012.

Digital Library

[2]

S. Karmakar and M. K. Varanasi, “The diversity-multiplexing tradeoff of the MIMO half-duplex relay channel,” IEEE Transactions on Information Theory, vol. 58, no. 12, pp. 7168–7187, 2012.

Digital Library

[3]

E. C. Van der Meulen, “Three-terminal communication channels,” Advances in Applied Probability, vol. 3, no. 1, pp. 120–154, 1971.

[4]

S. Ikki and M. H. Ahmed, “Performance analysis of incremental relaying cooperative diversity networks over Rayleigh fading channels,” in Proceedings of the 2008 IEEE Wireless Communications and Networking Conference, pp. 1311–1315, Las Vegas, NV, USA, April 2008.

[5]

T. Cover and A. E. Gamal, “Capacity theorems for the relay channel,” IEEE Transactions on Information Theory, vol. 25, no. 5, pp. 572–584, 1979.

Digital Library

[6]

A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity-Part I: system description,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1927–1938, 2003.

[7]

K. Azarian, H. ElGamal, and P. Schniter, “On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4152–4172, 2005.

Digital Library

[8]

J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3062–3080, 2004.

Digital Library

[9]

P. Razaghi and W. Yu, “Bilayer low-density parity-check codes for decode-and-forward in relay channels,” IEEE Transactions on Information Theory, vol. 53, no. 10, pp. 3723–3739, 2007.

Digital Library

[10]

J. P. Canees and V. Meghdadi, “Optimized low density parity check codes designs for half duplex relay channels,” IEEE Transactions on Wireless Communications, vol. 8, no. 7, pp. 3390–3395, 2009.

Digital Library

[11]

C. X. Li, G. S. Yue, M. A. Khojastepour, X. Wang, and M. Madihian, “LDPC-coded cooperative relay systems: performance analysis and code design,” IEEE Transactions on Communications, vol. 56, no. 3, pp. 485–496, 2008.

[12]

C. Li, G. Yue, X. Wang, and M. Khojastepour, “LDPC code design for half-duplex cooperative relay,” IEEE Transactions on Wireless Communications, vol. 7, no. 11, pp. 4558–4567, 2008.

Digital Library

[13]

F. Yang, J. Chen, P. Zong, S. Zhang, and Q. Zhang, “Joint iterative decoding for pragmatic irregular LDPC-coded multi-relay cooperations,” International Journal of Electronics, vol. 98, no. 10, pp. 1383–1397, 2011.

[14]

Y. Zhang, F.-F. Yang, and W. Song, “Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences,” Discrete Dynamics in Nature and Society, vol. 2015, 7 pages, 2015.

[15]

Y. Chang, R. Fuji-Hara, and Y. Miao, “Combinatorial constructions of optimal optical orthogonal codes with weight 4,” IEEE Transactions on Information Theory, vol. 49, no. 5, pp. 1283–1292, 2003.

Digital Library

[16]

M. Shikui and Y. Chang, “A new class of optimal optical orthogonal codes with weight five,” IEEE Transactions on Information Theory, vol. 50, no. 8, pp. 1848–1850, 2004.

Digital Library

[17]

S. Wang, L. Wang, and J. Wang, “A new class of optimal optical orthogonal codes with weight six,” in Proceedings of the 2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA), pp. 66–69, Bengaluru, India, September 2015.

[18]

C. Wensong and J. C. Charles, “Optimal n,4,2-OOC of small orders,” Discrete Mathematics, vol. 279, no. 1–3, pp. 163–172, 2004.

[19]

C. Wensong and J. C. Charles, “Recursive constructions for optimal n,4,2-OOCs,” Journal of Combinatorial Designs, vol. 12, no. 5, pp. 333–345, 2004.

[20]

Y. Chang and Y. Miao, “Constructions for optimal optical orthogonal codes,” Discrete Mathematics, vol. 261, no. 1–3, pp. 127–139, 2003.

Digital Library

[21]

K. Chen, G. Ge, and L. Zhu, “Starters and related codes,” Journal of Statistical Planning and Inference, vol. 86, no. 2, pp. 379–395, 2000.

[22]

R. Gallager, “Low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, 1962.

[23]

Y. Kou, S. Lin, and M. P. C. Fossorier, “Low-density parity-check codes based on finite geometries: a rediscovery and new results,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2711–2736, 2001.

Digital Library

[24]

L. Chen, J. Xu, I. Djurdjevic, and S. Lin, “Near-Shannon-limit quasi-cyclic low-density parity-check codes,” IEEE Transactions on Communications, vol. 52, no. 7, pp. 1038–1042, 2004.

[25]

W. E. Ryan and S. Lin, Channel Codes: Classical and Modern, University of Cambridge, New York, NY, USA, 2009.

[26]

X. Y. Hu, E. Eleftheriou, and D. M. Arnold, “Regular and irregular progressive edge-growth Tanner graphs,” IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 386–398, 2005.

Digital Library

[27]

D. Divsalar, S. Dolinar, C. Jones, and K. Andrews, “Capacity-approaching protograph codes,” IEEE Journal on Selected Areas in Communications, vol. 27, no. 6, pp. 876–888, 2009.

Digital Library

[28]

Q. Diao, Q. Huang, S. Lin, and K. Abdel-Ghaffar, “A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 4030–4048, 2012.

Digital Library

[29]

J. Li, K. Liu, S. Lin, and K. Abdel-Ghaffar, “Algebraic quasi-cyclic LDPC codes: construction, low error-floor, large girth and a reduced-complexity decoding scheme,” IEEE Transactions on Communications, vol. 62, no. 8, pp. 2626–2637, 2014.

[30]

M. P. C. Fossorier, “Quasi-cyclic low-density parity-check codes from circulant permutation matrices,” IEEE Transactions on Information Theory, vol. 50, no. 8, pp. 1788–1793, 2004.

Digital Library

[31]

J. Xu, L. Chen, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, “Construction of regular and irregular LDPC codes: geometry decomposition and masking,” IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 121–134, 2007.

Digital Library

[32]

Q. Diao, Y. Y. Tai, S. Lin, and K. Abdel-Ghaffar, “LDPC codes on partial geometries: construction, trapping set structure, and puncturing,” IEEE Transactions on Information Theory, vol. 59, no. 12, pp. 7898–7914, 2013.

Digital Library

[33]

B. Vasic and O. Milenkovic, “Combinatorial constructions of low-density parity-check codes for iterative decoding,” IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1156–1176, 2004.

Digital Library

[34]

S. J. Johnson and S. R. Weller, “Resolvable 2-designs for regular low-density parity-check codes,” IEEE Transactions on Communications, vol. 51, no. 9, pp. 1413–1419, 2003.

[35]

S. J. Johnson and S. R. Weller, “A family of irregular LDPC codes with low encoding complexity,” IEEE Communications Letters, vol. 7, no. 2, pp. 79–81, 2003.

[36]

H. Park, S. Hong, J.-S. No, and D.-J. Shin, “Construction of high-rate regular quasi-cyclic LDPC codes based on cyclic difference families,” IEEE Transactions on Communications, vol. 61, no. 8, pp. 3108–3113, 2013.

[37]

M. Fujisawa and S. Sakata, “A construction of high rate quasi-cyclic regular LDPC codes from cyclic difference families with girth 8,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E90-A, no. 5, pp. 1055–1061, 2007.

Digital Library

[38]

H. Falsafain and M. Esmaeili, “Construction of structured regular LDPC codes: a design-theoretic approach,” IEEE Transactions on Communications, vol. 61, no. 5, pp. 1640–1647, 2013.

[39]

M. Asif, W. Y. Zhou, M. Ajmal, A. Zain ul Abiden, and A. K. Nauman, “A construction of high performance quasicyclic LDPC codes: a combinatoric design approach,” Wireless Communications and Mobile Computing, vol. 2019, 10 pages, 2019.

Digital Library

[40]

V. Sina and N. R. Majid, “A new scheme of high performance quasi-cyclic LDPC codes with girth 6,” IEEE Communications Letters, vol. 19, no. 10, pp. 1666–1669, 2015.

[41]

C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs, CRC, Boca Raton, FL, USA, 1996.

[42]

F. R. K. Chung, J. A. Salehi, and V. K. Wei, “Optical orthogonal codes: design, analysis, and applications,” IEEE Transactions on Information Theory, vol. 35, no. 3, pp. 595–604, 1998.

Digital Library

[43]

G. Ge and J. Yin, “Constructions for optimal (v, 4, 1) optical orthogonal codes,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2998–3004, 2001.

Digital Library

[44]

S. Bitan and T. Etzion, “Constructions for optimal constant weight cyclically permutable codes and difference families,” IEEE Transactions on Information Theory, vol. 41, no. 1, pp. 77–87, 1995.

Digital Library

[45]

H. Hanani, “Balanced incomplete block designs and related designs,” Discrete Mathematics, vol. 11, no. 3, pp. 255–369, 1975.

Digital Library

[46]

K. Chen and L. Zhu, “Existence of (q, k, 1) difference families with q a prime power and k = 4, 5,” Journal of Combinatorial Designs, vol. 7, no. 1, pp. 21–30, 1999.

[47]

Y. Tang and J. Yin, “Combinatorial constructions for a class of optimal OOCs,” Science in China, vol. 45, pp. 1268–1275, 2002.

[48]

Y. Chang and L. Ji, “Optimal (4up, 5, 1) optical orthogonal codes,” Journal of Combinatorial Designs, vol. 12, no. 5, pp. 346–361, 2004.

[49]

K. Chen and L. Zhu, “Existence of q,6,1 difference families with q a prime power,” Designs, Codes and Cryptography, vol. 15, no. 2, pp. 167–173, 1998.

Digital Library

[50]

Y. Miao and R. Fuji-Hara, “Optical orthogonal codes: their bounds and new optimal constructions,” IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2396–2406, 2000.

Digital Library

Cited By

Chen CYang FXu H(2024)Jointly optimized quasi-cyclic LDPC codes for coded-cooperative wireless networks based on split labeling diversityTelecommunications Systems10.1007/s11235-024-01102-z85:3(461-476)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s11235-024-01102-z
Saleem AXu YKhan RRasheed IJaffri ZLayek M(2022)Statistical Characteristics of 3D MIMO Channel Model for Vehicle-to-Vehicle CommunicationsWireless Communications & Mobile Computing10.1155/2022/90904942022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/9090494
Rasheed IAsif MKhan WIhsan AUllah KAli M(2022)Blockchain-Based Trust Verification and Streaming Service Awareness for Big Data-Driven 5G and Beyond Vehicle-to-Everything (V2X) CommunicationWireless Communications & Mobile Computing10.1155/2022/73578202022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/7357820
Show More Cited By

Index Terms

A Deterministic Construction for Jointly Designed Quasicyclic LDPC Coded-Relay Cooperation

Index terms have been assigned to the content through auto-classification.

Recommendations

Joint iterative decoding for LDPC‐coded multi‐relay cooperation with receive multi‐antenna in the destination

This study proposes an low density party check (LDPC)‐coded multi‐relay cooperation with receive multi‐antenna in the destination over a Rayleigh‐fading channel, where maximal ratio combining and belief propagation algorithm (BP)‐based joint iterative ...
LDPC-Coded Cooperation with Receive Multi-Antenna and Unknown CSI in the Destination

This paper studies a coded cooperation scheme with receive multi-antenna in the destination. A kind of simple-encoding irregular systematic low-density-parity-check (LDPC) codes is applied to the scheme. For Rayleigh block fading channels, in the ...
The Design of Efficiently-Encodable LDPC Codes for Coded Cooperation in Relay Channel
CMC '10: Proceedings of the 2010 International Conference on Communications and Mobile Computing - Volume 02

For the application of LDPC in relay channel, a new matrix construction method for LDPC code is presented. The parity bits generated by the relay node are viewed as part of the whole code in the destination thus can be transmitted directory to the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Wireless Communications & Mobile Computing

Wireless Communications & Mobile Computing Volume 2019, Issue

2019

3202 pages

ISSN:1530-8669

Issue’s Table of Contents

Copyright © 2019 Muhammad Asif et al.

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Publisher

John Wiley and Sons Ltd.

United Kingdom

Publication History

Published: 01 January 2019

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen CYang FXu H(2024)Jointly optimized quasi-cyclic LDPC codes for coded-cooperative wireless networks based on split labeling diversityTelecommunications Systems10.1007/s11235-024-01102-z85:3(461-476)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s11235-024-01102-z
Saleem AXu YKhan RRasheed IJaffri ZLayek M(2022)Statistical Characteristics of 3D MIMO Channel Model for Vehicle-to-Vehicle CommunicationsWireless Communications & Mobile Computing10.1155/2022/90904942022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/9090494
Rasheed IAsif MKhan WIhsan AUllah KAli M(2022)Blockchain-Based Trust Verification and Streaming Service Awareness for Big Data-Driven 5G and Beyond Vehicle-to-Everything (V2X) CommunicationWireless Communications & Mobile Computing10.1155/2022/73578202022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/7357820
Akhtar ZRasool HAsif MKhan WJaffri ZAli M(2022)Driver’s Face Pose Estimation Using Fine-Grained Wi-Fi Signals for Next-Generation Internet of VehiclesWireless Communications & Mobile Computing10.1155/2022/73530802022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/7353080
Asif MKhan WAfzal HNebhen JUllah IRehman AKaabar M(2021)Reduced-Complexity LDPC Decoding for Next-Generation IoT NetworksWireless Communications & Mobile Computing10.1155/2021/20295602021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/2029560

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents