Molecular Arithmetic Coding (MoAC) and Optimized Molecular Prefix Coding (MoPC) for Diffusion-Based Molecular Communication

IF 2.4 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Melih Şahin;Beyza Ezgi Ortlek;Ozgur B. Akan
{"title":"Molecular Arithmetic Coding (MoAC) and Optimized Molecular Prefix Coding (MoPC) for Diffusion-Based Molecular Communication","authors":"Melih Şahin;Beyza Ezgi Ortlek;Ozgur B. Akan","doi":"10.1109/TMBMC.2024.3476197","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":36530,"journal":{"name":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","volume":"11 1","pages":"66-77"},"PeriodicalIF":2.4000,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Molecular, Biological, and Multi-Scale Communications","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10726580/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

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.
基于扩散的分子通信中的分子算术编码(MoAC)和优化分子前缀编码(MoPC)
分子通信(MC)能够在纳米尺度上通过分子传递信息。本文提出了一种新的和优化的MC源编码(数据压缩)方法。在最近的一篇论文中,前缀源编码被引入到该领域,通过一种适应MC的霍夫曼编码版本。我们首先表明,虽然mc - adaptive霍夫曼编码提高了符号错误率(SER),但就编码长度和功率而言,它并不总是产生最优的前缀码本。为了解决这个问题,我们提出了最优分子前缀编码(MoPC)。本文的主要成果是分子算术编码(MoAC),我们基于现有的约束算术信道编码的一般构造原理推导出它,使其具有对任何有限源字母表的纠错和数据压缩能力。我们从理论上和实践上都证明了MoAC比SAC的优越性,SAC是我们对MC的另一种算法源编码的适应。然而,MoAC独特的可解码性受到比特精度的限制。据此,提出了一种可唯一解码的新编码方案——分子前缀编码算法(MoAPC)。在两个核苷酸字母上,我们发现MoAPC比优化后的MoPC具有更好的压缩性能。MC仿真结果验证了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.90
自引率
13.60%
发文量
23
期刊介绍: As a result of recent advances in MEMS/NEMS and systems biology, as well as the emergence of synthetic bacteria and lab/process-on-a-chip techniques, it is now possible to design chemical “circuits”, custom organisms, micro/nanoscale swarms of devices, and a host of other new systems. This success opens up a new frontier for interdisciplinary communications techniques using chemistry, biology, and other principles that have not been considered in the communications literature. The IEEE Transactions on Molecular, Biological, and Multi-Scale Communications (T-MBMSC) is devoted to the principles, design, and analysis of communication systems that use physics beyond classical electromagnetism. This includes molecular, quantum, and other physical, chemical and biological techniques; as well as new communication techniques at small scales or across multiple scales (e.g., nano to micro to macro; note that strictly nanoscale systems, 1-100 nm, are outside the scope of this journal). Original research articles on one or more of the following topics are within scope: mathematical modeling, information/communication and network theoretic analysis, standardization and industrial applications, and analytical or experimental studies on communication processes or networks in biology. Contributions on related topics may also be considered for publication. Contributions from researchers outside the IEEE’s typical audience are encouraged.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信