Submit

Login Login

Register Register

Home / Journals / CMC / Online First / doi:10.32604/cmc.2024.056880
Journal Menu
Special Issues
Table of Content

All issues

Online First

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Open Access

ARTICLE

Efficient OpenMP Based Z-curve Encoding and Decoding Algorithms

Zicheng Zhou1, Shaowen Sun2, Teng Liang3, Mengjuan Li4,*, Fengling Xia5,*
1 School of Electronic Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 611731, China
2 Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, China
3 School of Communications Information Engineering, Yunnan Communications Vocational and Technical College, Kunming, 650500, China
4 Library, Yunnan Normal University, Kunming, 650500, China
5 Faculty of Civil Aviation and Aeronautics, Kunming University of Science and Technology, Kunming, 650500, China
* Corresponding Author: Mengjuan Li. Email: email; Fengling Xia. Email: email

Computers, Materials & Continua https://doi.org/10.32604/cmc.2024.056880

Received 01 August 2024; Accepted 30 October 2024; Published online 19 November 2024

Abstract

Z-curve’s encoding and decoding algorithms are primely important in many Z-curve-based applications. The bit interleaving algorithm is the current state-of-the-art algorithm for encoding and decoding Z-curve. Although simple, its efficiency is hindered by the step-by-step coordinate shifting and bitwise operations. To tackle this problem, we first propose the efficient encoding algorithm LTFe and the corresponding decoding algorithm LTFd, which adopt two optimization methods to boost the algorithm’s efficiency: 1) we design efficient lookup tables (LT) that convert encoding and decoding operations into table-lookup operations; 2) we design a bit detection mechanism that skips partial order of a coordinate or a Z-value with consecutive 0s in the front, avoiding unnecessary iterative computations. We propose order-parallel and point-parallel OpenMP-based algorithms to exploit the modern multi-core hardware. Experimental results on discrete, skewed, and real datasets indicate that our point-parallel algorithms can be up to 12.6× faster than the existing algorithms.

Keywords

Z-curve; lookup table; OpenMP; bit detection mechanism

  • 215

    View

  • 33

    Download

  • 0

    Like

Related articles
Copyright© 2024 Tech Science Press
© 1997-2024 TSP (Henderson, USA) unless otherwise stated

Share Link