Using complement at ion and resequencing to minimize transitions

Proceedings - Design Automation Conference

Volumn , Issue , 1998, Pages 694-697

  Murgai, Rajeev ^a   Fujita, Masahiro ^a   Oliveira, Arlindo ^b  

^a FUJITSU LABORATORIES OF AMERICA   (United States)

^b Cadence European Labs IST INESC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

BUS-INVERT; COMPLEMENTATION; DATA ORDERING; FOLLOWING PROBLEM; NP COMPLETE; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RESEQUENCING; SWITCHING ACTIVITIES;

BUSES; COMPUTER AIDED NETWORK ANALYSIS;

DATA ORDERING PROBLEM WITH INVERSION (DOPI); TRANSITION MINIMIZATION;

EID: 0031624020     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Experienced Motorola Designer. Personal comm., Apr. 95.
2. J. L. Hennessy and D. A Patterson. Computer Architecture: A Quantitative Approach. Morgan Kanfmann, 96.
3. R. Murgai, M. Fujita, and S. C. Krishnan. Data Sequencing For Minimum-transition Transmission. In VLSI'97, Brazil.
4. R. Murgai, M. Fujita, and A. Oliveira. Using Complementation And Resequencing To Minimize Transitions. In Internal Report, Fujitsu Labs of America, Inc., Nov. 97.
5. M. R. Stan and W. P. Burleson. Limited-weight Codes for Low-power I/O. In Int. Work, on Low Power Design, Apr. 94.