quadded redundancy

quadded redundancy

[′kwäd·əd ri′dən·dən·sē]
(computer science)
A form of redundancy in which each logic gate is quadruplicated, and the outputs of one stage are interconnected to the inputs of the succeeding stage by a connection pattern so that errors made in earlier stages are overridden in later stages, where the original correct signals are restored.