Abstract
The main problem of fractal image compression is the long search time of the domain pool. For this reason, the dedicated ASIC architecture for fractal image coding is needed. In this paper, we propose an efficient parallel architecture for fractal image coding which is based on fixed-size full-search algorithm. One of the main features of this architecture is that it uses only local communication such that each processor has a range and a domain block which is shifted to the next processor. Another main feature is that it has very regular interconnections and data flow. Domain blocks are formed from the range blocks in processors and the encoding procedure is performed by the regular data flow of domain blocks into the other processors. Each processor performs the fast isometric transformations which are calculated by one full rotation around the center.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
