Low-Complexity Tree Architecture For Finding The First Two Minima
暂无分享,去创建一个
[1] 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.
[2] Xiao Peng,et al. A sorting-based architecture of finding the first two minimum values for LDPC decoding , 2010, 2011 IEEE 7th International Colloquium on Signal Processing and its Applications.
[3] 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.
[4] Wonyong Sung,et al. Performance of rate 0.96 (68254, 65536) EG-LDPC code for NAND Flash memory error correction , 2012, 2012 IEEE International Conference on Communications (ICC).
[5] Joseph R. Cavallaro,et al. VLSI Architecture for Layered Decoding of QC-LDPC Codes With High Circulant Weight , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[6] Huang-Chang Lee,et al. An Efficient Multi-Standard LDPC Decoder Design Using Hardware-Friendly Shuffled Decoding , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.
[7] Javier Valls-Coquillat,et al. Reduced-Complexity Min-Sum Algorithm for Decoding LDPC Codes With Low Error-Floor , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.
[8] Wonyong Sung,et al. Rate-0.96 LDPC Decoding VLSI for Soft-Decision Error Correction of NAND Flash Memory , 2014, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.