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 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...
The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old algorithm due to Prange: they are known under the name of information set decoding techniques (ISD). A while ago a generic decoding algorithm which does not belong to this family was proposed: statistical decoding. It is...
Low Density Lattice Code (LDLC) uses a lattice with a sparse inverse matrix, which allows a linear complexity decoding. Spatially Coupled Low Density Lattice Code (SC-LDLC) is built by coupling several LDLCs which leads to a smaller Symbol Error Rate (SER) than the LDLC scheme for every tested block length n. In this paper, new constructions of the spatially coupled low density lattice codes are introduced,...
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),...
In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated (U | U + V) constructions with algebraic geometry (AG) code components. These codes are decoded with a recursive computation of the a posteriori probabilities of the code symbols together with decoding the AG components with the Koetter-Vardy algorithm. We...
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...
In the paper, we will discuss the powerfull class of channel codes referred to as turbo codes. We commence with a brief discussion for MAP and log-MAP decoding algorithms. Then we work with proposed turbo decoding method, which is called as PL-log-MAP. Some numerical results and research experiments, such as simulation for bit error rate estimation and images transmission have been presented. It is...
In this paper we present a flexible decoding kernel using K-best and iterative K-best algorithms. Using this decoding kernel, system designers can choose the alternative algorithms for their different applications. With one kernel, it supports multiple configurable antennas (2×2,4×4) and variable modulation schemes (QPSK,16-QAM). Using number of kernels supports 8×8 and 64-QAM. Using a 90-nm CMOS...
This paper considers a multicarrier faster-than-Nyquist (FTN) transceiver architecture when spectrally efficient frequency division multiplexing (SEFDM) is also utilized at the transmitter. The received symbols are corrupted by both the introduced inter-symbol interference (ISI) due to FTN and inter-carrier interference (ICI) due to SEFDM. The interferences have to be eliminated to recover the transmitted...
The Probabilistic Gradient Descent Bit-Flipping (PGDBF) decoder has been proposed as a very promising hard-decision Low-Density Parity-Check (LDPC) decoder with a large gain in error correction. However, this impressive decoding gain is reported to come along with a non-negligible extra complexity due to the additional Perturbation Block (PB) required on top of the Gradient Descent Bit-Flipping (GDBF)...
In this paper, we present a low-density parity-check coded modulation approach addressing orthogonal modulations with moderate order (between 8 and 32) over the additive white Gaussian noise channel. The proposed design is based on a constrained optimization of a non-binary low-density parity-check ensemble degree distribution, where the iterative decoding threshold is optimized via extrinsic information...
Channel coding is a fundamental building block in any communications system. High performance codes, with low complexity encoding and decoding are a must-have for future wireless systems, with requirements ranging from the operation in highly reliable scenarios, utilizing short information messages and low code rates, to high throughput scenarios, working with long messages, and high code rates. We...
The Internet of Things (IoT) is fueling innovation in nearly every part of our lives. From smart homes, cars, and cities, the Internet of Things is creating a more convenient, secure, intelligent, and personalized experience. While for any final user this IoT vision is a substantial innovation step, for communication providers is a compelling thread with massive number of devices connected to the...
We introduce a stochastic resonance based decoding paradigm for quantum codes using an error correction circuit made of a combination of noisy and noiseless logic gates. The quantum error correction circuit is based on iterative syndrome decoding of quantum low-density parity check codes, and uses the positive effect of errors in gates to correct errors due to decoherence. We analyze how the proposed...
This paper investigates the capability of iterative decoders based on stochastic computing (stochastic decoders) to tolerate circuit soft errors while maintaining good bit error rate performance and low error floors in the context of low-density parity-check (LDPC) coding. Soft errors can be intended faults as a result of either VDD scaling to reduce power consumption or overclocking the system to...
State-of-the-art LTE Turbo-Code decoder architectures support throughputs of several Gbps by employing parallelism on different architectural levels. However, a very high flexibility with respect to code block sizes and code rates must also be retained. Sophisticated techniques are used to maintain communications performance at high code rates which are critical. In this paper, we propose new techniques...
In this study, Layered Low Density Parity Check (LDPC) Decoder algorithm in Error Correction Codes is implemented on FPGA. Firstly, Layered LDPC Decoder algorithm is designed with floating point in MATLAB, then fixed point model is developed. By testing Floating and Fixed point designs, transmitted information that is deformed by AWGN model is corrected by decoding iteratively. After this step, fixed...
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.