Cochannel interference suppression through time/space diversity

Wireless systems are subject to a time-varying and unknown a priori combination of cochannel interference, fading, and Gaussian noise. It is well known that multiple antennas can provide diversity in space that allows system tradeoffs between interference suppression and mitigation of fading. This paper describes how to achieve these same tradeoffs through diversity in time provided by channel coding. The mathematical description of time diversity is identical to that of space diversity, and what emerges is a unified framework for signal processing. Decoding algorithms are provided for repetition codes, rate 1/n convolutional codes, first-order Reed-Muller codes, and a new class of linear combination codes that provide cochannel interference suppression. In all cases it is possible to trade performance for complexity by choosing between joint estimation and a novel low-complexity linear canceler structure that treats interference as noise. This means that a single code can be used in a variety of system environments just by changing the processing in the receiver.

[1]  Sergio Verdú,et al.  Linear multiuser detectors for synchronous code-division multiple-access channels , 1989, IEEE Trans. Inf. Theory.

[2]  Sergio Verdú,et al.  Minimum probability of error for asynchronous Gaussian multiple-access channels , 1986, IEEE Trans. Inf. Theory.

[3]  Gregory J. Pottie,et al.  Channel coding for cochannel interference suppression in wireless communication systems , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[4]  Richard D. Gitlin,et al.  The impact of antenna diversity on the capacity of wireless communication systems , 1994, IEEE Trans. Commun..

[5]  Asrar U. H. Sheikh,et al.  Advances in Equalization and Diversity for Portable Wireless Systems , 1993 .

[6]  Andrew J. Viterbi,et al.  On the capacity of a cellular CDMA system , 1991 .

[7]  Co-channel interference cancelling receiver for TDMA mobile systems , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[8]  Frank M. Hsu,et al.  Square root Kalman filtering for high-speed data received over fading dispersive HF channels , 1982, IEEE Trans. Inf. Theory.

[9]  Jr. G. Forney,et al.  Coset Codes-Part 11: Binary Lattices and Related Codes , 1988 .

[10]  Carl-Erik W. Sundberg,et al.  The performance of rate-compatible punctured convolutional codes for digital mobile radio , 1990, IEEE Trans. Commun..

[11]  Gregory J. Pottie,et al.  Channel Coding Strategies for Cellular Radio , 1993, Proceedings. IEEE International Symposium on Information Theory.

[12]  Shahid U. H. Qureshi,et al.  Reduced-state sequence estimation with set partitioning and decision feedback , 1988, IEEE Trans. Commun..

[13]  N. J. A. Sloane,et al.  New family of single-error correcting codes , 1970, IEEE Trans. Inf. Theory.

[14]  Gregory J. Pottie,et al.  Channel coding for co-channel interference suppression in wireless communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[15]  G. David Forney,et al.  Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.

[16]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .

[17]  Morris Plotkin,et al.  Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.