Simultaneous processing for error detection and P-parity and Q-parity ECC encoding
First Claim
Patent Images
1. A system for processing data for error control purposes, the system comprising:
- a first module that receives a sequence of data elements s(k), numbered k=0, 1, . . . , M·
N−
1, as a stream, where M and N are selected positive integers, and computes an EDC factor for the sequence;
a second module that receives the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, and computes P-parity syndrome components, s0[n1] and s1[n1] (n1=0, 1, . . . , N−
1) and P-parity checkbytes c0[n1] and c1[n1], where the second module comprises;
a first sum module having at least N signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one of the N signal summers, numbered p (0≦
p≦
N−
1), forms a sum of the data elements s(k) for which k (mod N)=p; and
a second sum module having at least N weighted signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one of the weighted signal summers, numbered p′
(0≦
p′
≦
N−
1), forms a weighted sum of data elements s(k)·
α
M−
1-[k/N]int, where [w]int is a floor function for any real number w, and α
is an element drawn from an algebraic field and satisfying a selected polynomial relation P(α
)=0; and
a third module that receives the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, receives the P-parity syndrome components, and computes Q-parity syndrome coefficients, s0′
[n2] and s1′
[n2] (n2=0, 1, . . . , M+1).
7 Assignments
0 Petitions
Accused Products
Abstract
Method and system for receiving each data element of an array once and simultaneously forming an EDC error detection term, two ECC P-parity checkbytes and two ECC-Q-parity checkbytes for the array. Each data element is read once from memory and is received by an EDC processor, by an ECC-P processor and by an ECC-Q processor and is processed in parallel and substantially simultaneously by the three processors to form an EDC error detection term and the ECC-P-parity and ECC-Q-parity checkbytes, using shift registers with feed-back and/or weighted summation of selected register contents.
82 Citations
16 Claims
-
1. A system for processing data for error control purposes, the system comprising:
-
a first module that receives a sequence of data elements s(k), numbered k=0, 1, . . . , M·
N−
1, as a stream, where M and N are selected positive integers, and computes an EDC factor for the sequence;
a second module that receives the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, and computes P-parity syndrome components, s0[n1] and s1[n1] (n1=0, 1, . . . , N−
1) and P-parity checkbytes c0[n1] and c1[n1], where the second module comprises;
a first sum module having at least N signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one of the N signal summers, numbered p (0≦
p≦
N−
1), forms a sum of the data elements s(k) for which k (mod N)=p; and
a second sum module having at least N weighted signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one of the weighted signal summers, numbered p′
(0≦
p′
≦
N−
1), forms a weighted sum of data elements s(k)·
α
M−
1-[k/N]int, where [w]int is a floor function for any real number w, and α
is an element drawn from an algebraic field and satisfying a selected polynomial relation P(α
)=0; and
a third module that receives the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, receives the P-parity syndrome components, and computes Q-parity syndrome coefficients, s0′
[n2] and s1′
[n2] (n2=0, 1, . . . , M+1).- View Dependent Claims (2, 3, 4, 5, 6, 7)
a sum module having at least M+2 signal summers, numbered n2=0, 1, . . . , M+1, wherein at least one of the M+2 signal summers, numbered q (0≦
q≦
M+1), forms a sum of said data elements s(k) for which said index k satisfies the relation k=((N+1)·
p+N·
q)(mod((M+2)·
N)).
-
-
4. The system of claim 1, wherein said third module comprises:
a sum module having at least M+2 signal summers, numbered n2=0, 1, . . . , M+1, wherein at least one of the M+2 signal summers, numbered q (0≦
q≦
M+1), forms a sum of said data elements s(k) for which said index k satisfies the relation q=(m·
(N+1)−
k)(mod M+2).
-
5. The system of claim 1, wherein said third module comprises:
-
a third sum module having at least M+2 signal summers, numbered n2=0, 1, . . . , M+1, wherein at least one signal summer in the third sum module, numbered q (0≦
q≦
M+1), forms a sum of said data elements s(k) for which f(k)=q (0≦
q≦
M+1), where f(k) is a function defined by the relationswhere N1=N+1, M2=M+2, [w]int is a floor function and (w)M2=w(mod M2) for any real number w.
-
-
6. The system of claim 5, wherein said third module comprises:
a fourth sum module having at least M+2 weighted signal summers, numbered n2=0, 1, . . . , M+1, wherein at least one of the weighted signal summers in the fourth sum module, numbered q′
(0≦
q′
≦
M+1), forms a weighted sum of said data elements s(k)·
α
(N−
1-k)(mod N) for which said function f(k)=q′
(0≦
q≦
M+1).
-
7. The system of claim 1, wherein said third module comprises:
-
a third sum module having at least M+1 signal summers, numbered n2=0, 1, . . . , M+1, wherein a first signal summer forms a sum of said data elements s(k) for which k is expressible as an integer {n1·
(N+1)+n2·
N}(mod R2), with n2 fixed and n1=0, 1, . . . , N−
1, where M (≧
2) and N (≧
2) are relatively prime integers and R2=(M+2); and
a fourth sum module having at least M+1 weighted signal summers, numbered n2=0, 1, . . . , M+1, wherein a weighted signal summer in the fourth sum module forms a weighted sum of said data elements s(k)·
α
N−
1-n1 for which k is expressible as an integer {n1·
(N+1)+n2·
N}(mod R2), with n2 fixed and n1=0, 1, . . . , N−
1, M (≧
2) and N (≧
2) are relatively prime integers, and R2=(M+2)·
N.
-
-
8. A method for processing data for error control purposes, the method comprising:
-
receiving, at a first module, a sequence of data elements s(k), numbered k=0, 1, . . . , M·
N−
1, as a stream, where M and N are selected positive integers, and computing an EDC factor for the sequence;
receiving, at a second module, the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, and computing P-parity syndrome components, s0[n1] and s1[n1] (n1=0, 1, . . . , N−
1) and P-parity checkbytes c0[n1] and c1[n1], wherein said second module comprises;
a first sum module having at least N signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one of the N signal summers, numbered p (0≦
p≦
N−
1), forms a sum of the data elements s(k) for which k (mod N)=p; and
a second sum module having at least N weighted signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one of the weighted signal summers, numbered p′
(0≦
p′
≦
N−
1), forms a weighted sum of data elements s(k)·
α
M−
1-[k/N]int, where [w]int is a floor function for any real number w, and α
is an element drawn from an algebraic field and satisfying a selected polynomial relation P(α
)=0; and
receiving, at a third module, the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, receiving the P-parity syndrome components from the second module, and computing Q-parity syndrome coefficients, s0′
[n2] and s1′
[n2] (n2=0, 1, . . . , M+1).- View Dependent Claims (9, 10, 11, 12, 13, 14)
where N1=N+1, M2=M+2, [w]int is a floor function and (w)M2=w(mod M2) for any real number w.
-
-
13. The method of claim 12, further comprising providing said third module with a fourth sum module having at least M+2 weighted signal summers in the fourth sum module, numbered n2=0, 1, . . . , M+1, wherein at least one of the M+2 weighted signal summers, numbered q′
- (0≦
q′
≦
M+1), forms a weighted sum of said data elements α
(N−
1-k)(mod N)·
s(k) for which said function f(k)=q′
·
(0≦
q′
≦
M+1) [, where α
is an element drawn from an algebraic field and satisfying a selected polynomial relation P(α
)=0].
- (0≦
-
14. The method of claim 8, further comprising:
-
providing said third module with a third sum module having at least M+1 signal summers, numbered n2=0, 1, . . . , M+1, wherein a first signal summer forms a sum of said data elements s(k) for which k is expressible as an integer {n1·
(N+1)+n2·
N}(mod R2), with n2 fixed and n1=0, 1, . . . , N−
1, where M (≧
2) and N (≧
2) are relatively prime integers and R2=(M+2)·
N; and
providing said third module with a fourth sum module having at least M+1 weighted signal summers, numbered n2=0, 1, . . . , M+1, wherein a weighted signal summer in the fourth sum module forms a weighted sum of said data elements s(k)·
α
N−
1-n1 for which k is expressible as an integer {n1·
(N+1)+n2·
N}(mod R2), with n2 fixed and n1=0, 1, . . . , N−
1, M (≧
2) and N (≧
2) are relatively prime integers, and R2=(M+2)·
N.
-
-
15. A system for processing data for error control purposes, the system comprising:
-
a first module that receives a sequence of data elements s(k), numbered k=0, 1, . . . , M·
N−
1, as a stream, where M and N are selected positive integers, and computes an EDC factor for the sequence;
a second module that receives the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, and computes P-parity syndrome components, s0[n1] and s1[n1] (n1=0, 1, . . . , N−
1) and P-parity checkbytes c0[n1] and c1[n1], wherein said second module comprises;
a first sum module having at least N signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one signal summer forms a sum of the data elements s(k=n1+n2·
N), with n1 fixed and n2=0, 1, . . . , M−
1, where M (≧
2) and N (≧
2) are relatively prime integers; and
a second sum module having at least N weighted signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one signal summer forms a weighted sum of data elements of the form s(k)·
α
M−
1-[k/N]int with k=n1+N·
n2 with n1 fixed and n2=0, 1, . . . , M−
1, where [w]int is a floor function, α
is an element drawn from an algebraic field and satisfying a selected polynomial relation P(α
)=0, and M (≧
2) and N (≧
2) are relatively prime integers; and
,a third module that receives the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, receives the P-parity syndrome components, and computes Q-parity syndrome coefficients, s0′
[n2] and s1′
[n2] (n2=0, 1, . . . , M+1).
-
-
16. A method for processing data for error control purposes, the method comprising:
-
receiving, at a first module, a sequence of data elements s(k), numbered k=0, 1, . . . , M·
N−
1, as a stream, where M and N are selected positive integers, and computing an EDC factor for the sequence;
receiving, at a second module, the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, and computing P-parity syndrome components, s0[n1] and s1[n1] (n1=0, 1, . . . , N−
1) and P-parity checkbytes c0[n1] and c1[n1], wherein said second module comprises;
a first sum module having at least N signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one signal summer forms a sum of the data elements s(k=n1+n2·
N), with n1 fixed and n2=0, 1, . . . , M−
1, where M (≧
2) and N (≧
2) are relatively prime integers; and
a second sum module having at least N weighted signal summers, numbered n1=0, 1, . . . , N−
1, wherein at least one signal summer forms a weighted sum of data elements of the form s(k)·
α
M−
1-[k/N]int with k=n1+N·
n2 with n1 fixed and n2=0, 1, . . . , M−
1, where [w]int is a floor function, α
is an element drawn from an algebraic field and satisfying a selected polynomial relation P(α
)=0, and M (≧
2) and N (≧
2) are relatively prime integers; and
,receiving, at a third module, the sequence of data elements s(k), simultaneously with receipt of the data element sequence by the first module, receiving the P-parity syndrome components, and computing Q-parity syndrome coefficients, s0′
[n2] and s1′
[n2] (n2=0, 1, . . . , M+1).
-
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeZoran Corporation (Qualcomm, Inc.)
-
Original AssigneeOak Technology Partners (Qualcomm, Inc.)
-
InventorsChiang, Kevin
-
Primary Examiner(s)MOISE, EMMANUEL LIONEL
-
Application NumberUS09/608,236Time in Patent Office1,110 DaysField of Search714/800, 714/804, 714/701, 714/755, 714/756, 714/757, 714/760, 714/761, 714/762, 714/763, 714/764, 714/766, 714/784, 714/785US Class Current714/800CPC Class CodesG06F 11/1044 with specific ECC/EDC distr...H03M 13/1515 Reed-Solomon codesH03M 13/2903 Methods and arrangements sp...H03M 13/2909 Product codes
