80,514 research outputs found
Low Density Lattice Codes
Low density lattice codes (LDLC) are novel lattice codes that can be decoded
efficiently and approach the capacity of the additive white Gaussian noise
(AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional
Euclidean space as a linear transformation of a corresponding integer message
vector b, i.e., x = Gb, where H, the inverse of G, is restricted to be sparse.
The fact that H is sparse is utilized to develop a linear-time iterative
decoding scheme which attains, as demonstrated by simulations, good error
performance within ~0.5dB from capacity at block length of n = 100,000 symbols.
The paper also discusses convergence results and implementation considerations.Comment: 24 pages, 4 figures. Submitted for publication in IEEE transactions
on Information Theor
The Methods to Improve Quality of Service by Accounting Secure Parameters
A solution to the problem of ensuring quality of service, providing a greater
number of services with higher efficiency taking into account network security
is proposed. In this paper, experiments were conducted to analyze the effect of
self-similarity and attacks on the quality of service parameters. Method of
buffering and control of channel capacity and calculating of routing cost
method in the network, which take into account the parameters of traffic
multifractality and the probability of detecting attacks in telecommunications
networks were proposed. The both proposed methods accounting the given
restrictions on the delay time and the number of lost packets for every type
quality of service traffic. During simulation the parameters of transmitted
traffic (self-similarity, intensity) and the parameters of network (current
channel load, node buffer size) were changed and the maximum allowable load of
network was determined. The results of analysis show that occurrence of
overload when transmitting traffic over a switched channel associated with
multifractal traffic characteristics and presence of attack. It was shown that
proposed methods can reduce the lost data and improve the efficiency of network
resources.Comment: 10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text
overlap with arXiv:1904.0520
Self-concatenated code design and its application in power-efficient cooperative communications
In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions
Discrete Multitone Modulation for Maximizing Transmission Rate in Step-Index Plastic Optical Fibres
The use of standard 1-mm core-diameter step-index plastic optical fiber (SI-POF) has so far been mainly limited to distances of up to 100 m and bit-rates in the order of 100 Mbit/s. By use of digital signal processing, transmission performance of such optical links can be improved. Among the different technical solutions proposed, a promising one is based on the use of discrete multitone (DMT) modulation, directly applied to intensity-modulated, direct detection (IM/DD) SI-POF links. This paper presents an overview of DMT over SI-POF and demonstrates how DMT can be used to improve transmission rate in such IM/DD systems. The achievable capacity of an SI-POF channel is first analyzed theoretically and then validated by experimental results. Additionally, first experimental demonstrations of a real-time DMT over SI-POF system are presented and discusse
Constellation Design for Channels Affected by Phase Noise
In this paper we optimize constellation sets to be used for channels affected
by phase noise. The main objective is to maximize the achievable mutual
information of the constellation under a given power constraint. The mutual
information and pragmatic mutual information of a given constellation is
calculated approximately assuming that both the channel and phase noise are
white. Then a simulated annealing algorithm is used to jointly optimize the
constellation and the binary labeling. The performance of optimized
constellations is compared with conventional constellations showing
considerable gains in all system scenarios.Comment: 5 pages, 6 figures, submitted to IEEE Int. Conf. on Communications
(ICC) 201
On Universal Properties of Capacity-Approaching LDPC Ensembles
This paper is focused on the derivation of some universal properties of
capacity-approaching low-density parity-check (LDPC) code ensembles whose
transmission takes place over memoryless binary-input output-symmetric (MBIOS)
channels. Properties of the degree distributions, graphical complexity and the
number of fundamental cycles in the bipartite graphs are considered via the
derivation of information-theoretic bounds. These bounds are expressed in terms
of the target block/ bit error probability and the gap (in rate) to capacity.
Most of the bounds are general for any decoding algorithm, and some others are
proved under belief propagation (BP) decoding. Proving these bounds under a
certain decoding algorithm, validates them automatically also under any
sub-optimal decoding algorithm. A proper modification of these bounds makes
them universal for the set of all MBIOS channels which exhibit a given
capacity. Bounds on the degree distributions and graphical complexity apply to
finite-length LDPC codes and to the asymptotic case of an infinite block
length. The bounds are compared with capacity-approaching LDPC code ensembles
under BP decoding, and they are shown to be informative and are easy to
calculate. Finally, some interesting open problems are considered.Comment: Published in the IEEE Trans. on Information Theory, vol. 55, no. 7,
pp. 2956 - 2990, July 200
- …