Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | HUNG, Jui-Hui | en_US |
dc.contributor.author | Hung, Jui-Hung | en_US |
dc.contributor.author | Chen, Sau-Gee | en_US |
dc.date.accessioned | 2014-12-16T06:15:55Z | - |
dc.date.available | 2014-12-16T06:15:55Z | - |
dc.date.issued | 2008-09-11 | en_US |
dc.identifier.govdoc | H03M013/09 | zh_TW |
dc.identifier.uri | http://hdl.handle.net/11536/105572 | - |
dc.description.abstract | The present invention discloses a cyclic comparison method for an LDPC decoder, which applies to the comparators used in an LDPC decoder. According to the cyclic comparison algorithm of the present invention, the nth element of the input k elements, wherein n=1, . . . , k, is sequentially removed by the corresponding comparator to obtain k first series. Next, pairs of two elements selected from the k elements are used to form k second series. The preceding step is repeated k×log2(k−1) times to obtain k completion series. Either of one first series and one completion series contains (k−1) elements. The first series are compared with the completion series to determine whether they are identical. If they are identical, the process stops. If they are not identical, the abovementioned step is repeated to obtain new completion series. The cyclic comparison method of the present invention needs only k×log2(k−1) comparisons to obtain completion series. Thus, the present invention can reduce the number of basic operations and can apply to any input number. Further, the present invention can be easily programmed and can achieve the optimal solution. | zh_TW |
dc.language.iso | zh_TW | en_US |
dc.title | CYCLIC COMPARISON METHOD FOR LOW-DENSITY PARITY-CHECK DECODER | zh_TW |
dc.type | Patents | en_US |
dc.citation.patentcountry | USA | zh_TW |
dc.citation.patentnumber | 20080222499 | zh_TW |
Appears in Collections: | Patents |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.