Proceedings of 2010 IEEE International Symposium on Circuits and Systems 2010
DOI: 10.1109/iscas.2010.5537591
|View full text |Cite
|
Sign up to set email alerts
|

A novel truncated squarer with linear compensation function

Abstract: A truncated binary squarer is a squarer with a n bit input that produces a n bit output. The proposed design minimizes the mean square error of the squarer and results in a very simple and fast circuital implementation.The squarer, compared against state of the art circuits, provides a reduction of the mean square error ranging from 20% to 5%. At the same time, the proposed squarer is able to reduce the power dissipation, reduce the silicon area occupation, and increase the maximum working frequency. Implement… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 9 publications
0
6
0
Order By: Relevance
“…The FFT unit is a mixed-radix dual-channel unit which operates following a decimation in frequency approach. Internal multiply operation are optimized in terms of speed and HW resource utilization exploiting the circuits and the design techniques proposed in [10][11][12][13]. The output from the FFT is not reordered inside the unit itself to avoid incurring in the associated resource utilization penalty: for this reason, a memory address generator issues to block buffers 1 and 2 the correct sequence of read/write addresses in order to allow the storage of the output data in the natural ordering.…”
Section: Proposed Filtering Processor Architecturementioning
confidence: 99%
“…The FFT unit is a mixed-radix dual-channel unit which operates following a decimation in frequency approach. Internal multiply operation are optimized in terms of speed and HW resource utilization exploiting the circuits and the design techniques proposed in [10][11][12][13]. The output from the FFT is not reordered inside the unit itself to avoid incurring in the associated resource utilization penalty: for this reason, a memory address generator issues to block buffers 1 and 2 the correct sequence of read/write addresses in order to allow the storage of the output data in the natural ordering.…”
Section: Proposed Filtering Processor Architecturementioning
confidence: 99%
“…Squaring operations can be executed using a fixed-width multiplier; however, this tends to results in redundant circuitry when dealing with very-large-scale integration (VLSI) designs. Therefore, many squarers employ symmetry to reduce partial products [2]- [3] as well as error-compensation circuits to alleviate the effects of truncation errors associated with fixedwidth squarers [4]- [5]. The Booth-folding technique (BFT) [3] has been shown to reduce 50% of the partial products, compared to a simple folding structure [2].…”
Section: Introductionmentioning
confidence: 99%
“…The Booth-folding technique (BFT) [3] has been shown to reduce 50% of the partial products, compared to a simple folding structure [2]. To reduce area overhead, the truncated fixed-width squarers with errorcompensation circuits for simple folding [4]- [5] and BFT [6] techniques are presented. The merged partial products squarer with an error-compensation circuit presented in [4] has proved a highly efficient design with regard to power usage and area efficiency.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In this context, analog processing performed in focal-plane Vision Systems-on-Chip [20] can represent an interesting choice. Important functions from the perspective of their applications are multiplying/dividing [21][22][23][24][25][26][27][28][29][30], exponential [31][32][33][34], squaring/square-rooting [30,[35][36][37][38][39][40][41], or Euclidean distance [42,43] functions.…”
Section: Introductionmentioning
confidence: 99%