Adaptive entropy coding method for stream-based lossless data compression
Shinichi Yamagiwa, Eisaku Hayakawa, Koichi Marumo
Abstract
Shinichi Yamagiwa, Eisaku Hayakawa, Koichi Marumo
Abstract
High performance lossless data compression is an emerged technology that enhances fast and effective data processing such as for communication and for storage applications. The recent devices generate continuous data flow at high rate, that is very fast stream data. Therefore, an elegant hardware-based compression technology is demanded. This paper proposes a lossless data compression called ASE coding. It encodes stream data by applying entropy coding approach. The encoding mechanism works as a lossless data compression. ASE coding instantly assigns the fewest bits to the corresponding compressed data according to the number of occupied entries in a look-up table. This paper shows the performance evaluations to promise ASE coding adaptively shrinks stream data and works on small hardware resources without stalling or buffering.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
High performance lossless data compression is an emerged technology that enhances fast and effective data processing such as for communication and for storage applications. The recent devices generate continuous data flow at high rate, that is very fast stream data. Therefore, an elegant hardware-based compression technology is demanded. This paper proposes a lossless data compression called ASE coding. It encodes stream data by applying entropy coding approach. The encoding mechanism works as a lossless data compression. ASE coding instantly assigns the fewest bits to the corresponding compressed data according to the number of occupied entries in a look-up table. This paper shows the performance evaluations to promise ASE coding adaptively shrinks stream data and works on small hardware resources without stalling or buffering.
Key concepts: Lossless compression, Adaptive coding, Computer science, Entropy encoding, Data compression, Arithmetic coding, Context-adaptive binary arithmetic coding, Lossy compression