The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, a one-parameter eight-point orthogonal transform suitable for image compression is proposed. An algorithm for its fast computation is developed and an efficient structure for a simple implementation valid for all possible values of its independent parameter is proposed. It is shown that an appropriate selection of the values of the parameter results in a number of new multiplication-free...
In this paper, an efficient algorithm for fast computation of the conjugate symmetric sequency-ordered complex Hadamard transform (CS-SCHT) of any length that is a power of two is proposed using the Kronecker product. Since the CS-SCHT matrix is factored into a product of sparse matrices, the resulting structure for the algorithm is very attractive for implementation and similar to that of the well-known...
The computational complexity of an adaptive filtering algorithm increases with increasing the filter tap length and therefore, the use of such a filter can become prohibitive for certain applications, especially for real-time implementation. In this paper, we develop low-complexity adaptive filtering algorithms by incorporating the concept of partial updating of the filter coefficients into the technique...
In this paper, the authors propose an alternate method to derive higher radix FFT algorithms by using a recursive approach and by appropriately combining the twiddle factors without increasing the structural complexity. Specifically, efficient radix-8 and radix-16 FFT algorithms are designed and their arithmetic complexities shown to be slightly less than those of the corresponding existing Cooley-Tukey...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.