28,746 research outputs found
Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages
A new achievable rate region is given for the Gaussian cognitive many-to-one
interference channel. The proposed novel coding scheme is based on the
compute-and-forward approach with lattice codes. Using the idea of decoding
sums of codewords, our scheme improves considerably upon the conventional
coding schemes which treat interference as noise or decode messages
simultaneously. Our strategy also extends directly to the usual many-to-one
interference channels without cognitive messages. Comparing to the usual
compute-and-forward scheme where a fixed lattice is used for the code
construction, the novel scheme employs scaled lattices and also encompasses key
ingredients of the existing schemes for the cognitive interference channel.
With this new component, our scheme achieves a larger rate region in general.
For some symmetric channel settings, new constant gap or capacity results are
established, which are independent of the number of users in the system.Comment: To appear in IEEE Transactions on Information Theor
Integer-Forcing Source Coding
Integer-Forcing (IF) is a new framework, based on compute-and-forward, for
decoding multiple integer linear combinations from the output of a Gaussian
multiple-input multiple-output channel. This work applies the IF approach to
arrive at a new low-complexity scheme, IF source coding, for distributed lossy
compression of correlated Gaussian sources under a minimum mean squared error
distortion measure. All encoders use the same nested lattice codebook. Each
encoder quantizes its observation using the fine lattice as a quantizer and
reduces the result modulo the coarse lattice, which plays the role of binning.
Rather than directly recovering the individual quantized signals, the decoder
first recovers a full-rank set of judiciously chosen integer linear
combinations of the quantized signals, and then inverts it. In general, the
linear combinations have smaller average powers than the original signals. This
allows to increase the density of the coarse lattice, which in turn translates
to smaller compression rates. We also propose and analyze a one-shot version of
IF source coding, that is simple enough to potentially lead to a new design
principle for analog-to-digital converters that can exploit spatial
correlations between the sampled signals.Comment: Submitted to IEEE Transactions on Information Theor
A Novel Transmission Scheme for the -user Broadcast Channel with Delayed CSIT
The state-dependent -user memoryless Broadcast Channel~(BC) with state
feedback is investigated. We propose a novel transmission scheme and derive its
corresponding achievable rate region, which, compared to some general schemes
that deal with feedback, has the advantage of being relatively simple and thus
is easy to evaluate. In particular, it is shown that the capacity region of the
symmetric erasure BC with an arbitrary input alphabet size is achievable with
the proposed scheme. For the fading Gaussian BC, we derive a symmetric
achievable rate as a function of the signal-to-noise ratio~(SNR) and a small
set of parameters. Besides achieving the optimal degrees of freedom at high
SNR, the proposed scheme is shown, through numerical results, to outperform
existing schemes from the literature in the finite SNR regime.Comment: 30 pages, 3 figures, submitted to IEEE Transactions on Wireless
Communications (revised version
Performance of Joint Channel and Physical Network Coding Based on Alamouti STBC
This work considers the protograph-coded physical network coding (PNC) based
on Alamouti space-time block coding (STBC) over Nakagami-fading two-way relay
channels, in which both the two sources and relay possess two antennas. We
first propose a novel precoding scheme at the two sources so as to implement
the iterative decoder efficiently at the relay. We further address a simplified
updating rule of the log-likelihood-ratio (LLR) in such a decoder. Based on the
simplified LLR-updating rule and Gaussian approximation, we analyze the
theoretical bit-error-rate (BER) of the system, which is shown to be consistent
with the decoding thresholds and simulated results. Moreover, the theoretical
analysis has lower computational complexity than the protograph extrinsic
information transfer (PEXIT) algorithm. Consequently, the analysis not only
provides a simple way to evaluate the error performance but also facilitates
the design of the joint channel-and-PNC (JCNC) in wireless communication
scenarios.Comment: 6 pages, 4 figures, accpete
Erasure Multiple Descriptions
We consider a binary erasure version of the n-channel multiple descriptions
problem with symmetric descriptions, i.e., the rates of the n descriptions are
the same and the distortion constraint depends only on the number of messages
received. We consider the case where there is no excess rate for every k out of
n descriptions. Our goal is to characterize the achievable distortions D_1,
D_2,...,D_n. We measure the fidelity of reconstruction using two distortion
criteria: an average-case distortion criterion, under which distortion is
measured by taking the average of the per-letter distortion over all source
sequences, and a worst-case distortion criterion, under which distortion is
measured by taking the maximum of the per-letter distortion over all source
sequences. We present achievability schemes, based on random binning for
average-case distortion and systematic MDS (maximum distance separable) codes
for worst-case distortion, and prove optimality results for the corresponding
achievable distortion regions. We then use the binary erasure multiple
descriptions setup to propose a layered coding framework for multiple
descriptions, which we then apply to vector Gaussian multiple descriptions and
prove its optimality for symmetric scalar Gaussian multiple descriptions with
two levels of receivers and no excess rate for the central receiver. We also
prove a new outer bound for the general multi-terminal source coding problem
and use it to prove an optimality result for the robust binary erasure CEO
problem. For the latter, we provide a tight lower bound on the distortion for
\ell messages for any coding scheme that achieves the minimum achievable
distortion for k messages where k is less than or equal to \ell.Comment: 48 pages, 2 figures, submitted to IEEE Trans. Inf. Theor
- …