Molecular communication (MC) enables information transfer through molecules at the nano-scale. This paper presents new and optimized source coding (data compression) methods for MC. In a recent paper, prefix source co...
详细信息
Molecular communication (MC) enables information transfer through molecules at the nano-scale. This paper presents new and optimized source coding (data compression) methods for MC. In a recent paper, prefix source coding was introduced into the field, through an MC-adapted version of the Huffman coding. We first show that while MC-adapted Huffman coding improves symbol error rate (SER), it does not always produce an optimal prefix codebook in terms of coding length and power. To address this, we propose optimal molecular prefix coding (MoPC). The major result of this paper is the Molecular Arithmetic coding (MoAC), which we derive based on an existing general construction principle for constrained arithmetic channel coding, equipping it with error correction and data compression capabilities for any finite source alphabet. We theoretically and practically show the superiority of MoAC to SAC, our another adaptation of arithmetic source coding to MC. However, MoAC's unique decodability is limited by bit precision. Accordingly, a uniquely-decodable new coding scheme named Molecular Arithmetic with prefix coding (MoAPC) is introduced. On two nucleotide alphabets, we show that MoAPC has a better compression performance than optimized MoPC. MC simulation results demonstrate the effectiveness of the proposed methods.
This paper proposes an algorithm called MACH for coding a hierarchical category structure to enable prefix matching between a publication and a subscription. Compared to fixed-length coding, the MACH algorithm generat...
详细信息
ISBN:
(纸本)9781479984619
This paper proposes an algorithm called MACH for coding a hierarchical category structure to enable prefix matching between a publication and a subscription. Compared to fixed-length coding, the MACH algorithm generates shorter code lengths without losing the efficiency of matching. In addition, the MACH algorithm automatically identifies the bits that are not necessary for prefix matching. These bits are saved to allow growth of categories. The bit saving is prioritized according to a configurable criterion. Experiments with real world data and synthetic data are conducted to evaluate the benefit of the proposed algorithm.
The mixed-base numeration system based on series of powers of the numbers 2 and 3 is introduced and investigated. Representation of numbers in this numeration system is a special case of recursive number decomposition...
详细信息
The mixed-base numeration system based on series of powers of the numbers 2 and 3 is introduced and investigated. Representation of numbers in this numeration system is a special case of recursive number decomposition into linear forms in the basis of orthogonal number sequences. A new universal robust prefix coding of integers with the help of this representation is presented that possesses an increased tolerance to transmission errors. Computational aspects of base (2,3) representation of numbers are considered.
A simple scheme was proposed by Knuth to generate binary balanced codewords from any information word. However, this method is limited in the sense that its redundancy is twice that of the full sets of balanced codes....
详细信息
A simple scheme was proposed by Knuth to generate binary balanced codewords from any information word. However, this method is limited in the sense that its redundancy is twice that of the full sets of balanced codes. The gap between Knuth's algorithm's redundancy and that of the full sets of balanced codes is significantly considerable. This paper attempts to reduce that gap. Furthermore, many constructions assume that a full balancing can be performed without showing the steps. A full balancing refers to the overall balancing of the encoded information together with the prefix. We propose an efficient way to perform a full balancing scheme that does not make use of lookup tables or enumerative coding.
暂无评论