.png){kind=icon}
.png){kind=icon}
Return
Distributed Reception with Hard Decision Exchanges
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2014.051314.131763.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers the problem of jointly processing messages received over a forward link from a single distant transmitter to a cooperative receive cluster connected by a local area network with finite available throughput. For N cooperating receivers, ideal distributed receive beamforming with direct exchange of unquantized observations leads to an N-fold gain in signal-to-noise ratio (SNR) for equal-gain additive white Gaussian noise channels, with significant additional gains over fading channels due to diversity. It is shown in this paper that a significant portion of these gains can be obtained simply by exchanging hard decisions among some or all of the nodes in the receive cluster. Mutual information computations and simulations of LDPC-coded systems show that optimal combining of hard decisions tends to perform within 0.5-2 dB of ideal receive beamforming. For the low per-node SNR regime of interest with large receive clusters, asymptotic analysis of a suboptimal combining technique termed pseudo-beamforming shows that distributed reception with hard decision exchanges performs within 1-2 dB of ideal receive beamforming.
Keywords:
Distributed reception
receiver cooperation
receive beamforming
cooperative communications
likelihood combining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
View more organizations