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.
Conventional filter bank-based spectrum sensing methods employ uniform discrete Fourier transform filter bank (DFTFB). In this paper, we propose a multi-stage coefficient decimation filter bank (MS-CDFB) that can provide variable sensing resolution for wideband spectrum sensing in cognitive radios. From an initial fixed-coefficient modal filter, a filter bank that has multiple passbands of different...
The most computationally demanding part in the digital front-end of a Software radio receiver is the channelizer, which operates at the highest sampling rate. The channelizer extracts multiple narrowband channels from the digitized wideband input signal. The limitation of the conventional uniform Discrete Fourier transform (DFT) filter bank channelizer is that, it is incapable of extracting channels...
A new recursive solution based on Clenshaw's recurrence relation is formulated for computation of the discrete Fourier transform (DFT). The proposed recursive formulation is used further to derive a simple, regular and locally connected linear array architecture for systolic implementation of the DFT. The proposed structure offers nearly twice the throughput and involves nearly the same area-complexity...
A simple 2-dimensional architecture is derived for highly concurrent systolization of the 2-dimensional (2D) discrete Fourier transform (DFT). The concurrency of computation has been enhanced and complexity is minimized by the proposed algorithm where an N-point DFT is computed via four inner-products of real-valued data of length ap (N/2). The proposed structure offers significantly lower latency,...
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.