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.
The present paper has considered multithreshold decoders for self-orthogonal codes providing a near-optimal efficiency of the error correction under linear computational complexity. New divergence principle used within construction and decoding convolutional codes has been discussed. The paper has shown that usage of such principle allows significantly approximating an area of the decoder effective...
NarrowBand Waveforms (NBWF) are often used in VHF or UHF tactical communications. For these kinds of waveforms, low latency and robust data rates result in short codeword lengths that are challenging in terms of channel coding. Usually, serially concatenated convolutional code and continuous phase modulation (CC-CPM) schemes are considered in the context of NBWF. When evaluating the achievable rates,...
In this work, we show that polar belief propagation (BP) decoding exhibits an error floor behavior which is caused by clipping of the log-likelihood ratios (LLR). The error floor becomes more pronounced for clipping to smaller LLR-values. We introduce a single-value measure quantifying a “relative error floor”, showing, by exhaustive simulations for different lengths, that the error floor is mainly...
In this paper, the iterative learning control problem using uniform quantizer with encoding and decoding scheme is considered, in which the system output is transformed and encoded firstly, and then transmitted back to the controller and decoded for input updating. Zero-error convergence of the output to the desired reference is realized by utilizing this updating scheme. The results are extended...
The focus of this paper is the high mobility coded wireless communication system with Doppler diversity. In order to improve the bit-error-rate (BER) performance, we combine the systematic block Markov superposition transmission (BMST) with Doppler diversity, resulting in BMST-DD, where the systematic BMST is a recently proposed rate-compatible coding scheme. In the BMST-DD system, to reduce the performance...
This paper proposes a new graph-based practical encoding and joint belief propagation (BP) decoding techniques for two-vehicle communicating simultaneously with another vehicle or a roadside unit. The proposed scheme achieves any rate pair close to the capacity region without using time sharing. While at the encoders, the corresponding parity check matrices are randomly built from a half-rate matrix,...
A concatenated soft-decision channel coding scheme consisting of an inner LDGM code and an outer staircase code is proposed. The soft-decision LDGM code is used for error reduction while the majority of bit errors are corrected by the low complexity hard-decision staircase code. Decoding complexity of the concatenated code is quantified by a score based on the number of edges in the LDGM code Tanner...
In this paper, we consider a bit-interleaved coded modulation scheme (BICM) composed of an error correcting code serially concatenated with a M-ary non linear modulation with memory. We first compare demodulation strategies for both the coherent and the non coherent cases. Then, we perform an asymptotic analysis and try to show that the design of coding schemes performing well for both the coherent...
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,...
A novel scheme is presented for encoding and decoding of Reed-Solomon codes of prime lengths. Encoding is performed on a collection of codewords which are mapped through Galois Fourier transform into a codeword in a low-density parity-check code with a binary parity-check matrix for transmission. Using this matrix, a binary iterative soft-decision decoding algorithm is applied to jointly decode a...
LT codes are a class of rateless codes designed for data dissemination on erasure channels. In this paper, we present a decoder for LT codes on partial erasure channels, which were recently introduced for multi-level read storage channel applications. We compare the efficiency of LT codes on these channels to those on the q-ary Erasure Channel (QEC).
This paper presents a Non-Binary LDPC decoder with information throughput of 2.267Gbps and power consumption of 212.4mW, yielding an energy efficiency of 93.7pJ/b, implemented in a 40nm CMOS technology. The employed code is long and high-rate without degree-2 variable nodes, resulting in a low error floor. A dual decoding algorithm scheme alleviates the computational complexity of decoding, realized...
The problem of identification via channels concerns a decoder that needs to provide a reliable answer to the question of whether or not a specific message (unknown in advance) was transmitted. The achievability result of Ahlswede and Dueck who introduced this problem, relied on a universal identification decoder. This decoder assigns a channel output vector yn to a decision region Dm if the empirical...
The emergence of networks of many devices in the context of cyber-physical systems motivates novel solutions for communication over random access channels. Currently deployed random access protocols attempt to avoid collisions, and target the performance of a scheduled multiple access system (a strategy known to be only suboptimal from the information-theoretic perspective). In contrast, in this paper,...
This paper is concerned with block Markov super-position transmission of BCH (BMST-BCH) codes. Compared with other BMST codes, BMST-BCH codes can achieve a lower error floor with an encoding memory of two, which is critical to reduce both delay and implementation complexity. To further reduce the implementation complexity, we propose a hard-decision sliding-window decoding algorithm, in which only...
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...
Coded computation is a framework for providing redundancy in distributed computing systems to make them robust to slower nodes, or stragglers. In [1], the authors propose a coded computation scheme based on maximum distance separable (MDS) codes for computing the product ATB, and this scheme is suitable for the case where one of the matrices is small enough to fit into a single compute node. In this...
Extensive studies have demonstrated the effectiveness of constructing capacity-approaching codes by block Markov superposition transmission (BMST). However, to achieve high performance, BMST codes typically require large encoding memories and large decoding window sizes, which result in increased decoding complexity and decoding latency. To address this issue, we introduce the recursive BMST (rBMST),...
Multithreshold decoders (MTD) for the self-orthogonal codes (SOC) are considered. It is shown that applying of MTD for the well chosen codes provides almost optimum decoding. Noted that MTD using is difficult to provide a low decoding error probability at the a large noise level due to a small code distance of SOC. For reducing the error probability we propose a concatenated coding scheme formed by...
This paper investigates the asymptotic performance of bit-interleaved coded modulation (BICM) with iterative multiuser detection and decoding in uplink sparse code multiple access (SCMA) systems. The extrinsic information transfer (EXIT) characteristics analysis of the joint multiuser detector for SCMA is provided, and shows that the average detection reliability for multiple users converges to the...
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.