完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHung, Jui-Huien_US
dc.contributor.authorChen, Sau-Geeen_US
dc.date.accessioned2014-12-08T15:01:59Z-
dc.date.available2014-12-08T15:01:59Z-
dc.date.issued2008en_US
dc.identifier.isbn978-1-4244-4242-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/708-
dc.description.abstractThe bit-error-rate (BER) performance of an LDPC decoding algorithm will be seriously degraded when the algorithm is realized with fixed-point implementation in practical applications, due to the introduced quantization errors and rounding errors. To remedy the problem, this paper proposes an improved min-sum algorithm (MSA), called CMVP algorithm. It achieves better performances than the popular min-sum algorithm (MSA), under the condition of the same fixed-point precision. Besides, the hardware overhead of the new algorithm over conventional MSA is small. On the other hand, under the condition of comparable performances, MSA algorithm needs a higher fixed-point precision and hardware costs than the new CMVP algorithm, according to the simulations and hardware synthesis results. The new algorithm also works well in a wide range of code rates and code lengths.en_US
dc.language.isoen_USen_US
dc.titleA Low-Complexity High-Performance Decoding Algorithm for Fixed-Point LDPC Decodersen_US
dc.typeProceedings Paperen_US
dc.identifier.journalICSPCS: 2ND INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION SYSTEMS, PROCEEDINGSen_US
dc.citation.spage462en_US
dc.citation.epage466en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000268672600073-
顯示於類別:會議論文