A very fast, parallel, combinatorial Berlekamp decoder that can perform the second step in binary BCH decoding at rates exceeding 300 Mb/s is presented. The circuit given is for the t=3 case. It is possible to build a t=5 decoder that can operate faster than 100 Mb/s. In addition to the Berlekamp section, the complete BCH decoder also requires a syndrome generator and a root finder. These can be implemented in a straightforward way with sequential circuits and ROMs or fast static RAMs. For the t=3 code, there are only three syndrome components yielding 48 clock cycles for 255 incoming bits
Published in:
Global Telecommunications Conference, 1991. GLOBECOM '91. 'Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services
Date of Conference:
2-5 Dec 1991
- Page(s):
-
775
-
778 vol.2
- Meeting Date :
-
02 Dec 1991-05 Dec 1991
- Print ISBN:
-
0-87942-697-7
- INSPEC Accession Number:
-
4291221
- Conference Location :
-
Phoenix, AZ
- Digital Object Identifier :
-
10.1109/GLOCOM.1991.188488
- Product Type:
-
Conference Publications