{"title":"Near-Optimal Detection of TAST Codes Over Multimode Optical Fiber Channels","authors":"M. O. Damen, G. R. Othman","doi":"10.1109/COMNET.2018.8622301","DOIUrl":null,"url":null,"abstract":"In this work we propose a new low-complexity, essentially optimal detection algorithm for n × n TAST codes over n-mode optical fiber channels with Mode-Dependent Loss (MDL). Our algorithm is derived from the analysis of the Orthogonality Defect Factor (ODF) of the equivalent channel matrix where we derive its closed-form expression for general n as well as characterize its statistical properties. Using the ODF properties allows us to modify the detection algorithm such that it still achieves essentially optimal performance but at a much smaller cost than exhaustive or sphere decoding algorithms. The theoretical results are validated by simulations.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Seventh International Conference on Communications and Networking (ComNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMNET.2018.8622301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this work we propose a new low-complexity, essentially optimal detection algorithm for n × n TAST codes over n-mode optical fiber channels with Mode-Dependent Loss (MDL). Our algorithm is derived from the analysis of the Orthogonality Defect Factor (ODF) of the equivalent channel matrix where we derive its closed-form expression for general n as well as characterize its statistical properties. Using the ODF properties allows us to modify the detection algorithm such that it still achieves essentially optimal performance but at a much smaller cost than exhaustive or sphere decoding algorithms. The theoretical results are validated by simulations.
在这项工作中,我们提出了一种新的低复杂度、本质上最优的n × n TAST码检测算法,该算法适用于具有模式相关损耗(MDL)的n模光纤信道。我们的算法是从等效信道矩阵的正交缺陷因子(ODF)的分析中推导出来的,我们推导了它对一般n的封闭形式表达式,并表征了它的统计性质。使用ODF属性允许我们修改检测算法,这样它仍然可以获得本质上最优的性能,但成本比穷尽或球面解码算法要小得多。通过仿真验证了理论结果。