Decoding complexity analyses of PEG-based methods with the improved hybrid iterative/Gaussian elimination decoding algorithm

This paper focuses on analysing the operational complexity of decoding the progressive-edge-growth-based (PEG-based) method for the extended grouping of radio frequency identification (RFID) tags using the improved hybrid iterative/Gaussian elimination decoding algorithm. In addition, the joint use of two decoding components is adapted based on the missing amounts of RFID tags and group sizes in order to avoid iterative decoding when the missing amounts is larger than a threshold and thus to save more decoding time. Various simulations have been carried out to analyse and evaluate the decoding complexity as well as the impact of the threshold value on decoding time. Simulation results are presented, demonstrating that the improved hybrid decoding algorithm achieves low decoding complexity and thus decoding time when compared to the full Gaussian elimination decoding algorithm.

[1]  Jun Murai,et al.  Group coding of RF tags to verify the integrity of group of objects , 2011, 2011 IEEE International Conference on RFID.

[2]  Yi-Sheng Su,et al.  Extended Grouping of RFID Tags Based on Resolvable Transversal Designs , 2014, IEEE Signal Processing Letters.

[3]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[4]  Marcel Ambroze,et al.  Optimizing the Decoding Complexity of PEG-Based Methods with an Improved Hybrid Iterative/Gaussian Elimination Decoding Algorithm , 2017 .

[5]  Reem Alkanhel,et al.  Extended grouping of RFID tags based on progressive edge-growth methods , 2016, 2016 5th International Conference on Electronic Devices, Systems and Applications (ICEDSA).

[6]  Jun Murai,et al.  Theory and Performance Evaluation of Group Coding of RFID Tags , 2012, IEEE Transactions on Automation Science and Engineering.

[7]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[8]  Valentin Savin,et al.  Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel , 2010, 2010 International Symposium On Information Theory & Its Applications.

[9]  Ozan K. Tonguz,et al.  Grouping of RFID Tags via Strongly Selective Families , 2013, IEEE Communications Letters.

[10]  Vincent Roca,et al.  Improving the Decoding of LDPC Codes for the Packet Erasure Channel with a Hybrid Zyablov Iterative Decoding/Gaussian Elimination Scheme , 2008 .

[11]  J. Mitsugi,et al.  Identification of missing objects with group coding of RF tags , 2012, 2012 IEEE International Conference on RFID (RFID).

[12]  Marco Chiani,et al.  Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding , 2008, IEEE Communications Letters.

[13]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[14]  Ozan K. Tonguz,et al.  Using the Chinese Remainder Theorem for the Grouping of RFID Tags , 2013, IEEE Transactions on Communications.