Arrangement and method for decoding a data word with the aid of a Reed-Muller code
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 1, 2017
Issued Date -
N/A
app pub date -
Jan 24, 2014
filing date -
Feb 1, 2013
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
An arrangement for decoding a data word using a Reed-Muller code, has: (1) N input terminals, (2) a first level of E>>D summing modules, each summing module being linked with F different input terminals and each input terminal being linked with E summing modules, (3) a first level of E decision modules, each of the D inputs of each decision module being linked respectively with an output from D different summing modules, (4) a second level of H summing modules, (5) a second level of G decision modules, (6) a third level of G summing modules, and (7) G output terminals. N signifies the code length and D signifies the minimum spacing of the code, E is equal to D-2, F is equal to N/D, G is the number of symbols of the data word that need to be corrected and is a natural number between 1 and E<
Recipient Email Address Recipient Email Address Comment Recipient Email Address To add this patent to one, or more, of
your portfolios, simply click the add button. This Patent is in these Portfolios: Add to additional portfolios: Last Refreshed On:
Changes done successfully
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Add to Portfolio(s)
