i-manager Publications

Efficient Sorting Mechanism for Finding First W Maxima/Minima Values

Kante Raj Kumar*, V. Thrimurthulu**

* PG Scholar, Department of Electronics and Communication Engineering, Chundi Ranganayakulu Engineering College, Tirupathi, India.

** Professor, Department of Electronics and Communication Engineering, Chundi Ranganayakulu Engineering College, Tirupathi, India.

Periodicity:August - October'2014
DOI : https://doi.org/10.26634/jes.3.3.3299

Abstract

Sorting is a deep-rooted problem in Computer Science and is a means of operation in quite a lot of applications. In this paper, the authors’ have proposed a complete VLSI model of sorting mechanism to find first maxima/minima values using (BWA) Bit Wise and Architecture. In this effort, a parallel radix-sort-based VLSI architecture for finding the first W maximum (or minimum) values is proposed. The described architecture, named Bit-Wise-And (BWA) architecture with an added advantage of high level scalability depends on analyzing input data from the most significant bit to the least significant one, the proposed scheme along with parallel structure has been modelled successfully on Xilinx Virtex -5 Fpga with a simple verilog RTL description.

Keywords

Sorting, Bit Wise and Operation, Verilog, RTL Description and Xilinx Virtex -5 Fpga

How to Cite this Article?

Kumar,K,R., and Thrimurthulu.V. (2014). Efficient Sorting Mechanism For Finding First W Maxima/Minima Values. i-manager’s Journal on Embedded System, 3(3), 39-44. https://doi.org/10.26634/jes.3.3.3299

References

[1]. Guoping Xiao, Maurizio Martina, A parallel radix-sortbased VLSI architecture for finding the first W maximum/minimum values Member IEEE, Gianluca Piccinini. Vol. 61, No. 11, pp. 890-894.

[2]. S. Papaharalabos, P. T. Mathiopoulos, G. Masera, and M. Martina, (2012). “Novel non-recursive max* operator with reduced implementation complexity for turbo decoding,” IET Communications, Vol. 6, No. 7, pp.702–707.

[3]. M. Martina, S. Papaharalabos, P. T. Mathiopoulos, and G. Masera, (2014). “Simplified Log-MAP algorithm for very low-complexity turbo decoder hardware architectures,” IEEE Trans. on Instrumentation and Measurement, Vol. 63, No. 3, pp. 531–537.

[4]. S. Zezza, S. Nooshabadi, and G. Masera, (2013). “A 2.63 Mbit/s VLSI implementation of SISO arithmetic decoders for high performance joint source channel codes,” IEEE Trans. on Circuits and Systems I, Vol. 60,No. 4, pp. 951–964.

[5]. Z. Guo and P. Nilsson, (2006). “Algorithm and implementation of the K-bestsphere decoding for MIMO detection,” IEEE Journal on Selected Areas in Communications, Vol. 24, No. 3, pp. 491–503.

[6]. K. Gunnam, G. Choi, and M. Yeary, (2007). “A parallel VLSI architecturefor layered decoding for array LDPC codes,” in IEEE International Conference on VLSI Design, pp. 738–743.

[7]. D. Oh and K. K. Parhi, (2010). “Min-sum decoder architectures with reduced word length for LDPC codes,” IEEE Trans. on Circuits and Systems I, Vol. 57, No. 1, pp. 105–115.

[8]. C. Condo, M. Martina, and G. Masera, (2013). “VLSI implementation of amulti-mode turbo/LDPC decoder architecture,” IEEE Trans. on Circuitsand Systems I, Vol. 60, No. 6, pp. 1441–1454.

[9]. M. Fossorier, M. Mihaljevic, and H. Imai, (1999). “Reduced complexity iterative decoding of low-density parity check codes based on belief propagation,” IEEE Trans. on Communications, Vol. 47, No. 5, pp. 673–680.

[10]. M. Shabany and P. G. Gulak, (2012). “A 675 mbps, 4x4 64-QAM K-Best MIMO detector in 0.13 um CMOS,” IEEE Trans. on VLSI systems, Vol. 20, No. 1, pp. 135–147.

[11]. B. Wu and G. Masera, (2012). “Efficient VLSI implementation of soft-input soft output fixed-complexity sphere decoder,” IET Communications, Vol. 6, No. 9, pp. 1111–1118.

[12]. E. Boutillon and L. Conde-Canencia, (2010). “Bubble check: a simplified algorithm for elementary check node processing in extended min-sumnon-binary LDPC decoders,” IET Electronics Letters, Vol. 46, No. 9, pp.633–634.

Efficient Sorting Mechanism for Finding First W Maxima/Minima Values

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content:

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25