Abstract
In this paper, a comparison-free sorting algorithm is proposed for negative and positive elements which satisfies the conditions such as hardware complexity. The basic idea is to sort the array of input integer elements without performing any comparison related operations between the data. Sorting technique for negative and positive numbers are executed involving similar hardware. Therefore, it doesn’t require any complex hardware design. This avoids any usage of memory such as SRAM or any circuitry involving complex design as compared to that of the ones used in other conventional sorting practices. Instead the proposed work utilizes basic registers to store the binary elements. FSM module is proposed with a comparison-free sorting algorithm in order to reduce hardware complexity. All the designs are coded in VHDL and verified using ModelSim SE10.4d simulator. The conventional and the proposed design are synthesized using Vivado and Synopsys DC Design Compiler (90 nm CMOS technology). From the synthesis report, it is observed that proposed FSM with comparison-free sorting algorithm has reduction in power and area compared to the conventional design.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdel-Hafeez, S., Gordon-Ross, A.: An efficient O(N) comparison-free sorting algorithm. IEEE Trans. Very Large Scale Integr. Syst. 25, 1930–1942 (2017)
Canaan, C., Garai, M.S., Daya, M.: Popular sorting algorithms. World Appl. Program. 1(1), 6271 (2011)
Busse, L.M., Chehreghani, M.H., Buhmann, J.M.: The information content in sorting algorithms. In: Proceedings IEEE International Symposium Information Theory (ISIT), pp. 2746–2750 July 2012
Koike, A., Sadakane, K.: A novel computational model for GPUs with application to I/O optimal sorting algorithms. In: 2014 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 614–623. IEEE, May 2014
Lupescu, G., Sluanschi, E.I., Tpu, N.: Using the integrated GPU to improve CPU sort performance. In: 2017 46th International Conference on Parallel Processing Workshops (ICPPW), (pp. 39–44). IEEE 2017, August
Sareen, P.: Comparison of sorting algorithms (on the basis of the average case). Int. J. Adv. Res. Comput. Sci. Softw. Eng. 3(3), 522–532 (2013)
Lindstrom, E.E., Vitter, J.S., Wong, C.K.: Introduction–sorting. IEEE Trans. Comput. 100(4), 293–295 (1985)
Khan, F.G., Khan, O.U., Montrucchio, B. Giaccone, P.: Analysis of fast parallel sorting algorithms for GPU architectures. In: 2011 Frontiers of Information Technology (FIT), pp. 173–178. IEEE, December 2011
Harish Ram D.S., Bhuvaneswari, M.C., Logesh, S.M.: A novel evolutionary technique for multi-objective power area and delay optimization in high level synthesis of datapaths. In: Proceedings 2011 IEEE Computer Society Annual Symposium on VLSI, ISVLSI 2011, Chennai, pp. 290–295 (2011)
Prabhu, E., Mangalam, H., Gokul, P.R.: A delay efficient vedic multiplier. In: Proceedings National Academy of Sciences, India, Section A: Physical Sciences (2018). https://doi.org/10.1007/s40010-017-0464-4
Madhukar Reddy, B., Prabhu, E.: An efficient 16-bit carry select adder with optimized power and delay. Int. J. Appl. Eng. Res. 10(11), 27909–27916 (2015)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Bhargav, T.A.S., Prabhu, E. (2019). Power and Area Efficient FSM with Comparison-Free Sorting Algorithm for Write-Evaluate Phase and Read-Sort Phase. In: Thampi, S., Marques, O., Krishnan, S., Li, KC., Ciuonzo, D., Kolekar, M. (eds) Advances in Signal Processing and Intelligent Recognition Systems. SIRS 2018. Communications in Computer and Information Science, vol 968. Springer, Singapore. https://doi.org/10.1007/978-981-13-5758-9_37
Download citation
DOI: https://doi.org/10.1007/978-981-13-5758-9_37
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-5757-2
Online ISBN: 978-981-13-5758-9
eBook Packages: Computer ScienceComputer Science (R0)