Pub Date : 2023-09-01DOI: 10.1587/transcom.2022ebp3145
Keigo AKAHOSHI, Eiji OKI
This paper investigates a service deployment model for network function virtualization which handles per-flow priority to minimize the deployment cost. Service providers need to implement network services each of which consists of one or more virtual network functions (VNFs) with satisfying requirements of service delays. In our previous work, we studied the service deployment model with per-host priority; flows belonging to the same service, for the same VNF, and handled on the same host have the same priority. We formulated the model as an optimization problem, and developed a heuristic algorithm named FlexSize to solve it in practical time. In this paper, we address per-flow priority, in which flows of the same service, VNF, and host have different priorities. In addition, we expand FlexSize to handle per-flow priority. We evaluate per-flow and per-host priorities, and the numerical results show that per-flow priority reduces deployment cost compared with per-host priority.
{"title":"Service Deployment Model with Virtual Network Function Resizing Based on Per-Flow Priority","authors":"Keigo AKAHOSHI, Eiji OKI","doi":"10.1587/transcom.2022ebp3145","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3145","url":null,"abstract":"This paper investigates a service deployment model for network function virtualization which handles per-flow priority to minimize the deployment cost. Service providers need to implement network services each of which consists of one or more virtual network functions (VNFs) with satisfying requirements of service delays. In our previous work, we studied the service deployment model with per-host priority; flows belonging to the same service, for the same VNF, and handled on the same host have the same priority. We formulated the model as an optimization problem, and developed a heuristic algorithm named FlexSize to solve it in practical time. In this paper, we address per-flow priority, in which flows of the same service, VNF, and host have different priorities. In addition, we expand FlexSize to handle per-flow priority. We evaluate per-flow and per-host priorities, and the numerical results show that per-flow priority reduces deployment cost compared with per-host priority.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135944513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-01DOI: 10.1587/transcom.2022ebp3171
KENGO TAJIRI, RYOICHI KAWAHARA, YOICHI MATSUO
Machine learning (ML) has been used for various tasks in network operations in recent years. However, since the scale of networks has grown and the amount of data generated has increased, it has been increasingly difficult for network operators to conduct their tasks with a single server using ML. Thus, ML with edge-cloud cooperation has been attracting attention for efficiently processing and analyzing a large amount of data. In the edge-cloud cooperation setting, although transmission latency, bandwidth congestion, and accuracy of tasks using ML depend on the load balance of processing data with edge servers and a cloud server in edge-cloud cooperation, the relationship is too complex to estimate. In this paper, we focus on monitoring anomalous traffic as an example of ML tasks for network operations and formulate transmission latency, bandwidth congestion, and the accuracy of the task with edge-cloud cooperation considering the ratio of the amount of data preprocessed in edge servers to that in a cloud server. Moreover, we formulate an optimization problem under constraints for transmission latency and bandwidth congestion to select the proper ratio by using our formulation. By solving our optimization problem, the optimal load balance between edge servers and a cloud server can be selected, and the accuracy of anomalous traffic monitoring can be estimated. Our formulation and optimization framework can be used for other ML tasks by considering the generating distribution of data and the type of an ML model. In accordance with our formulation, we simulated the optimal load balance of edge-cloud cooperation in a topology that mimicked a Japanese network and conducted an anomalous traffic detection experiment by using real traffic data to compare the estimated accuracy based on our formulation and the actual accuracy based on the experiment.
{"title":"Optimizing Edge-Cloud Cooperation for Machine Learning Accuracy Considering Transmission Latency and Bandwidth Congestion","authors":"KENGO TAJIRI, RYOICHI KAWAHARA, YOICHI MATSUO","doi":"10.1587/transcom.2022ebp3171","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3171","url":null,"abstract":"Machine learning (ML) has been used for various tasks in network operations in recent years. However, since the scale of networks has grown and the amount of data generated has increased, it has been increasingly difficult for network operators to conduct their tasks with a single server using ML. Thus, ML with edge-cloud cooperation has been attracting attention for efficiently processing and analyzing a large amount of data. In the edge-cloud cooperation setting, although transmission latency, bandwidth congestion, and accuracy of tasks using ML depend on the load balance of processing data with edge servers and a cloud server in edge-cloud cooperation, the relationship is too complex to estimate. In this paper, we focus on monitoring anomalous traffic as an example of ML tasks for network operations and formulate transmission latency, bandwidth congestion, and the accuracy of the task with edge-cloud cooperation considering the ratio of the amount of data preprocessed in edge servers to that in a cloud server. Moreover, we formulate an optimization problem under constraints for transmission latency and bandwidth congestion to select the proper ratio by using our formulation. By solving our optimization problem, the optimal load balance between edge servers and a cloud server can be selected, and the accuracy of anomalous traffic monitoring can be estimated. Our formulation and optimization framework can be used for other ML tasks by considering the generating distribution of data and the type of an ML model. In accordance with our formulation, we simulated the optimal load balance of edge-cloud cooperation in a topology that mimicked a Japanese network and conducted an anomalous traffic detection experiment by using real traffic data to compare the estimated accuracy based on our formulation and the actual accuracy based on the experiment.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135944514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-08-01DOI: 10.1587/transcom.2022ebp3169
Guosheng Zhao, Yang Wang, Jian Wang
Internet of Things (IoT) devices are widely used in various fields. However, their limited computing resources make them extremely vulnerable and difficult to be effectively protected. Traditional intrusion detection systems (IDS) focus on high accuracy and low false alarm rate (FAR), making them often have too high spatiotemporal complexity to be deployed in IoT devices. In response to the above problems, this paper proposes an intrusion detection model of IoT based on the light gradient boosting machine (LightGBM). Firstly, the one-dimensional convolutional neural network (CNN) is used to extract features from network traffic to reduce the feature dimensions. Then, the LightGBM is used for classification to detect the type of network traffic belongs. The LightGBM is more lightweight on the basis of inheriting the advantages of the gradient boosting tree. The LightGBM has a faster decision tree construction process. Experiments on the TON-IoT and BoT-IoT datasets show that the proposed model has stronger performance and more lightweight than the comparison models. The proposed model can shorten the prediction time by 90.66% and is better than the comparison models in accuracy and other performance metrics. The proposed model has strong detection capability for denial of service (DoS) and distributed denial of service (DDoS) attacks. Experimental results on the testbed built with IoT devices such as Raspberry Pi show that the proposed model can perform effective and real-time intrusion detection on IoT devices.
{"title":"Intrusion Detection Model of Internet of Things Based on LightGBM","authors":"Guosheng Zhao, Yang Wang, Jian Wang","doi":"10.1587/transcom.2022ebp3169","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3169","url":null,"abstract":"Internet of Things (IoT) devices are widely used in various fields. However, their limited computing resources make them extremely vulnerable and difficult to be effectively protected. Traditional intrusion detection systems (IDS) focus on high accuracy and low false alarm rate (FAR), making them often have too high spatiotemporal complexity to be deployed in IoT devices. In response to the above problems, this paper proposes an intrusion detection model of IoT based on the light gradient boosting machine (LightGBM). Firstly, the one-dimensional convolutional neural network (CNN) is used to extract features from network traffic to reduce the feature dimensions. Then, the LightGBM is used for classification to detect the type of network traffic belongs. The LightGBM is more lightweight on the basis of inheriting the advantages of the gradient boosting tree. The LightGBM has a faster decision tree construction process. Experiments on the TON-IoT and BoT-IoT datasets show that the proposed model has stronger performance and more lightweight than the comparison models. The proposed model can shorten the prediction time by 90.66% and is better than the comparison models in accuracy and other performance metrics. The proposed model has strong detection capability for denial of service (DoS) and distributed denial of service (DDoS) attacks. Experimental results on the testbed built with IoT devices such as Raspberry Pi show that the proposed model can perform effective and real-time intrusion detection on IoT devices.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134984313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1587/transcom.2022cep0004
Issei Makino, Junji Terai, N. Miki
{"title":"Small-Scale Demonstration of Remote Control of Patrol and Work Robot with Arms Employing Local 5G System","authors":"Issei Makino, Junji Terai, N. Miki","doi":"10.1587/transcom.2022cep0004","DOIUrl":"https://doi.org/10.1587/transcom.2022cep0004","url":null,"abstract":"","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"11 1","pages":"101-108"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72817581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1587/transcom.2023ebp3001
Megumi A Asada, Nobuhide Nonaka, K. Higuchi
SUMMARY We propose an e ffi cient hybrid automatic repeat request (HARQ) method that simultaneously achieves packet combining and resolution of the collisions of random access identifiers (RAIDs) during re-transmission in a non-orthogonal multiple access (NOMA)-based random access system. Here, the RAID functions as a separator for simultaneously received packets that use the same channel in NOMA. An example of this is a scrambling code used in 4G and 5G systems. Since users independently select a RAID from the candidate set prepared by the system, the decoding of received packets fails when multiple users select the same RAID. Random RAID reselection by each user when attempting retrans-mission can resolve a RAID collision; however, packet combining between the previous and retransmitted packets is not possible in this case because the base station receiver does not know the relationship between the RAID of the previously transmitted packet and that of the retransmitted packet. To address this problem, we propose a HARQ method that employs novel hierarchical tree-structured RAID groups in which the RAID for the previous packet transmission has a one-to-one relationship with the set of RAIDs for retransmission. The proposed method resolves RAID collisions at retrans-mission by randomly reselecting for each user a RAID from the dedicated RAID set from the previous transmission. Since the relationship between the RAIDs at the previous transmission and retransmission is known at the base station, packet combining is achieved simultaneously. Computer simulation results show the e ff ectiveness of the proposed method.
{"title":"HARQ Using Hierarchical Tree-Structured Random Access Identifiers in NOMA-Based Random Access","authors":"Megumi A Asada, Nobuhide Nonaka, K. Higuchi","doi":"10.1587/transcom.2023ebp3001","DOIUrl":"https://doi.org/10.1587/transcom.2023ebp3001","url":null,"abstract":"SUMMARY We propose an e ffi cient hybrid automatic repeat request (HARQ) method that simultaneously achieves packet combining and resolution of the collisions of random access identifiers (RAIDs) during re-transmission in a non-orthogonal multiple access (NOMA)-based random access system. Here, the RAID functions as a separator for simultaneously received packets that use the same channel in NOMA. An example of this is a scrambling code used in 4G and 5G systems. Since users independently select a RAID from the candidate set prepared by the system, the decoding of received packets fails when multiple users select the same RAID. Random RAID reselection by each user when attempting retrans-mission can resolve a RAID collision; however, packet combining between the previous and retransmitted packets is not possible in this case because the base station receiver does not know the relationship between the RAID of the previously transmitted packet and that of the retransmitted packet. To address this problem, we propose a HARQ method that employs novel hierarchical tree-structured RAID groups in which the RAID for the previous packet transmission has a one-to-one relationship with the set of RAIDs for retransmission. The proposed method resolves RAID collisions at retrans-mission by randomly reselecting for each user a RAID from the dedicated RAID set from the previous transmission. Since the relationship between the RAIDs at the previous transmission and retransmission is known at the base station, packet combining is achieved simultaneously. Computer simulation results show the e ff ectiveness of the proposed method.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"47 1","pages":"696-704"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76182195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1587/transcom.2022ebp3022
H. Saito
SUMMARY When a disaster hits a network, network service disruptions can occur even if the network facilities have survived and battery and power generators are provided. This is because in the event of a disaster, the power supply will not be restarted within the lifetime of the battery or oil transportation will not be restarted before running out of oil and power will be running out. Therefore, taking a power grid into account is important. This paper proposes a polynomial-time algorithm to identify the critical location C ∗ D of a communications network N c when a disaster hits. Electrical power grid N p supplies power to the nodes of N c , and a link in N c is disconnected when a node or a link in N c or N p fails. Here, the disaster area is modeled as co-centric disks and the failure probability is higher in the inner disk than the outer one. The location of the center of the disaster with the greatest expected number of disconnected links in N c is taken as the critical location C ∗ D . key words: disaster, critical location, network failure, cascading failure, power grid
{"title":"Critical Location of Communications Network with Power Grid Power Supply","authors":"H. Saito","doi":"10.1587/transcom.2022ebp3022","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3022","url":null,"abstract":"SUMMARY When a disaster hits a network, network service disruptions can occur even if the network facilities have survived and battery and power generators are provided. This is because in the event of a disaster, the power supply will not be restarted within the lifetime of the battery or oil transportation will not be restarted before running out of oil and power will be running out. Therefore, taking a power grid into account is important. This paper proposes a polynomial-time algorithm to identify the critical location C ∗ D of a communications network N c when a disaster hits. Electrical power grid N p supplies power to the nodes of N c , and a link in N c is disconnected when a node or a link in N c or N p fails. Here, the disaster area is modeled as co-centric disks and the failure probability is higher in the inner disk than the outer one. The location of the center of the disaster with the greatest expected number of disconnected links in N c is taken as the critical location C ∗ D . key words: disaster, critical location, network failure, cascading failure, power grid","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"104 1","pages":"166-173"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87772975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1587/transcom.2023ebp3075
Eiku ANDO, Yukitoshi SANADA
This paper proposes user equipment (UE) grouping schemes and evaluates the performance of a scheduling scheme for each formed group in collaborative multiple-input multiple-output (MIMO) reception. In previous research, the criterion for UE grouping and the effects of group scheduling has never been presented. In the UE grouping scheme, two criteria, the base station (BS)-oriented one and the UE-oriented one, are presented. The BS-oriented full search scheme achieves ideal performance though it requires knowledge of the relative positions of all UEs. Therefore, the UE-oriented local search scheme is also proposed. As the scheduling scheme, proportional fairness scheduling is used in resource allocation for each formed group. When the number of total UEs increases, the difference in the number of UEs among groups enlarges. Numerical results obtained through computer simulation show that the throughput per user increases and the fairness among users decreases when the number of UEs in a cell increases in the proposed schemes compared to those of the conventional scheme.
{"title":"Performance of Collaborative MIMO Reception with User Grouping Schemes","authors":"Eiku ANDO, Yukitoshi SANADA","doi":"10.1587/transcom.2023ebp3075","DOIUrl":"https://doi.org/10.1587/transcom.2023ebp3075","url":null,"abstract":"This paper proposes user equipment (UE) grouping schemes and evaluates the performance of a scheduling scheme for each formed group in collaborative multiple-input multiple-output (MIMO) reception. In previous research, the criterion for UE grouping and the effects of group scheduling has never been presented. In the UE grouping scheme, two criteria, the base station (BS)-oriented one and the UE-oriented one, are presented. The BS-oriented full search scheme achieves ideal performance though it requires knowledge of the relative positions of all UEs. Therefore, the UE-oriented local search scheme is also proposed. As the scheduling scheme, proportional fairness scheduling is used in resource allocation for each formed group. When the number of total UEs increases, the difference in the number of UEs among groups enlarges. Numerical results obtained through computer simulation show that the throughput per user increases and the fairness among users decreases when the number of UEs in a cell increases in the proposed schemes compared to those of the conventional scheme.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135104539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1587/transcom.2023cep0002
Satoshi YONEDA, Akihito KOBAYASHI, Eiji TANIGUCHI
An ESL-cancelling circuit for a shunt-connected film capacitor filter using vertically stacked coupled square loops is reported in this paper. The circuit is applicable for a shunt-connected capacitor filter whose equivalent series inductance (ESL) of the shunt-path causes deterioration of filter performance at frequencies above the self-resonant frequency. Two pairs of vertically stacked magnetically coupled square loops are used in the circuit those can equivalently add negative inductance in series to the shunt-path to cancel ESL for improvement of the filter performance. The ESL-cancelling circuit for a 1-μF film capacitor was designed according to the Biot-Savart law and electromagnetic (EM)-analysis, and the prototype was fabricated with an FR4 substrate. The measured result showed 20-dB improvement of the filter performance above the self-resonant frequency as designed, satisfying Sdd21 less than -40 dB at 1 MHz to 100 MHz. This result is almost equivalent to reduce ESL of the shunt-path to less than 1 nH at 100 MHz and is also difficult to realize using any kind of a single bulky film capacitor without cancelling ESL.
{"title":"An ESL-Cancelling Circuit for a Shunt-Connected Film Capacitor Filter Using Vertically Stacked Coupled Square Loops","authors":"Satoshi YONEDA, Akihito KOBAYASHI, Eiji TANIGUCHI","doi":"10.1587/transcom.2023cep0002","DOIUrl":"https://doi.org/10.1587/transcom.2023cep0002","url":null,"abstract":"An ESL-cancelling circuit for a shunt-connected film capacitor filter using vertically stacked coupled square loops is reported in this paper. The circuit is applicable for a shunt-connected capacitor filter whose equivalent series inductance (ESL) of the shunt-path causes deterioration of filter performance at frequencies above the self-resonant frequency. Two pairs of vertically stacked magnetically coupled square loops are used in the circuit those can equivalently add negative inductance in series to the shunt-path to cancel ESL for improvement of the filter performance. The ESL-cancelling circuit for a 1-μF film capacitor was designed according to the Biot-Savart law and electromagnetic (EM)-analysis, and the prototype was fabricated with an FR4 substrate. The measured result showed 20-dB improvement of the filter performance above the self-resonant frequency as designed, satisfying Sdd21 less than -40 dB at 1 MHz to 100 MHz. This result is almost equivalent to reduce ESL of the shunt-path to less than 1 nH at 100 MHz and is also difficult to realize using any kind of a single bulky film capacitor without cancelling ESL.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135357285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1587/transcom.2023pnp0003
Ryuta SHIRAKI, Yojiro MORI, Hiroshi HASEGAWA
We propose a demodulation framework to extend the maximum distance of unrepeated transmission systems, where the simplest back propagation (BP), polarization and phase recovery, data arrangement for machine learning (ML), and symbol decision based on ML are rationally combined. The deterministic waveform distortion caused by fiber nonlinearity and chromatic dispersion is partially eliminated by BP whose calculation cost is minimized by adopting the single-step Fourier method in a pre-processing step. The non-deterministic waveform distortion, i.e., polarization and phase fluctuations, can be eliminated in a precise manner. Finally, the optimized ML model conducts the symbol decision under the influence of residual deterministic waveform distortion that cannot be cancelled by the simplest BP. Extensive numerical simulations confirm that a DP-16QAM signal can be transmitted over 240 km of a standard single-mode fiber without optical repeaters. The maximum transmission distance is extended by 25 km.
{"title":"Demodulation framework based on machine learning for unrepeated transmission systems","authors":"Ryuta SHIRAKI, Yojiro MORI, Hiroshi HASEGAWA","doi":"10.1587/transcom.2023pnp0003","DOIUrl":"https://doi.org/10.1587/transcom.2023pnp0003","url":null,"abstract":"We propose a demodulation framework to extend the maximum distance of unrepeated transmission systems, where the simplest back propagation (BP), polarization and phase recovery, data arrangement for machine learning (ML), and symbol decision based on ML are rationally combined. The deterministic waveform distortion caused by fiber nonlinearity and chromatic dispersion is partially eliminated by BP whose calculation cost is minimized by adopting the single-step Fourier method in a pre-processing step. The non-deterministic waveform distortion, i.e., polarization and phase fluctuations, can be eliminated in a precise manner. Finally, the optimized ML model conducts the symbol decision under the influence of residual deterministic waveform distortion that cannot be cancelled by the simplest BP. Extensive numerical simulations confirm that a DP-16QAM signal can be transmitted over 240 km of a standard single-mode fiber without optical repeaters. The maximum transmission distance is extended by 25 km.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135402680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：