Signal design and convolutional coding for noncoherent space-time communication on the block-rayleigh-fading channel

IEEE Transactions on Information Theory

Volumn 48, Issue 5, 2002, Pages 1186-1194

  McCloud, Michael L ^a,b,c   Brehler, Matthias ^a,b   Varanasi, Mahesh K ^a,b  

^a IEEE   (United States)

^b UCB 450   (United States)

^c Magis Networks Inc   (United States)

Author keywords

Convolutional coding; Fading channels; Noncoherent communication; Signal design; Space time modulation

Indexed keywords

BLOCK-RAYLEIGH-FADING CHANNEL;

BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); MAXIMUM LIKELIHOOD ESTIMATION; MODULATION; RAYLEIGH FADING; SIGNAL TO NOISE RATIO; TRANSCEIVERS;

CONVOLUTIONAL CODES;

EID: 0036566751     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.995648     Document Type: Article

References (23)

1. Capacity of multi-antenna Gaussian channels
2. On limits of wireless communications in a fading environment when using multiple antennas
3. Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
4. Communication on the Grassmann maniforld: A geometric approach to the noncoherent multiple-antenna channel
5. Asymptotic error probability analysis of quadratic receivers in Rayleigh fading channels with applications to a unified analysis of coherent and noncoherent space-time receivers
6. Differential unitary space-time modulation
7. A differential detection scheme for transmit diversity
8. Differential space-time modulation
9. Multiple transmit antenna differential detection from generalized orthogonal designs
10. Spectrally efficient noncoherent communications
11. Modulation and coding for noncoherent communications
12. Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading
13. Systematic design of unitary space-time constellations
14. Multiple-antenna signal constellations for fading channels
15. Packing lines, planes, etc: Packings in Grassmannian spaces
16. Two classes of convolutional codes over GF (q) for q-ary orthogonal signaling
17. Numerical methods for computing angles between linear subspaces
18. Calculation of the amount of information about a random function contained in another function
19. Canonical coordinates and the geometry of inference, rate and capacity