<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

2008 - 20103

Settings

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Hung, Jui-HuiSubject: search.filters.subject.LDPC

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item type:Item,
    An Efficient LDPC Decoder Architecture with a High-Performance Decoding Algorithm
    (2010-11-01)
    Hung, Jui-Hui
    ;
    Chen, Sau-Gee
    ;
    電子工程學系及電子研究所
    ;
    Department of Electronics Engineering and Institute of Electronics
    In this work a high performance LDPC decoder architecture is presented It is a partially parallel architecture for low complexity consideration In order to eliminate the idling time and hardware complexity in conventional partially parallel decoders the decoding process decoder architecture and memory structure are optimized Particularly the parity check matrix is optimally partitioned into four unequal sub matrices that lead to high efficiency in hardware sharing As a result it can handle two different codewords simultaneously with 100% hard ware utilization Furthermore for minimizing the performance loss due to round off errors in fixed point implementations the well known mod died min sum decoding algorithm is enhanced by our recently proposed high performance CMVP decoding algorithm Overall the proposed de coder has high throughput low complexity and good BER performances In the circuit implementation example of the (576 288) parity check matrix for IEEE 802 16e standard the decoder achieves a data rate of 5 5 Gbps assuming 10 decoding iterations and 7 quantization bits with a small area of 653K gates based on UMC 90 nm process technology
  • Thumbnail Image
    Item type:Item,
    An Efficient LDPC Decoder Architecture with a High-Performance Decoding Algorithm
    (2010-11-01)
    Hung, Jui-Hui
    ;
    Chen, Sau-Gee
    ;
    電子工程學系及電子研究所
    ;
    Department of Electronics Engineering and Institute of Electronics
    In this work a high performance LDPC decoder architecture is presented It is a partially parallel architecture for low complexity consideration In order to eliminate the idling time and hardware complexity in conventional partially parallel decoders the decoding process decoder architecture and memory structure are optimized Particularly the parity check matrix is optimally partitioned into four unequal sub matrices that lead to high efficiency in hardware sharing As a result it can handle two different codewords simultaneously with 100% hard ware utilization Furthermore for minimizing the performance loss due to round off errors in fixed point implementations the well known mod died min sum decoding algorithm is enhanced by our recently proposed high performance CMVP decoding algorithm Overall the proposed de coder has high throughput low complexity and good BER performances In the circuit implementation example of the (576 288) parity check matrix for IEEE 802 16e standard the decoder achieves a data rate of 5 5 Gbps assuming 10 decoding iterations and 7 quantization bits with a small area of 653K gates based on UMC 90 nm process technology
  • Thumbnail Image
    Item type:Item,
    A systematic optimized comparison algorithm for LDPC decoder
    (2008)
    Hung, Jui-Hui
    ;
    Hung, Jui-Hung
    ;
    Chen, Sau-Gee
    ;
    電子工程學系及電子研究所
    ;
    Department of Electronics Engineering and Institute of Electronics
    This paper proposes a novel systematic optimized comparison algorithm for LDPC codes with arbitrary code lengths. Based on the presented algorithm, we also design a corresponding decoder architecture which has a short comparison delay time of [log(2)(n-1)] and a very low comparator complexity of n x [log(2) (n - 1)], where n is the input number to CNU. Besides, the proposed design is general, systematic and flexible, which can be applied to arbitrary input number of a CNU. The designed CNU is favorable to the existing CNU designs which are non-systematically designed with either longer critical path delays or higher comparator counts than the proposed designs. The proposed design is particularly good for long code length cases, when it is impractical to do customized optimized designs by hand, due to high design complexity.