Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2016 ( 3 )

2015 ( 23 )

2014 ( 60 )

2013 ( 71 )

Custom range...

Search Results: 1 - 10 of 579 matches for " Camilla Hollanti "
All listed articles are free for downloading (OA Articles)
Page 1 /579
Display every page Item
A Comparison of Skewed and Orthogonal Lattices in Gaussian Wiretap Channels
Alex Karrila,Camilla Hollanti
Mathematics , 2014,
Abstract: We consider lattice coset-coded transmissions over a wiretap channel with additive white Gaussian noise (AWGN). Examining a function that can be interpreted as either the legitimate receiver's error probability or the eavesdropper's correct decision probability, we rigorously show that, albeit offering simple bit labeling, orthogonal nested lattices are suboptimal for coset coding in terms of both the legitimate receiver's and the eavesdropper's probabilities.
Multi-Dimensional and Non-Uniform Constellation Optimization via the Special Orthogonal Group
David Karpuk,Camilla Hollanti
Mathematics , 2014,
Abstract: With the goal of optimizing the CM capacity of a finite constellation over a Rayleigh fading channel, we construct for all dimensions which are a power of 2 families of rotation matrices which optimize a certain objective function controlling the CM capacity. Our construction does not depend on any assumptions about the constellation, dimension, or signal-to-noise ratio. We confirm the benefits of our construction for uniform and non-uniform constellations at a large range of SNR values through numerous simulations. We show that in two and four dimensions one can obtain a further potential increase in CM capacity by jointly considering non-uniform and rotated constellations.
Locally Diverse Constellations from the Special Orthogonal Group
David Karpuk,Camilla Hollanti
Mathematics , 2015,
Abstract: To optimize rotated, multidimensional constellations over a single-input, single-output Rayleigh fading channel, a family of rotation matrices is constructed for all dimensions which are a power of 2. This family is a one-parameter subgroup of the group of rotation matrices, and is located using a gradient descent scheme on this Lie group. The parameter defining the family is chosen to optimize the cutoff rate of the constellation. The optimal rotation parameter is computed explicitly for low signal-to-noise ratios. The cutoff rate serves as the main judge of performance, and is an approximation of the coded modulation capacity of the constellation. These rotations modestly outperform full-diversity algebraic rotation matrices in terms of cutoff rate and error performance. However, a QAM constellation rotated by such a matrix lacks full diversity, but will satisfy a less restrictive property referred to as "local full diversity". Roughly, a locally fully diverse constellation is fully diverse only in small neighborhoods. This is in contrast with the conventional wisdom that good signal sets exhibit full diversity. A "local" variant of the minimum product distance is also introduced and is shown experimentally to be a superior predictor of constellation performance than the minimum product distance.
Algebraic Fast-Decodable Relay Codes for Distributed Communications
Camilla Hollanti,Nadya Markin
Mathematics , 2012,
Abstract: In this paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures, e.g. quaternion division algebras. When satisfying certain properties, these algebras provide us with codes whose structure naturally reduces the decoding complexity. The complexity can be further reduced by shortening the block length, i.e., by considering rectangular codes called less than minimum delay (LMD) codes.
Rotating Non-Uniform and High-Dimensional Constellations Using Geodesic Flow on Lie Groups
David A. Karpuk,Camilla Hollanti
Computer Science , 2013,
Abstract: We use a numerical algorithm on the Lie group of rotation matrices to obtain rotated constellations for Rayleigh fading channels. Our approach minimizes the union bound for the pairwise error probability to produce rotations optimized for a given signal-to-noise ratio. This approach circumvents explicit parametrization of rotation matrices, which has previously prevented robust numerical methods from being applied to constellation rotation. Our algorithm is applicable to arbitrary finite constellations in arbitrary dimensions, and one can thus apply our method to non-uniform constellations, which are of interest for practical concerns due to their ability to increase BICM capacity. We show how our rotations can improve the codeword error performance of non-uniform constellations, and we also apply our method to reproduce and improve rotations given by ideal lattices in cyclotomic fields.
Applications of Polymatroid Theory to Distributed Storage Systems
Thomas Westerb?ck,Ragnar Freij-Hollanti,Camilla Hollanti
Mathematics , 2015,
Abstract: In this paper, a link between polymatroid theory and locally repairable codes (LRCs) is established. The codes considered here are completely general in that they are subsets of $A^n$, where $A$ is an arbitrary finite set. Three classes of LRCs are considered, both with and without availability, and for both information-symbol and all-symbol locality. The parameters and classes of LRCs are generalized to polymatroids, and a general- ized Singelton bound on the parameters for these three classes of polymatroids and LRCs is given. This result generalizes the earlier Singleton-type bounds given for LRCs. Codes achieving these bounds are coined perfect, as opposed to the more common term optimal used earlier, since they might not always exist. Finally, new constructions of perfect linear LRCs are derived from gammoids, which are a special class of matroids. Matroids, for their part, form a subclass of polymatroids and have proven useful in analyzing and constructing linear LRCs.
Algebraic Hybrid Satellite-Terrestrial Space-Time Codes for Digital Broadcasting in SFN
Camilla Hollanti,Roope Vehkalahti,Youssef Nasser
Mathematics , 2011,
Abstract: Lately, different methods for broadcasting future digital TV in a single frequency network (SFN) have been under an intensive study. To improve the transmission to also cover suburban and rural areas, a hybrid scheme may be used. In hybrid transmission, the signal is transmitted both from a satellite and from a terrestrial site. In 2008, Y. Nasser et al. proposed to use a double layer 3D space-time (ST) code in the hybrid 4 x 2 MIMO transmission of digital TV. In this paper, alternative codes with simpler structure are proposed for the 4 x 2 hybrid system, and new codes are constructed for the 3 x 2 system. The performance of the proposed codes is analyzed through computer simulations, showing a significant improvement over simple repetition schemes. The proposed codes prove in addition to be very robust in the presence of power imbalance between the two sites.
Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions
Camilla Hollanti,Emanuele Viterbo,David Karpuk
Mathematics , 2013,
Abstract: In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper bound the error performance of a finite constellation on a Rayleigh fading channel and the probability of an eavesdropper's correct decision in a wiretap channel. As a byproduct, an estimate of the number of elements with a certain algebraic norm within a finite hyper-cube is derived. While this type of estimates have been, to some extent, considered in algebraic number theory before, they are now brought into novel practice in the context of fading channel communications. Hence, the interest here is in small-dimensional lattices and finite constellations rather than in the asymptotic behavior.
Linear Locally Repairable Codes with Random Matrices
Toni Ernvall,Thomas Westerb?ck,Camilla Hollanti
Mathematics , 2014,
Abstract: In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this gives also a constructive method to find locally repairable codes.
Node Repair for Distributed Storage Systems over Fading Channels
David Karpuk,Camilla Hollanti,Amaro Barreal
Mathematics , 2014,
Abstract: Distributed storage systems and associated storage codes can efficiently store a large amount of data while ensuring that data is retrievable in case of node failure. The study of such systems, particularly the design of storage codes over finite fields, assumes that the physical channel through which the nodes communicate is error-free. This is not always the case, for example, in a wireless storage system. We study the probability that a subpacket is repaired incorrectly during node repair in a distributed storage system, in which the nodes communicate over an AWGN or Rayleigh fading channels. The asymptotic probability (as SNR increases) that a node is repaired incorrectly is shown to be completely determined by the repair locality of the DSS and the symbol error rate of the wireless channel. Lastly, we propose some design criteria for physical layer coding in this scenario, and use it to compute optimally rotated QAM constellations for use in wireless distributed storage systems.
Page 1 /579
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.