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 propose a thresholding algorithm to improve Split-Row decoding method of irregular LDPC codes, with maintaining the same level of complexity. We present in this paper a full description of this method and its benefits for various row weight and length code word. In this context, we have performed an implementation on MATLAB of an irregular LDPC codes with different code word and...
This paper designs protograph-based Raptor-like (PBRL) codes as a class of rate-compatible (RC) LDPC codes for binary-erasure channels (BEC). Similar to the Raptor Codes, the RC property is achieved by X-OR operations of the precoded bits. The additional parity bits, which lower the rate, are selected such that their connections in the protograph optimize the density evolution threshold. In order...
Low Density Parity Check (LDPC) codes are the one most powerful error correction codes (ECCs) and approach the Shannon limit[1]. The main advantage of the parity check matrix is the decoder can correct all single-bit errors. A decoding algorithm called Min-Sum (MS) algorithm is used in LDPC decoder. In a MIN-SUM decoding algorithm, check node units (CNU) and variable node units (VNU) are iteratively...
OFDMA and SC-FDMA were chosen as strong candidates for uplink transmission in 3GPP-LTE. OFDMA is a full-fledged multicarrier modulation scheme but has the disadvantage of high PAPR. SC-FDMA achieves low PAPR by spreading the constellation points over entire bandwidth but lacks efficient spectral utilization and prone to Inter Carrier Interference (ICI) at cell edge. Grouped Frequency Division Multiple...
The present paper focuses on the compression system using Huffman compression algorithm for data compression. The rate of data decompression is more time consuming during the decoding of these compressed data. Various works have proposed for the enhancement of compressed data decoding. In this paper the realization and implementation of a High speed decoding Huffman coding system is proposed and the...
Non-binary quasi-cyclic (NB-QC) codes are a class of graph-based codes with high performance and implementation-friendly structure. In this paper, we introduce a new method for designing NB-QC codes with improved performance in the low error-rate region. Specifically, we propose a construction which reduces the number of non-binary absorbing sets, which are known to cause errors when decoding non-binary...
Trafc indication map (TIM) is one information element (IE) that is used to indicate the buffered frame status for the stations (STAs) and carried in the regularly transmitted beacons in the IEEE 802.11 based WLANs. To reduce the overhead of TIM signaling for the recent standardization of IEEE 802.11ah, which supports a large number of STAs and operates at the sub-1GHz frequency, a hierarchical structure...
The achievable sum-rate of the two-way relaying becomes far below the cut-set outer bound if the signal-to-noise-ratio (SNR) from one node to the relay is significantly different from the SNR from the other node to the relay, and particularly so for decode-and-forward or compute-and-forward type relaying. In this paper, we propose a buffer-aided compute-and-forward two-way relaying with lattice codes...
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS)....
We derive a new fast convergent Density Evolution algorithm for finding optimal rate Low-Density Parity-Check (LDPC) codes used over the binary erasure channel (BEC). The fast convergence property comes from the modified Density Evolution (DE), a numerical method for analyzing the behavior of iterative decoding convergence of a LDPC code. We have used the method of [16] for designing of a LDPC code...
In this paper, we present an extension of the semi-definite programming formulation of the optimal rate code design in single link Binary Erasure Channel (BEC) proposed by the authors to the Binary Erasure Multiple Access Channel (BE-MAC) with two sources correlation. This new way can be easily extended to the multiple access senders. Simulation results show the efficiency and effectiveness of the...
A novel quantize-and-forward scheme with two relays is proposed in this paper. In our scheme, each relay only processes one bit of the quantized codeword. The principle of selecting the aforementioned bit is based on the channel condition of the relay links. Compared with the single-relay scheme, the system consumes the same resources, while each relay has a prolonged life since it only transmits...
Polar codes have a regular-recursive structure, which can efficiently be mapped to hardware for practical applications. A good quantization scheme plays a great important role in hardware implementation. In this paper, three uniform quantizers are designed for successive cancellation (SC) decoding of polar codes based on either optimizing the equivalent channel capacity, cutoff rate or mean-squared...
On the basis of Lu's syndrome-based decoding algorithm, we propose an improved decoding algorithm for turbo product code, which has lower complexity and latency. On one hand, the proposed algorithm further reduces the computational complexity and the decoding latency by simplifying the calculation of syndrome and selecting a proper number of least reliable bits. On the other hand, this algorithm obtains...
This paper presents a Resolver-to-Digital Converter decoding arithmetic for detecting the velocity and driving distance of automobiles. The application deals with dual synchronous reference frame-based phase-locked loop(DSRF-PLL) to transform the sine and cosine output signals of a resolver into the double SRF(DSRF), from which a decoupling cell(DC) added to attenuate oscillations caused by DSRF....
As an extension of binary low-density parity-check (LDPC) codes, non-binary LDPC (NB-LDPC) codes show significantly better performance when the code length is moderate or small. Recently, enhanced iterative hard reliability based (EIHRB) decoding algorithm is proposed to reduce the computation complexity. However, the EIHRB algorithm suffers a lot from significant performance degradation when the...
This paper presents a variation tolerant driving technique for all-digital self-timed 3-level signaling high-speed SerDes transceivers. The proposed design generates the 3-level signal without a ½VDD driver, thus removing all the overhead and hassle of an additional supply. Moreover, the proposed all-digital scheme uses half the clock frequency while maintaining the same data rate of the conventional...
The physical-layer network coding (PNC) has become a hot research topic, since it can potentially reduce the transmission time slots and increase the channel capacity. However, current studies are mainly concentrated on three nodes (two users and one relay) network. This paper considers a specific multiuser network that includes M (M>2) users with one relay, and illustrates the transmission scheme...
In this paper we describe ensemble of Low-Density Parity-Check (LDPC) block codes based on Partial Unit Memory (P)UM codes. We study a decoding performance of received ensemble in the case of different parameters of constituent LDPC codes. The results of simulation of obtained code constructions for an iterative “belief propagation” (Sum-Product) decoding algorithm, applied in the case of transmission...
In this paper, we propose an accumulated loss recovery algorithm on overlay multicast system using Fountain codes. Fountain code successfully decodes the packet loss, but it is weak in accumulated losses on multicast tree. The proposed algorithm overcomes an accumulated loss and significantly reduces delay on overlay multicast tree.
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.