Matches in SemOpenAlex for { <https://semopenalex.org/work/W2466803516> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W2466803516 abstract "Despite the fact that the memory cost has decreased drastically over the past few years, the data storage requirements and data processing applications are growing explosively. Data compression methods are used to reduce the redundancy in data representation in order to decrease the storage requirements and communication costs. To take advantage of the VLSI technology, application-specific hardware algorithms and architectures for real-time systems with data parallelism would have to be developed as standard components for communication and storage.In this dissertation, we develop a new memory-based architecture for multibit encoding and decoding of Huffman-type tree-based codes such that multiple number of bits can be encoded or decoded in one clock cycle. We present simulation results that lead to the design and implementation of a memory-based VLSI CODEC architecture. We also develop new parallel algorithms for image decorrelation schemes and present the design of a VLSI chip which implements one of these algorithms.We develop a new paradigm of data compression called the pattern matching. The basic concept of compressed pattern matching is to search a pattern in compressed data without explicitly decompressing it. The problem becomes more crucial when the pattern is not fully specified, i.e. the pattern may consist of wild card characters. We present a set of hardware algorithms and design of a VLSI chip for compressed pattern matching using Huffman-type tree-based codes. The pattern can be fully or partially specified. We adopt the concept of these hardware algorithms for compressed pattern matching to join two compressed relational databases and present the detail simulation results. We will also formulate the compressed pattern matching problem for LZ-codes and we will show with an example that the compressed pattern search in arithmetic codes is not possible.Finally, we will propose a variation of the LZW algorithm for text compression using a new data structure for on-line binary representation of the trie to represent a dictionary. This binary representation of the trie data structure can be mapped into memory for fast encoding and decoding of text and we propose a possible hardware architecture for implementation of a VLSI chip." @default.
- W2466803516 created "2016-07-22" @default.
- W2466803516 creator A5019576954 @default.
- W2466803516 date "1995-11-20" @default.
- W2466803516 modified "2023-09-24" @default.
- W2466803516 title "VLSI algorithms and architectures for data compression" @default.
- W2466803516 hasPublicationYear "1995" @default.
- W2466803516 type Work @default.
- W2466803516 sameAs 2466803516 @default.
- W2466803516 citedByCount "1" @default.
- W2466803516 crossrefType "journal-article" @default.
- W2466803516 hasAuthorship W2466803516A5019576954 @default.
- W2466803516 hasConcept C113775141 @default.
- W2466803516 hasConcept C11413529 @default.
- W2466803516 hasConcept C115223089 @default.
- W2466803516 hasConcept C14580979 @default.
- W2466803516 hasConcept C149635348 @default.
- W2466803516 hasConcept C154945302 @default.
- W2466803516 hasConcept C173608175 @default.
- W2466803516 hasConcept C41008148 @default.
- W2466803516 hasConcept C46900642 @default.
- W2466803516 hasConcept C57273362 @default.
- W2466803516 hasConcept C67692717 @default.
- W2466803516 hasConcept C68859911 @default.
- W2466803516 hasConcept C70992990 @default.
- W2466803516 hasConcept C78548338 @default.
- W2466803516 hasConcept C9390403 @default.
- W2466803516 hasConceptScore W2466803516C113775141 @default.
- W2466803516 hasConceptScore W2466803516C11413529 @default.
- W2466803516 hasConceptScore W2466803516C115223089 @default.
- W2466803516 hasConceptScore W2466803516C14580979 @default.
- W2466803516 hasConceptScore W2466803516C149635348 @default.
- W2466803516 hasConceptScore W2466803516C154945302 @default.
- W2466803516 hasConceptScore W2466803516C173608175 @default.
- W2466803516 hasConceptScore W2466803516C41008148 @default.
- W2466803516 hasConceptScore W2466803516C46900642 @default.
- W2466803516 hasConceptScore W2466803516C57273362 @default.
- W2466803516 hasConceptScore W2466803516C67692717 @default.
- W2466803516 hasConceptScore W2466803516C68859911 @default.
- W2466803516 hasConceptScore W2466803516C70992990 @default.
- W2466803516 hasConceptScore W2466803516C78548338 @default.
- W2466803516 hasConceptScore W2466803516C9390403 @default.
- W2466803516 hasLocation W24668035161 @default.
- W2466803516 hasOpenAccess W2466803516 @default.
- W2466803516 hasPrimaryLocation W24668035161 @default.
- W2466803516 hasRelatedWork W2019770187 @default.
- W2466803516 hasRelatedWork W2043698691 @default.
- W2466803516 hasRelatedWork W2080733670 @default.
- W2466803516 hasRelatedWork W2107919946 @default.
- W2466803516 hasRelatedWork W2131179333 @default.
- W2466803516 hasRelatedWork W2159959433 @default.
- W2466803516 hasRelatedWork W2241660112 @default.
- W2466803516 hasRelatedWork W2382992262 @default.
- W2466803516 hasRelatedWork W2467356713 @default.
- W2466803516 hasRelatedWork W2524844236 @default.
- W2466803516 hasRelatedWork W2559755755 @default.
- W2466803516 hasRelatedWork W2729892436 @default.
- W2466803516 hasRelatedWork W2774347486 @default.
- W2466803516 hasRelatedWork W2792875167 @default.
- W2466803516 hasRelatedWork W2921492343 @default.
- W2466803516 hasRelatedWork W2962890265 @default.
- W2466803516 hasRelatedWork W2973369574 @default.
- W2466803516 hasRelatedWork W3118903812 @default.
- W2466803516 hasRelatedWork W3138997362 @default.
- W2466803516 hasRelatedWork W2765851521 @default.
- W2466803516 isParatext "false" @default.
- W2466803516 isRetracted "false" @default.
- W2466803516 magId "2466803516" @default.
- W2466803516 workType "article" @default.