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 work, we present a fast computational structure for the discrete Hirschman Transform (FHT) family on Field Programmable Gate Arrays (FPGAs). Compared to the traditional FFT, the FHT has better performance in spectral estimation, FIR convolution, and especially in Compressive Sensing (CS). We implement our design of the DHT by using circular shifting of shorter terms of the FFT. This algorithm...
Correlation Electromagnetic analysis (CEMA) has been effective in revealing the cryptographic key on cryptosystems. Random delay insertion (RDI) causes misalignments to prevent the action of these attacks in the time domain to avoid information leakage. In this paper, we first use the newly proposed time-frequency transformation Hirschman Optimal Transform (HOT) to transform the signal from the time...
Electromagnetic analysis in side channel attack exploits the information of electromagnetic radiation that leaks from the cryptographic devices when they are running. It's no-table because of its efficiency and easiness to perform. Correlation electromagnetic analysis (CEMA) is of the most effective means in electromagnetic analysis. However, the efficiency of traditional CEMA is limited by some insignificant'...
This paper presents a low power FFT accelerator using a Radix-2 algorithm with an 8-parallel multi-path delay commutator. Hardware accelerators can achieve better performance and throughput compared to software FFT routines. Thus, FFT accelerators are used in many DSP processors. In this paper, a Radix-2 Multipath Delay Commutator (R2MDC) FFT accelerator is designed with 8-parallel processing of the...
The Hirschman Uncertainty [1] is defined by the average of the Shannon entropies of a discrete-time signal and its Fourier transform. The picket fence functions has been found to be the optimal basis for the Hirschman Uncertainty, as given in a previous paper of ours [2]. We have seen that a basis can be constructed from signals with minimum Hirschman Uncertainty in that paper, leading to a transform...
In [1] we developed a new uncertainty measure which incorporates Rényi entropy instead of Shannon entropy. This new uncertainty measure was conjectured to be invariant to the Rényi order α > 0 for the case of the optimizer signals of Hirschman Uncertainty (Picket Fence functions whose lengths are a perfect square). In this paper, we prove this invariance, and test whether this invariance is predictive...
Compressive Sensing (CS) increases the computational complexity of decoding while simplifying the sampling process. In this paper, we apply our previously discussed Hirschman Optimal Transform to develop a series of measurement matrices that reduce the computational complexity of decoding while preserving the recovery performance. In addition, this application provides us alternative choices when...
In this paper, a high throughput and low power architecture for 256-point FFT processor is proposed which is suitable for both high performance and low power applications. The proposed architecture is based on Radix-4 algorithm. We choose pipelined Multi-path Delay Commutators (MDC) for our design. Two separate datapaths are used in this architecture so that it can process eight inputs in parallel...
In [1] we developed a new uncertainty measure which incorporates Rényi entropy instead of Shannon entropy. This new uncertainty measure was conjectured to be invariant to the Rényi order α > 0, whereas for discrete signals other than picket fence signal the uncertainty measure decreases for α > 0. In this paper, we prove this invariance, and test whether this invariance is predictive in the...
The Hirschman Uncertainty [1] is defined by the average of the Shannon entropies of a discrete-time signal and its Fourier transform. The optimal basis for the Hirschman Uncertainty has been shown to be the picket fence function, as given in a previous paper of ours [2]. We have seen that a basis can be constructed from signals with minimum Hirschman Uncertainty in that paper, leading to a transform...
In this paper, a hardware efficient convolution implementation is proposed which is based on the Hirschman Optimal Transform (HOT). Previously, it has been shown theoretically that convolution based on HOT has major cost advantage over FFT based convolution, since, a K2 point HOT is based on a K-point DFT. However, due to the complexity of the HOT convolution, it was not easily realizable on hardware...
The traditional Heisenberg-Weyl measure quantifies the joint localization, uncertainty, or concentration of a signal in the phase plane based on a product of energies expressed as signal variances in time and in frequency. Unlike the Heisenberg-Weyl measure, the Hirschman notion of joint uncertainty is based on the entropy rather than the energy [1]. Furthermore, as we noted in [2], the Hirschman...
In this paper, we propose a hardware architecture to compute the Hirschman Optimal Transform (HOT). The HOT promises faster computation than the FFT with reduced area, yet can be used in similar ways. In fact, the HOT can potentially yield faster FIR convolution and superior spectral analysis methods. An N=K2 point HOT is composed of K, K-point DFTs. For our work, these K-point DFTs are computed using...
The Hirschman Uncertainty [1] is defined by the average of the Shannon entropies of a discrete-time signal and its Fourier transform. The optimal basis for the Hirschman Uncertainty has been shown to be the picket fence function, as given in a previous paper of ours [2]. In this paper, we develop a new uncertainty measure that incorporates the Rényi entropy instead of the Shannon entropy, and we show...
The entropy based Hirschman optimal transform (HOT) is superior to the energy based discrete Fourier transform (DFT) in terms of its ability to separate or resolve two limiting cases of localization in frequency, viz pure tones and additive white noise. In this paper, we implement a stationary line spectral estimation method using filter banks, which are constructed with the HOT and the DFT. We combine...
Displacement measurements of structures like bridges are helpful in many ways. Understanding bridge response to increasing loads is of interest in bridge analysis and load rating. Currently used direct displacement methods such as laser systems and displacement transducers are expensive, time consuming and difficult to deploy, particularly on an in-service bridge. One indirect method would be to use...
The traditional Heisenberg-Weyl measure quantifies the joint localization, uncertainty, or concentration of a signal in the phase plane based on a product of energies expressed as signal variances in time and in frequency. Unlike the Heisenberg-Weyl measure, the Hirschman notion of joint uncertainty is based on the entropy rather than the energy [1]. Furthermore, its definition extends naturally from...
The traditional Heisenberg-Weyl measure quantifies the joint localization, uncertainty, or concentration of a signal in the phase plane based on a product of energies expressed as signal variances in time and in frequency. Unlike the Heisenberg-Weyl measure, the Hirschman notion of joint uncertainty is based on the entropy rather than the energy. Furthermore, its definition extends naturally from...
Measuring bridge displacement for moving vehicle loads helps in load rating and evaluating the structural health of the bridge. Traditional methods of measuring bridge displacement such as laser systems and displacement transducers are expensive, require a stationary reference point and are complicated to setup. Measuring acceleration using accelerometers is inexpensive and easy. Displacement can...
In this paper, we compare the Orthogonal Matching Pursuits and the Matching Pursuits algorithm as used with the same dictionary in a stationary spectral estimation problem. Specifically, we develop an over-complete dictionary using the Fourier and Hirschman Optimal Transforms. Then, we apply a periodogram spectral estimation algorithm using this dictionary to a signal consisting of closely-spaced-in-frequency...
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.