Anti-jamming coding techniques with application to cognitive radio

IEEE Transactions on Wireless Communications

Volumn 8, Issue 12, 2009, Pages 5996-6007

  Yue, Guosen ^a   Wang, Xiaodong ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b Columbia University ^*  (United States)

Author keywords

Anti jamming coding; Cognitive radio; Rateless codes; Short block codes

Indexed keywords

ANTI-JAMMING; CODING SCHEME; CODING TECHNIQUES; COGNITIVE RADIO; GOODPUT PERFORMANCE; HIGH THROUGHPUT; LOW COMPLEXITY; NONUNIFORM; PARALLEL CHANNEL; PARITY CHECK; PIECE-WISE; RATELESS CODES; RATELESS CODING; RELIABLE TRANSMISSION; SHORT CODES; SUB-OPTIMAL DESIGNS; SUBCHANNELS;

BLOCK CODES; JAMMING; RADIO SYSTEMS; SECURITY SYSTEMS; TRANSMISSIONS;

RADIO;

EID: 73049083486     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2009.12.081627     Document Type: Article

References (23)

1. S. Haykin, "Cognitive radio: brain-empowered wireless communications," IEEE J. Select. Areas Commun., vol.23, no.2, pp. 201-220, Feb. 2005.
2. J. Mitola and G. Q. Maguire, Jr., "Cognitive radio: making software radios more personal," Wireless Personal Commun., vol.6, no.4, pp. 13-18, Aug. 1999.
3. D. Willkomm, J. Gross, and A. Wolisz, "Reliable link maintenance in cognitive radio systems," in Proc. IEEE Int. Symp. New Frontiers Dynamic Spectrum Access Networks (DySPAN 2005), Baltimore, MD, Nov. 2005, pp. 371-378.
4. D. Cabric, S. M. Mishra, D. Willkomm, R. W. Brodersen, and A.Wolisz, "A cognitive radio approach for usage of virtual unlicensed spectrum," in Proc. 14th IST Mobile Wireless Commun. Summit 2005, Dresden, Germany, June 2005.
5. M. Luby, "LT-code," in Proc. ACM Symp. Funndations of Computer Sci. (FOCS), 2002.
6. M. Shokrollahi, "Raptor codes," IEEE Trans. Inform. Theory, vol.52, no.6, pp. 2551-2567, June 2006.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol.27, no.5, pp. 533-547, Sept. 1981.
8. M. G. Luby, M. Mitzenmacher, M. A. Shokrohalli, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol.47, no.2, pp. 569-584, Feb. 2001.
9. T. Richardson and R. Urbanke, "Capacity of low density parity check codes under message passing decoding," IEEE Trans. Inform. Theory, vol.47, no.2, pp. 599-618, Feb. 2001.
10. T. Richardson, M. A. Shokrohalli, and R. Urbanke, "Design of capacity approaching irregular low density parity check codes," IEEE Trans. Inform. Theory, vol.47, no.2, pp. 619-637, Feb. 2001.
11. J. S. Plank, A. L. Buchsbaum, R. L. Collins, and M. G. Thomason, "Small parity-check erasure codes-exploration and observations," in Proc. IEEE Int. Conf. Dependable Syst. and Networks (DSN), Yokohama, Japan, June 2005, pp. 326-335.
12. R. W. Broaderson, A. Wolisz, D. Cabric, S. M. Mishra, and D. Willkom, "CORVUS: a cognitive radio approach for usage of virtual unlicensed spectrum," 2004, white paper.
13. D. J. C. MacKay, Information Theory, Inference, and Learning Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 2003.
14. B. Hajek, "Connections between network coding and stochastic network theory," in Stochastic Networks Conference, Urbana, IL, June 2006, available at http://www.ifp.illinois.edu/̃hajek/Papers/HajekStochNets06. pdf.
15. E. Maneva and A. Shokrollahi, "New model for rigorous analysis of LTcodes," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Seattle, WA, July 2006.
16. S. Sanghavi, "Intermediate performance of rateless codes," in Proc. IEEE Inform. Theory Workshop (ITW), Lake Tahoe, CA, Sept. 2007.
17. R. W. R. Darling and J. R. Norris, "Structure of large random hypergraphs," Ann. Appl. Probab., vol. 15, no. 1A, pp. 125-152, 2005.
18. R. Karp, M. Luby, and A. Shokrollahi, "Finite length analysis of LT codes," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Chicago, IL, June 2004, pp. 37-37
19. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol.48, no.6, pp. 1570- 1579, June 2002.
20. N. Rahnavard and F. Fekri, "Bounds on maximum-likelihood decoding of finite-length rateless codes," in Proc. Conf. Info. Sci. Syst. (CISS), Baltimore, MD, Mar. 2005.
21. K. Lee and H. Radha, "A maximum-likelihood decoding algorithm of LT codes with a small fraction of dense rows," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Nice, France, June 2007.
22. X. Wang, G. Yue, and K. R. Narayanan, "Optimization of LDPC-coded turbo CDMA systemss," IEEE Trans. Signal Processing, vol.53, no.4, pp. 1500-1510, Apr. 2005.
23. A. Shokrollahi and R. Storn, "Design of efficient erasure codes with differential evolution," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Sorrento, Italy, June 2000, pp. 5-5