21 results on '"Ueng, Yeong-Luh"'
Search Results
2. Post-Processing for CRC-Aided Successive Cancellation List Decoding of Polar Codes.
- Author
-
Wang, Chung-Hsuan, Pan, Yi-Han, Lin, Yu-Heng, and Ueng, Yeong-Luh
- Abstract
In this letter, three post-processing schemes for cyclic redundancy check (CRC-)aided successive cancellation list (CA-SCL) decoding are presented for polar codes. The re-decoding based on our post-processing schemes can effectively alleviate both the channel and decision errors encountered via CA-SCL decoding. Simulation results show that our schemes perform better than conventional re-decoding schemes and can be incorporated into a polar decoder that has a small list size to achieve a performance that is expected for a large list size. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
3. An LDPC-Coded SCMA Receiver With Multi-User Iterative Detection and Decoding.
- Author
-
Sun, Wei-Cheng, Su, Yu-Chieh, Ueng, Yeong-Luh, and Yang, Chia-Hsiang
- Subjects
ITERATIVE decoding ,DIGITAL integrated circuits ,ELECTRIC transients ,LOGIC circuits ,ERROR rates - Abstract
This paper presents the first low-complexity realization of an LDPC-code sparse code multiple access (SCMA) receiver with a high-throughput LDPC decoder and a multi-mode SCMA detector. The minimum mean-square error with parallel interference cancellation (MMSE-PIC) algorithm is adopted in the SCMA detection. The modified user-node operations in the MMSE-PIC-based message-passing detector improve the convergence rate in error performance. The proposed receiver also supports multi-user iterative detection and decoding (MU-IDD) to improve the error rate performance. The proposed receiver supports both $4\times 6$ and $8\times 12$ SCMA systems. The proposed MU LDPC decoder has a 57.1% lower hardware complexity than the direct-mapped design that is achieved through hardware sharing and memory access scheduling. Designed in a 40-nm CMOS technology, the SCMA receiver integrates 10.9M logic gates in an area of $3.382\times 3.382$ mm2. The proposed design achieves a gross throughput of 1.198 Gb/s and 599 Mb/s for $8\times 12$ and $4\times 6$ SCMA systems, respectively, under a practical situation. It dissipates 813 mW at a clock frequency of 300 MHz from a 0.9-V supply. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
4. An Effective Low-Complexity Error-Floor Lowering Technique for High-Rate QC-LDPC Codes.
- Author
-
Lee, Huang-Chang, Chou, Po-Chiao, and Ueng, Yeong-Luh
- Abstract
This letter presents a low-complexity redecoding-based error-floor lowering technique for quasi-cyclic low-density parity-check codes, where a predetermined set of variable nodes are attenuated before the redecoding. Using a two-stage off-line search, the attenuation set is determined based on the error patterns collected from the standard decoding simulation. It is shown that the error floor can be effectively lowered, and only a negligible amount of complexity is introduced. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. An Efficient Combined Bit-Flipping and Stochastic LDPC Decoder Using Improved Probability Tracers.
- Author
-
Ueng, Yeong-Luh, Wang, Chun-Yi, and Li, Mao-Ruei
- Subjects
- *
LOW density parity check codes , *PROBABILITY theory , *STOCHASTIC analysis , *CRYPTOGRAPHY , *WIRELESS sensor nodes - Abstract
This paper presents an efficient combined bit-flipping (BF) and stochastic low-density parity-check decoder, where a BF decoder is used to achieve a reduction in decoding cycles. A node-wise probability tracer is adopted at each variable node (VN) in order to achieve a BER performance comparable to the normalized min-sum algorithm, where check-to-variable (C2V) messages are used as inputs, rather than the variable-to-check (V2C) messages adopted in previous stochastic decoders. The complexity of the VN units is greatly reduced by sharing common units used in the generation of V2C messages together with a probability tracer. The C2V-based probability tracer enables the design of a decoder that provides a short critical path. The proposed methods are demonstrated by designing a (2048, 1723) decoder that is implemented in a 90 nm process. A total of 1460 K logic gates are integrated in a decoder that has an area of 4.12 \mboxmm^2 and achieves a coded throughput of 39.3 Gb/s at a clock frequency of 749 MHz. To the best of the authors’ knowledge, the proposed decoder achieves the best normalized throughput-to-area ratio among the stochastic decoders reported in the open literatures. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
6. An Integrated Message-Passing Detector and Decoder for Polar-Coded Massive MU-MIMO Systems.
- Author
-
Chen, Yan-Tong, Sun, Wei-Cheng, Cheng, Chung-Chao, Tsai, Tsung-Lin, Ueng, Yeong-Luh, and Yang, Chia-Hsiang
- Subjects
MIMO systems ,ANTENNAS (Electronics) ,SIGNAL processing - Abstract
For a coded massive multi-user multiple-input multiple-output (MIMO) system, a soft-output MIMO detector is essential since it can provide a significant coding gain, e.g., 3 dB, compared with a hard-output detector. However, the computational complexity of the soft-output MIMO detector is usually much greater than that of the hard-output detector. This paper presents the first soft-output message-passing detector (MPD), which is also integrated with a high-throughput polar decoder. The algorithm and architecture are designed concurrently to improve the hardware performance. The proposed techniques, including the adaptive variance estimation and reliable symbol detection, reduce the complexity of the MPD by 98.3%, and enable soft output for the outer polar decoder. Compared to the state-of-the-art hard-output design, the proposed MPD achieves a $5.86\times $ higher throughput-to-area ratio (TAR) with 54.3% lower energy dissipation, despite the soft output. The proposed bidirectional-propagation belief propagation decoder is devised to reduce the critical path and to increase the throughput. The proposed polar decoder can improve the TAR by 35% with a comparable area and energy compared with the state-of-the-art polar decoder. A polar-coded massive MIMO receiver that supports a length-1024 rate-1/2 polar code, 128 receive antennas, and eight users is designed and implemented, and delivers a throughput of 7.61 Gb/s. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
7. A 5.28-Gb/s LDPC Decoder With Time-Domain Signal Processing for IEEE 802.15.3c Applications.
- Author
-
Li, Mao-Ruei, Yang, Chia-Hsiang, and Ueng, Yeong-Luh
- Subjects
LOW density parity check codes ,TIME-domain analysis ,IEEE 802 standard - Abstract
This paper presents a high-throughput, energy-efficient, and scalable low-density parity-check (LDPC) decoder with time-domain (TD) signal processing. The proposed arbiter-based minimum value finder is able to support practical long codes. The latency for determining the first two minimum values required in the check node unit is significantly reduced through TD processing. A layered Q -based decoding architecture together with the associated scheduling is proposed in order to reduce the amount of memory used for check node storage. Multimode operations are supported by leveraging the structure of the base matrices and the proposed scalable minimum finder architecture. As a proof of concept, a TD-based multimode LDPC decoder for high-speed IEEE 802.15.3c is designed and fabricated in a 90-nm CMOS process. The LDPC decoder integrates 495k logic gates in 2.25 mm2 and achieves a throughput of 5.28 Gb/s at 157 MHz from a 1.05 V supply voltage. The power and normalized energy dissipation are 182 mW and 34.47 pJ/b, respectively. The proposed LDPC decoder is more hardware and energy efficient than previous digital counterparts and is able to support long codes for practical applications, which is still infeasible for the state-of-the-art TD-based LDPC decoders. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
8. Strategies for Reducing Decoding Cycles in Stochastic LDPC Decoders.
- Author
-
Wu, Di, Chen, Yun, Zhang, Qichen, Ueng, Yeong-luh, and Zeng, Xiaoyang
- Abstract
This brief presents three strategies, including initialization based on Look Up Table (LUT), postprocessing based on bit flipping and hard decision based on the posterior information, to reduce the number of decoding cycles (DCs) for stochastic low-density parity-check decoding. For the standard IEEE 802.3an code, simulation indicates a 73.6% reduction in the average number of DCs with a satisfactory bit error rate. Moreover, hardware implementation shows that the area required for the proposed decoder is significantly reduced. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
9. Raptor-Coded Noncoherent Cooperative Schemes Based on Distributed Unitary Space–Time Modulation.
- Author
-
Lai, Wei-Min, Chen, Yen-Ming, and Ueng, Yeong-Luh
- Subjects
WIRELESS cooperative communication ,TELECOMMUNICATION systems ,DECODE & forward communication ,DATA transmission systems ,MIMO systems - Abstract
In this paper, we investigate Raptor-coded distributed unitary space–time modulation (USTM) schemes, where both the amplify-and-forward (AF) and decode-and-forward (DF) relaying scenarios are considered, under a wireless relay network with arbitrary path gains for the channel fading coefficients. First, the AF and DF relaying procedures are investigated based on the use of an inner USTM signal and an outer Raptor code, and the related noncoherent detectors are also derived. The constellation search for the USTM signal, as well as the optimization for the Raptor code, is then investigated in order to enhance the system performance. It is shown that the designed systems effectively approach the predicted limit in throughput performances and outperform the noncoherent distributed MIMO scheme reported in the previous literature. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
10. Optimization Techniques for the Efficient Implementation of High-Rate Layered QC-LDPC Decoders.
- Author
-
Lee, Huang-Chang, Li, Mao-Ruei, Hu, Jyun-Kai, Chou, Po-Chiao, and Ueng, Yeong-Luh
- Subjects
LOW density parity check codes ,ERROR-correcting codes ,MATHEMATICAL optimization - Abstract
For high-rate low-density parity-check (LDPC) codes, layered decoding processing can be reordered such that the first-in-first-out (FIFO) buffer that stores variable-to-check (V2C) messages is not needed and, hence, the memory area can be minimized, but at the cost of increased data dependency. This paper presents three techniques that can be used to implement an efficient reordered layered decoder. First, with the assistance of a graph coloring method, the required minimum number of V2C sign memory banks can be theoretically determined, with the corresponding pipeline architecture also designed. After that, the integer linear programming technique is adopted so as to arrange the V2C sign memory banks in a manner that minimizes the number of pipeline stalls, thereby increasing throughput. In order to further simplify the decoder, the first minimum values are not stored if the proposed modified min-sum algorithm is used. The proposed techniques are demonstrated by implementing a rate-0.905 (18396,16644) QC-LDPC decoder using 90-nm CMOS technology. When using the proposed techniques, implementation results show that the throughput-to-area ratio (TAR) increases by 58.9% without sacrificing error-rate performance. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
11. LDPC Decoding Scheduling for Faster Convergence and Lower Error Floor.
- Author
-
Lee, Huang-Chang and Ueng, Yeong-Luh
- Subjects
- *
LOW density parity check codes , *CONVERGENCE (Telecommunication) , *PULSE frequency modulation , *ERROR rates , *ITERATIVE decoding - Abstract
This paper presents a maximum mutual information increase (M^2I^2)-based algorithm that can be used to arrange low-density parity-check (LDPC) decoding schedules for faster convergence, where the increase is used to guide the arrangement of the fixed decoding schedule. The predicted mutual information for the messages to be updated is used in the calculation of the increase. By looking ahead for several decoding stages, a high-order prediction can be realized, which can then be used to devise a schedule with an even faster convergence. For a single received frame, different decoding results can be obtained using different schedules, and, hence, schedule diversity, that lowers the error floor resultant from the dominant trapping sets, is proposed. By adopting the M^2I^2-based schedule together with the schedule diversity, both the convergence speed in the waterfall region and the error-rate in the floor region can be improved. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
12. Noncoherent coded space-time modulation for a large number of transmit antennas.
- Author
-
Chen, Yen-Ming, Ueng, Yeong-Luh, Shiau, Hau-Jung, Hsieh, Dung-Rung, Hsu, Jen-Yuan, and Ting, Pangan
- Abstract
Recently, a turbo-coded noncoherent space-time modulation scheme, which is aimed at providing both a high data transmission rate and a low receiving complexity, was proposed for noncoherent block fading channels. However, in cases where a large number of transmit antennas exist, the turbo code does not match well with the noncoherent space-time modulation scheme, and results in performance degradation. In this paper, we first investigate a coded noncoherent space-time modulation scheme using an irregular low-density parity-check (LDPC) code. We also design a turbo-coded noncoherent space-time modulation scheme based on the codeword-interleaving strategy. The coded symbols mapped from adjacent codewords are interleaved into the same signal vectors, and the soft information from adjacent codewords are allowed to be exchanged at the receiver. When comparing to the conventional turbo-coded scheme, both proposed schemes achieve a significant improvement in BER performance. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
13. Flooding-assisted informed dynamic scheduling for rateless codes.
- Author
-
Chen, Yen-Ming, Lee, Huang-Chang, Ueng, Yeong-Luh, and Yeh, Chin-Yun
- Abstract
As part of the tradeoff between error performance, decoding complexity and the overhead of rateless codes, the combination of incremental decoding (ID) and informed dynamic scheduling (IDS), known as IDIDS (incremental decoding with informed dynamic scheduling), is an attractive solution in binary symmetric channels (BSC). However, applying IDIDS in the AWGN (additive white Gaussian noise) channel may cause a degradation in BER performance, since the incrementally received symbols from the AWGN channel may not be immediately utilized in the decoding process directed by IDS. In addition, a stopping criterion combined with IDS may cause the current decoding attempt to terminate too early, and the channel information contained in the originally received codeword will not be used efficiently. In this paper, a dynamic decoding schedule strategy is proposed. In the proposed decoder, the new received symbols can be immediately utilized in the decoding process. For Luby transform (LT) codes and Raptor codes over the AWGN channel, the proposed algorithm provides a more balanced tradeoff. In the case of Raptor codes, the BER performance is obviously improved. [ABSTRACT FROM PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
14. An Iterative Detection and Decoding Receiver for LDPC-Coded MIMO Systems.
- Author
-
Sun, Wei-Cheng, Wu, Wei-Hsuan, Yang, Chia-Hsiang, and Ueng, Yeong-Luh
- Subjects
MIMO systems ,WIRELESS communications ,PARITY-check matrix ,DETECTORS ,MULTIUSER detection (Telecommunication) - Abstract
This paper presents a high-throughput, area-efficient and energy-efficient iterative detection and decoding (IDD) receiver for low-density parity-check (LDPC)-coded multiple-input multiple-output (MIMO) systems. A layered non-resetting IDD technique is used to minimize the number of inner iterations for a required error performance. An area-efficient minimum mean-square error with parallel interference cancellation (MMSE-PIC) detector is devised to simplify matrix inversion. A detector-decoder interface that is used to exchange soft messages efficiently is proposed. Given the throughput specifications, inner and outer loops are optimally combined to maximize the error performance. The design specifications defined in the IEEE 802.11n standard are adopted as the design target. A 4 \times 4 antenna configuration with BPSK, QPSK, 16-QAM modulations are realized in silicon. The designs that support 64-QAM and 256-QAM modulations are also demonstrated for comparison with prior work. Fabricated in 40 nm technology, the chip integrates 998k logic gates in 1.33 mm^2 and achieves a maximum throughput of 794 Mb/s. The chip dissipates 135 mW at 0.9 V, achieving an energy efficiency of 170 pJ/bit. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
15. A 5.4 \muW Soft-Decision BCH Decoder for Wireless Body Area Networks.
- Author
-
Yang, Chia-Hsiang, Huang, Ting-Ying, Li, Mao-Ruei, and Ueng, Yeong-Luh
- Subjects
BODY area networks ,IEEE 802 standard ,INTEGRATED circuits ,BIT error rate ,ERROR-correcting codes ,DECODERS (Electronics) - Abstract
This paper presents an IEEE 802.15.6 compliant soft-decision BCH decoder for energy-constrained wireless body area networks. The proposed soft-decision decoder (SDD) provides a 1 dB coding gain compared to the hard-decision decoder (HDD). The improvement in BER performance can translate into power savings at the transmitter. The energy dissipation and area of the soft-decision BCH decoder is minimized by jointly considering the algorithm, architecture, and circuit parameters. An early termination strategy is proposed to reduce the number of redundant test patterns. Probabilistic sorting is proposed to determine the test patterns, and its hardware complexity is only 54.7% of the conventional sorting method. The HDD kernel is implemented by adopting the Peterson rule, reducing the area by 44.2%. A pass-transistor logic based Chien search circuit consumes 33.3% less energy compared to the standard-cell based implementation. The chip is designed to operate at the minimum energy point of 0.29 V, yielding an energy reduction of 94% compared to a direct-mapped SDD at SNR=5\ dB. Fabricated in 90 nm CMOS, the chip dissipates 5.4 \muW at 500 kHz, achieving a throughput of 6.38 Mbps. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
16. A Fully Parallel LDPC Decoder Architecture Using Probabilistic Min-Sum Algorithm for High-Throughput Applications.
- Author
-
Cheng, Chung-Chao, Yang, Jeng-Da, Lee, Huang-Chang, Yang, Chia-Hsiang, and Ueng, Yeong-Luh
- Subjects
LOW density parity check codes ,COMPLEMENTARY metal oxide semiconductors ,SIGNAL-to-noise ratio ,DECODERS (Electronics) ,ALGORITHMS (Physics) - Abstract
This paper presents a normalized probabilistic min-sum algorithm for low-density parity-check (LDPC) codes, where a probabilistic second minimum value, instead of the true second minimum value, is used to facilitate fully parallel decoder realization. The comparators in each check-node unit (CNU) are connected through an interconnect network based on a mix of tree and butterfly networks such that the routing and message passing between the variable-node units (VNUs) and CNUs can be efficiently realized. In order to further reduce the hardware complexity, the normalization operation is realized in the VNU rather than in the CNU. An early termination scheme is proposed in order to prevent unnecessary energy dissipation for both low and high signal-to-noise-ratio regions. The proposed techniques are demonstrated by implementing a (2048, 1723) LDPC decoder using a 90 nm CMOS process. Post-layout simulation results show that the decoder supports a throughput of 45.42 Gbps at 199.6 MHz , achieving the highest throughput and throughput-to-area ratio among comparable works based on a similar or better error performance. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
17. Two Informed Dynamic Scheduling Strategies for Iterative LDPC Decoders.
- Author
-
Lee, Huang-Chang, Ueng, Yeong-Luh, Yeh, Shan-Ming, and Weng, Wen-Yen
- Subjects
- *
COMPUTER scheduling , *ITERATIVE methods (Mathematics) , *DECODERS & decoding , *LOW density parity check codes , *STOCHASTIC convergence , *COMPUTATIONAL complexity , *ERROR rates - Abstract
When residual belief-propagation (RBP), which is a kind of informed dynamic scheduling (IDS), is applied to low-density parity-check (LDPC) codes, the convergence speed in error-rate performance can be significantly improved. However, the RBP decoders presented in previous literature suffer from poor convergence error-rate performance due to the two phenomena explored in this paper. The first is the greedy-group phenomenon, which results in a small part of the decoding graph occupying most of the decoding resources. By limiting the number of updates for each edge message in the decoding graph, the proposed Quota-based RBP (Q-RBP) schedule can reduce the probability of greedy groups forming. The other phenomenon is the silent-variable-nodes issue, which is a condition where some variable nodes have no chance of contributing their intrinsic messages to the decoding process. As a result, we propose the Silent-Variable-Node-Free RBP (SVNF-RBP) schedule, which can force all variable nodes to contribute their intrinsic messages to the decoding process equally. Both the Q-RBP and the SVNF-RBP provide appealing convergence speed and convergence error-rate performance compared to previous IDS decoders for both dedicated and punctured LDPC codes. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
18. An RLL-Constrained LDPC Coded Recording System Using Deliberate Flipping and Flipped-Bit Detection.
- Author
-
Chou, Hong-Fu, Ueng, Yeong-Luh, Lin, Mao-Chao, and Fossorier, Marc P. C.
- Subjects
- *
WIRELESS communications , *SIGNAL detection , *NETWORK performance , *ERROR rates , *COMPUTER algorithms - Abstract
In this paper, a low-density parity-check (LDPC) coded recording system is investigated, for which the run-length-limited (RLL) constraint is satisfied by deliberate flipping at the write side and by estimating the flipped bits at the read side. Two approaches are proposed for enhancing the error performance of such a system. The first approach is to alleviate the negative effect of incorrect estimation of the flipped bits by adjusting the soft information. The second approach is to increase the likelihood of the correct detection of flipped bits by designing a flipped-bit detection algorithm that utilizes both the RLL constraint and the parity-check constraint of the LDPC code. These two approaches can be combined to obtain significant improvement in performance over previously proposed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
19. An Efficient Multi-Standard LDPC Decoder Design Using Hardware-Friendly Shuffled Decoding.
- Author
-
Ueng, Yeong-Luh, Yang, Bo-Jhang, Yang, Chung-Jay, Lee, Huang-Chang, and Yang, Jeng-Da
- Subjects
- *
LOW density parity check codes , *DECODING algorithms , *BANDWIDTHS , *QUANTIZATION (Physics) , *COLLATERALIZED mortgage obligations - Abstract
This paper presents an efficient multi-standard low-density parity-check (LDPC) decoder architecture using a shuffled decoding algorithm, where variable nodes are divided into several groups. In order to provide sufficient memory bandwidth without the need for using registers, a FIFO-based check-mode memory, which dominates the decoder area, is used. Since two compensation factors, rather than a single factor, are dynamically used in the offset Min-Sum algorithm, the number of quantization bits, and, hence, the memory size, can be reduced without degradation in error performance. In order to further reduce the memory size, artificial minimum values, which do not need to be stored in memory, are used. We also propose an algorithm that can be used to partition variable nodes such that the hardware cost can be minimized. Using the proposed techniques, a multi-standard decoder that supports the LDPC codes specified in the ITU G.hn, IEEE 802.11n, and IEEE 802.16e standards was designed and implemented using a 90-nm CMOS process. This decoder supports 133 codes, occupies an area of 5.529 mm^2, and achieves an information throughput of 1.956 Gbps. [ABSTRACT FROM PUBLISHER]
- Published
- 2013
- Full Text
- View/download PDF
20. Processing-Task Arrangement for a Low-Complexity Full-Mode WiMAX LDPC Codec.
- Author
-
Wang, Yu-Luen, Ueng, Yeong-Luh, Peng, Chien-Lien, and Yang, Chung-Jay
- Subjects
- *
IEEE 802.16 (Standard) , *NETWORK routers , *ALGORITHMS , *COMPUTER storage devices , *COMPUTER network standards , *COMPUTER architecture - Abstract
In this paper, we propose dividing the decoding operations of a variety of irregular quasi-cyclic (QC) low-density parity-check (LDPC) codes into several smaller tasks. An algorithm is devised in order to arrange these tasks in a similar form such that a highly reusable multimode architecture can be designed to process these tasks. For this task-based decoder, the associated memory access can be accomplished with the help of the proposed address generators. Using this approach, the difficulty of designing a low-complexity multimode decoder, which is capable of supporting a variety of irregular QC-LDPC codes, can be overcome. Layered encoding that enables the routing networks and memory for decoding to be reused for the encoding is also proposed. Using these techniques, a multimode codec which can support all 114 WiMAX LDPC codes is designed and implemented in a 90-nm process. The full-mode WiMAX codec achieves a moderate encoding (decoding) throughput of 800 Mb/s (200 Mb/s) and occupies an area of only 0.679 \mm^2. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
21. A Multimode Shuffled Iterative Decoder Architecture for High-Rate RS-LDPC Codes.
- Author
-
Ueng, Yeong-Luh, Yang, Chung-Jay, Wang, Kuan-Chieh, and Chen, Chun-Jung
- Subjects
- *
DECODERS (Electronics) , *REED-Solomon codes , *COMPUTER architecture , *PERMUTATIONS , *CODING theory - Abstract
For an efficient multimode low-density parity-check (LDPC) decoder, most hardware resources, such as permutators, should be shared among different modes. Although an LDPC code constructed based on a Reed–Solomon (RS) code with two information symbols is not quasi-cyclic, in this paper, we reveal that the structural properties inherent in its parity-check matrix can be adopted in the design of configurable permutators. A partially parallel architecture combined with the proposed permutators is used to mitigate the increase in implementation complexity for the multimode function. The high check-node degree of a high-rate RS-LDPC code leads to challenges in the efficient implementation of a high-throughput decoder. To overcome this difficulty, the variable nodes have been partitioned into several groups, and each group is processed sequentially in order to shorten the critical-path delay and hence increase the maximum operating frequency. In addition, shuffled message-passing decoding is adopted, since fewer iterations can be used to achieve the desired bit-error-rate performance. In order to demonstrate the usefulness of the proposed flexible-permutator-based architecture, one single-mode rate-0.84 decoder and two multimode decoders whose code rates range between 0.79 and 0.93 have been implemented. These decoders can achieve multigigabit-per-second throughput. Using the proposed architecture to support lower rate RS-LDPC codes, e.g., rate-0.568 code, is also investigated. [ABSTRACT FROM PUBLISHER]
- Published
- 2010
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.