15 research outputs found
On the BICM Capacity
Optimal binary labelings, input distributions, and input alphabets are
analyzed for the so-called bit-interleaved coded modulation (BICM) capacity,
paying special attention to the low signal-to-noise ratio (SNR) regime. For
8-ary pulse amplitude modulation (PAM) and for 0.75 bit/symbol, the folded
binary code results in a higher capacity than the binary reflected gray code
(BRGC) and the natural binary code (NBC). The 1 dB gap between the additive
white Gaussian noise (AWGN) capacity and the BICM capacity with the BRGC can be
almost completely removed if the input symbol distribution is properly
selected. First-order asymptotics of the BICM capacity for arbitrary input
alphabets and distributions, dimensions, mean, variance, and binary labeling
are developed. These asymptotics are used to define first-order optimal (FOO)
constellations for BICM, i.e. constellations that make BICM achieve the Shannon
limit -1.59 \tr{dB}. It is shown that the \Eb/N_0 required for reliable
transmission at asymptotically low rates in BICM can be as high as infinity,
that for uniform input distributions and 8-PAM there are only 72 classes of
binary labelings with a different first-order asymptotic behavior, and that
this number is reduced to only 26 for 8-ary phase shift keying (PSK). A general
answer to the question of FOO constellations for BICM is also given: using the
Hadamard transform, it is found that for uniform input distributions, a
constellation for BICM is FOO if and only if it is a linear projection of a
hypercube. A constellation based on PAM or quadrature amplitude modulation
input alphabets is FOO if and only if they are labeled by the NBC; if the
constellation is based on PSK input alphabets instead, it can never be FOO if
the input alphabet has more than four points, regardless of the labeling.Comment: Submitted to the IEEE Transactions on Information Theor
Recent Advances in Steganography
Steganography is the art and science of communicating which hides the existence of the communication. Steganographic technologies are an important part of the future of Internet security and privacy on open systems such as the Internet. This book's focus is on a relatively new field of study in Steganography and it takes a look at this technology by introducing the readers various concepts of Steganography and Steganalysis. The book has a brief history of steganography and it surveys steganalysis methods considering their modeling techniques. Some new steganography techniques for hiding secret data in images are presented. Furthermore, steganography in speeches is reviewed, and a new approach for hiding data in speeches is introduced
General BER Expression for One-Dimensional Constellations
A novel general ready-to-use bit-error rate (BER) expression for
one-dimensional constellations is developed. The BER analysis is performed for
bit patterns that form a labeling. The number of patterns for equally spaced
M-PAM constellations with different BER is analyzed.Comment: To appear in the Proceedings of the IEEE Global Communications
Conference (GLOBECOM) 2012. Remark 3 modifie
On the Exact BER of Bit-Wise Demodulators for One-Dimensional Constellations
The optimal bit-wise demodulator for M-ary pulse amplitude modulation (PAM)
over the additive white Gaussian noise channel is analyzed in terms of uncoded
bit-error rate (BER). New closed-form BER expressions for 4-PAM with any
labeling are developed. Moreover, closed-form BER expressions for 11 out of 23
possible bit patterns for 8-PAM are presented, which enable us to obtain the
BER for 8-PAM with some of the most popular labelings, including the binary
reflected Gray code and the natural binary code. Numerical results show that,
regardless of the labeling, there is no difference between the optimal
demodulator and the symbol-wise demodulator for any BER of practical interest
(below 0.1)
A Simple Approximation for the Bit-Interleaved Coded Modulation Capacity
The generalized mutual information (GMI) is an achievable rate for bit-interleaved coded modulation (BICM) and is highly dependent on the binary labeling of the constellation. The BICM-GMI, sometimes called the BICM capacity, can be evaluated numerically. This approach, however, becomes impractical when the number of constellation points and/or the constellation dimensionality grows, or when many different labelings are considered. A simple approximation for the BICM-GMI based on the area theorem of the demapper's extrinsic information transfer (EXIT) function is proposed. Numerical results show the proposed approximation gives good estimates of the BICM-GMI for labelings with close to linear EXIT functions, which includes labelings of common interest, such as the natural binary code, binary reflected Gray code, etc. This approximation is used to optimize the binary labeling of the 32-APSK constellation defined in the DVB-S2 standard. Gains of approximately 0.15 dB are obtained
Rate-Adaptive Coded Modulation for Fiber-Optic Communications
Rate-adaptive optical transceivers can play an important role in exploiting the available resources in dynamic optical networks, in which different links yield different signal qualities. We study rate-adaptive joint coding and modulation, often called coded modulation (CM), addressing non-dispersion-managed (non-DM) links, exploiting recent advances in channel modeling of these links.
We introduce a four-dimensional CM scheme, which shows a better tradeoff between digital signal processing complexity and transparent reach than existing methods. We construct a rate-adaptive CM scheme combining a single low-density parity-check code with a family of three signal constellations and using probabilistic signal shaping.
We evaluate the performance of the proposed CM scheme for single-channel transmission through long-haul non-DM fiber-optic systems with electronic chromatic-dispersion compensation. The numerical results demonstrate improvement of spectral
efficiency over a wide range of transparent reaches, an improvement over 1 dB compared to existing methods
A simple approximation for the bit-interleaved coded modulation capacity
Abstract-The generalized mutual information (GMI) is an achievable rate for bit-interleaved coded modulation (BICM) and is highly dependent on the binary labeling of the constellation. The BICM-GMI, sometimes called the BICM capacity, can be evaluated numerically. This approach, however, becomes impractical when the number of constellation points and/or the constellation dimensionality grows, or when many different labelings are considered. A simple approximation for the BICM-GMI based on the area theorem of the demapper's extrinsic information transfer (EXIT) function is proposed. Numerical results show the proposed approximation gives good estimates of the BICM-GMI for labelings with close to linear EXIT functions, which includes labelings of common interest, such as the natural binary code, binary reflected Gray code, etc. This approximation is used to optimize the binary labeling of the 32-APSK constellation defined in the DVB-S2 standard. Gains of approximately 0.15 dB are obtained