191 research outputs found
LDPC coded transmissions over the Gaussian broadcast channel with confidential messages
We design and assess some practical low-density parity-check (LDPC) coded
transmission schemes for the Gaussian broadcast channel with confidential
messages (BCC). This channel model is different from the classical wiretap
channel model as the unauthorized receiver (Eve) must be able to decode some
part of the information. Hence, the reliability and security targets are
different from those of the wiretap channel. In order to design and assess
practical coding schemes, we use the error rate as a metric of the performance
achieved by the authorized receiver (Bob) and the unauthorized receiver (Eve).
We study the system feasibility, and show that two different levels of
protection against noise are required on the public and the secret messages.
This can be achieved in two ways: i) by using LDPC codes with unequal error
protection (UEP) of the transmitted information bits or ii) by using two
classical non-UEP LDPC codes with different rates. We compare these two
approaches and show that, for the considered examples, the solution exploiting
UEP LDPC codes is more efficient than that using non-UEP LDPC codes.Comment: 5 pages, 5 figures, to be presented at IEEE ICT 201
Practical LDPC coded modulation schemes for the fading broadcast channel with confidential messages
The broadcast channel with confidential messages is a well studied scenario
from the theoretical standpoint, but there is still lack of practical schemes
able to achieve some fixed level of reliability and security over such a
channel. In this paper, we consider a quasi-static fading channel in which both
public and private messages must be sent from the transmitter to the receivers,
and we aim at designing suitable coding and modulation schemes to achieve such
a target. For this purpose, we adopt the error rate as a metric, by considering
that reliability (security) is achieved when a sufficiently low (high) error
rate is experienced at the receiving side. We show that some conditions exist
on the system feasibility, and that some outage probability must be tolerated
to cope with the fading nature of the channel. The proposed solution exploits
low-density parity-check codes with unequal error protection, which are able to
guarantee two different levels of protection against noise for the public and
the private information, in conjunction with different modulation schemes for
the public and the private message bits.Comment: 6 pages, 4 figures, to be presented at IEEE ICC'14 - Workshop on
Wireless Physical Layer Securit
Protograph-Based LDPC Code Design for Shaped Bit-Metric Decoding
A protograph-based low-density parity-check (LDPC) code design technique for
bandwidth-efficient coded modulation is presented. The approach jointly
optimizes the LDPC code node degrees and the mapping of the coded bits to the
bit-interleaved coded modulation (BICM) bit-channels. For BICM with uniform
input and for BICM with probabilistic shaping, binary-input symmetric-output
surrogate channels for the code design are used. The constructed codes for
uniform inputs perform as good as the multi-edge type codes of Zhang and
Kschischang (2013). For 8-ASK and 64-ASK with probabilistic shaping, codes of
rates 2/3 and 5/6 with blocklength 64800 are designed, which operate within
0.63dB and 0.69dB of continuous AWGN capacity for a target frame error rate of
1e-3 at spectral efficiencies of 1.38 and 4.25 bits/channel use, respectively.Comment: 9 pages, 10 figures. arXiv admin note: substantial text overlap with
arXiv:1501.0559
Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure Channel
Most existing works on analyzing the performance of a random ensemble of
low-density parity-check (LDPC) codes assume that the degree distributions of
the two ends of a randomly selected edge are independent. In the paper, we take
one step further and consider ensembles of LDPC codes with degree-degree
correlations. For this, we propose two methods to construct an ensemble of
degree-degree correlated LDPC codes. We then derive a system of density
evolution equations for such degree-degree correlated LDPC codes over a binary
erasure channel (BEC). By conducting extensive numerical experiments, we show
how the degree-degree correlation affects the performance of LDPC codes. Our
numerical results show that LDPC codes with negative degree-degree correlation
could improve the maximum tolerable erasure probability. Moreover, increasing
the negative degree-degree correlation could lead to better unequal error
protection (UEP) design.Comment: accepted by the 2023 IEEE International Symposium on Information
Theory (ISIT
An Optimal Unequal Error Protection LDPC Coded Recording System
For efficient modulation and error control coding, the deliberate flipping
approach imposes the run-length-limited(RLL) constraint by bit error before
recording. From the read side, a high coding rate limits the correcting
capability of RLL bit error. In this paper, we study the low-density
parity-check (LDPC) coding for RLL constrained recording system based on the
Unequal Error Protection (UEP) coding scheme design. The UEP capability of
irregular LDPC codes is used for recovering flipped bits. We provide an
allocation technique to limit the occurrence of flipped bits on the bit with
robust correction capability. In addition, we consider the signal labeling
design to decrease the number of nearest neighbors to enhance the robust bit.
We also apply the density evolution technique to the proposed system for
evaluating the code performances. In addition, we utilize the EXIT
characteristic to reveal the decoding behavior of the recommended code
distribution. Finally, the optimization approach for the best distribution is
proven by differential evolution for the proposed system.Comment: 20 pages, 18 figure
- …