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.
This paper proposes a novel method for recovering missing radio frequency identification (RFID) tag identifiers from a group, based on progressive edge-growth (PEG) methods. Extended grouping of RFID tags allows the recovery of missing tag identifiers without external systems such as databases. Motivated by the properties of Tanner graphs, or equivalently, parity check matrices constructed using PEG...
Spatially-coupled (SC) codes have recently attracted significant attention due to their capability to achieve capacity approaching performance. Significant recent research has been devoted to the asymptotic study of SC codes. Although the asymptotic analysis is relevant, it cannot be directly applied in the finite-length setting due to cycle-free and averaging assumptions. In this paper, we consider...
Polar codes are a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more complex successive-cancellation list (SCL) decoding algorithm is gathering more attention lately as it significantly improves the error-correction performance of short-to...
Cyclically-coupled quasi-cyclic LDPC (CC-QC-LDPC) block codes have been shown to achieve outstanding bit error performance with extremely low error floor. In this paper, we propose two new types of CC-QC-LDPC block codes which can achieve a larger girth. We present the error performance of the CC-QC-LDPC codes constructed by the new mechanism. We show that with similar codelengths, the new codes outperform...
In this paper, we propose a joint decoding and signal processing scheme for NAND flash memory. The proposed scheme provides a considerable improvement of error correcting capability when the raw error rate depends on programming voltage levels, equivalently user data, of the target memory cell and/or adjacent cells. It will be shown that the proposed scheme also requires a fewer number of voltage...
Burst error occurs due to various factors and degrades the system performance. In this paper, we propose a burst error sensing scheme for page-oriented data. Using this scheme, the proposed method can sense a two-dimensional burst error location. In addition, it is possible to improve the performance by using erasure decoding on the sensed burst error position.
In this paper, we propose a new improved algorithm to reduce the decoding complexity of NB-LDPC codes especially when the number of iteration is large. The proposed algorithm is based on the extended min-sum (EMS) which truncates the message vectors and trellis-based EMS (T-EMS) which employs the trellis representation. Our modification of EMS introduces the thresholds to further truncate the incoming...
In some practical applications, impulsive noise can severely degrade the performance of a communication system. As a class of powerful error correction codes, Low-density parity-check (LDPC) codes have been shown superior performance on AWGN channels. In addition, belief propagation (BP) decoding algorithm of LDPC codes based on scheduling strategy has better performance and faster convergence rate...
The higher order constellation scheme, i.e., 128AP-SK, has been adopted in the latest generation satellite digital video broadcasting (DVB-S2X) standard. It significantly improves the spectral efficiency, but also introduces serious complexity problems in the implementation of the demapper. This paper presents an efficient soft demapper for 128APSK of DVB-S2X based on the concept of decision region...
The transmission distance of continuous variable QKD (CV QKD) protocol based on Gaussian modulation has been quite limited by the low efficient reconciliation protocol. On the other hand, noiseless linear amplifier (NLA) have greatly enhanced the ability of CV QKD. In this paper, we propose a Gaussian post-selection method simulating NAL in CV QKD, followed by a reconciliation process based on systematic...
Check node processing dominates the complexity of nonbinary LDPC decoding. Trellis based min-max algorithm[1] can reduce the computation complexity and generate the message from check node to variable node in parallel. In this paper, power representation is used to implement check node processor, adder structures over GF(q) using power representation in trellis based check node processing are proposed...
In modern communication systems, there is content redundancy inside the transmitted data no matter what source codes are adopted. This paper introduces machine learning method to utilize content redundancy and perform content recognition, in order to provide side information for error control coding (ECC) and improve performing. It shows that content recognition for English text, based on Trie and...
In this paper, we proposed a secure communication scheme based on Reliability-Based Hybrid Automatic Repeat reQuest (RB-HARQ) protocol over the additive white Gaussian noise (AWGN) wiretap channel. RB-HARQ protocol aims at retransmitting the unreliable bits required for the authorized user's (Bob) successfully decoding and minimizing the information leakage that may benefit to eavesdropper (Eve)....
In this paper, we propose a new approach to construct quasi-cyclic low-density parity-check (QC-LDPC) codes using Hamming codewords of weight three, namely the HM-QC-LDPC codes. Thanks to the distance property of Hamming codes, length four cycles are avoided from the Tanner graph of the constructed codes, resulting in codes of girth six. This approach can be further extended to construct QC-LDPC codes...
This paper presents a look-up table based, configurable and serial-parallel scheduled π-rotation LDPC decoder. By using the proposed permutation mapping scheme together with an optimized normalized min-sum decoding algorithm, the LDPC decoder structure and circuit resource requirements can be greatly reduced. Furthermore, the proposed approach is compatible with different code lengths, bit widths...
As technology improves, the power dissipated by the links of a network-on-chip (NoC) starts to contend with the power dissipated by the additional elements of the correspond ion subsystem, namely, the routers and the network interfaces (NIs). Here, we present a set of data encoding schemes to diminish the power dissipated by the links of an NoC. In this paper, the encoder in LDPC is replaced with...
it is known that the more reliable LDPC code is the longer code, and it is also known that LDPC decoders with flooded architecture which allow parallel processing can achieve high throughputs. But, just architectures become very complex and require more hardware resources when the code length is large and random, so achieving a high error correction rate on short code lengths is considered a challenge...
In this paper, the performance study of OSMLD convolutional self orthogonal (CSOC) and OSMLD block codes over Gamma-Gamma ΓΓ atmospheric turbulence channel is studied. We analyse the efficiency of channel coding technique for different atmospheric turbulence conditions by modeling the channel with a Gamma-Gamma ΓΓ distribution and with BPSK modulation. The results obtained by Monte Carlo simulation...
This paper exposes a new decoder for linear bloc codes. The proposed decoder is based on the resolution of the parity equations system. Elsewhere, to reduce its complexity we have developed a criteria for early terminating the decoding, on the one hand. On the other hand, we introduced a fast method for generating test error patterns. Our decoder is suitable for linear bloc code of medium and high...
We design and implement a variable-rate non-concatenated LDPC code with an adaptive power-consumption decoder using 28nm CMOS technology. Experimental results obtained from a fabricated 256Gb/s optical transceiver demonstrate that the proposed LDPC achieves a NCG of 11.4dB at BER=10−15 without error-floor.
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.