A self-checking generalized prediction checker and its use for built-in testing
IEEE Transactions on Computers
Efficient Design of Totally Self-Checking Checkers for all Low-Cost Arithmetic Codes
IEEE Transactions on Computers
Error-Control Coding in Computers
Computer
Design of Self-Testing Checkers for Borden Codes
IEEE Transactions on Computers
Embedded Checker Architectures for Cyclic and Low-Cost Arithmetic Codes
Journal of Electronic Testing: Theory and Applications
Design of Residue Generators and Multioperand Modular Adders Using Carry-Save Adders
IEEE Transactions on Computers
Efficient Totally Self-Checking Checkers for a Class of Borden Codes
IEEE Transactions on Computers
A Design Technique of TSC Checker for Borden's Code
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Embedded two-rail checkers with on-line testing ability
VTS '96 Proceedings of the 14th IEEE VLSI Test Symposium
Programmable Embedded Self-Testing Checkers for All-Unidirectional Error-Detecting Codes
VTS '99 Proceedings of the 1999 17TH IEEE VLSI Test Symposium
Design of Embedded Self-Testing Checkers for t-UED and BUED Codes
Journal of Electronic Testing: Theory and Applications
Design of Embedded m-out-of-n Code Checkers Using Complete Parallel Counters
IOLTS '07 Proceedings of the 13th IEEE International On-Line Testing Symposium
Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes
IEEE Transactions on Computers
Arithmetic Error Codes: Cost and Effectiveness Studies for Application in Digital System Design
IEEE Transactions on Computers
IEEE Transactions on Computers
Hi-index | 0.00 |
Borden codes are optimal nonsystematic t-unidirectionalerror detecting (t-UED) codes. A possible method to designa Borden code checker is to map the Borden code words to words ofan AN arithmetic code and to check the obtained words withan appropriate AN code checker. Fort=q-1 with q=2m-1 weshow how this method can be modified such that the Borden codecheckers achieve the self-testing property under very weakconditions. It is only required that no checker input line gets aconstant signal and that the Borden code words occur in a randomorder, making the proposed checkers very suitable for use asembedded checkers. Based on these checkers it is then possible todesign embedded Borden t-UED code checkers fort=2kq-1 withq=2m-1.