Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 7 Mar 2024 in cs.IT and math.IT

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 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. M. Kuscu, E. Dinc, B. A. Bilgin, H. Ramezani, and O. B. Akan, “Transmitter and receiver architectures for molecular communications: A survey on physical design with modulation, coding, and detection techniques,” Proceedings of the IEEE, vol. 107, no. 7, pp. 1302–1341, 2019.
  2. B. Tepekule, A. E. Pusane, H. B. Yilmaz, C.-B. Chae, and T. Tugcu, “Isi mitigation techniques in molecular communication,” IEEE Transactions on Molecular, Biological and Multi-Scale Communications, vol. 1, no. 2, pp. 202–216, 2015.
  3. H. Hyun, C. Lee, M. Wen, S.-H. Kim, and C.-B. Chae, “Isi-mitigating character encoding for molecular communications via diffusion,” IEEE Wireless Communications Letters, pp. 1–1, 2023.
  4. P. Hofmann, J. A. Cabrera, R. Bassoli, M. Reisslein, and F. H. P. Fitzek, “Coding in diffusion-based molecular nanonetworks: A comprehensive survey,” IEEE Access, vol. 11, pp. 16 411–16 465, 2023.
  5. P.-J. Shih, C. han Lee, P.-C. Yeh, and K.-C. Chen, “Channel codes for reliability enhancement in molecular communication,” IEEE Journal on Selected Areas in Communications, vol. 31, pp. 857–867, 2013.
  6. M. Kuran, H. B. Yilmaz, T. Tugcu, and I. Akyildiz, “Modulation techniques for communication via diffusion in nanonetworks,” 12 2013.
  7. R. W. Hamming, “Error detecting and error correcting codes,” The Bell System Technical Journal, vol. 29, no. 2, pp. 147–160, 1950.
  8. C. Bai, M. S. Leeson, and M. D. Higgins, “Minimum energy channel codes for molecular communications,” Electronics Letters, vol. 50, no. 23, pp. 1669–1671, 2014.
  9. Y. Lu, M. D. Higgins, and M. S. Leeson, “Self-orthogonal convolutional codes (soccs) for diffusion-based molecular communication systems,” in 2015 IEEE International Conference on Communications (ICC), 2015, pp. 1049–1053.
  10. A. O. Kislal, B. C. Akdeniz, C. Lee, A. E. Pusane, T. Tugcu, and C.-B. Chae, “Isi-mitigating channel codes for molecular communication via diffusion,” IEEE Access, vol. 8, pp. 24 588–24 599, 2020.
  11. D. A. Huffman, “A method for the construction of minimum-redundancy codes,” Proceedings of the IRE, vol. 40, no. 9, pp. 1098–1101, 1952.
  12. J. J. Rissanen, “Generalized kraft inequality and arithmetic coding,” IBM Journal of Research and Development, vol. 20, no. 3, pp. 198–203, 1976.
  13. A. Shahbahrami, R. Bahrampour, M. S. Rostami, and M. A. Mobarhan, “Evaluation of huffman and arithmetic algorithms for multimedia compression standards,” CoRR, vol. abs/1109.0216, 2011. [Online]. Available: http://arxiv.org/abs/1109.0216
  14. M. Hosseini, D. Pratas, and A. Pinho, “A survey on data compression methods for biological sequences,” information, MDPI, vol. 7, p. 56, 10.
  15. F. Hach, I. Numanagic, and C. Sahinalp, “Deez: Reference-based compression by local assembly,” Nature methods, vol. 11, pp. 1082–4, 10 2014.
  16. D. Cao, T. Dix, L. Allison, and C. Mears, “A simple statistical algorithm for biological sequence compression,” 01 2007, pp. 43–52.
  17. S. Grumbach and F. Tahi, “A new challenge for compression algorithms: Genetic sequences,” Information Processing & Management, vol. 30, no. 6, pp. 875–886, 1994.
  18. A. J. Pinho, D. Pratas, and S. P. Garcia, “GReEn: a tool for efficient compression of genome resequencing data,” Nucleic Acids Research, vol. 40, no. 4, pp. e27–e27, 12 2011.
  19. I. Ochoa, M. Hernaez, and T. Weissman, “iDoComp: a compression scheme for assembled genomes,” Bioinformatics, vol. 31, no. 5, pp. 626–633, 10 2014.
  20. A. Pinho and D. Pratas, “Mfcompress: a compression tool for fasta and multi-fasta data,” Bioinformatics (Oxford, England), vol. 30, 10 2013.
  21. L. Roguski and S. Deorowicz, “Dsrc 2–industry-oriented compression of fastq files,” Bioinformatics (Oxford, England), vol. 30, no. 15, p. 2213—2215, August 2014.
  22. D. Jones, W. Ruzzo, P. Xinxia, and M. Katze, “Compression of next-generation sequencing reads aided by highly efficient,” Nucleic acids research, vol. 40, 08 2012.
  23. J. Bonfield and M. Mahoney, “Compression of fastq and sam format sequencing data,” PloS one, vol. 8, p. e59190, 03 2013.
  24. S. Grabowski, S. Deorowicz, and L. Roguski, “Disk-based compression of data from genome sequencing,” Bioinformatics, vol. 31, no. 9, pp. 1389–1395, 12 2014.
  25. H. B. Yilmaz, A. C. Heren, T. Tugcu, and C.-B. Chae, “Three-dimensional channel characteristics for molecular communications with an absorbing receiver,” IEEE Communications Letters, vol. 18, no. 6, pp. 929–932, 2014.
  26. P. Bradford, M. J. Golin, L. L. Larmore, and W. Rytter, “Optimal prefix-free codes for unequal letter costs: Dynamic programming with the monge property,” Journal of Algorithms, vol. 42, no. 2, pp. 277–303, 2002.
  27. H. B. Yilmaz, “Molecular communication (mucin) simulator matlab central file exchange. 2020.” [Online]. Available: https://www.mathworks.com/matlabcentral/fileexchange/46066-molecular-communication-mucin-simulator

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now