Low-complexity tree architecture for finding the first two minima
SCIE
SCOPUS
- Title
- Low-complexity tree architecture for finding the first two minima
- Authors
- Lee, Y; Kim, B; Jung, J; Park, IC
- Date Issued
- 2015-01
- Publisher
- IEEE
- Abstract
- This brief presents an area-efficient tree architecture for finding the first two minima as well as the index of the first minimum, which is essential in the design of a low-density parity-check decoder based on the min-sum algorithm. The proposed architecture reduces the number of comparators by reusing the intermediate comparison results computed for the first minimum in order to collect the candidates of the second minimum. As a result, the proposed tree architecture improves the area-time complexity remarkably.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/37537
- DOI
- 10.1109/TCSII.2014.2362663
- ISSN
- 1549-7747
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, vol. 62, no. 1, page. 61 - 64, 2015-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.