The Discrete Fourier Transform (DFT) is a mathematical procedure that stands at the center of the processing inside a digital signal processor. It has been widely known and argued in relevant literature that the Fast ...
详细信息
The Discrete Fourier Transform (DFT) is a mathematical procedure that stands at the center of the processing inside a digital signal processor. It has been widely known and argued in relevant literature that the Fast Fourier Transform (FFT) is useless in detecting specific frequencies in a monitored signal of length N because most of the computed results are ignored. In this paper, we present an efficient FFT-based method to detect specific frequencies in a monitored signal, which will then be compared to the most frequently used method which is the recursive Goertzel algorithm that detects and analyses one selectable frequency component from a discrete signal. The proposed JM-Filter algorithm presents a reduction of iterations compared to the first and second order Goertzel algorithm by a factor of r, where r represents the radix of the JM-Filter. The obtained results are significant in terms of computational reduction and accuracy in fixed-point implementation. Gains of 15 dB and 19 dB in signal to quantization noise ratio (SQNR) were respectively observed for the proposed first and second order radix-8 JM-Filter in comparison to Goertzel algorithm.
The random-like behavior of chaotic systems make them perfect candidates for the core of numerous pseudo-random number generators. The coupling of two or more chaotic maps has been proven to increase the random proper...
详细信息
The random-like behavior of chaotic systems make them perfect candidates for the core of numerous pseudo-random number generators. The coupling of two or more chaotic maps has been proven to increase the random property robustness of the generated sequences. However, these properties are also strongly influenced by the datatype implementation of these generators owing to the effect of the sensitivity to initial conditions. Hence, several factors must be considered concerning the hardware implementation of these coupled chaotic map-based generators. This paper first examines the effect of fixed-point precision implementation on the periodicity of a single skew tent map and the extension of this effect on the statistical properties of the generated sequence from coupled skew tent maps. Then, the effect on cross-coupled skew tent maps is discussed. Further, a modification to the cross-coupled scheme is presented;this achieves a reduction in the fixed-point fraction length required for generating a sequence suitable for cryptographic applications while expanding the dependency on the control parameters of the maps. The generated sequences from the proposed modification met all the applied statistical and correlation test requirements, demonstrating that they possess acceptable random properties and are suitable for cryptographic applications. (C) 2018 Elsevier Ltd. All rights reserved.
Bird's eye view (BEV) generation from front-looking video stream is considered an important pre-processing task in various computer vision applications such as driver assistance systems. In this work, hardware imp...
详细信息
Bird's eye view (BEV) generation from front-looking video stream is considered an important pre-processing task in various computer vision applications such as driver assistance systems. In this work, hardware implementation of this process using high-level synthesis in Simulink environment has been considered for rapid prototyping under real-time constraints. Traditionally, researchers have employed lookup table-based approaches to circumvent the exorbitant cost of implementing arithmetic modules associated with the perspective transformation. The hardware implementation scheme proposed here, however, demonstrates that a polynomial approximation over the limited domain of the involved operands not only saves precious hardware resources but also provides better fixed-point precision. Synthesis results on Zynq-7000 FPGA show that the proposed circuit reduces the block memory utilisation by 9% compared to the lookup table-based built-in Simulink Vision HDL block. The proposed design evaluates the results in fixed-point format which is essential for subsequent bilinear interpolation to produce high-fidelity output frame, albeit at the cost of 4% increase in DSP48E utilisation. The approximation error of the proposed solution is less than quarter-pixel on average. The proposed hardware has been integrated as an IP core in a hardware-software co-design system. The whole framework is publicly available to facilitate practitioners and researchers.
Since their introduction in 1993, turbo codes have received a significant amount of attention in the communications theory field due to their Shannon-capacity approaching performance. In recent years, the cellular sys...
详细信息
ISBN:
(纸本)9780819466990
Since their introduction in 1993, turbo codes have received a significant amount of attention in the communications theory field due to their Shannon-capacity approaching performance. In recent years, the cellular systems market has embraced turbo code technology and made it part of the latest standards. This paper will review the effects of scale factors, fixed-point precision, soft decisions and hard decisions on the performance of the turbo codes defined in the UMTS third-generation cellular system. In addition, a new scale factor estimation technique which provides improved performance at low signal to noise ratios will be presented.
We propose a feasible V-BLAST detector based on modified Householder QRD (M-H-QRD) over spatially correlated fading channel, which can almost match the performance of the V-BLAST algorithm with much lower complexity a...
详细信息
We propose a feasible V-BLAST detector based on modified Householder QRD (M-H-QRD) over spatially correlated fading channel, which can almost match the performance of the V-BLAST algorithm with much lower complexity and better numerical stability. Compared to the soiled QRD (S-QRD) detector. the proposed detector requires a smaller minimum word-length to reach the same value of error floor for fixed-point (FP) numerical precision despite no significant performance difference for floating-point machine precision. All these advantages make it attractive when implemented using FP arithmetic.
暂无评论