Quick sequential search algorithm used to decode high-frequency matrices

SIDDEQ, Mohammed M., RASHEED, Mohammed H., SALIH, Omar M. and RODRIGUES, Marcos (2023). Quick sequential search algorithm used to decode high-frequency matrices. World Academy of Science, Engineering and Technology, 17 (8), 180-187.

Preview

PDF Rodrigues-QuickSequentialSearch(VoR).pdf - Published Version Creative Commons Attribution. Download (1MB) | Preview

Abstract

This research proposes a data encoding and decoding method based on the Matrix Minimization algorithm. This algorithm is applied to high-frequency coefficients for compression/encoding. The algorithm starts by converting every three coefficients to a single value; this is accomplished based on three different keys. The decoding/decompression uses a search method called QSS (Quick Sequential Search) Decoding Algorithm presented in this research based on the sequential search to recover the exact coefficients. In the next step, the decoded data are saved in an auxiliary array. The basic idea behind the auxiliary array is to save all possible decoded coefficients; this is because another algorithm, such as conventional sequential search, could retrieve encoded/compressed data independently from the proposed algorithm. The experimental results showed that our proposed decoding algorithm retrieves original data faster than conventional sequential search algorithms.

Item Type:	Article
Page Range:	180-187
SWORD Depositor:	Symplectic Elements
Depositing User:	Symplectic Elements
Date Deposited:	30 Aug 2023 16:03
Last Modified:	10 Nov 2023 09:45
URI:	https://shura.shu.ac.uk/id/eprint/32315

Actions (login required)

View Item

Downloads

Publication Metrics