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.
A new joint message-passing decoder is presented for use in a two-user cooperative wireless network. This decoder is designed for use with the diversity network coding scheme of Xiao et al. [1], which uses nonbinary network codes together with channel coding to achieve high diversity gains. The proposed joint decoder, together with appropriate modifications to the cooperative protocol of [1], significantly...
A recursive encoding of spatially coupled LDPC codes with low complexity has been proposed in recent works. But it has to solve a system of linear equations to terminate the codes. In this paper we modify the protograph of spatially coupled LDPC codes by adding extra variable nodes, called repeat-accumulate(RA) tail, which can simplify the termination without time delays. Performance analysis with...
This paper proposes a physical layer coding scheme to secure communications over the Gaussian wiretap channel. This scheme is based on non-systematic Rate-Compatible Low-Density-Parity-Check (RC-LDPC) codes. The rate compatibility involves the presence of a feedback channel that allows transmission at the minimum rate required for legitimate successful decoding. Whenever the decoding is unsuccessful,...
We compare hybrid turbo differential decoding with other FEC-schemes that reduce the penalty usually associated with differential encoding applied for cycle slip mitigation. We discuss implementation aspects and show robust FEC-performance in nonlinear transmission experiments.
Increase in design complication for current and future era of microelectronics technologies and mechanisms used for data transmission leads to an increased sensitivity to bit-flip errors. As we know, multiple cores are built in a single system on chip (SoC) and to test that SoC, test vectors are transferred from automatic test equipment (ATE) via serial communication link. Now if there is a defect...
A concatenation of two encoders is used to construct channel resolvability codes. The code of the first encoder has large minimum distance and the second encoder is linear and has a sparse generator matrix. If the first encoder has encoding complexity O(n) or O(n log n), where n is the length of the codewords, an overall encoding complexity O(n log n) can be achieved. One can tune the sparsity to...
The next generation broadcast wireless (NGB-W) system is aimed to provide high-speed, ubiquitous, and secure tri-play services to massive users. In this paper, a new terrestrial broadcast solution for the NGB-W system is proposed. The system and the key techniques of the proposed solution are introduced. The performance of the proposed solution is evaluated by simulations. It is shown that the performance...
In this work, we consider the problem of synchronizing two sets of data where the size of the symmetric difference between the sets is small and, in addition, the elements in the symmetric difference are related. In this introductory work, the elements within the symmetric difference are related through the Hamming distance metric. Upper and lower bounds are derived on the minimum amount of information...
The performance of the original successive cancellation decoder of short-length polar codes is inferior to that of the maximum-likelihood decoder. Existing sphere decoding algorithms of polar codes have a high computational complexity even for short lengths. This is because, when exploring the tree defined by the generator matrix of the code, existing algorithms employ loose branching conditions and...
This paper constructs WOM codes that combine rewriting and error correction for mitigating the reliability and the endurance problems in flash memory.We consider a rewriting model that is of practical interest to flash applications where only the second write uses WOM codes. Our WOM code construction is based on binary erasure quantization with LDGM codes, where the rewriting uses message passing...
We study low-delay streaming codes for erasure channels in point-to-point and multicast scenarios. We consider a sliding window erasure channel which captures the temporal correlation in packet losses observed in real channels. This correlation is often modelled using statistical channels such as Gilbert-Elliott channel. In the point-to-point case, we provide a new class of codes, Embedded Maximum...
In this paper, we propose an efficient parallel encoding algorithm for the low-density parity-check (LDPC) codes. The main idea of the proposed encoding algorithm is the block-diagonalization of the parity part of a given parity check matrix by row and column permutation. The numerical examples in this paper show that the proposed encoding algorithm efficiently works in the multi-processor systems.
In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are considered. An expression for the average distance spectrum is derived and this expression is used to obtain the asymptotic exponent of the weight distribution. The asymptotic growth rate analysis is then exploited to develop a necessary and sufficient condition under which the fixed-rate Raptor code ensemble...
The problem of constructing error correcting codes for defective memories, where some of the cells are defected and unable to switch their states, is considered. This is a classical problem in coding theory which has recently received renewed attention due to application to new technologies for non-volatile memories such as phase change memories. We show how the state of the art capacity achieving...
An [n, k] linear code C that is subject to locality constraints imposed by a parity check matrix H0 is said to be a maximally recoverable (MR) code if it can recover from any erasure pattern that some k-dimensional subcode of the null space of H0 can recover from. The focus in this paper is on MR codes constrained to have all-symbol locality r. Given that it is challenging to construct MR codes having...
A standard VLSI model is used to derive universal lower bounds on the energy of decoder circuits. In the circuit model used, the product of the circuit area and number of clock cycles, or the area-time complexity is proportional to the energy of computation. Lower bounds as a function of block length n are presented for three different circuit paradigms. Firstly, for circuits that compute in parallel,...
In this work we study the reliability and secrecy performance achievable by practical low-density parity-check (LDPC) codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis of codewords of infinite length, only a few approaches exist for the finite length regime. We propose an approach to measure the performance...
In this paper, we address the issue of unequal missing protection (UMP) for the design of grouping of radio-frequency identification (RFID) tags. While relying on group generation matrices, grouping of RFID tags allows verifying the integrity of a collection of RFID tags without the requirement for accessing external systems, and can be extended to identify missing RFID tags. Motivated by application...
In this paper, we explore code optimization for two-user discrete memoryless interference channels (DMICs) wherein the inputs and outputs of the channel are from a finite alphabet. For encoding, we employ irregular low-density parity-check (LDPC) codes combined with non-linear trellis codes (NLTCs) to satisfy the desired distribution of zeros and ones in the transmitted codewords. At the receiver...
A packing lemma is proved using a setting where the channel is a binary-input discrete memoryless channel (X,w(y|x),Y ), the code is selected at random subject to parity-check constraints, and the decoder is a joint typicality decoder. The ensemble is characterized by (i) a pair of fixed parameters (H,q) where H is a parity-check matrix and q is a channel input distribution and (ii) a random parameter...
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.