Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10982Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kavousianos, X. | en |
| dc.contributor.author | Kalligeros, E. | en |
| dc.contributor.author | Nikolos, D. | en |
| dc.date.accessioned | 2015-11-24T17:01:48Z | - |
| dc.date.available | 2015-11-24T17:01:48Z | - |
| dc.identifier.issn | 1063-8210 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10982 | - |
| dc.rights | Default Licence | - |
| dc.subject | huffman encoding | en |
| dc.subject | test data compression | en |
| dc.subject | a-chip test | en |
| dc.subject | volume | en |
| dc.subject | codes | en |
| dc.subject | power | en |
| dc.title | Multilevel-Huffman test-data compression for IP cores with multiple scan chains | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | Doi 10.1109/Tvlsi.2008.2000448 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2008 | - |
| heal.abstract | Various compression methods have been proposed for tackling the problem of increasing test-data volume of contemporary, core-based systems. Despite their effectiveness, most of the approaches that are based on classical codes (e.g., run-lengths, Huffman) cannot exploit the test-application-time advantage of multiple-scan-chain cores, since they are not able to perform parallel decompression of the encoded data. In this paper, we take advantage of the inherent parallelism of Huffman decoding and we present a generalized multilevel Huffman-based compression approach that is suitable for cores with multiple scan chains. The size of the encoded data blocks is independent of the slice size (i.e., the number of scan chains), and thus it can be adjusted so as to maximize the compression ratio. At the same time, the parallel data-block decoding ensures the exploitation of most of the scan chains' parallelism. The proposed decompression architecture can be easily modified to suit any Huffman-based compression scheme. | en |
| heal.journalName | Ieee Transactions on Very Large Scale Integration (Vlsi) Systems | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Kavousianos-2008-Multilevel-Huffman t.pdf | 433.47 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
