Linear-time block noncoherent detection of PSK

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn , Issue , 2009, Pages 2465-2468

  McKilliam, Robby G ^a   Clarkson, I Vaughan L ^a   Ryan, Daniel J ^b   Collings, Iain B ^c  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^c CSIRO   (Australia)

Author keywords

Communication systems; Differential phase shift keying; Mobile communication

Indexed keywords

BLOCK FADING CHANNEL; CLOSE APPROXIMATION; DETECTION PROBLEMS; DIFFERENTIAL PHASE SHIFT KEYING; MOBILE COMMUNICATION; NEAREST LATTICE POINT; NON-COHERENT; NONCOHERENT DETECTION; NONCOHERENT SEQUENCE DETECTION; SEQUENCE LENGTHS; SIMULATION RESULT; TIME-BLOCK;

ACOUSTICS; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMMUNICATION SYSTEMS; DETECTORS; FADING (RADIO); FADING CHANNELS; MAXIMUM LIKELIHOOD; MOBILE TELECOMMUNICATION SYSTEMS; PHASE SHIFT; SIGNAL DETECTION; SIGNAL PROCESSING; SIGNAL TO NOISE RATIO;

PHASE SHIFT KEYING;

EID: 70349493018     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2009.4960121     Document Type: Conference Paper

References (20)

1. R. Chen, R. Koetter, D. Agrawal, and U. Madhow, "Joint demodulation and decoding for the noncoherent block fading channel: a practical framework for approaching Shannon capacity," IEEE Trans. Commun., vol. 51, no. 10, pp. 1676-1689, Oct. 2003.
2. D. J. Ryan, I. V. L. Clarkson, and I. B. Collings, "GLRT-optimal noncoherent lattice decoding," IEEE Trans. Signal Process., vol. 55, pp. 3773-3786, July 2007.
3. S. G. Wilson, J. Freebersyser, and C. Marshall, "Multi-symbol detection of MPSK," Proc. IEEE GLOBECOM, pp. 1692-1697, Nov. 1989.
4. D. Makrakis and K. Feher, "Optimal noncoherent detection of PSK signals," Electronics Letters, vol. 26, no. 6, pp. 398-400, Mar. 1990.
5. J. Liu, J. Kim, S. C. Kwatra, and G. H. Stevens, "An analysis of the MPSK scheme with differential recursive detection (DRD)," Proc. IEEE Conf. on Veh. Tech., pp. 741-746, May 1991.
6. D. Warrier and U. Madhow, "Spectrally efficient noncoherent communication," IEEE Trans. Inform. Theory, vol. 48, no. 3, pp. 651-668, Mar. 2002.
7. W. Sweldens, "Fast block noncoherent decoding," IEEE Comms. Letters, vol. 5, no. 4, pp. 132-134, Apr. 2001.
8. K.M. Mackenthun, "A fast algorithm for multiple-symbol differential detection of MPSK," IEEE Trans. Commun., vol. 42, pp. 1471-1474, Feb/Mar/Apr 1994.
9. R. G. McKilliam, D. J. Ryan, I. V. L. Clarkson, and I. B. Collings, "An improved algorithm for optimal noncoherent QAM detection," Proc. Australian Commun. Theory Workshop, pp. 64-68, Jan. 2008.
10. J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and groups, Springer, 3rd edition, 1998.
11. n*," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Marc Fossorier, Hideki Imai, Shu Lin, and Alain Poli, Eds., vol. 1719 of Lecture Notes in Computer Science, pp. 104-120. Springer, 1999.
12. n*," IEEE Trans. Inform. Theory, vol. 54, no. 9, pp. 4378-4381, Sep. 2008.
13. n* ," International Symposium on Information Theory and its Applications, 2008.
14. W. J.Weber, "Differential encoding for multiple amplitude and phase shift keying systems," IEEE Trans. Commun., vol. 26, pp. 385-391, Mar. 1978.
15. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
16. J. H. Conway and N. J. A. Sloane, "Fast quantizing and decoding and algorithms for lattice quantizers and codes," IEEE Trans. Inform. Theory, vol. 28, no. 2, pp. 227-232, Mar. 1982.
17. J. H. Conway and N. J. A. Sloane, "Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice," IEEE Trans. Inform. Theory, vol. 32, no. 1, pp. 41-50, Jan. 1986.
18. P. van Emde Boas, "Another NP-complete partition problem and the complexity of computing short vectors in a lattice," Tech. Rep., Mathematisch Instituut, Roetersstraat 15, 1018 WB Amsterdam, The Netherlands, Apr. 1981.
19. 2 is NP-hard for randomized reductions," in Proc. 30th ACM Symposium on Theory of Computing, pp. 10-19, May 1998.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press. and McGraw-Hill, 2nd edition, 2001.