28,240 research outputs found
Construction of Capacity-Achieving Lattice Codes: Polar Lattices
In this paper, we propose a new class of lattices constructed from polar
codes, namely polar lattices, to achieve the capacity \frac{1}{2}\log(1+\SNR)
of the additive white Gaussian-noise (AWGN) channel. Our construction follows
the multilevel approach of Forney \textit{et al.}, where we construct a
capacity-achieving polar code on each level. The component polar codes are
shown to be naturally nested, thereby fulfilling the requirement of the
multilevel lattice construction. We prove that polar lattices are
\emph{AWGN-good}. Furthermore, using the technique of source polarization, we
propose discrete Gaussian shaping over the polar lattice to satisfy the power
constraint. Both the construction and shaping are explicit, and the overall
complexity of encoding and decoding is for any fixed target error
probability.Comment: full version of the paper to appear in IEEE Trans. Communication
Ergodic Interference Alignment
This paper develops a new communication strategy, ergodic interference
alignment, for the K-user interference channel with time-varying fading. At any
particular time, each receiver will see a superposition of the transmitted
signals plus noise. The standard approach to such a scenario results in each
transmitter-receiver pair achieving a rate proportional to 1/K its
interference-free ergodic capacity. However, given two well-chosen time
indices, the channel coefficients from interfering users can be made to exactly
cancel. By adding up these two observations, each receiver can obtain its
desired signal without any interference. If the channel gains have independent,
uniform phases, this technique allows each user to achieve at least 1/2 its
interference-free ergodic capacity at any signal-to-noise ratio. Prior
interference alignment techniques were only able to attain this performance as
the signal-to-noise ratio tended to infinity. Extensions are given for the case
where each receiver wants a message from more than one transmitter as well as
the "X channel" case (with two receivers) where each transmitter has an
independent message for each receiver. Finally, it is shown how to generalize
this strategy beyond Gaussian channel models. For a class of finite field
interference channels, this approach yields the ergodic capacity region.Comment: 16 pages, 6 figure, To appear in IEEE Transactions on Information
Theor
Optimal Channel Training in Uplink Network MIMO Systems
We consider a multi-cell frequency-selective fading uplink channel (network
MIMO) from K single-antenna user terminals (UTs) to B cooperative base stations
(BSs) with M antennas each. The BSs, assumed to be oblivious of the applied
codebooks, forward compressed versions of their observations to a central
station (CS) via capacity limited backhaul links. The CS jointly decodes the
messages from all UTs. Since the BSs and the CS are assumed to have no prior
channel state information (CSI), the channel needs to be estimated during its
coherence time. Based on a lower bound of the ergodic mutual information, we
determine the optimal fraction of the coherence time used for channel training,
taking different path losses between the UTs and the BSs into account. We then
study how the optimal training length is impacted by the backhaul capacity.
Although our analytical results are based on a large system limit, we show by
simulations that they provide very accurate approximations for even small
system dimensions.Comment: 15 pages, 7 figures. To appear in the IEEE Transactions on Signal
Processin
On Computing Shannonâs Sphere Packing Bound and Applications
file: :home/zaki/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Ahmed, Ambroze, Tomlinson - 2007 - On Computing Shannonâs Sphere Packing Bound and Applications.pdf:pdf keywords: SPB mendeley-tags: SPBA new method to numerically evalu- ate Shannonâs lower bound is presented in this pa- per. This new method is based on the Incomplete Beta function and permits the exact evaluation of the Sphere Packing Bound for a large range of code sizes, rates and probability of error. Comparisons with cur- rent standards (DVBâRCS, DVBâS2 and 3GPP) are also presented and discussed. It is shown that cur- rent standard coding schemes are about 0.6dB from the Shannon Limit corrected for Binary Signalling
- âŠ