English
Related papers

Related papers: Multidimensional Coded Modulation in Block-Fading …

200 papers

Diversity is an essential concept associated with communication reliability in multipath channels since it determines the slope of bit error rate performance in the medium to high signal-to-noise ratio regions. However, most of the existing…

Signal Processing · Electrical Eng. & Systems 2026-01-21 Xuehan Wang , Jinhong Yuan , Jintao Wang , Kehan Huang

In this paper, we address the design of codes which achieve modulation diversity in block fading single-input single-output (SISO) channels with signal quantization at receiver and low-complexity decoding. With an unquantized receiver,…

Information Theory · Computer Science 2015-03-19 Saif Khan Mohammed , Emanuele Viterbo , Yi Hong , Ananthanarayanan Chockalingam

Efficient constellation design is important for improving performance in communication systems. The problem of multidimensional constellation design has been studied extensively in the literature in the context of multidimensional coded…

Information Theory · Computer Science 2020-04-14 Bharath Shamasundar , A. Chockalingam

This paper presents an enhanced design of multi-dimensional (MD) constellations which play a pivotal role in many communication systems such as code-domain non-orthogonal multiple access (CD-NOMA). MD constellations are attractive as their…

Information Theory · Computer Science 2022-07-25 Haifeng Wen , Zilong Liu , Qu Luo , Chuang Shi , Pei Xiao

In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional…

Information Theory · Computer Science 2016-11-15 Khoa D. Nguyen , Albert Guillen i Fabregas , Lars K. Rasmussen

Bit-interleaved coded modulation with iterative decoding (BICM-ID) offers very good error performance over additive white Gaussian noise (AWGN) and fading channels if it uses a wisely designed signal mapping. Further, error performance of…

Information Theory · Computer Science 2017-01-06 Hassan M. Navazi , Md. Jahangir Hossain

The idea of Media-based Modulation (MBM) is to embed information in the variations of the transmission media (channel states). Using an RF closure with $w$ RF walls, MBM creates a set of $2^w$ select-able states for the end-to-end channel.…

Information Theory · Computer Science 2022-02-08 Ehsan Seifi , Amir K. Khandani

In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity…

Information Theory · Computer Science 2016-11-15 Ghassan M. Kraidy , Nicolas Gresset , Joseph J. Boutros

In this paper, we investigate network nest coded modulation schemes for multiple access relay channels. The performance of the distributed systems which are based on distributed convolutional codes with network coded modulation is…

Information Theory · Computer Science 2022-03-16 Zihuai Lin

The capacity of the AWGN broadcast channel is achieved by superposition coding, but superposition of individual coded modulations expands the modulation alphabet and distorts its configuration. Coded modulation over a broadcast channel…

Information Theory · Computer Science 2016-10-31 Ahmed Abotabl , Aria Nosratinia

The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity…

Information Theory · Computer Science 2015-03-19 Yair Yona , Meir Feder

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow…

Information Theory · Computer Science 2016-11-17 Johan Östman , Wei Yang , Giuseppe Durisi , Tobias Koch

In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…

Information Theory · Computer Science 2015-12-11 Amaro Barreal , Camilla Hollanti , Nadya Markin

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent selective-fading multiple-access multiple-input multiple-output (MIMO) channels and provide corresponding code design criteria. As a byproduct, on the conceptual…

Information Theory · Computer Science 2008-05-02 Pedro Coronel , Markus Gärtner , Helmut Bölcskei

The standard approach to the design of individual space-time codes is based on optimizing diversity and coding gains. This geometric approach leads to remarkable examples, such as perfect space-time block codes, for which the complexity of…

Information Theory · Computer Science 2015-05-13 Yiyue Wu , Robert Calderbank

In this paper, probabilistic shaping is numerically and experimentally investigated for increasing the transmission reach of wavelength division multiplexed (WDM) optical communication system employing quadrature amplitude modulation (QAM).…

Motivated by communication channels in which the transmitted sequences are subject to random permutations, as well as by certain DNA storage systems, we study the error control problem in settings where the information is stored/transmitted…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Vincent Y. F. Tan

In this work the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channels with no power constraints (infinite constellations). For K users (K>1), M transmit…

Information Theory · Computer Science 2015-05-22 Yair Yona , Meir Feder

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…

Information Theory · Computer Science 2014-09-26 David Karpuk , Camilla Hollanti

We study the error probability performance of rotated lattice constellations in frequency-flat Nakagami-$m$ block-fading channels. In particular, we use the sphere lower bound on the underlying infinite lattice as a performance benchmark.…

Information Theory · Computer Science 2007-07-13 Albert Guillen i Fabregas , Emanuele Viterbo
‹ Prev 1 2 3 10 Next ›