[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Fu et al., 2003 - Google Patents

The application of 2D algebraic integer encoding to a DCT IP core

Fu et al., 2003

Document ID
17629164729599409459
Author
Fu M
Jullien G
Dimitrov V
Ahmadi M
Miller W
Publication year
Publication venue
The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, 2003. Proceedings.

External Links

Snippet

This paper discusses the application of a new two-dimensional algebraic integer encoding scheme for the design of a processor core for JPEG and MPEG applications. The paper concentrates on the efficient implementation of the 2D algebraic integer DCT. The processor …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/145—Square transforms, e.g. Hadamard, Walsh, Haar, Hough, Slant transforms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/52—Multiplying; Dividing
    • G06F7/523—Multiplying only

Similar Documents

Publication Publication Date Title
Madisetti et al. A 100 MHz 2-D 8/spl times/8 DCT/IDCT processor for HDTV applications
Jia et al. A new VLSI-oriented FFT algorithm and implementation
Huang et al. Flipping structure: An efficient VLSI architecture for lifting-based discrete wavelet transform
EP1850597A1 (en) Method and circuit for performing a cordic based Loeffler discrete cosine transformation (DCT), particularly for signal processing
Ingemarsson et al. Efficient FPGA mapping of pipeline SDF FFT cores
Wang et al. High-throughput VLSI architectures for the 1-D and 2-D discrete cosine transforms
Lee et al. Precision-aware self-quantizing hardware architectures for the discrete wavelet transform
Singh et al. Novel architecture for lifting discrete wavelet packet transform with arbitrary tree structure
Hung et al. Compact inverse discrete cosine transform circuit for MPEG video decoding
Fu et al. The application of 2D algebraic integer encoding to a DCT IP core
Trainor et al. Implementation of the 2D DCT using a Xilinx XC6264 FPGA
Woods et al. VLSI architectures for Field Programmable Gate Arrays: A case study
Fu et al. A low-power DCT IP core based on 2D algebraic integer encoding
Guo et al. A generalized architecture for the one-dimensional discrete cosine and sine transforms
Mukherjee et al. Hardware efficient architecture for 2D DCT and IDCT using Taylor-series expansion of trigonometric functions
Wahid et al. Error-free computation of 8/spl times/8 2D DCT and IDCT using two-dimensional algebraic integer quantization
Chen et al. Direct recursive structures for computing radix-r two-dimensional DCT/IDCT/DST/IDST
Dimitrov et al. Multiplierless DCT algorithm for image compression applications
Hsiao et al. New matrix formulation for two-dimensional DCT/IDCT computation and its distributed-memory VLSI implementation
Jiang et al. A new algorithm to derive high performance and low hardware cost dct for hevc
Parfieniuk et al. Short‐critical‐path and structurally orthogonal scaled CORDIC‐based approximations of the eight‐point discrete cosine transform
Hsiao et al. Parallel, pipelined and folded architectures for computation of 1-D and 2-D DCT in image and video codec
Kim et al. A design of 2-D DCT/IDCT for real-time video applications
Kiryukhin et al. Implementation of 2D-DCT on XC4000 series FPGA using DFT-based DSFG and DA architectures
Aroutchelvame et al. Architecture of wavelet packet transform for 1-D signal