Research Of Fast Discrete Cosine Transform Algorithm Based On Multi-dimensional Vector Matrix

Multimedia communication is the product of the combination of communicationtechnology and computer technology. In recent years, with the rapid development ofcomputer technology and network technology, many multimedia applications havebeen gradually extended to all aspects of our lives. Compared with other traditionaldata applications, the most prominent feature of multimedia applications is theintegration of audio, video and other types of media streams. These digital videosignals generate extremely high data rates which can not be transmitted without firstbeing compressed. The critical challenge for data compression is to reduce the bit ratewithout affecting picture quality. Therefore, video compression technology has been apermanent research focus in digital video technology. According to statistics, there isa lot of redundant information in images and video，such as visual redundancy,structural redundancy, knowledge redundancy, statistical redundancy, inter-frameredundancy, space redundancy and so on. The role of compression coding technologyis to cut or compressed the redundant information and to retain the useful information.Beyond the traditional ways of thinking, our laboratory proposed the theory ofmulti-dimensional vector matrix. The theory of multi-dimensional vector matrix caneffectively decrease the redundancies。Mufti-dimensional transform is carried out inorder to achieve good compression results with good image quality. In the image andvideo compression standard, DCT is one of the core coding algorithm, so manyacademics have been studying the fast DCT algorithm.This paper is the follow-up study of DCT-based multi-dimensional vectororthogonal matrix transform algorithm. Based on Multi-dimensional vector matrixmultiplication and DCT-based multi-dimensional vector orthogonal matrix transformalgorithm and in order to reduce color video stream compression transform time, we partly correct and supplement the fast1D-DCT algorithm which has strongpracticality. After in-depth research the two most representative fast algorithm of2D-DCT, the Fast transform algorithm is extended to the multi-dimensional field.We propose a new fast algorithm that is the fast discrete cosine transform algorithmbased on multi-dimensional vector matrix. We also give two butterfly diagram of thefast DCT based on the multi-dimensional vector matrix. And both the twotransformational methods are used in video compression coding, thus it not only canachieve compression, also can improve speed of the compression and shorten the timeof the compression transformation.We simulate fast DCT algorithm based on multi-dimensional vector matrixtheory. C language is used in visual C++6.0. Source data which are selected as testdata are four different size and have the same YUV proportion (4:2:0). First, we usesub-matrix method divide source data into sub-blocks. Then, two new kinds ofbutterfly diagrams based on multidimensional vector matrix fast DCT algorithm areproposed. Finally, we process all blocks by the new fast transform algorithm. Asshown in four group results, the algorithm is feasible. We compare the first methodwith the second method. After detail data analyzing, we find that both the twomethods can meet the need of real time video. In the end of this paper, we summarizealgorithms and point out the continued research direction.