Please use this identifier to cite or link to this item:
Title: A parallel-routing network for reliability inferences of single-parity-check decoder
Authors: Lu, Q
Shen, Z
Sham, CW
Lau, FCM 
Issue Date: 2015
Source: 2015 International Conference on Advanced Technologies for Communications (ATC), Ho Chi Minh, Vietnam, 14-16 Oct 2015, p.127-132
Abstract: The computation of the reliability inferences among the variables of a single-parity-check (SPC) code is a common challenge to the implementation of channel decoders. Applicable to a variety of computational mechanisms using disparate kernels, a parallel-routing network has been developed, which is, compared to the state-of-art structure, exploring the best of its parallel nature for an improved timing performance. Furthermore, we assure that the proposed structure has no degradation in neither computation accuracy nor hardware complexity. With this structure, the LUT-based method becomes the optimal solution as a whole to implement an SPC decoder and other decoders containing it, like, for example, a low-density parity-check (LDPC) decoder. The improvement of the proposed design has been verified by a field-programmable gate array (FPGA), showing a 186% increase in clock rate for a 32-degree SPC decoder.
Keywords: Decoding
Complexity theory
Table lookup
Publisher: Institute of Electrical and Electronics Engineers
ISBN: 978-1-4673-8374-5 (electronic)
978-1-4673-8372-1 (print)
978-1-4673-8373-8 (USB)
978-1-4673-8375-2 (print on demand(PoD))
ISSN: 2162-1020
DOI: 10.1109/ATC.2015.7388304
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 15, 2020

Page view(s)

Last Week
Last month
Citations as of Nov 18, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.