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...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Versión enviada para evaluación y publicación |
| Publication Date: | 2001 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/76322 |
| Online Access: | https://hdl.handle.net/11441/76322 https://doi.org/10.1023/A:1011106228550 |
| Access Level: | Open access |
| Keyword: | Self-purging Redundancy Fault Tolerance Sorting Networks Threshold Logic |
| Summary: | 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. |
|---|