摘要:
The invention relates to an arrangement for decoding a data word with the aid of a Reed-Muller code or a code equivalent thereto, which consists of the following components: (1) N input terminals, I1 to IN, (2) a first level of E»D summing modules, SI_11 to SI_ED, wherein each summing module of the first level is linked with F different input terminals and each input terminal is linked with E summing modules of the first level, (3) a first level of E decision modules, MM to MI_E, wherein each of the D inputs of each decision module is linked respectively with an output from D different summing modules from the first level of the summing modules, (4) a second level of H summing modules, SIM to SII_H, wherein each summing module is linked with a decision module from the first level of the decision modules and with a summing module from the first level of the summing modules, (5) a second level of G decision modules, MIM to MII_G, wherein each of the E inputs of each decision module is linked respectively with an output from E different summing modules from the second level of the summing modules, (6) a third level of G summing modules, SIIM to SIII_G, wherein each summing module is linked with precisely one decision module from the second level of the decision modules and with an input terminal, (7) G output terminals, O1 to OG, wherein each output terminal is linked to precisely one summing module from the third level of the summing modules, wherein N signifies the length of the code 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 H is a natural number between 1 and E«D.