Design of the Fast Algorithm for Discrete Orthogonal Transforms and Their Unified Architectures

Discrete orthogonal transform ( DOT ) is widely used in digital image processing and video compression,and it is of great practical significance to study its fast algorithm and design of general architecture. Because various video compression algorithms are widely proposed,the DOT of specific types...

Full description

Saved in:
Bibliographic Details
Main Authors: HUANG Hai, LIU Hong-yu, XING Lin, NA Ning, LI Chun-bao
Format: Article
Language:zho
Published: Harbin University of Science and Technology Publications 2021-04-01
Series:Journal of Harbin University of Science and Technology
Subjects:
Online Access:https://hlgxb.hrbust.edu.cn/#/digest?ArticleID=1936
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Discrete orthogonal transform ( DOT ) is widely used in digital image processing and video compression,and it is of great practical significance to study its fast algorithm and design of general architecture. Because various video compression algorithms are widely proposed,the DOT of specific types and points cannot meet the development requirements in the field of image and video. Therefore,it is an unsolved problem to study a multi-type,arbitrary point DOT fast algorithm and its general architecture. Aiming at the above problems,this paper proposes a fast algorithm based on CORDIC for DOT and designs a general architecture that can implement multiple orthogonal transform algorithms. The experimental results show that the algorithm has obvious advantages in complexity,scalability,pipeline design and easy VLSI implementation compared with the existing algorithms. The general architecture is simple to calculate and high hardware reuse rate,which can meet the needs of multiple applications compared with the existing architecture.
ISSN:1007-2683