Single block finite alphabet based source recovery and channel identification

It has been known that under certain conditions the source symbols can be recovered and the channel identified given only the channel output and knowledge of the alphabet generating the source symbols. However. an arbitrarily large number of received symbols may have to be observed. This paper considers the case when null guards are present between blocks of symbols and proves that source recovery and channel identification is always possible given only a single received block. A Viterbi-like algorithm implementing this single block source recovery strategy is also derived.

[1]  Lang Tong,et al.  Indeterminacy and identifiability of blind identification , 1991 .

[2]  Jonathan H. Manton,et al.  A Viterbi-like decoder for linearly precoded and m-coded communication systems , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[3]  A. Benveniste,et al.  Blind Equalizers , 1984, IEEE Trans. Commun..

[4]  Hui Liu,et al.  Recent developments in blind channel equalization: From cyclostationarity to subspaces , 1996, Signal Process..

[5]  C.R. Johnson,et al.  Admissibility in blind adaptive channel equalization , 1991, IEEE Control Systems.

[6]  A. Benveniste,et al.  Robust identification of a nonminimum phase system: Blind adjustment of a linear equalizer in data communications , 1980 .

[7]  Benjamin Friedlander,et al.  Blind equalization of digital communication channels using high-order moments , 1991, IEEE Trans. Signal Process..

[8]  John M. Cioffi,et al.  Discrete multiple tone modulation with coset coding for the spectrally shaped channel , 1992, IEEE Trans. Commun..

[9]  Jonathan H. Manton,et al.  Finite alphabet source recovery in polynomial systems , 2002, Syst. Control. Lett..

[10]  Lang Tong,et al.  Blind identification and equalization based on second-order statistics: a time domain approach , 1994, IEEE Trans. Inf. Theory.

[11]  Jonathan H. Manton.  An OFDM interpretation of zero padded block transmissions , 2002, Syst. Control. Lett..

[12]  Ehud Weinstein,et al.  New criteria for blind deconvolution of nonminimum phase systems (channels) , 1990, IEEE Trans. Inf. Theory.

[13]  Jonathan H. Manton.  Dissecting OFDM: the independent roles of the cyclic prefix and the IDFT operation , 2001, IEEE Communications Letters.

[14]  Antonio Ruiz,et al.  Frequency domain data transmission using reduced computational complexity algorithms , 1980, ICASSP.

[15]  J. Cadzow.  Blind deconvolution via cumulant extrema , 1996, IEEE Signal Process. Mag..

[16]  Bo Wahlberg,et al.  Blind equalization by direct examination of the input sequences , 1995, IEEE Trans. Commun..