Towards Fully Optimized BICM Transceivers

Bit-interleaved coded modulation (BICM) transceivers often use equally spaced constellations and a random interleaver. In this paper, we propose a new BICM design, which considers hierarchical (nonequally spaced) constellations, a bit-level multiplexer, and multiple interleavers. It is shown that this new scheme increases the degrees of freedom that can be exploited in order to improve its performance. Analytical bounds on the bit error rate (BER) of the system in terms of the constellation parameters and the multiplexing rules are developed for the additive white Gaussian Noise (AWGN) and Nakagami-$m$ fading channels. These bounds are then used to design the BICM transceiver. Numerical results show that, compared to conventional BICM designs, and for a target BER of $10^{-6}$, gains up to 3 dB in the AWGN channel are obtained. For fading channels, the gains depend on the fading parameter, and reach 2 dB for a target BER of $10^{-7}$ and $m=5$.Comment: Submitted to the IEEE Transactions on Communication

Detect-and-forward relaying aided cooperative spatial modulation for wireless networks

A novel detect-and-forward (DeF) relaying aided cooperative SM scheme is proposed, which is capable of striking a flexible tradeoff in terms of the achievable bit error ratio (BER), complexity and unequal error protection (UEP). More specifically, SM is invoked at the source node (SN) and the information bit stream is divided into two different sets: the antenna index-bits (AI-bits) as well as the amplitude and phase modulation-bits (APM-bits). By exploiting the different importance of the AI-bits and the APM-bits in SM detection, we propose three low-complexity, yet powerful relay protocols, namely the partial, the hybrid and the hierarchical modulation (HM) based DeF relaying schemes. These schemes determine the most appropriate number of bits to be re-modulated by carefully considering their potential benefits and then assigning a specific modulation scheme for relaying the message. As a further benefit, the employment of multiple radio frequency (RF) chains and the requirement of tight inter-relay synchronization (IRS) can be avoided. Moreover, by exploiting the benefits of our low-complexity relaying protocols and our inter-element interference (IEI) model, a low-complexity maximum-likelihood (ML) detector is proposed for jointly detecting the signal received both via the source-destination (SD) and relay-destination (RD) links. Additionally, an upper bound of the BER is derived for our DeF-SM scheme. Our numerical results show that the bound is asymptotically tight in the high-SNR region and the proposed schemes provide beneficial system performance improvements compared to the conventional MIMO schemes in an identical cooperative scenario.<br/

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

Turbo trellis-coded hierarchical modulation assisted decode-and-forward cooperation

Hierarchical modulation, which is also known as layered modulation, has been widely adopted across the telecommunication industry. Its strict backward compatibility with single-layer modems and its low complexity facilitate the seamless upgrading of wireless communication services. The potential employment of hierarchical modulation in cooperative communications has the promise of increasing the achievable throughput at a low power consumption. In this paper, we propose a single-relay aided hierarchical modulation based cooperative communication system. The source employs a pair of Turbo Trellis-Coded Modulation schemes relying on specially designed hierarchical modulation, while the relay invokes the Decode-and-Forward protocol. We have analysed the system’s achievable rate as well as its bit error ratio using Monte-Carlo simulations. The results demonstrate that the power consumption of the entire system is reduced to 3.62 dB per time slot by our scheme

Network coded modulation for two-way relaying

Network coding compresses multiple traffic flows with the aid low-complexity algebraic operations, hence holds the potential of significantly improving both the power and bandwidth efficiency of wireless networks. In this contribution, the novel concept of Network Coded Modulation (NCM) is proposed for jointly performing network coding and modulation in bi-directional/duplex relaying. Each receiver is colocated with a transmitter and hence has prior knowledge of the message intended for the distant receiver. As in classic coded modulation, the Euclidian distance between the symbols is maximized, hence the Symbol Error Ratio (SER) is minimized. Specifically, we conceive NCM methods for PSK, PAM and QAM based on modulo addition of the normalized phase or amplitude. Furthermore, we propose low complexity decoding algorithms based on the corresponding conditional minimum distance criteria. Our performance analysis and simulations demonstrate that NCM relying on PSK is capable of achieving a SER at both receivers of the NCM scheme as if the relay transmitted exclusively to a single receiver only. By contrast, when our NCM concept is combined with PAM/QAM, an SNR loss (&lt;1.25dB) is imposed at one of the receivers, usually at the one having a lower data rate in a realistic different rate scenario. Finally, we will demonstrate that the proposed NCM is compatible with existing physical layer designs

Multilevel Coded Modulation for Unequal Error Protection and Multistage Decoding—Part II: Asymmetric Constellations

In this paper, multilevel coded asymmetric modulation with multistage decoding and unequal error protection (UEP) is discussed. These results further emphasize the fact that unconventional signal set partitionings are more promising than traditional (Ungerboeck-type) partitionings, to achieve UEP capabilities with multilevel coding and multistage decoding. Three types of unconventional partitionings are analyzed for asymmetric 8-PSK and 16-QAM constellations over the additive white Gaussian noise channel to introduce design guidelines. Generalizations to other PSK and QAM type constellations follow the same lines. Upper bounds on the bit-error probability based on union bound arguments are first derived. In some cases, these bounds become loose due to the large overlappings of decision regions associated with asymmetric constellations and unconventional partitionings. To overcome this problem, simpler and tighter approximated bounds are derived. Based on these bounds, it is shown that additional refinements can be achieved in the construction of multilevel UEP codes, by introducing asymmetries in PSK and QAM signal constellations