Detector design and complexity analysis for cooperative communications in intersymbol interference fading channels

Authors:
Yanjie Peng;Andrew G. Klein;Xinming Huang
Affiliations:
Department of Electrical & Computer Engineering, Worcester Polytechnic Institute, Worcester, MA;Department of Electrical & Computer Engineering, Worcester Polytechnic Institute, Worcester, MA;Department of Electrical & Computer Engineering, Worcester Polytechnic Institute, Worcester, MA
Venue:
ISRN Communications and Networking
Year:
2011

Citing 6
Cited 0

Generalized trace-back techniques for survivor memory management in the Viterbi algorithm

Journal of VLSI Signal Processing Systems - Application specific array processors
Design of a maximum-likelihood detector for cooperative communications in intersymbol interference channels

Proceedings of the 19th ACM Great Lakes symposium on VLSI
Asynchronous cooperative diversity

IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks

IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The area of cooperative communications has recently attracted lots of research interest because of the potential benefit of increased spatial diversity. In this paper, we study the detector design for cooperative communications in intersymbol interference (ISI) channels. A novel system framework employing nonorthogonal amplify-and-forward half-duplex relays through ISI channels is introduced.We focus on detector design and first consider an optimal detector that consists of a whitening filter and a maximum-likelihood sequence estimator (MLSE). However, such an optimal detector embedded with Viterbi algorithm has practical issues of high complexity if the relay period is long. Consequently, we adopt a multitrellis Viterbi algorithm (MVA) that reduces the complexity significantly but still achieves near-optimal performance. Simulation results demonstrate the performance of both the optimal and near-optimal detector designs.