High Speed VLSI Architecture for Finding the First W Maximum/Minimum Values

VLSI architectures for finding the first W maximum/minimum values are highly demanded in the fields of K-best MIMO detector, non-binary LDPC decoder and product-code decoder. In this paper, a VLSI architecture based on parallel comparing scheme is explored for finding the first W maximum/minimum values from M inputs. The place and route results using a TSMC 90-nm CMOS technology show that, despite some hardware cost, it achieves on average a 3.6x faster speed performance compared to the existing partial sorting architectures.

[1]  Guido Masera,et al.  VLSI Implementation of a Multi-Mode Turbo/LDPC Decoder Architecture , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  Emmanuel Boutillon,et al.  Bubble check: a simplified algorithm for elementary check node processing in extended min-sum non-binary LDPC decoders , 2010 .

[3]  Chin-Long Wey,et al.  Algorithms of Finding the First Two Minimum Values and Their Hardware Implementation , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[4]  Pei-Yun Tsai,et al.  A 4×4 64-QAM reduced-complexity K-best MIMO detector up to 1.5Gbps , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[5]  Luca Gaetano Amarù,et al.  High Speed Architectures for Finding the First two Maximum/Minimum Values , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Guido Masera,et al.  Efficient VLSI implementation of soft-input soft-output fixed-complexity sphere decoder , 2012, IET Commun..

[7]  P. Glenn Gulak,et al.  A 675 Mbps, 4 × 4 64-QAM K-Best MIMO Detector in 0.13 µm CMOS , 2012, IEEE Trans. Very Large Scale Integr. Syst..

[8]  Guido Masera,et al.  Non-recursive max* operator with reduced implementation complexity for turbo decoding , 2012, IET Commun..

[9]  Christophe Jégo,et al.  A highly parallel Turbo Product Code decoder without interleaving resource , 2008, 2008 IEEE Workshop on Signal Processing Systems.