基于试验台的SISO分子通信通道接收器优化

Pit Hofmann, J. T. Gómez, F. Dressler, F. Fitzek
{"title":"基于试验台的SISO分子通信通道接收器优化","authors":"Pit Hofmann, J. T. Gómez, F. Dressler, F. Fitzek","doi":"10.1109/BalkanCom55633.2022.9900720","DOIUrl":null,"url":null,"abstract":"When conceiving molecular communication (MC) systems, it is of utmost importance to determine the threshold value for decoding bits and producing the smaller bit error rate (BER). At this optimum, the BER has the smallest value, and errors in the reception can be minimized, thereby improving the minimal throughput of molecular means. Despite its importance, prior research still presents little applicability and insights obtaining the optimal threshold for real testbeds. Filling this gap, in this paper, we feature a low-complex algorithm for the optimal threshold in single-input single-output (SISO) testbeds. Using a self-adaptive method, we assess a threshold close to the optimal, whereas the BER results are close to the minimum achievable. Furthermore, we show that for real existing molecular communication systems, an optimum can also be determined with respect to the BER. The BER can thus be reduced by up to 90 %.","PeriodicalId":114443,"journal":{"name":"2022 International Balkan Conference on Communications and Networking (BalkanCom)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Testbed-based Receiver Optimization for SISO Molecular Communication Channels\",\"authors\":\"Pit Hofmann, J. T. Gómez, F. Dressler, F. Fitzek\",\"doi\":\"10.1109/BalkanCom55633.2022.9900720\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When conceiving molecular communication (MC) systems, it is of utmost importance to determine the threshold value for decoding bits and producing the smaller bit error rate (BER). At this optimum, the BER has the smallest value, and errors in the reception can be minimized, thereby improving the minimal throughput of molecular means. Despite its importance, prior research still presents little applicability and insights obtaining the optimal threshold for real testbeds. Filling this gap, in this paper, we feature a low-complex algorithm for the optimal threshold in single-input single-output (SISO) testbeds. Using a self-adaptive method, we assess a threshold close to the optimal, whereas the BER results are close to the minimum achievable. Furthermore, we show that for real existing molecular communication systems, an optimum can also be determined with respect to the BER. The BER can thus be reduced by up to 90 %.\",\"PeriodicalId\":114443,\"journal\":{\"name\":\"2022 International Balkan Conference on Communications and Networking (BalkanCom)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Balkan Conference on Communications and Networking (BalkanCom)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BalkanCom55633.2022.9900720\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Balkan Conference on Communications and Networking (BalkanCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BalkanCom55633.2022.9900720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在构思分子通信(MC)系统时,确定解码位的阈值并产生较小的误码率(BER)至关重要。在这个最优值下,误码率最小,接收误差可以最小化,从而提高分子手段的最小吞吐量。尽管它很重要,但先前的研究仍然缺乏适用性和见解,无法获得实际测试平台的最佳阈值。为了填补这一空白,在本文中,我们采用了一种低复杂度的算法,用于单输入单输出(SISO)测试平台的最优阈值。使用自适应方法,我们评估接近最优的阈值,而误码率结果接近可实现的最小值。此外,我们还表明,对于实际存在的分子通信系统,也可以根据误码率确定最优。因此,误码率可以减少高达90%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Testbed-based Receiver Optimization for SISO Molecular Communication Channels
When conceiving molecular communication (MC) systems, it is of utmost importance to determine the threshold value for decoding bits and producing the smaller bit error rate (BER). At this optimum, the BER has the smallest value, and errors in the reception can be minimized, thereby improving the minimal throughput of molecular means. Despite its importance, prior research still presents little applicability and insights obtaining the optimal threshold for real testbeds. Filling this gap, in this paper, we feature a low-complex algorithm for the optimal threshold in single-input single-output (SISO) testbeds. Using a self-adaptive method, we assess a threshold close to the optimal, whereas the BER results are close to the minimum achievable. Furthermore, we show that for real existing molecular communication systems, an optimum can also be determined with respect to the BER. The BER can thus be reduced by up to 90 %.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Architecture of MySQL Storage Engines to Increase the Resource Utilization Molecular Communication Transmitter Architectures for the Internet of Bio-Nano Things Markov Model Based Traffic Classification with Multiple Features Statistical Modeling of Sand and Dust Storm Attenuation Calibrated Probabilistic QoT Regression for Unestablished Lightpaths in Optical Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1