Related papers: Parallel Bit Interleaved Coded Modulation
Building upon previously introduced Bistable Vortex Memory (BVM) as a novel, nonvolatile, high-density, and scalable superconductor memory technology, this work presents a methodology that uses BVM arrays to address challenges in…
Current wireless communication technologies are insufficient in the face of ever-increasing demands. Therefore, novel and high-performance communication systems are needed. In this paper, a novel high data rate and high-performance index…
An unconventional encoding scheme called concurrent coding, has recently been demonstrated and shown to offer interesting features and benefits in comparison to conventional techniques, e.g. robustness against burst errors and improved…
Conventional turbo codes (CTCs) usually employ a block-oriented interleaving so that each block is separately encoded and decoded. As interleaving and de-interleaving are performed within a block, the message-passing process associated with…
We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel. Each user has partial knowledge of each message as side information. However, unlike classic…
In this paper, diversity analysis of bit-interleaved coded multiple beamforming (BICMB) is extended to the case of general spatial interleavers, removing a condition on their previously known design criteria and quantifying the resulting…
This paper is concerned with list decoding of $2$-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for…
The idea of media-based modulation (MBM) is to embed information in the channel states via intentional perturbations of the transmission media. This article covers a broad range of topics regarding MBM, expanding on its benefits and…
This paper proposes a new coded modulation scheme for reliable transmission of short data packets at very low signal-to-noise ratio, combining cyclic code shift keying modulation and non-binary polar coding. We consider non-binary polar…
Physical-layer network coding improves the throughput of the two-way relay channel by allowing multiple source terminals to transmit simultaneously to the relay. However, it is generally not feasible to align the phases of the multiple…
In this paper, we propose simple and novel complex modulation techniques that exploit the spatial domain to transmit complex-valued modulation symbols in visible light wireless communication. The idea is to use multiple light emitting…
Polar codes with memory (PCM) are proposed in this paper: a pair of consecutive code blocks containing a controlled number of mutual information bits. The shared mutual information bits of the succeeded block can help the failed block to…
The binary-forking model is a parallel computation model, formally defined by Blelloch et al. very recently, in which a thread can fork a concurrent child thread, recursively and asynchronously. The model incurs a cost of $\Theta(\log n)$…
As a power and bandwidth efficient modulation scheme, the optical spatial modulation (SM) technique has recently drawn increased attention in the field of visible light communications (VLC). To guarantee the number of bits mapped by the…
Interference widely exists in communication systems and is often not optimally treated at the receivers due to limited knowledge and/or computational burden. Evolutions of receivers have been proposed to balance complexity and spectral…
In this paper, we design and compare multilevel polar coding (MLPC) and bit-interleaved polar coded modulation (BIPCM) for uplink sparse code multiple access (SCMA) systems that operate over fast and block fading channels. Both successive…
In this paper, an iterative interference cancellation (IIC) based BICM-ID receiver is designed to cancel the intrinsic interference in FBMC-QAM systems. The proposed receiver consist of an inner decoder, which combines iterative…
We show that linear codes combined with rejection sampling can yield a capacity-achieving scheme for simulating additive exchangeable noise channels. Specifically, our scheme achieves an amount of communication within $\log e + 1$ bits from…
The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{N}$ is considered. The sequence of channels is assumed to be completely known to both the…
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…