Practical fast 1-D DCT algorithms with 11 multiplications

Loeffler, Charles M.; Ligtenberg, A.; Moschytz, G.S.

doi:10.1109/icassp.1989.266596

Cited by 519 publications

(324 citation statements)

References 10 publications

Supporting

Mentioning

309

Contrasting

Unclassified

Order By: Relevance

“…In [13], the authors show that the theoretical lower limit of 8-point DCT algorithm is 11 multiplications. Since the number of multiplications of Loeffler's algorithm [12] reaches the theoretical limit, our work is based on this algorithm.…”

Section: Fast Dct Algorithmmentioning

confidence: 99%

“…Symbols n denote left shift operation by n-bit positions. It is important to notice that nonoverbraced terms in (12) are potential common subexpressions which could be shared with other DCT coefficients such as X(4), X (6), and X (8). According to this analysis, X(2) is computed by using 11 adders and 4 embedded multipliers.…”

Section: New Cse Technique For Dct Implementationmentioning

confidence: 99%

“…Loeffler et al in [12] proposed to compute DCT outputs on four stages as shown in Figure 2. The first stage is performed by 4 adders and 4 subtractors while the second one is composed of 2 adders, 2 subtractors, and 2 MultAddSub (multiplier, adder and subtractor) blocks.…”

Section: Fast Dct Algorithmmentioning

confidence: 99%

“…Research in this domain can be classified into three parts. The first part is the earliest and concerns the reduction of the number of arithmetic operators required for DCT computation [7][8][9][10][11][12][13]. The second research thematic relates to the computation of DCT using multiple constant multiplication schemes [14][15][16][17][18][19][20][21][22][23][24][25] for hardware implementation.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimized Architecture Using a Novel Subexpression Elimination on Loeffler Algorithm for DCT‐Based Image Compression

2012

View full text Add to dashboard Cite

The canonical signed digit (CSD) representation of constant coefficients is a unique signed data representation containing the fewest number of nonzero bits. Consequently, for constant multipliers, the number of additions and subtractions is minimized by CSD representation of constant coefficients. This technique is mainly used for finite impulse response (FIR) filter by reducing the number of partial products. In this paper, we use CSD with a novel common subexpression elimination (CSE) scheme on the optimal Loeffler algorithm for the computation of discrete cosine transform (DCT). To meet the challenges of low-power and high-speed processing, we present an optimized image compression scheme based on two-dimensional DCT. Finally, a novel and a simple reconfigurable quantization method combined with DCT computation is presented to effectively save the computational complexity. We present here a new DCT architecture based on the proposed technique. From the experimental results obtained from the FPGA prototype we find that the proposed design has several advantages in terms of power reduction, speed performance, and saving of silicon area along with PSNR improvement over the existing designs as well as the Xilinx core.

show abstract

Section: Fast Dct Algorithmmentioning

confidence: 99%

Section: New Cse Technique For Dct Implementationmentioning

confidence: 99%

Section: Fast Dct Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimized Architecture Using a Novel Subexpression Elimination on Loeffler Algorithm for DCT‐Based Image Compression

2012

View full text Add to dashboard Cite

show abstract

“…The most computationally-complex operations are 2D-IDCT and VLC decoding. Hardware implementations for 2D-IDCT have been widely reported in the past [16,6,2]. The most computationally-complex part is related to compressed video segment data re-arrangement, which needs to be done in three passes (each at the different data sets).…”

Section: Description Of a Problem Solutionmentioning

confidence: 99%

FPGA-based DVCPRO HD Decoder Implementation Using Impulse C

Cichoń¹,

Gorgon²

2013

csci

View full text Add to dashboard Cite

A video coding control strategy based on a QOS concept of computational capability

Nishi¹,

Katayama²,

Shomura

et al. 2000

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

The transmission of electronic mail and static images on the Internet functions through simple computer telecommunication terminals running software. Practical methods for codec systems that process video coding in software have been discussed in order to use such terminals for audiovisual communications. The authors first discuss the advantages and problems when performing coding using software for audiovisual signals. They then propose a dynamic computational control strategy in order to provide software‐driven video coding quickly and cheaply as a way to deal with these problems. Next the authors confirm the coding performance through experiments, and using the results they derive the relationship between the coding computational burden and the QOS level. Based on this relationship, the authors offer a video coding control strategy peculiar to software, in addition to providing a policy for creating software‐driven audiovisual systems. © 2000 Scripta Technica, Electron Comm Jpn Pt 1, 83(12): 58–70, 2000

show abstract

Practical fast 1-D DCT algorithms with 11 multiplications

Cited by 519 publications

References 10 publications

Optimized Architecture Using a Novel Subexpression Elimination on Loeffler Algorithm for DCT‐Based Image Compression

Optimized Architecture Using a Novel Subexpression Elimination on Loeffler Algorithm for DCT‐Based Image Compression

FPGA-based DVCPRO HD Decoder Implementation Using Impulse C

A video coding control strategy based on a QOS concept of computational capability

Contact Info

Product

Resources

About