609 research outputs found
Nested turbo codes for the costa problem
Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has lately become a very active research area. In this paper, we first offer code design guidelines in terms of source- channel coding for algebraic binning. We then address practical code design based on nested lattice codes and propose nested turbo codes using turbo-like trellis-coded quantization (TCQ) for source coding and turbo trellis-coded modulation (TTCM) for channel coding. Compared to TCQ, turbo-like TCQ offers structural similarity between the source and channel coding components, leading to more efficient nesting with TTCM and better source coding performance. Due to the difference in effective dimensionality between turbo-like TCQ and TTCM, there is a performance tradeoff between these two components when they are nested together, meaning that the performance of turbo-like TCQ worsens as the TTCM code becomes stronger and vice versa. Optimization of this performance tradeoff leads to our code design that outperforms existing TCQ/TCM and TCQ/TTCM constructions and exhibits a gap of 0.94, 1.42 and 2.65 dB to the Costa capacity at 2.0, 1.0, and 0.5 bits/sample, respectively
Vector quantization
During the past ten years Vector Quantization (VQ) has developed from a theoretical possibility promised by Shannon's source coding theorems into a powerful and competitive technique for speech and image coding and compression at medium to low bit rates. In this survey, the basic ideas behind the design of vector quantizers are sketched and some comments made on the state-of-the-art and current research efforts
Secrecy Through Synchronization Errors
In this paper, we propose a transmission scheme that achieves information
theoretic security, without making assumptions on the eavesdropper's channel.
This is achieved by a transmitter that deliberately introduces synchronization
errors (insertions and/or deletions) based on a shared source of randomness.
The intended receiver, having access to the same shared source of randomness as
the transmitter, can resynchronize the received sequence. On the other hand,
the eavesdropper's channel remains a synchronization error channel. We prove a
secrecy capacity theorem, provide a lower bound on the secrecy capacity, and
propose numerical methods to evaluate it.Comment: 5 pages, 6 figures, submitted to ISIT 201
- …