The Experts below are selected from a list of 318 Experts worldwide ranked by ideXlab platform
M N S Swamy - One of the best experts on this subject based on the ideXlab platform.
-
New Systolic Algorithm and Array Architecture for Prime-Length Discrete Sine Transform
IEEE Transactions on Circuits and Systems II: Express Briefs, 2007Co-Authors: Pramod Kumar Meher, M N S SwamyAbstract:Using a simple input-regeneration approach and index-Transformation techniques, a new formulation is presented in this paper for computing an N-point prime-length discrete Sine Transform (DST) through two pairs of [(N-1)/4]-point cyclic convolutions, where [(N-1)/4] is an odd number. The cyclic convolution-based algorithm is used further to obtain a simple regular and locally connected linear systolic array for concurrent pipelined implementation of the DST. It is shown that the proposed systolic structure involves significantly less area-time complexity compared with that of the existing structures
-
reduced complexity concurrent systolic implementation of the discrete Sine Transform
Asia Pacific Conference on Circuits and Systems, 2006Co-Authors: Pramod Kumar Meher, A P Vinod, Jagdish C Patra, M N S SwamyAbstract:In this paper, a reduced complexity algorithm for computation of the discrete Sine Transform (DST) is presented. The proposed algorithm can be used to compute an N?point DST from two pairs of [(M ? 1)/2]?point identical cyclic convolutions, where M is a prime number and M = N/2. A regular and locally connected linear systolic array architecture is also presented for concurrent pipelined VLSI implementation of all the four cyclic convolutions. The proposed structure is not only simpler, but also involves significantly less area-time complexity compared to that of the existing convolution-based DST structures. Unlike some of the existing structures, it does not need any control tag-bits for implementation of convolution-like operations.
-
APCCAS - Reduced-Complexity Concurrent Systolic Implementation of the Discrete Sine Transform
APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems, 2006Co-Authors: Pramod Kumar Meher, A P Vinod, Jagdish C Patra, M N S SwamyAbstract:In this paper, a reduced complexity algorithm for computation of the discrete Sine Transform (DST) is presented. The proposed algorithm can be used to compute an N?point DST from two pairs of [(M ? 1)/2]?point identical cyclic convolutions, where M is a prime number and M = N/2. A regular and locally connected linear systolic array architecture is also presented for concurrent pipelined VLSI implementation of all the four cyclic convolutions. The proposed structure is not only simpler, but also involves significantly less area-time complexity compared to that of the existing convolution-based DST structures. Unlike some of the existing structures, it does not need any control tag-bits for implementation of convolution-like operations.
-
A systolic array architecture for the discrete Sine Transform
IEEE Transactions on Signal Processing, 2002Co-Authors: Doru Florin Chiper, M N S Swamy, M.o. Ahmad, Thanos StouraitisAbstract:An efficient approach to design very large scale integration (VLSI) architectures and a scheme for the implementation of the discrete Sine Transform (DST), based on an appropriate decomposition method that uses circular correlations, is presented. The proposed design uses an efficient restructuring of the computation of the DST into two circular correlations, having similar structures and only one half of the length of the original Transform; these can be concurrently computed and mapped onto the same systolic array. Significant improvement in the computational speed can be obtained at a reduced input-output (I/O) cost and low hardware complexity, retaining all the other benefits of the VLSI implementations of the discrete Transforms, which use circular correlation or cyclic convolution structures. These features are demonstrated by comparing the proposed design with some of the previously reported schemes.
-
On the computation of running discrete coSine and Sine Transform
IEEE Transactions on Signal Processing, 1992Co-Authors: N.r. Murthy, M N S SwamyAbstract:Two algorithms are given for the computation of the updated discrete coSine Transform-II (DCT-II), discrete Sine Transform-II (DST-II), discrete coSine Transform-IV (DCT-IV), and discrete Sine Transform-IV (DST-IV). It is pointed out that the algorithm used for running DCT-IV can also be used for computation for running DST-IV without additional computational overhead. An architecture which is common and suitable for VLSI implementation of the derived algorithms is also presented. Preliminary studies have shown that the architecture can easily be implemented in VLSI form, and, in conjunction with a high-speed digital signal processor (for example ADSP 2100A), it can be used for real-time Transform domain LMS adaptive filtering (128 taps) of 8 kHz sample rate speech signals. >
Chien-cheng Tseng - One of the best experts on this subject based on the ideXlab platform.
-
closed form design of fir frequency selective filter using discrete Sine Transform
Asia Pacific Conference on Circuits and Systems, 2016Co-Authors: Chien-cheng Tseng, Su-ling LeeAbstract:In this paper, the closed-form design of FIR frequency selective filter (FSF) using discrete Sine Transform (DST) is studied. First, the DST-based frequency selective method is used to obtain the filtered signal from the given digital signal. Then, the transfer function of FSF is derived from the filtered signal by using index mapping approach. Because the closed-form design is obtained, the filter coefficients are easily computed without performing any optimization. Finally, the long-length low-pass, band-pass and high-pass filter design examples are used to show the effectiveness of the proposed DST method.
-
Image sharpening using matrix Riesz fractional order differentiator and discrete Sine Transform
2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW), 2016Co-Authors: Su-ling Lee, Chien-cheng TsengAbstract:In this paper, the design of matrix Riesz fractional order differentiator (FOD) using discrete Sine Transform (DST) is presented. First, the matrix Riesz FOD design problem is described. Then, the transfer matrix of the matrix Riesz FOD is obtained by using DST. Next, the designed matrix Riesz FOD is applied to develop an image sharpening algorithm. Finally, an example is presented to show the usefulness of the proposed DST-based matrix Riesz FOD method.
-
APCCAS - Closed-form design of FIR frequency selective filter using discrete Sine Transform
2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), 2016Co-Authors: Chien-cheng Tseng, Su-ling LeeAbstract:In this paper, the closed-form design of FIR frequency selective filter (FSF) using discrete Sine Transform (DST) is studied. First, the DST-based frequency selective method is used to obtain the filtered signal from the given digital signal. Then, the transfer function of FSF is derived from the filtered signal by using index mapping approach. Because the closed-form design is obtained, the filter coefficients are easily computed without performing any optimization. Finally, the long-length low-pass, band-pass and high-pass filter design examples are used to show the effectiveness of the proposed DST method.
-
Design of matrix second-order differentiator for image sharpening using discrete Sine Transform
2015 IEEE International Conference on Consumer Electronics - Taiwan, 2015Co-Authors: Su-ling Lee, Chien-cheng TsengAbstract:In this paper, the design of matrix second-order differentiator (SOD) using discrete Sine Transform (DST) is presented. First, the design problem of matrix filter is described. Then, the DST is applied to obtain the closed-form transfer matrix of the matrix SOD. Next, the designed matrix SOD is used to develop an image sharpening algorithm by using Laplacian operator. Finally, the performance of the proposed matrix SOD is evaluated through numerical examples.
-
closed form design of fixed fractional hubert Transformer using discrete Sine Transform
Asia Pacific Conference on Circuits and Systems, 2014Co-Authors: Chien-cheng Tseng, Su-ling LeeAbstract:In this paper, the closed-form design of fixed fractional Hilbert Transformer (FHT) using discrete Sine Transform (DST) is presented. First, the DST-based interpolation method is applied to reconstruct the continuous-time signal from the given discrete-time signal. Then, the filter coefficients of the transfer function of fixed FHT are obtained from the DST reconstruction results by using suitable index mapping. The main feature of the proposed method is that the closed-form design can be obtained without performing any optimization procedure. Finally, several numerical examples are demonstrated to show the effectiveness of the proposed design method.
Su-ling Lee - One of the best experts on this subject based on the ideXlab platform.
-
closed form design of fir frequency selective filter using discrete Sine Transform
Asia Pacific Conference on Circuits and Systems, 2016Co-Authors: Chien-cheng Tseng, Su-ling LeeAbstract:In this paper, the closed-form design of FIR frequency selective filter (FSF) using discrete Sine Transform (DST) is studied. First, the DST-based frequency selective method is used to obtain the filtered signal from the given digital signal. Then, the transfer function of FSF is derived from the filtered signal by using index mapping approach. Because the closed-form design is obtained, the filter coefficients are easily computed without performing any optimization. Finally, the long-length low-pass, band-pass and high-pass filter design examples are used to show the effectiveness of the proposed DST method.
-
Image sharpening using matrix Riesz fractional order differentiator and discrete Sine Transform
2016 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW), 2016Co-Authors: Su-ling Lee, Chien-cheng TsengAbstract:In this paper, the design of matrix Riesz fractional order differentiator (FOD) using discrete Sine Transform (DST) is presented. First, the matrix Riesz FOD design problem is described. Then, the transfer matrix of the matrix Riesz FOD is obtained by using DST. Next, the designed matrix Riesz FOD is applied to develop an image sharpening algorithm. Finally, an example is presented to show the usefulness of the proposed DST-based matrix Riesz FOD method.
-
APCCAS - Closed-form design of FIR frequency selective filter using discrete Sine Transform
2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), 2016Co-Authors: Chien-cheng Tseng, Su-ling LeeAbstract:In this paper, the closed-form design of FIR frequency selective filter (FSF) using discrete Sine Transform (DST) is studied. First, the DST-based frequency selective method is used to obtain the filtered signal from the given digital signal. Then, the transfer function of FSF is derived from the filtered signal by using index mapping approach. Because the closed-form design is obtained, the filter coefficients are easily computed without performing any optimization. Finally, the long-length low-pass, band-pass and high-pass filter design examples are used to show the effectiveness of the proposed DST method.
-
Design of matrix second-order differentiator for image sharpening using discrete Sine Transform
2015 IEEE International Conference on Consumer Electronics - Taiwan, 2015Co-Authors: Su-ling Lee, Chien-cheng TsengAbstract:In this paper, the design of matrix second-order differentiator (SOD) using discrete Sine Transform (DST) is presented. First, the design problem of matrix filter is described. Then, the DST is applied to obtain the closed-form transfer matrix of the matrix SOD. Next, the designed matrix SOD is used to develop an image sharpening algorithm by using Laplacian operator. Finally, the performance of the proposed matrix SOD is evaluated through numerical examples.
-
closed form design of fixed fractional hubert Transformer using discrete Sine Transform
Asia Pacific Conference on Circuits and Systems, 2014Co-Authors: Chien-cheng Tseng, Su-ling LeeAbstract:In this paper, the closed-form design of fixed fractional Hilbert Transformer (FHT) using discrete Sine Transform (DST) is presented. First, the DST-based interpolation method is applied to reconstruct the continuous-time signal from the given discrete-time signal. Then, the filter coefficients of the transfer function of fixed FHT are obtained from the DST reconstruction results by using suitable index mapping. The main feature of the proposed method is that the closed-form design can be obtained without performing any optimization procedure. Finally, several numerical examples are demonstrated to show the effectiveness of the proposed design method.
Fabio Di Benedetto - One of the best experts on this subject based on the ideXlab platform.
-
Solution of Toeplitz normal equations by Sine Transform based preconditioning
Linear Algebra and its Applications, 1998Co-Authors: Fabio Di BenedettoAbstract:Abstract The normal equations constructed by a Toeplitz matrix are studied, in order to find a suitable preconditioner related to the discrete Sine Transform. New results are given about the structure of the product of two Toeplitz matrices, which allow the CGN method to achieve a superlinear rate of convergence. This preconditioner outperforms the circulant one for the iterative solution of Toeplitz least-squares problems; such strategy can also be applied to nonsymmetric linear systems. A block generalization is discussed.
-
WNAA - The Use of Discrete Sine Transform in Computations with Toeplitz Matrices
Lecture Notes in Computer Science, 1997Co-Authors: Fabio Di BenedettoAbstract:The T algebra, related to the discrete Sine Transform, is an efficient tool for approximating Toeplitz matrices arising in image processing. We present two applications concerning the computation of singular values and the preconditioning of least squares problems.
-
the use of discrete Sine Transform in computations with toeplitz matrices
International Conference on Numerical Analysis and Its Applications, 1996Co-Authors: Fabio Di BenedettoAbstract:The T algebra, related to the discrete Sine Transform, is an efficient tool for approximating Toeplitz matrices arising in image processing. We present two applications concerning the computation of singular values and the preconditioning of least squares problems.
-
Iterative solution of Toeplitz systems by preconditioning with the discrete Sine Transform
Advanced Signal Processing Algorithms, 1995Co-Authors: Fabio Di BenedettoAbstract:Solving linear systems or least-squares related to Toeplitz matrices is often required in the context of signal and image processing; conjugate-gradient-like methods are well-suited for solving such problems. The recent preconditioning technique involving the discrete Sine Transform is presented: convergence properties are reported and suitable generalizations to block matrices, nonsymmetric systems, and least-squares problems are discussed. Finally, these techniques are applied to regularized inverse problems arising in image restoration.© (1995) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
M. N. Murty - One of the best experts on this subject based on the ideXlab platform.
-
Radix-2 Algorithms for realization of Type-II Discrete Sine Transform and Type-IV Discrete Sine Transform
2015Co-Authors: M. N. MurtyAbstract:In this paper, radix-2 algorithms for computation of type-II discrete Sine Transform (DST-II) and type-IV discrete Sine Transform (DST-IV), each of length
-
Realization of Prime-Length Discrete Sine Transform Using Cyclic Convolution
2013Co-Authors: M. N. MurtyAbstract:This paper presents a new algorithm for the implementation of an N-point prime-length discrete Sine Transform (DST) through cyclic convolution. The proposed algorithm is based on the idea of reformulating prime N-length DST into two ሾሺ െ 1 ሻ /2ሿ- point cyclic convolutions. Thus, the hardware complexity can be reduced. This cyclic convolution –based algorithm is used to obtain a simple systolic array for pipelined implementation of the DST. This algorithm preserves all the benefits of very large-scale integration algorithms based on cyclic convolution or circular convolution, such as regular and simple structure. The convolutions play a significant role in digital signal processing due to their nature of easy implementation.
-
RECURSIVE ALGORITHMS FOR REALIZATION OF ONE- DIMENSIONAL DISCRETE Sine Transform AND INVERSE DISCRETE Sine Transform
2013Co-Authors: M. N. MurtyAbstract:In this paper, novel recursive algorithms for realization of one-dimensional discrete Sine Transform (DST) and inverse discrete Sine Transform (IDST) of any length are proposed. By using some mathematical techniques, recursive expressions for DST and IDST have been developed. Then, the DST and IDST are implemented by recursive filter structures. A linear systolic architecture for realization of DST is also presented in this paper. Compared with some other algorithms, the proposed algorithm for DST achieves savings on the number of multiplications and additions. The recursive algorithms have been found very effective for realization using software and VLSI techniques.
-
Radix-2 Algorithms for Implementation of Type-II Discrete CoSine Transform and Discrete Sine Transform
2013Co-Authors: M. N. MurtyAbstract:In this paper radix-2 algorithms for computation of type-II discrete coSine Transform (DCT) and discrete Sine Transform (DST) of length N = �� �� (�� ≥ �� ) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations. The proposed algorithms require a reduced number of arithmetic operations compared with some existing methods.
-
Systolic Architecture for Implementation of 2-D Discrete Sine Transform
Procedia Engineering, 2012Co-Authors: M. N. Murty, S.s. Nayak, B. Padhy, S.n. PandaAbstract:Abstract In this paper, a recursive algorithm and two linear systolic architectures for realizing the one-dimensional discrete Sine Transform (DST) are presented. By using some mathematical techniques, any general length DST can be converted into a recursive equation. The recursive algorithms apply to arbitrary length algorithms and are appropriate for VLSI implementation. These two linear arrays have been utilised for designing a bilayer structure for computing the 2-D DST. This bilayer structure does not require any hardware / time for the transposition of the intermediate results. The desired transposition is achieved by orthogonal alignment of the linear array of the upper layer with respect to those of the lower layer.
