Comparative study by solving the test compaction problem

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2008, Pages 44-49

  Logofǎtu, Doina ^a   Drechsler, Rolf ^a,b  

^a UNIVERSITY OF APPLIED SCIENCES   (Germany)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPACTION; LSI CIRCUITS; MANY VALUED LOGICS; NETWORKS (CIRCUITS); NUCLEAR PROPULSION;

INTERNATIONAL SYMPOSIUM; MULTIPLE VALUED LOGICS; OPTIMAL ALGORITHMS; TEST SEQUENCES;

PROBLEM SOLVING;

EID: 50449096188     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISMVL.2008.17     Document Type: Conference Paper

References (17)

1. Alon, N., Moshkovitz, D., Safra, M.: "Algorithmic construction of sets for k-restrictions," ACM Transactions on Algorithms (TALG), v. 2, n. 2, pp. 153-177, 2006.
2. Cardei, M., Wu, J.: "Energy-efficient coverage problems in wireless ad-hoc sensor networks," Computer Communications, v. 29, n. 4, pp. 415-420, 2006.
3. nd Edition, MIT Press, 2001.
4. De Micheli, G.: Synthesis and Optimization of Digital Circuits. McGraw-Hill, Inc., 1994.
5. Drechsler, N., Drechsler, R.: Exploiting don't cares during data sequencing using genetic algorithms. In ASP Design Automation Conf., pp. 303-306, 1999.
6. Drechsler, R.: Evolutionary Algorithms for VLSI CAD. Kluwer Academic Publisher, 1998.
7. El-Maleh, A., Osais, Y.: Test vector decomposition based static compaction algorithms for combinatorial circuits, ACM Trans. Des. Autom. Electron. Syst., vol. 8, pp. 430-459, 2003.
8. Feige, U.: A Threshold of Ln N for Approximating Set Cover, Journal of the ACM (JACM), v. 45 n. 4, pp. 634-652, 1998.
9. Garey, M. R., Johnson, D. S.: Computers and Intractability - A Guide to NP-Completeness. Freeman, San Francisco, 1979.
10. Guo, R., Pomeranz, I., Reddy, S. M., On improving static test compaction for sequential circuits, VLSI Design, Fourteenth International Conference, pp. 111-116, 2001.
11. Higami, Y., Kajihara, S., Pomeranz, I., Kobayashi, S., Takamatsu, Y.: On Finding Don't Cares in Test Sequences for Sequential Circuits, IEICE Transactions on Information and Systems, v. E89 n. 11, 2006.
12. Hochbaum, D., S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage, Naval Research Logistics, v. 45 n.6, pp. 615-627, 1998.
13. Karp, M. R.: Reductibility Among Combinatorial Problems, Complexity of Computer Computations (Symposium Proceedings), Plenum Press, 1972.
14. Logofǎtu, D.: Algorithmen und Problemlösungen mit C++, Vieweg-Verlag, 2006.
15. Logofǎtu, D.: Drechsler, R., Efficient Evolutionary Approaches for the Data Ordering Problem with Inversion, 3rd European Workshop on Hardware Optimisation Techniques (EvoHOT), LNCS 3907, pp. 320-331, Budapest, 2006.
16. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems, Journal of the ACM (JACM), v. 41 n. 5, pp. 960-981, 1994.
17. Murray, A., T., Kim, K., K., Davis, J., W., Machiraju, R., Parent, R.: Coverage optimization to support security monitoring, Computers, Environment and Urban Systems, vol. 31, n. 2, pp 133-147, 2007.