Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems

Details Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems

2011-09-05

arxiv.org/abs/1109.0800v1

Computer Science

Information Theory

To appear in 2011 IEEE Information Theory Workshop (ITW 2011)

Scientific paper

We consider a low-complexity version of the Compute and Forward scheme that involves only scaling, offset (dithering removal) and scalar quantization at the relays. The proposed scheme is suited for the uplink of a distributed antenna system where the antenna elements must be very simple and are connected to a oint processor via orthogonal perfect links of given rate R0. We consider the design of non-binary LDPC codes naturally matched to the proposed scheme. Each antenna element performs individual (decentralized) Belief Propagation decoding of its own quantized signal, and sends a linear combination of the users' information messages via the noiseless link to the joint processor, which retrieves the users' messages by Gaussian elimination. The complexity of this scheme is linear in the coding block length and polynomial in the system size (number of relays).

Affiliated with

Also associated with

No associations

Rating

Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449286