Publication:
Molecular Arithmetic Coding (MoAC) and Optimized Molecular Prefix Coding (MoPC*) for Diffusion-Based molecular communication

dc.contributor.departmentDepartment of Electrical and Electronics Engineering
dc.contributor.departmentNext Generation and Wireless Communication Laboratory
dc.contributor.departmentGraduate School of Sciences and Engineering
dc.contributor.kuauthorAkan, Özgür Barış
dc.contributor.kuauthorOrtlek, Beyza Ezgi
dc.contributor.kuauthorŞahin, Melih
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteGRADUATE SCHOOL OF SCIENCES AND ENGINEERING
dc.contributor.schoolcollegeinstituteLaboratory
dc.date.accessioned2025-03-06T20:58:35Z
dc.date.issued2024
dc.description.abstractMolecular 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 MoPC*. MC simulation results demonstrate the effectiveness of the proposed methods. © 2014 IEEE.
dc.description.indexedbyScopus
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.sponsorshipThis work was supported in part by the AXA Research Fund (AXA Chair for Internet of Everything at Ko\u00E7 University).
dc.identifier.doi10.1109/TMBMC.2024.3476197
dc.identifier.grantnoAXA Research Fund, AXA
dc.identifier.issn2332-7804
dc.identifier.quartileN/A
dc.identifier.scopus2-s2.0-85207403279
dc.identifier.urihttps://doi.org/10.1109/TMBMC.2024.3476197
dc.identifier.urihttps://hdl.handle.net/20.500.14288/27504
dc.keywordsArithmetic coding
dc.keywordsData compression
dc.keywordsMolecular communication (MC)
dc.keywordsPrefix coding
dc.keywordsRun-length-limited coding
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.ispartofIEEE Transactions on Molecular, Biological, and Multi-Scale Communications
dc.subjectElectrical and electronics engineering
dc.titleMolecular Arithmetic Coding (MoAC) and Optimized Molecular Prefix Coding (MoPC*) for Diffusion-Based molecular communication
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorAkan, Özgür Barış
local.contributor.kuauthorOrtlek, Beyza Ezgi
local.contributor.kuauthorŞahin, Melih
local.publication.orgunit1College of Engineering
local.publication.orgunit1GRADUATE SCHOOL OF SCIENCES AND ENGINEERING
local.publication.orgunit1Laboratory
local.publication.orgunit2Department of Electrical and Electronics Engineering
local.publication.orgunit2Next Generation and Wireless Communication Laboratory
local.publication.orgunit2Graduate School of Sciences and Engineering
relation.isOrgUnitOfPublication21598063-a7c5-420d-91ba-0cc9b2db0ea0
relation.isOrgUnitOfPublicationa5d3121b-8789-4c71-84d3-12bf643bfef9
relation.isOrgUnitOfPublication3fc31c89-e803-4eb1-af6b-6258bc42c3d8
relation.isOrgUnitOfPublication.latestForDiscovery21598063-a7c5-420d-91ba-0cc9b2db0ea0
relation.isParentOrgUnitOfPublication8e756b23-2d4a-4ce8-b1b3-62c794a8c164
relation.isParentOrgUnitOfPublication434c9663-2b11-4e66-9399-c863e2ebae43
relation.isParentOrgUnitOfPublication20385dee-35e7-484b-8da6-ddcc08271d96
relation.isParentOrgUnitOfPublication.latestForDiscovery8e756b23-2d4a-4ce8-b1b3-62c794a8c164

Files