Cochannel interference suppression through time/space diversity
- 1 May 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 46 (3), 922-932
- https://doi.org/10.1109/18.841171
Abstract
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 receiverKeywords
This publication has 14 references indexed in Scilit:
- Channel coding for co-channel interference suppression in wireless communicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Channel coding strategies for cellular radioIEEE Transactions on Vehicular Technology, 1995
- The impact of antenna diversity on the capacity of wireless communication systemsIEEE Transactions on Communications, 1994
- Advances in Equalization and Diversity for Portable Wireless SystemsDigital Signal Processing, 1993
- The performance of rate-compatible punctured convolutional codes for digital mobile radioIEEE Transactions on Communications, 1990
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Minimum probability of error for asynchronous Gaussian multiple-access channelsIEEE Transactions on Information Theory, 1986
- Square root Kalman filtering for high-speed data received over fading dispersive HF channelsIEEE Transactions on Information Theory, 1982
- New family of single-error correcting codesIEEE Transactions on Information Theory, 1970
- Binary codes with specified minimum distanceIEEE Transactions on Information Theory, 1960