Loading...
Please wait, while we are loading the content...
Similar Documents
Code Compression for VLIW Processors using Variable – to- Fixed Coding (2006)
| Content Provider | CiteSeerX |
|---|---|
| Author | Xie, Yuan Wolf, Wayne Lekatsas, Haris |
| Abstract | Memory has been one of the most restricted resources in the embedded computing system domain. Code compression has been proposed as a solution to this problem. Previous work used fixed-to-variable coding algorithms that translate fixed-length bit sequences into variable-length bit sequences. In this paper,we propose code compression schemes that use variable-to-fixed (V2F) length coding. We also propose an instruction bus encoding scheme,which can effectively reduce the bus power consumption. Though the code compression algorithm can be applied to any embedded processor, it favors VLIW architectures because VLIW architectures require a high-bandwidth instruction pre-fetch mechanism to supply multiple operations per cycle. Experiments show that the compression ratios using memoryless V2F coding for IA-64 and TMS320C6x are around 72.7 % and 82.5 % respectively. Markov V2F coding can achieve better compression ratio up to 56 % and 70 % for IA-64 and TMS320C6x respectively. A greedy algorithm for codeword assignment can reduce the bus power consumption and the reduction depends on the probability model used. |
| File Format | |
| Journal | IEEE Trans. VLSI Systems |
| Language | English |
| Publisher Date | 2006-01-01 |
| Access Restriction | Open |
| Subject Keyword | Code Compression Fixed Coding Vliw Processor Bus Power Consumption Code Compression Algorithm Variable-length Bit Sequence Greedy Algorithm Code Compression Scheme Fixed-length Bit Sequence High-bandwidth Instruction Pre-fetch Mechanism Previous Work Multiple Operation Restricted Resource Embedded Processor Instruction Bus Vliw Architecture Memoryless V2f Probability Model Markov V2f Computing System Domain Compression Ratio Codeword Assignment |
| Content Type | Text |
| Resource Type | Article |
