Hybrid binary-unary truncated multiplication for DSP Applications on FPGAs

Faraji, Somayeh; Bazargan, Kia

doi:10.1145/3400302.3415700

Cited by 3 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the magnitude of quantization residual is 1, only isZero=1 needs to be coded; when the magnitude of quantization residual is 2, isZero=0 and isOne=1 are written into bitstream; the magnitude of quantization residual is >2, and needs to be encoded, after that the magnitude of quantization residual is subtracted by 1 and encoded by using the Exponential Golomb encoder 45 . For zero quantized residual, the number of consecutive zero is encoded using Truncated Unary coding 46 combined with Exponential Golomb coding.…”

Section: Proposed Methodsmentioning

confidence: 99%

Rate-distortion optimized quantization for geometry-based point cloud compression

et al. 2023

View full text Add to dashboard Cite

.Limited by the network bandwidth, three-dimensional (3D) point cloud needs to be efficiently compressed before transmission. As one of the three attribute coding methods adopted in the geometry-based point cloud compression (G-PCC) standard developed by MPEG, predicting transform (PT) has received increasing attention. To further improve the coding efficiency of PT, we propose a rate-distortion optimized quantization (RDOQ) in which an additional option for quantization results is added by setting the quantized residuals to zero forcedly. Rate-distortion optimization is then used to determine whether the final quantized residual should be zero or nonzero. Experimental results show that average BD rates of −0.5 % , −3.0 % , and −3.0 % can be achieved for Luma, Chroma Cb, and Chroma Cr components, respectively, with negligible increment of time complexity.

show abstract

Section: Proposed Methodsmentioning

confidence: 99%

Rate-distortion optimized quantization for geometry-based point cloud compression

et al. 2023

View full text Add to dashboard Cite

show abstract

“…It is widely utilized in digital signal processing, linear algebra, cryptosystems, and 3D graphic accelerators. [22][23][24] Column compression (CC) multipliers are composed of three phases: (1) partial product generation; (2) partial product reduction; and (3) final addition. The long critical path of a multiplier has always been a severe challenge for VLSI system designers.…”

Section: Introductionmentioning

confidence: 99%

“…A multiplier is an arithmetic unit with a considerable impact on the performance of the entire system. It is widely utilized in digital signal processing, linear algebra, cryptosystems, and 3D graphic accelerators 22–24 . Column compression (CC) multipliers are composed of three phases: (1) partial product generation; (2) partial product reduction; and (3) final addition.…”

Section: Introductionmentioning

confidence: 99%

Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors

Karimi

Mirzaee

Fakeri-Tabrizi

et al. 2023

Circuit Theory & Apps

View full text Add to dashboard Cite

Summary A multiplier, as a key component in many different applications, is a time‐consuming, energy‐intensive computation block. Approximate computing is a practical design paradigm that attempts to improve hardware efficacy while keeping computation quality satisfactory. A novel multicolumn 3,3:2 inexact compressor is presented in this paper. It takes three partial products from two adjacent columns each for rapid partial product reduction. The proposed inexact compressor and its derivatives enable us to design a high‐speed approximate multiplier. Then, another ultra‐fast, high‐efficient approximate multiplier is achieved by utilizing a systematic truncation strategy. The proposed multipliers accumulate partial products in only two stages, one fewer stage than other approximate multipliers in the literature. Implementation results by the Synopsys Design Compiler and 45 nm technology node demonstrate nearly 11.11% higher speed for the second proposed design over the fastest existing approximate multiplier. Furthermore, the new approximate multipliers are applied to the image processing application of image sharpening, and their performance in this application is highly satisfactory. It is shown in this paper that the error pattern of an approximate multiplier, in addition to the mean error distance and error rate, has a direct effect on the outcomes of the image processing application.

show abstract

“…It is here, DCT is introduced with the fast algorithm for its computation whose performance is closer to that of KLT compared to the performance of walsh hadamard transform, discrete fourier transform, and hadamard transform. Coding of high-resolution images done successfully by discrete cosine transform (DCT) [11]- [15]. DCT was implemented using doublesize fast fourier transform (FFT) utilizing complex arithmetic conventionally due to the lack of an algorithm…”

Section: Introductionmentioning

confidence: 99%

Reduced encoder time complexity using enhanced adaptive multiple transform selection in versatile video coding

Tummala,

Nalluri

2023

IJEECS

View full text Add to dashboard Cite

<span>When compressing a video, the architecture is provided with the width and height of the frame along with the video as input. The multiple transform selection (MTS) techniques are used to compress video. Traditional discrete cosine transforms (DCT) and other trigonometric (sine and cosine) transforms, such as DCT-8 and DST-7, are included in the pool of transforms. For the best outcomes, two additional transforms-DST-2 and DCT-5-were also utilized to compress any remaining video frames. To improve coding effectiveness, peak signal-to-noise ratio (PSNR), and delay, 2D Transforms are broken into 1D Directional Transforms for block sizes ranging from 4×4 to 64×64. The temporal complexity was greatly decreased by adding DST-2 to the existing video test model (VTM). The MTS’s adaptive multiple transform (AMT) scheme already included a pool of transforms, but DST-2 was introduced as a fourth transform. Encoder time complexity was reduced by 22% on average without compromising PSNR and bitrate.</span>

show abstract

Hybrid binary-unary truncated multiplication for DSP Applications on FPGAs

Cited by 3 publications

References 18 publications

Rate-distortion optimized quantization for geometry-based point cloud compression

Rate-distortion optimized quantization for geometry-based point cloud compression

Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors

Reduced encoder time complexity using enhanced adaptive multiple transform selection in versatile video coding

Contact Info

Product

Resources

About