An efficient VLSI linear array for DCT/IDCT using subband decomposition algorithm (Q980564)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5728471
Language Label Description Also known as
default for all languages
No label defined
    English
    An efficient VLSI linear array for DCT/IDCT using subband decomposition algorithm
    scientific article; zbMATH DE number 5728471

      Statements

      An efficient VLSI linear array for DCT/IDCT using subband decomposition algorithm (English)
      0 references
      0 references
      0 references
      0 references
      29 June 2010
      0 references
      Summary: Discrete Cosine transform (DCT) and inverse DCT (IDCT) have been widely used in many image processing systems and real-time computation of nonlinear time series. In this paper, a novel lineararray of DCT and IDCT is derived from the data flow of subband decompositions representing the factorized coefficient matrices in the matrix formulation of the recursive algorithm. For increasing the throughput as well as decreasing the hardware cost, the input and output data are reordered. The proposed 8-point DCT/IDCT processor with four multipliers, simple adders, and less registers and ROM storing the immediate results and coefficients, respectively, has been implemented on FPGA (field programmable gate array) and SoC (system on chip). The linear-array DCT/IDCT processor with the computation complexity \(O(5N/8)\) and hardware complexity \(O(5N/8)\) is fully pipelined and scalable for variable-length DCT/IDCT computations.
      0 references

      Identifiers