[go: up one dir, main page]

Agostini et al., 2005 - Google Patents

A FPGA based design of a multiplierless and fully pipelined JPEG compressor

Agostini et al., 2005

Document ID
1959130043663846384
Author
Agostini L
Porto R
Bampi S
Silva I
Publication year
Publication venue
8th Euromicro Conference on Digital System Design (DSD'05)

External Links

Snippet

This paper presents the design and implementation of a multiplierless JPEG compressor for gray scale images. The modules of this architecture were fully pipelined and targeted to FPGA device implementation. The designed architectures are detailed in this paper and they …
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
    • 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
    • G06F7/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
    • 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/544—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 for evaluating functions by calculation
    • G06F7/5443—Sum of products
    • 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
    • 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
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding, e.g. from bit-mapped to non bit-mapped
    • G06T9/008—Vector quantisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation

Similar Documents

Publication Publication Date Title
Agostini et al. Pipelined fast 2D DCT architecture for JPEG image compression
RU2429531C2 (en) Transformations with common factors
EP0776559B1 (en) System and method for inverse discrete cosine transform implementation
Habboush et al. DE-ZFP: An FPGA implementation of a modified ZFP compression/decompression algorithm
Agostini et al. Multiplierless and fully pipelined JPEG compression soft IP targeting FPGAs
WO1996004733A9 (en) System and method for inverse discrete cosine transform implementation
Agostini et al. A FPGA based design of a multiplierless and fully pipelined JPEG compressor
Mukherjee et al. Hardware efficient architecture for 2D DCT and IDCT using Taylor-series expansion of trigonometric functions
Nagabushanam et al. Design and implementation of parallel and pipelined distributive arithmetic based discrete wavelet transform IP core
De Silva et al. Exploring the Implementation of JPEG Compression on FPGA
Savakis et al. Discrete wavelet transform core for image processing applications
Martisius et al. A 2-D DCT hardware codec based on Loeffler algorithm
Parfieniuk et al. Short‐critical‐path and structurally orthogonal scaled CORDIC‐based approximations of the eight‐point discrete cosine transform
Sano et al. Segment-parallel predictor for FPGA-based hardware compressor and decompressor of floating-point data streams to enhance memory I/O bandwidth
Vishwajeet et al. Design of Hardware Efficient Approximate DCT Architecture
Cao et al. Efficient architecture for two-dimensional discrete wavelet transform based on lifting scheme
Patino et al. 2D-DCT on FPGA by polynomial transformation in two-dimensions
Dhakar et al. A novel parallel architecture of lifting based 2D-discrete wavelet transform
Agostini et al. Pipelined entropy coders for JPEG compression
Ismail et al. High speed on-chip multiple cosine transform generator
Hsieh et al. A novel, efficient architecture for the 1D, lifting-based DWT with folded and pipelined schemes
Ruiz et al. High throughput parallel-pipeline 2-D DCT/IDCT processor chip
Cobrnic et al. An Area Efficient and Reusable HEVC 1D-DCT Hardware Accelerator
Park et al. Low-power, low-complexity bit-serial VLSI architecture for 1D discrete wavelet transform
Gore et al. Implementation of Image Compression algorithm on FPGA