Optimizing the Decoding Complexity of PEG-Based Methods with an Improved Hybrid Iterative/Gaussian Elimination Decoding Algorithm
| Autor: | Marcel Ambroze, Reem Alkanhel |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Physics and Astronomy (miscellaneous)
Iterative Viterbi decoding Computer science Group integrity Hybrid decoding 02 engineering and technology Sequential decoding Data_CODINGANDINFORMATIONTHEORY lcsh:Technology symbols.namesake Gaussian elimination Management of Technology and Innovation 0202 electrical engineering electronic engineering information engineering lcsh:Science Engineering (miscellaneous) Progressive edge-growth (PEG) methods Computer Science::Information Theory Berlekamp–Welch algorithm lcsh:T Missing tag recovery 020206 networking & telecommunications symbols lcsh:Q Early stopping criterion Algorithm Decoding methods |
| Zdroj: | Advances in Science, Technology and Engineering Systems, Vol 2, Iss 3, Pp 578-586 (2017) |
| ISSN: | 2415-6698 |
| Popis: | This paper focuses on optimizing the decoding complexity of the progressive-edge-growth-based (PEG-based) method for the extended grouping of radio frequency identification (RFID) tags using a hybrid iterative/Gaussian elimination decoding algorithm. To further reduce the decoding time, the hybrid decoding is improved by including an early stopping criterion to avoid unnecessary iterations of iterative decoding for undecodable blocks. Various simulations have been carried out to analyse and assess the performance achieved with the PEG-based method under the improved hybrid decoding, both in terms of missing recovery capabilities and decoding complexities. Simulation results are presented, demonstrating that the improved hybrid decoding achieves the optimal missing recovery capabilities of full Gaussian elimination decoding at a lower complexity, as some of the missing tag identifiers are recovered iteratively. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|