相关论文: Space-time codes with controllable ML decoding com…
In this paper, we consider the problem of recursively designing uniquely decodable ternary code sets for highly overloaded synchronous code-division multiple-access (CDMA) systems. The proposed code set achieves larger number of users $K <…
We present a low-complexity and low-latency decoding algorithm for a class of Reed-Muller (RM) subcodes that are defined based on the product of smaller RM codes. More specifically, the input sequence is shaped as a multi-dimensional array,…
Let $K/F$ and $K/L$ be two cyclic Galois field extensions and $D=(K/F,\sigma,c)$ a cyclic algebra. Given an invertible element $d\in D$, we present three families of unital nonassociative algebras over $L\cap F$ defined on the direct sum of…
We consider a time division duplex (TDD) $n_t \times n_r$ multiple-input multiple-output (MIMO) system with channel state information (CSI) at both the transmitter and receiver. We propose X- and Y-Codes to achieve high multiplexing and…
In wireless communication systems, the use of multiple antennas at both the transmitter and receiver is a widely known method for improving both reliability and data rates, as it increases the former through transmit or receive diversity…
Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve…
A commonly assumed drawback of multi-level coding, compared to a bit-interleaved coded modulation, is its high latency: Indeed, the levels must be decoded sequentially. In this paper, we consider polar codes to code each level. We show that…
Differential distributed space-time coding (D-DSTC) has been considered to improve both diversity and data-rate in cooperative communications in the absence of channel information. However, conventionally, it is assumed that relays are…
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…
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…
Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M…
An efficient decoder for the generalized first-order Reed-Muller code RM_q(1,m) is essential for the decoding of various block-coding schemes for orthogonal frequency-division multiplexing with reduced peak-to-mean power ratio. We present…
This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…
Error correction code is a major part of the communication physical layer, ensuring the reliable transfer of data over noisy channels. Recently, neural decoders were shown to outperform classical decoding techniques. However, the existing…
Indoor visible light communications (VLC) require simultaneous illumination and communication. Hence, uniformity in the illumination is a key consideration for user comfort and data transfer in VLC systems. Several run-length limited codes…
This paper proposes an encoding/decoding framework for achieving the optimal channel capacities of the two-user broadcast channel where each user (receiver) has the message targeted for the other user (receiver) as side information. Since…
This paper presents Bit-Interleaved Coded Modulation metrics for joint estimation detection using training or reference signal transmission strategies for short to long block length channels. We show that it is possible to enhance the…
Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as…
In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…
Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with…