| Autor: |
Kontopidi, E., Muzio, J.C. |
| Zdroj: |
Microelectronics Journal; August 1993, Vol. 24 Issue: 5 p533-546, 14p |
| Abstrakt: |
Linear Feedback Shift Registers (LFSRs) and Linear Cellular Automata Registers (LCARs) are linear finite state machines which are used in built-in self test as test pattern generators and signature analysers. This paper considers the problem of partitioning maximal length machines into a number of smaller maximal length submachines. Such a property allows more flexibility to the system designer with resulting economy in testing hardware. The study presented shows that LCARs have better partitioning behavior than LFSRs, but only a small percentage of all the primitive machines of both types can be partitioned into primitive bit-slices. It is proposed that LFSRs and LCARs can exhibit better partitioning performance if minimum modifications to the registers are allowed. The extra hardware required for partitioning and modifications is estimated using the OASIS Design System and the Magic Layout Editor. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
