<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/10013200" mdate="2023-08-07 00:00:00"> <author>Mohammed M. Siddeq and Mohammed H. Rasheed and Omar M. Salih and Marcos A. Rodrigues</author> <title>Quick Sequential Search Algorithm Used to Decode HighFrequency Matrices</title> <pages>180 - 187</pages> <year>2023</year> <volume>17</volume> <number>8</number> <journal>International Journal of Electrical and Computer Engineering</journal> <ee>https://publications.waset.org/pdf/10013200</ee> <url>https://publications.waset.org/vol/200</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>This research proposes a data encoding and decoding method based on the Matrix Minimization algorithm. This algorithm is applied to highfrequency coefficients for compressionencoding. The algorithm starts by converting every three coefficients to a single value; this is accomplished based on three different keys. The decodingdecompression 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 encodedcompressed data independently from the proposed algorithm. The experimental results showed that our proposed decoding algorithm retrieves original data faster than conventional sequential search algorithms.</abstract> <index>Open Science Index 200, 2023</index> </article>