8,755 research outputs found
Faulty Successive Cancellation Decoding of Polar Codes for the Binary Erasure Channel
In this paper, faulty successive cancellation decoding of polar codes for the
binary erasure channel is studied. To this end, a simple erasure-based fault
model is introduced to represent errors in the decoder and it is shown that,
under this model, polarization does not happen, meaning that fully reliable
communication is not possible at any rate. Furthermore, a lower bound on the
frame error rate of polar codes under faulty SC decoding is provided, which is
then used, along with a well-known upper bound, in order to choose a
blocklength that minimizes the erasure probability under faulty decoding.
Finally, an unequal error protection scheme that can re-enable asymptotically
erasure-free transmission at a small rate loss and by protecting only a
constant fraction of the decoder is proposed. The same scheme is also shown to
significantly improve the finite-length performance of the faulty successive
cancellation decoder by protecting as little as 1.5% of the decoder.Comment: Accepted for publications in the IEEE Transactions on Communication
Polar Coding for the Large Hadron Collider: Challenges in Code Concatenation
In this work, we present a concatenated repetition-polar coding scheme that
is aimed at applications requiring highly unbalanced unequal bit-error
protection, such as the Beam Interlock System of the Large Hadron Collider at
CERN. Even though this concatenation scheme is simple, it reveals significant
challenges that may be encountered when designing a concatenated scheme that
uses a polar code as an inner code, such as error correlation and unusual
decision log-likelihood ratio distributions. We explain and analyze these
challenges and we propose two ways to overcome them.Comment: Presented at the 51st Asilomar Conference on Signals, Systems, and
Computers, November 201
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
Faulty Successive Cancellation Decoding of Polar Codes for the Binary Erasure Channel
We study faulty successive cancellation decoding of polar codes for the
binary erasure channel. To this end, we introduce a simple erasure-based fault
model and we show that, under this model, polarization does not happen, meaning
that fully reliable communication is not possible at any rate. Moreover, we
provide numerical results for the frame erasure rate and bit erasure rate and
we study an unequal error protection scheme that can significantly improve the
performance of the faulty successive cancellation decoder with negligible
overhead.Comment: As presented at ISITA 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
On the Construction and Decoding of Concatenated Polar Codes
A scheme for concatenating the recently invented polar codes with interleaved
block codes is considered. By concatenating binary polar codes with interleaved
Reed-Solomon codes, we prove that the proposed concatenation scheme captures
the capacity-achieving property of polar codes, while having a significantly
better error-decay rate. We show that for any , and total frame
length , the parameters of the scheme can be set such that the frame error
probability is less than , while the scheme is still
capacity achieving. This improves upon 2^{-N^{0.5-\eps}}, the frame error
probability of Arikan's polar codes. We also propose decoding algorithms for
concatenated polar codes, which significantly improve the error-rate
performance at finite block lengths while preserving the low decoding
complexity
A polar codes-based distributed UEP scheme for the internet of things
The Internet of Things (IoT), which is expected to support a massive number of devices, is a promising communication scenario. Usually, the data of different devices has different reliability requirements. Channel codes with the unequal error protection (UEP) property are rather appealing for such applications. Due to the power-constrained characteristic of the IoT services, most of the data has short packets; therefore, channel codes are of short lengths. Consequently, how to transmit such nonuniform data from multisources efficiently and reliably becomes an issue be solved urgently. To address this issue, in this paper, a distributed coding scheme based on polar codes which can provide UEP property is proposed. The distributed polar codes are realized by the groundbreaking combination method of noisy coded bits. With the proposed coding scheme, the various data from multisources can be recovered with a single common decoder. Various reliability can be achieved; thus, UEP is provided. Finally, the simulation results show that the proposed coding scheme is viable
- âŠ