The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we interpret the polar codes based on Plotkin construction perspective. We briefly review the rate allocation for component codes of Plotkin codes and the construction of polar codes based on Gaussian approximation. Then, we show that the recursively constructed Plotkin codes can be a class of polar codes. And also, the polar codes are a class of Plotkin code having minimum threshold.
In contemporary digital communications design, two major challenges should be addressed: adaptability and flexibility. The system should be capable of flexible and efficient use of all available spectrums and should be adaptable to provide efficient support for the diverse set of service characteristics. These needs imply the necessity of limit-achieving and flexible channel coding techniques, to...
In this paper, the BER performance of a soft distance successive cancellation decoder for Polar codes is analyzed in the presence of impulsive noise, modelled using both the Middleton's Class A model and the symmetric alpha-stable model, for impulsive noise channels. This algorithm avoids estimation of the signal-to-noise ratio of the channel, and simplifies the initialization step of the classic...
The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying attenuation due to fading needs to be mitigated. To the best of our knowledge, there has been no comprehensive work in this direction thus far. In this work, a practical...
Recently, both polar codes and low-density parity-check (LDPC) codes have been adopted by 3GPP eMBB scenario. Since both codes exist in one system, it is natural to consider the concatenation scheme of them. In this paper, a merged belief propagation (BP) decoding algorithm for the concatenated codes of polar and LDPC codes is proposed. By jointing factor graphs, this merged algorithm is designed...
First and second generation digital video broadcasting terrestrial systems (DVB-T and DVB-T2/T2-Lite), like many other wireless communication standards, contain an Orthogonal Frequency Division Multiplexing (OFDM) signal processing chain. One of the main disadvantages of the OFDM technique is its high sensitivity to the non-orthogonality between In-Phase and Quadrature (IQ) signals in the IQ modulator/demodulator...
The rising interest in applications requiring the transmission of small amounts of data has recently lead to the development of accurate performance bounds and of powerful channel codes for the transmission of short-data packets over the AWGN channel. Much less is known about the interaction between error control coding and channel estimation at short blocks when transmitting over channels with states...
New Raptor codes, based on low rate low-density parity-check (LDPC) codes, are proposed for short message length over various channels. The proposed Raptor codes are obtained by pre-coding the information bits by low rate LDPC codes and utilizing a low constant average degree distribution with high intermediate symbol recovery rate (ISRR). Simulation results demonstrate that the proposed Raptor codes...
We propose and design the lattice codes with finite lattice constellations based on multi-dimensional (more than two dimensions) lattice partitions. The codes are constructed from non-binary irregular repeat-accumulate (IRA) codes. Most notably, we propose a novel encoding structure to ensure that the decoder's messages exhibit permutation-invariance and symmetry properties. With these two properties,...
Sparse regression codes (SPARCs) are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a computationally efficient technique for decoding SPARCs, has been proven to be asymptotically capacity-achieving for the AWGN channel. In this paper, we refine the asymptotic results by deriving a large...
Concatenation of polar codes with cyclic redundancy check (CRC) codes, together with successive cancellation list (SCL) decoding, is known to be an effective approach that can significantly enhance the performance of the original polar codes. Most of the studies on the concatenation of CRC and polar codes, however, pay little attention to the structure of CRC codes themselves, even though the longer...
Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios. We consider the family of single-transmitter multiple-receiver Gaussian channels where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has coded side information,...
We consider a binary energy harvesting communication system with a finite battery transmitter over a noisy channel, and design explicit and implementable codes based on concatenation of a nonlinear trellis code (NLTC) with an outer low density parity check (LDPC) code. We propose two different decoding methods where the simplified one ignores the memory in the battery state while the more sophisticated...
Recently, rateless codes make a remarkable progress on achieving maximum network performance without incurring CSI feedback overhead, under dynamic contexts with time-varying channels. However, existing rateless codes are only optimal for single-carrier channels, but are far from optimal for multi-subcarrier OFDM channels that are dominantly adopted in modern high-speed wireless networks. In this...
Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication in AWGN channels with finite blocklength, in which the number of channel uses is finite. Specifically, we analytically prove that the entire block (all available...
We propose a new construction algorithm for Polar codes operating over Additive White Gaussian Noise channels under Successive Cancellation decoding. Our approach is based on tracking the bit error probabilities of the bit channels as they evolve through the decoder, allowing us on the one hand to characterize the performance of these channels, and on the other hand, providing a solid construction...
The performance of a noisy linear time-invariant (LTI) plant, controlled over a noiseless digital channel with transmission delay, is investigated in this paper. The rate-limited channel connects the single measurement output of the plant to its single control input through a causal, but otherwise arbitrary, coder-controller pair. An information-theoretic approach is utilized to analyze the minimal...
In this paper, we consider channel coding scheme for single carrier Internet of Things (SC-IoT). We propose new Raptor codes for SC-IoT devices with new degree distributions suitable for single carrier transmission to provide long term battery life services. In the proposed Raptor codes, Low Density Generator Matrix (LDGM) codes are used as the precode, called LDGM-Raptor codes. The codes are optimally...
Polar codes are applied to bit-interleaved coded modulation system with iterative decoding (BIPCM-ID) system. To optimize the iterative decoding performance, conventional polar coding construction is modified by extrinsic information transfer (EXIT) chart methodology. Simulation results show that BIPCM-ID system based on the proposed technique can outperforms BIPCM over 16-ary quadrature-amplitude...
In this paper a minimum distance detector is implemented for the first time, to decode equiprobable ultra-wide band (UWB) chipless radio frequency identification (RFID) tags in an additive white Gaussian noise (AWGN) channel. The coding of the UWB chipless tags is performed by changing the position of the resonance dip in order to increase the Euclidean distance (ED) between different codes. Four...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.