On the Accuracy of Fm-transform Approximation in Boundary Subintervals

2017 ◽  
Author(s):  
Masoumeh Zeinali ◽  
Sedaghat Shahmorad
Keyword(s):  
Transform Approximation

Least-squares rational -transform approximation

1973 ◽  
Vol 295 (1) ◽  
pp. 1-7 ◽  
Author(s):  
G. Miller
Keyword(s):  
Least Squares ◽  
Transform Approximation

The relation between Bessel wavelet convolution product and Hankel convolution product involving Hankel transform

2017 ◽  
Vol 15 (04) ◽  
pp. 1750030 ◽  
Author(s):  
S. K. Upadhyay ◽  
Reshma Singh ◽  
Alok Tripathi
Keyword(s):  
Wavelet Transform ◽  
Hankel Transform ◽  
Convolution Product ◽  
Hankel Transformation ◽  
Hankel Convolution ◽  
Transform Approximation

In this paper, the relation between Bessel wavelet convolution product and Hankel convolution product is obtained by using the Bessel wavelet transform and the Hankel transform. Approximation results of the Bessel wavelet convolution product are investigated by exploiting the Hankel transformation tool. Motivated from the results of Pinsky, heuristic treatment of the Bessel wavelet transform is introduced and other properties of the Bessel wavelet transform are studied.

EFFICIENT COMPUTATION OF MULTIPLIERLESS FILTERS IN EMBEDDED SYSTEMS EMPLOYING AN OPTIMAL APPROXIMATION METHOD

2006 ◽  
Vol 03 (02) ◽  
pp. 177-204 ◽  
Author(s):  
WEI ZHANG ◽  
MARK YEARY ◽  
J. Q. TRELEWICZ ◽  
MONTE TULL
Keyword(s):  
Embedded Systems ◽  
Filter Design ◽  
Optimal Approximation ◽  
Efficient Computation ◽  
Fixed Integer ◽  
Decimation Filter ◽  
Improved Performance ◽  
And Shifts ◽  
Transform Approximation ◽  
Very High

An integerization technique for creating fixed integer transforms with computationally optimal representations is presented, and the improved performance in embedded systems by employing these integerized implementations is explored. This technique uses an optimal approximation algorithm that finds the lowest-length fractional representation of the rational numbers. The integer transform approximation allows multiplication to be replaced by shift-and-add operations in hardware systems; where multiplication can take several cycles, shifts and adds take one or fewer cycles each. The multiplierless implementation furthermore benefits from employing the proposed method to represent the floating-point coefficients in very high precision requirement areas, like decimation filter design. This paper is strongly oriented around the design of coefficients with hardware constraints in mind, such as minimizing the number of required adds/subtracts and shifts required for some engineering algorithms.

Processing and analysis of rhinomanometric signals by F-transform approximation

2016 ◽  
Author(s):  
Andriy Yerokhin ◽  
Alina Nechyporenko ◽  
Andrii Babii ◽  
Oleksii Turuta
Keyword(s):  
Transform Approximation

A biorthogonal wavelet design technique using Karhunen–Loéve transform approximation

2016 ◽  
Vol 51 ◽  
pp. 202-222 ◽  
Author(s):  
Mehmet Cemil Kale ◽  
Gizem Atac ◽  
Ömer Nezih Gerek
Keyword(s):  
Biorthogonal Wavelet ◽  
Design Technique ◽  
Karhunen Loeve Transform ◽  
Transform Approximation ◽  
Wavelet Design
Sign in / Sign up

Export Citation Format

Share Document