An Efficient Base Conversion Using Variable Length Segmentation and Remainder Transfer

This letter addresses the problems of conversion overflows, losses, and faults in the radix number system. Different from the fixed length truncation conversion strategy, the proposed scheme determines the optimal length of each segment adaptively according to the bases of source and destination and the representable numbers range limited by the maximum storage capacity of registers. In the segmentation repeated division scheme, the term of segment weight is presented to reflect the influence of different segment positions on the size of corresponding segment value, and a remainder transfer function that can interrelate individual segments is established to correct the dividend automatically. Theoretical and experimental results prove that the proposed scheme can realize the defect-free radix conversion for any integers between any bases and improve conversion efficiency up to the theoretical value.

[1]  Baoming Bai,et al.  Superposition Construction of $Q$ -Ary LDPC Codes by Jointly Optimizing Girth and Number of Shortest Cycles , 2016, IEEE Communications Letters.

[2]  Chin-Chen Chang,et al.  A steganographic scheme by fully exploiting modification directions , 2011, Expert Syst. Appl..

[3]  Jiasong Wu,et al.  Fast Radix-3 Algorithm for the Generalized Discrete Hartley Transform of Type II , 2012, IEEE Signal Processing Letters.

[4]  Yen-Ping Chu,et al.  A Novel Image Data Hiding Scheme with Diamond Encoding , 2009, EURASIP J. Inf. Secur..

[5]  Bin Li,et al.  Steganalysis of Multiple-Base Notational System Steganography , 2008, IEEE Signal Processing Letters.

[6]  Chip-Hong Chang,et al.  Novel Design Algorithm for Low Complexity Programmable FIR Filters Based on Extended Double Base Number System , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.

[7]  Jianhao Hu,et al.  Hardware Efficient Mixed Radix-25/16/9 FFT for LTE Systems , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Jinhong Yuan,et al.  q-Ary Chain-Containing Quantum Synchronizable Codes , 2016, IEEE Communications Letters.

[9]  Chin-Chen Chang,et al.  An Adjustable and Reversible Data Hiding Method Based on Multiple-base Notational System without Location Map , 2015, J. Inf. Hiding Multim. Signal Process..

[10]  Houssain Kettani,et al.  On the Conversion Between Number Systems , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[11]  David W. Matula,et al.  A Formalization of Floating-Point Numeric Base Conversion , 1970, IEEE Transactions on Computers.

[12]  Gerhard Fettweis,et al.  Optimal Radix-2 FFT Compatible Filters for GFDM , 2017, IEEE Communications Letters.

[13]  Xinpeng Zhang,et al.  Efficient Steganographic Embedding by Exploiting Modification Direction , 2006, IEEE Communications Letters.

[14]  Xiangyong Zeng,et al.  On q-ary Linear Quasi-Constant-Weight Codes , 2016, IEEE Commun. Lett..

[15]  Tung-Shou Chen,et al.  Data embedding using pixel value differencing and diamond encoding with multiple-base notational system , 2012, J. Syst. Softw..

[17]  Xinpeng Zhang,et al.  Steganography using multiple-base notational system and human vision sensitivity , 2005, IEEE Signal Process. Lett..

[18]  Chi-Yao Weng,et al.  An efficient reversible data hiding with reduplicated exploiting modification direction using image interpolation and edge detection , 2017, Multimedia Tools and Applications.

[19]  Mitchell A. Thornton,et al.  A Fixed-Point Squaring Algorithm Using an Implicit Arbitrary Radix Number System , 2016, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[20]  Tanay Chattopadhyay,et al.  All-optical conversion scheme: Binary to quaternary and quaternary to binary number , 2009 .

[21]  Amal K. Ghosh,et al.  Binary to modified trinary number system conversion and vice-versa for optical super computing , 2010, Natural Computing.

[22]  Xiaofang Zhou,et al.  Generic Mixed-Radix FFT Pruning , 2012, IEEE Signal Processing Letters.