Efficient realization of a threshold voter for self-purging redundancy
The self-purging technique is not commonly used mainly due to the lack of practical implementations of its key component, the threshold voter. A very efficient implementation of this voter is presented which uses a decomposition technique to substantially reduce the circuit complexity and delay, as...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2001 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/76322 |
| Acceso en línea: | https://hdl.handle.net/11441/76322 https://doi.org/10.1023/A:1011106228550 |
| Access Level: | acceso abierto |
| Palabra clave: | Self-purging Redundancy Fault Tolerance Sorting Networks Threshold Logic |
| Sumario: | The self-purging technique is not commonly used mainly due to the lack of practical implementations of its key component, the threshold voter. A very efficient implementation of this voter is presented which uses a decomposition technique to substantially reduce the circuit complexity and delay, as compared to alternative implementations. |
|---|