Antijamming coding techniques

In this article, we have provided an overview of several coding techniques for erasure channels which can be or have been applied to cognitive radio systems as antijamming coding schemes for link maintenance purpose. We have discussed in detail the conventional erasure codes, LDPC codes, rate less codes, as well as recently proposed piecewise coding. Among these coding schemes, conventional RS codes are perfect in terms of erasure recovery performance. But they are not suitable for the antijamming purpose in cognitive radio due to inflexible code length and high decoding complexity for large block length. LDPC codes offer impressive capacity-approaching performance under very long code length. Well-designed LDPC codes with finite block length for erasure and burst-erasure channels may be applicable to cognitive radio system LDPC codes, rateless codes, as well asm.

[1]  Zhi Ding,et al.  CTH02-2: Cyclic Codes for Correcting Bursts of Errors or Erasures With Iterative Decoding , 2006, IEEE Globecom 2006.

[2]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[3]  James Lee Hafner,et al.  HoVer Erasure Codes For Disk Arrays , 2006, International Conference on Dependable Systems and Networks (DSN'06).

[4]  A. Wolisz,et al.  Reliable link maintenance in cognitive radio systems , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[5]  Khaled A. S. Abdel-Ghaffar,et al.  Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels , 2006, IEEE Transactions on Communications.

[6]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[7]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[8]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[9]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[10]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[11]  James S. Plank,et al.  A practical analysis of low-density parity-check erasure codes for wide-area storage applications , 2004, International Conference on Dependable Systems and Networks, 2004.

[12]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[13]  Syed Ali Jafar,et al.  COGNITIVE RADIOS FOR DYNAMIC SPECTRUM ACCESS - The Throughput Potential of Cognitive Radio: A Theoretical Perspective , 2007, IEEE Communications Magazine.

[14]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[15]  Cheng Huang,et al.  STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures , 2005, IEEE Transactions on Computers.

[16]  Joseph Mitola.  Cognitive Radio for Flexible Mobile Multimedia Communications , 2001, Mob. Networks Appl..

[17]  James S. Plank,et al.  Small parity-check erasure codes - exploration and observations , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[18]  S. Srinivasa,et al.  The Throughput Potential of Cognitive Radio: A Theoretical Perspective , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[19]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.

[20]  Haitao Zheng,et al.  Collaboration and fairness in opportunistic spectrum access , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[21]  Guosen Yue,et al.  Design of Anti-Jamming Coding for Cognitive Radio , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[22]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[23]  Shu Lin,et al.  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach , 2007, IEEE Transactions on Information Theory.

[24]  S. Wicker.  Error Control Systems for Digital Communication and Storage , 1994 .

[25]  Joseph Mitola,et al.  Cognitive radio: making software radios more personal , 1999, IEEE Wirel. Commun..

[26]  G. McLachlan,et al.  The EM algorithm and extensions , 1996 .

[27]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[28]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[29]  Rajarathnam Chandramouli,et al.  Reliable Multimedia Transmission Over Cognitive Radio Networks Using Fountain Codes , 2008, Proceedings of the IEEE.

[30]  Friedrich Jondral,et al.  Spectrum pooling: an innovative strategy for the enhancement of spectrum efficiency , 2004, IEEE Communications Magazine.

[31]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[32]  Danijela Cabric,et al.  White paper: Corvus: A cognitive radio approach for usage of virtual unlicensed spectrum , 2004 .

[33]  James Lee Hafner,et al.  WEAVER codes: highly fault tolerant erasure codes for storage systems , 2005, FAST'05.

[34]  Jehoshua Bruck,et al.  X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.