Name
Abstract | ||
|---|---|---|
This paper proposes a new bus-invert coding scheme for reducing the number of bus transitions. Unlike the previous schemes in which the entire bus lines or one subset of the bus lines are considered for bus-invert coding, in the proposed scheme, the bus lines are partitioned and each partitioned group is considered independently for bus-invert coding to maximize the effectiveness of reducing the total number of bus transitions. Experimental results show that the decomposed bus-invert coding scheme reduces the total number of bus transitions by 47.2% and 11.9% on average than those of the conventional and the partial bus-invert coding schemes respectively. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0218-1266(00)00009-3 | JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS |
Field | DocType | Volume |
Coding tree unit,Computer science,Input/output,Electronic engineering,Coding (social sciences) | Journal | 10 |
Issue | ISSN | Citations |
1-2 | 0218-1266 | 8 |
PageRank | References | Authors |
0.56 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sungpack Hong | 1 | 864 | 33.20 |
| Taewhan Kim | 2 | 1087 | 113.31 |
| Unni Narayanan | 3 | 8 | 0.56 |
| Ki-Seok Chung | 4 | 39 | 10.31 |