Performance of a Reduced Complexity Algorithm for Diversity Combining

The paper introduces a new diversity algorithm that uses real valued weights to reduce the complexity of coherent combining. The approach starts with Selection Diversity but allows any signal branch to contribute to the output by a simple real valued scaling operation. Channel estimation is performe...

Full description

Saved in:
Bibliographic Details
Main Authors: Lanante, L.A., Marciano, J.S.
Format: Conference Proceeding
Language:English
Subjects:
Analog computers
Channel estimation
Cities and towns
Computational modeling
Diversity reception
Fading
Interference
Radio frequency
Receiving antennas
Signal to noise ratio
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper introduces a new diversity algorithm that uses real valued weights to reduce the complexity of coherent combining. The approach starts with Selection Diversity but allows any signal branch to contribute to the output by a simple real valued scaling operation. Channel estimation is performed only on the branch with the strongest signal and the rest of the combining weights are then computed directly from the received signals themselves. This simplifies the weight computation and the resulting real-valued weights allows for combining to be performed at the analog or RF/IF stage, reducing the need for multiple receive chains required by digital combining. Simulation results reveal that the performance of the proposed algorithm is just 0.7 dB and 1.6 dB below optimum for 2 and 4 antennas respectively in independent Rayleigh fading channels.
ISSN:2161-9646
DOI:10.1109/WICOM.2007.256