Encoding and syndrome computing co-design circuit for bch code and method for deciding the same
AssigneeStorart Technology Co. Ltd.
InventorsJui Hui HUNG, Chih Nan YEN
Life of this patent
Estimating the term…
Abstract
An encoding and syndrome computing co-design circuit for BCH code and a method for deciding the circuit are disclosed. The method includes the steps of: building up matrices of XR, XG and XS according to p parallel computations and 2t syndromes; building up FP; building up F′; building up F″; building up matrix of [XSRG F″]; and designing a circuit which fulfills the operation of [XSRG F″].
Claims9
A co-design circuit for BCH encoding and syndrome computing, capable of processing p parallel computation, comprising:
- an encoding unit, for encoding one message having k bits as one BCH codeword having n bits after processing a first iterative operation, the first iterative operation being processed to receive p bits sequentially in each clock and output the BCH codeword after [n/p] clocks;
- a syndrome computing unit, for obtaining 2t syndromes each having m bits from one BCH codeword having n bits after processing a second iterative operation, the second iterative operation being processed to receive p bits sequentially in each clock and output the syndromes after [n/p] clocks;
- a plurality of multiplexers, each being used to receive a first intermediate computing result generated from the first iterative operation and a second intermediate computing result generated from the second iterative operation, wherein when the first iterative operation processes, the first intermediate computing result is outputted, and when the second iterative operation processes, the second intermediate computing result is outputted;
- and
- a plurality of registers, each being used to receive the first intermediate computing result or the second intermediate computing result from a corresponding multiplexer, or the second intermediate computing result from a syndrome computing unit, and outputting the first intermediate computing result to the encoding unit or the second intermediate computing result to the syndrome computing unit in a later clock after the first intermediate computing result or the second intermediate computing result is received,
- wherein k, n, p and t are positive integers, n is greater than k and m is the power of 2 over GF(2m).
A method for deciding a co-design circuit for BCH encoding and syndrome computing, comprising the steps of:
- building up XR, XG and XS according to p parallel computations and 2t syndromes;
- building up FP;
- building up F′;
- building up F″;
- building up matrix [XSRG F″];
- and
- designing a circuit fulfilling operation of matrix [XSRG F″], wherein k, n, p and t are positive integers, n is greater than k, XR=[C1 C3 . . . C2t-1], where
- C
- 2
-
- t
- -
- 1
- =
- [
- α
- 0
- 0
- α
- 1
- 0
- ⋯
- α
- m
- -
- 1
- 0
- α
- 0
- 2
-
- t
- -
- 1
- α
- 1
- 2
-
- t
- -
- 1
- ⋯
- α
- m
- -
- 1
- 2
-
- t
- -
- 1
- ⋮
- ⋮
- ⋱
- ⋮
- α
- 0
- (
- p
- -
- 1
- )
-
- (
- 2
-
- t
- -
- 1
- )
- α
- 1
- (
- p
- -
- 1
- )
-
- (
- 2
-
- t
- -
- 1
- )
- ⋯
- α
- m
- -
- 1
- (
- p
- -
- 1
- )
-
- (
- 2
-
- t
- -
- 1
- )
- ]
- ,
- α
- 0
- ,
- …
-
-
- and
-
-
- α
- (
- m
- -
- 1
- )
- are elements in GF(2m);
- X
- G
- =
- [
- A
- 1
- p
- 0
- ⋯
- 0
- 0
- A
- 3
- p
- ⋯
- 0
- ⋮
- ⋮
- ⋱
-
-
- A
- (
- 2
-
- t
- -
- 3
- )
-
- p
- ⋮
- 0
- 0
- ⋯
- A
- (
- 2
-
- t
- -
- 1
- )
-
- p
- ]
- ,
- where
- A
- (
- 2
-
- t
- -
- 1
- )
-
- p
- =
- [
- α
- 0
- (
- 2
-
- t
- -
- 1
- )
-
- p
- α
- 1
- (
- 2
-
- t
- -
- 1
- )
-
- p
- ⋯
- α
- m
- -
- 1
- (
- 2
-
- t
- -
- 1
- )
-
- p
- α
- 0
- (
- 2
-
- t
- -
- 1
- )
-
- p
- +
- 1
- α
- 1
- (
- 2
-
- t
- -
- 1
- )
-
- p
- +
- 1
- ⋯
- α
- m
- -
- 1
- (
- 2
-
- t
- -
- 1
- )
-
- p
- +
- 1
- ⋮
- ⋮
- ⋱
- ⋮
- α
- 0
- (
- 2
-
- t
- -
- 1
- )
-
- p
- +
- m
- -
- 1
- α
- 1
- (
- 2
-
- t
- -
- 1
- )
-
- p
- +
- m
- -
- 1
- ⋯
- α
- m
- -
- 1
- (
- 2
-
- t
- -
- 1
- )
-
- p
- +
- m
- -
- 1
- ]
- ;
- X
- s
- =
- [
- I
- B
- 2
- 0
- B
- 4
- 0
- 0
- ⋯
- 0
- 0
- I
- 0
- 0
- B
- 2
- ⋯
- 0
- 0
- 0
- 0
- I
- 0
- ⋯
- ⋮
- ⋮
- ⋮
- ⋮
- ⋮
- ⋮
- ⋱
- ]
- ,
- where
- B
- w
- =
- [
- α
- 0
- 0
- α
- 1
- 0
- ⋯
- α
- m
- -
- 1
- 0
- α
- 0
- w
- α
- 1
- w
- ⋯
- α
- m
- -
- 1
- w
- ⋮
- ⋮
- ⋱
- ⋮
- α
- 0
- (
- m
- -
- 1
- )
-
- w
- α
- 1
- (
- m
- -
- 1
- )
-
- w
- ⋯
- α
- m
- -
- 1
- (
- m
- -
- 1
- )
-
- w
- ]
- ,
- where I is a unit matrix, Bw is an operating matrix other than a zero matrix and a unit matrix, w is an positive integer of power of 2 and smaller than or equal to 2t;
- X
- SRG
- =
- [
- 0
- X
- R
- X
- S
- X
- G
- ]
- ,
-
- F
- ″
- =
- [
- F
- ′
-
-
- T
- 0
- ]
- (
- P
- +
- mt
- )
- ×
- Rt
- ,
- F
- ′
- =
- [
- first
-
-
- p
-
-
- columns
-
-
- of
-
-
- F
- p
- |
- F
- p
- ]
- F
- p
- =
- [
- F
- p
- -
- 1
- ×
- [
- g
- R
- -
- 1
- ′
- g
- R
- -
- 2
- ′
- ⋮
- g
- 1
- ′
- g
- 0
- ′
- ]
-
-
- first
-
-
- R
- -
- 1
-
-
- columns
-
-
- of
-
-
- F
- p
- -
- 1
- ]
- ,
-
- F
- 1
- =
- [
- g
- R
- -
- 1
- ′
- 1
- 0
- ⋯
- 0
- g
- R
- -
- 2
- ′
- 0
- 1
- ⋯
- 0
- ⋮
- ⋮
- ⋮
- ⋮
- ⋮
- g
- 1
- ′
- 0
- 0
- ⋯
- 1
- g
- 0
- ′
- 0
- 0
- ⋯
- 0
- ]
- ,
- where R=n−k+1;
- g′R-1, g′R-2 . . . and g′0 are coefficients of a generating polynomial,
- g(x)=xR+g′R-1xR-1+g′R-2xR-2+ . . . +g′2x2+g′1x1+g′0.
Dependencies are inferred from the claim text.