A method for error correction in integrated circuit (IC) implementations of Boolean functions is described. Additional logic, implementing error correcting codes known from channel coding, corrects both 'hard' manufacturing errors and 'soft' temporary errors. Experimental results are presented, with code optimization based on a fast algorithm for Boolean symmetry analysis. Apart from the well known majority voting (triplication), Hammin-and Product codes are described, having an implementation overhead much less than for maority voting.
|Title of host publication||Associative Digital Network Theory - An Associative Algebra Approach to Logic, Arithmetic and State Machines|
|Place of Publication||Berlin|
|Publication status||Published - 2009|