Abstract

Goal of this research article is to study and the analysis of a parameterization technique called Common Operator for an embedded digital signal processing system and implementation of that embedded system using a special architecture to achieve better performance. This can be realized by efficient hardware design with reduced area and low-power dissipation which is a significant challenge for embedded systems, particularly in portable devices. The challenge is even more pronounced when DWT and FFT with large transform lengths need to be realized in embedded hardware for several embedded signal processing applications. When it comes to miniaturization or reuse or sharing of the hardware, two Parameterization approaches, viz; the Common Function approach and the Common Operator approach are the effective ones. But in this study, it is proposed a reconfigurable FFT (Fast Fourier Transform) operator using the common operator approach. This operator can be reconfigured to switch from an operator dedicated to compute the FFT to an operator which computes the FFT in order to perform DWT. Contribution of this study is to Minimize the waste of resources by modifying slightly the FFT butterfly to support the DWT computation and to reduce the resources allocated to the reconfiguration, Simplify the reconfiguration between the two algorithms, by separating the calculation of the Real and Imaginary parts of FFT modules.

Keywords:

DWT-lifting, FFT-butterfly, mutual module, parameterization,

References

1. Alaus, L., D. Noguet and J. Palicot, 2010. A common operator bank to resolve scheduling issue on a complexity optimized SDR terminal. Proceeding of 6th Advanced International Conference on Telecommunications (AICT, 2010), pp: 142-146.
   CrossRef    
2. Alaus, L., J. Palicot, C. Roland, Y. Louet and D. Noguet, 2009. Promising technique of parameterization for reconfigurable radio, the common operators technique: Fundamentals and examples. J. Signal Process. Sys., 62(2): 173-185.
   CrossRef    
3. Al Ghouwayel, A.C., A. Haj-Ali, Z. El-Bazzal and Y. Loüet, 2012. Towards a triple mode common operator FFT for software radio systems. Proceeding of 19th International Conference on Telecommunication (ICT, 2012), pp: 1-6.
   CrossRef    
4. Cooley, J.W. and J.W. Tukey, 1965. An algorithm for the machine calculation of complex Fourier series. Math. Comput., 19(90): 297-301.
   CrossRef    
5. Gul, S.T., C. Moy and J. Palicot, 2007. Two scenarios of flexible Multi-standard architecture designs using a multi-granularity exploration. Proceeding of the IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications, pp: 1-5.
   CrossRef    
6. Naoues, M., L. Alaus and D. Noguet, 2010. A common operator for FFT and viterbi algorithms. Proceeding of the 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, pp: 309-313.
   CrossRef    
7. Naoues, M., L. Alaus, D. Noguet and Y. Louët, 2011b. A common operator for FFT and FEC decoding. Microprocess. Microsy., 35(8): 708-715.
   CrossRef    
8. Naoues, M., D. Noguet, Y. Louët, K. Grati and A. Ghazel, 2011a. An efficient flexible common operator for FFT and viterbi algorithms. Proceeding of IEEE 73rd Vehicular Technology Conference (VTC, Spring), pp: 1-5.
   CrossRef    
9. Takala, J. and P. Konsta, 2006. Scalable FFT processors and pipelined butterfly units. J. VLSI Sig. Proc. Syst., 43(2-3): 113-123.
   CrossRef    
10. Tseng, P.C., C.T. Huang and L.G. Chen, 2002. VLSI implementation of shape-adaptive discrete wavelet transform. Proceeding of SPIE 4671, Visual Communications and Image Processing, pp: 655.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.