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 an adaptive threshold for flipping intensity based dynamic weighted multi bit flipping algorithm is proposed to overcome the existing complexities in finding the threshold. The change in the check node and bit node status are also considered here. Improvement in performance is observed using the method of adaptive threshold in place of fixed threshold.
Syndrome coding is a very classical coding scheme in Physical layer security. It is necessary to design a efficient and secure code for syndrome coding to guarantee the security of the instant communications. In this paper, we apply two ways to construct random codes. By analysing on the effect of the parity check matrix on the average equivocation, we propose a method to generate the best random...
With the technology scaling of solid state drives (SSDs), data reliability has to be ensured by advanced Low-Density Parity-Check (LDPC) codes. As LDPC reads often take high latency, read performance involved in traditional garbage collection, called external GC, is largely decreased, which affects system performance. GC can choose not to correct data with LD-PC codes but just copy valid pages into...
LDPC codes have been applied in recent communication standards, such as WiFi, WiGig, and 10GBased-T Ethernet as a forward error correction code. However, LDPC codes require a large number of computational complexity for high performances. To solve this problem, various studies have been continuously performed for reducing computational complexity. In this paper, we propose an adaptive forced convergence...
In order to improve the throughput of error correction decoding for the high-performance solid-state drives (SSDs), a semi-parallel low-density parity-check (LDPC) decoding architecture is proposed in this paper. The circuit of the LDPC decoder which can be dynamically configured with bit rate and code length is implemented using the scheduling control flow mode of single instruction multiple data...
We propose a scheme of ultraviolet (UV) communication system, with polar channel coding method. The bit error rate (BER) performance of the UV polar code scheme is analyzed by simulations and offline experiments, in contrast with low-density parity-check (LDPC) scheme. Results suggest that the polar code scheme has a better BER performance than LDPC scheme in the UV communication system.
Flash memories are gaining prominence for utilizing in large scale data centers (DCs) due to their high memory density, low power consumption and heat dissipation, and high access speed characteristics. The rate of degradation for a flash memory is largely affected by the amount and frequency of the erase/write operations, which is a challenge in the DC context that serves dynamically changing workloads...
In this invited paper, we describe a rate-adaptive FEC scheme based on LDPC codes together with its software reconfigurable unified FPGA architecture. By FPGA emulation, we demonstrate that this class of rate-adaptive LDPC codes based on shortening with an overhead from 25% to 42.9% provides a coding gain ranging from 13.08 dB to 14.28 dB at a post-FEC BER of 10−15 for BPSK transmission. In addition,...
In this paper, we studied the irregular row weight problem of DVB-S2 LDPC short frame. This problem will cause the failure of decoding. Based on a special structure of check matrix address table, we have achieved a simple and common solution to the problem.
In this invited paper, both binary and nonbinary LDPC codes suitable for optical transmission systems are described. The corresponding FPGA implementation has been discussed as well. The use of adaptive LDPC coding to deal with time-varying optical channel conditions is described as well.
In this paper, we mainly focus on the optimization of multi-level coded modulation scheme in terms of sub-channel code rate optimal assignment and irregular QC-LDPC code construction with the aid of EXIT chart analysis. Simulation results show that the proposed MLCM scheme can achieve additional 0.1dB NCG compared with the UEP coded modulation scheme.
The main aspect considered in this paper is a comparison of interleaver sizes for convolutional and low-density parity-check codes (LDPC) employed for 100 Gbps wireless communication at 240 GHz with parallel sequence spread spectrum (PSSS). Interleavers required for PSSS-15 and convolutional codes are larger in silicon area than a complete Reed-Solomon decoder. Thus, convolutional codes are not recommended...
This paper proposes a modified IMWBF decoding algorithm for low-density parity-check (LDPC) codes. In the proposed modification, the magnitude of the received signal is updated when the number of the unsatisfied parity-check equations participated by this received signal is larger than a predetermined threshold. Through this modification, the outlier, defined as the undesired large-magnitude received...
Channel Coding for the 5G wireless networks is facing novel challenges to endorse innumerable emerging use cases and applications with miscellaneous performance aspects. With respect to existing state of art codes; 5G channel Codes have diverse requirements of code lengths and rates, as well as throughput, latency and decoding complexity. Therefore, Turbo codes and LDPC codes that played key enablers...
This paper presents a fully pipelined layered decoder architecture for IEEE 802.11 n/ac/ax LDPC codes, free of idle cycles. Several decoder architectures for such codes have emerged in the literature featuring throughputs in the multi- Gbps range. The proposed architecture surpasses the highest reported throughput for IEEE 802.11 n/ac/ax LDPC codes. This is achieved 1) algorithmically, by implementing...
The rapid growth of commercial cellular and personal communication systems has increased the demand for high data rate, power and bandwidth efficient transmissions. Advanced coding and modulation techniques are suitable candidates for this purpose as the potential to reduce the symbol period is often limited by the multipath-induced intersymbol interference (ISI). In this paper, a scheme that jointly...
Several types of insertion/deletion/substitution error correction codings have been proposed for channels with imperfect synchronization. Most of the conventional coding schemes assume insertion/deletion errors of bit granularity, while in some applications, e.g. bit patterned media recording, insertion/deletion errors occur as a result of accumulation of small synchronization errors. This paper considers...
The extended min-sum (EMS) algorithm for decoding low-density parity-check codes over the finite field with q elements significantly reduces decoding complexity by truncating each message of length q into a message of effective length nm. The number of effectively dominant components in each truncated message may gradually decrease with the number of decoding iterations. Based on this observation,...
The outstanding decoding performance of spatially-coupled low-density parity-check (SC-LDPC) codes comes from wave-like propagation of reliable messages. The reliable messages are triggered by shortened (known) variable nodes in some consecutive reliable positions. However, at the cost of the improvement, shortened variable nodes cause rate-loss of SC-LDPC codes. To reduce the rate-loss, additional...
Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages. This strategy, coined compute-forward multiple access (CFMA), provably achieves points on the dominant face of the multiple-access capacity region...
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.