2001
DOI: 10.1007/3-540-44687-7_71
|View full text |Cite
|
Sign up to set email alerts
|

FPGA-Based Modelling Unit for High Speed Lossless Arithmetic Coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2002
2002
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…Although compression can be implemented in this manner, the implementation of the decompressor's search and decode stages in parallel hardware would greatly increase the complexity of the design and it is likely that these aspects would need to be implemented sequentially. Stefo et al [18] described an FPGA implementation of a parallel binary arithmetic coding architecture that is able to process 8 bits per clock cycle compared to the standard 1 bit per cycle.…”
Section: Review Of Parallel Data Compressionmentioning
confidence: 99%
“…Although compression can be implemented in this manner, the implementation of the decompressor's search and decode stages in parallel hardware would greatly increase the complexity of the design and it is likely that these aspects would need to be implemented sequentially. Stefo et al [18] described an FPGA implementation of a parallel binary arithmetic coding architecture that is able to process 8 bits per clock cycle compared to the standard 1 bit per cycle.…”
Section: Review Of Parallel Data Compressionmentioning
confidence: 99%
“…They are, the modelling phase to keep track of the cumulative frequency information and the coding phase to generate the code with the help of multiple binary coders. Stefo et al (2001) presented in hardware implementation of modelling unit that is able to support parallel binary arithmetic coding. A fully parallel pipelined implementation and execution of both the phases of the multi-alphabet arithmetic encoding algorithm has been tested and synthesised on Xilinx FPGA in Singh (2005, 2007).…”
Section: Literature Survey and Motivationmentioning
confidence: 99%
“…Firstly, the arithmetic coding stage does not need to be based on a complex multi-alphabet arithmetic coder but a simple and fast binary arithmetic coder would suffice. Secondly, the maintenance of the frequency counts is achieved with a single update operation per node visited [19]. Fig.…”
Section: B Probability Estimatormentioning
confidence: 99%