Open Access System for Information Sharing

Login Library

 

Article
Cited 7 time in webofscience Cited 10 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
DC FieldValueLanguage
dc.contributor.authorPark, Byeonggil-
dc.contributor.authorPark, Jongsun-
dc.contributor.authorLee, Youngjoo-
dc.date.accessioned2018-06-15T05:58:11Z-
dc.date.available2018-06-15T05:58:11Z-
dc.date.created2018-05-15-
dc.date.issued2018-03-
dc.identifier.issn2169-3536-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/51039-
dc.description.abstractRecently, there are increasing demands for fully flexible Bose Chaudhuri Hocquenghem (BCH) decoders, which can support different dimensions of Galois fields (GF) operations. As the previous BCH decoders are mainly targeting the fixed GF operations, the conventional techniques are no longer suitable for multiple GF dimensions. For the area-optimized flexible BCH decoders, in this paper, we present several optimization schemes for reducing hardware costs of multi-dimensional GF operations. In the proposed optimizations, we first reformulate the matrix operations in syndrome calculation and Chien search for sharing more common sub-expressions between GF operations having different dimensions. The cell based multi-m GF multiplier is newly introduced for the area-efficient flexible key-equation solver. As case studies, we design several prototype flexible BCH decoders for digital video broadcasting systems and NAND flash memory controllers managing different page sizes. The implementation results show that the proposed fully-flexible BCH decoder architecture remarkably enhances the area-efficiency compared with the conventional solutions.-
dc.languageEnglish-
dc.publisherInstitute of Electrical and Electronics Engineers Inc.-
dc.relation.isPartOfIEEE Access-
dc.titleArea-Optimized Fully-Flexible BCH Decoder for Multiple GF Dimensions-
dc.typeArticle-
dc.identifier.doi10.1109/ACCESS.2018.2815640-
dc.type.rimsART-
dc.identifier.bibliographicCitationIEEE Access, v.6, pp.14498 - 14509-
dc.identifier.wosid000428956400001-
dc.date.tcdate2019-02-01-
dc.citation.endPage14509-
dc.citation.startPage14498-
dc.citation.titleIEEE Access-
dc.citation.volume6-
dc.contributor.affiliatedAuthorLee, Youngjoo-
dc.identifier.scopusid2-s2.0-85043781719-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc2-
dc.description.isOpenAccessY-
dc.type.docTypeArticle-
dc.subject.keywordPlusHIGH-THROUGHPUT-
dc.subject.keywordPlusALGORITHMS-
dc.subject.keywordPlusDESIGN-
dc.subject.keywordPlusMEMORY-
dc.subject.keywordPlusCODES-
dc.subject.keywordPlusECC-
dc.subject.keywordAuthorBose-Chaudhuri-Hocquenghem (BCH) decoder-
dc.subject.keywordAuthorGalois-field (GF) arithmetic-
dc.subject.keywordAuthoroptimization-
dc.subject.keywordAuthorlow complexity-
dc.subject.keywordAuthorVLSI design-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.relation.journalWebOfScienceCategoryEngineering, Electrical & Electronic-
dc.relation.journalWebOfScienceCategoryTelecommunications-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaEngineering-
dc.relation.journalResearchAreaTelecommunications-

qr_code

  • mendeley

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

Related Researcher

Researcher

이영주LEE, YOUNGJOO
Dept of Electrical Enginrg
Read more

Views & Downloads

Browse