162 research outputs found
Analysis of the Second Moment of the LT Decoder
We analyze the second moment of the ripple size during the LT decoding
process and prove that the standard deviation of the ripple size for an LT-code
with length is of the order of Together with a result by Karp
et. al stating that the expectation of the ripple size is of the order of
[3], this gives bounds on the error probability of the LT decoder. We also give
an analytic expression for the variance of the ripple size up to terms of
constant order, and refine the expression in [3] for the expectation of the
ripple size up to terms of the order of , thus providing a first step
towards an analytic finite-length analysis of LT decoding.Comment: 5 pages, 1 figure; submitted to ISIT 200
Representation theory for high-rate multiple-antenna code design
Multiple antennas can greatly increase the data rate and reliability of a wireless communication link in a fading environment, but the practical success of using multiple antennas depends crucially on our ability to design high-rate space-time constellations with low encoding and decoding complexity. It has been shown that full transmitter diversity, where the constellation is a set of unitary matrices whose differences have nonzero determinant, is a desirable property for good performance. We use the powerful theory of fixed-point-free groups and their representations to design high-rate constellations with full diversity. Furthermore, we thereby classify all full-diversity constellations that form a group, for all rates and numbers of transmitter antennas. The group structure makes the constellations especially suitable for differential modulation and low-complexity decoding algorithms. The classification also reveals that the number of different group structures with full diversity is very limited when the number of transmitter antennas is large and odd. We, therefore, also consider extensions of the constellation designs to nongroups. We conclude by showing that many of our designed constellations perform excellently on both simulated and real wireless channels
Asymmetric information embedding
In the Information Embedding Problem one is given a piece of data which can be altered only conditionally, for example only at certain places. One is then asked to embed an arbitrary message into the data by only applying admissible changes to the data. These changes lead to a distortion which is to be kept low. In this short note, we introduce an ?asymmetric? version of information embedding in which the file is regarded as a string over a finite alphabet, and admissible changes on the alphabet elements are modeled by a directed graph. We introduce embedding techniques based on list-decoding algorithms for algebraic-geometric codes, and analyze their performance
Codes for differential signaling with many antennas
We construct signal constellations for differential transmission with multiple basestation antennas. The signals are derived using the theory of fixed-point-free groups and are especially suitable for mobile
cellular applications because they do not require the handset to have more than one antenna or to know the time-varying propagation environment. Yet we achieve full transmitter diversity and excellent performance gains over a single-antenna system
- …