Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798824
Van-Hao Le, T. Pham, Dinh-Nghiep Le
Feature indexing is a critical technique for addressing real-time image matching and retrieval. In this work, we propose a novel quantization method that is capable of creating highly accurate quantized codes for a given feature database. Differing from many quantization techniques in the literature (typically, product quantization based methods), the proposed method is designed to reshape the feature vectors so that close points are placed into a small sub-space. To this aim, a hierarchical product quantization method is presented. In its essence, the first level of quantization aims at reordering the dimensions so as to exploit better the correlation among subspaces. The second level of quantization is then invoked to create a sub-quantizer for the points contained in each sub-space. To validate the proposed method, various experiments have been conducted, demonstrating quite impressive performance when compared with other state-of-the-art methods.
{"title":"Hierarchical product quantization for effective feature indexing","authors":"Van-Hao Le, T. Pham, Dinh-Nghiep Le","doi":"10.1109/ICT.2019.8798824","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798824","url":null,"abstract":"Feature indexing is a critical technique for addressing real-time image matching and retrieval. In this work, we propose a novel quantization method that is capable of creating highly accurate quantized codes for a given feature database. Differing from many quantization techniques in the literature (typically, product quantization based methods), the proposed method is designed to reshape the feature vectors so that close points are placed into a small sub-space. To this aim, a hierarchical product quantization method is presented. In its essence, the first level of quantization aims at reordering the dimensions so as to exploit better the correlation among subspaces. The second level of quantization is then invoked to create a sub-quantizer for the points contained in each sub-space. To validate the proposed method, various experiments have been conducted, demonstrating quite impressive performance when compared with other state-of-the-art methods.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127128046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798793
A. Gelgor, V. Nguyen
In the paper, we compared spectral efficiency between OFDM signals, reputed SEFDM signals, and recently proposed RRC-SEFDM and PR-SEFDM signals. The last three are different types of signals with non-orthogonal frequency division multiplexing, i.e. signals with intersymbol interference (ISI). All signals were modulated with QPSK and 16-QAM. For signals with ISI demodulation was performed by the suboptimal M-BCJR algorithm with $M=8$ paths survived at each step. For construction PR-SEFDM signals we used optimal spectral pulses with length $L = 12$ taps. The simulation results were shown that, at first, the maximum gain in spectral efficiency is achieved only with simultaneous introducing ISI and increasing the size of signal constellation. At second, PR-SEFDM signals with optimal spectral pulses provide a significant gain in spectral efficiency with respect to SEFDM signals and RRC-SEFDM signals at fixed energy consumptions and fixed complexity of the demodulation algorithm. Also, for QPSK and 16-QAM, with respect to OFDM signals our proposed PR-SEFDM signals provide up to 27% gain in spectral efficiency by additional expenses up to 0.6 and 1.3 dB respectively.
{"title":"Outperforming Conventional OFDM and SEFDM Signals by Means of Using Optimal Spectral Pulses and the M-BCJR Algorithm","authors":"A. Gelgor, V. Nguyen","doi":"10.1109/ICT.2019.8798793","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798793","url":null,"abstract":"In the paper, we compared spectral efficiency between OFDM signals, reputed SEFDM signals, and recently proposed RRC-SEFDM and PR-SEFDM signals. The last three are different types of signals with non-orthogonal frequency division multiplexing, i.e. signals with intersymbol interference (ISI). All signals were modulated with QPSK and 16-QAM. For signals with ISI demodulation was performed by the suboptimal M-BCJR algorithm with $M=8$ paths survived at each step. For construction PR-SEFDM signals we used optimal spectral pulses with length $L = 12$ taps. The simulation results were shown that, at first, the maximum gain in spectral efficiency is achieved only with simultaneous introducing ISI and increasing the size of signal constellation. At second, PR-SEFDM signals with optimal spectral pulses provide a significant gain in spectral efficiency with respect to SEFDM signals and RRC-SEFDM signals at fixed energy consumptions and fixed complexity of the demodulation algorithm. Also, for QPSK and 16-QAM, with respect to OFDM signals our proposed PR-SEFDM signals provide up to 27% gain in spectral efficiency by additional expenses up to 0.6 and 1.3 dB respectively.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125749049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798800
Adeola Omorinoye, Quoc-Tuan Vien, T. Le, P. Shah
Deice-to-Device (D2D) communications has attracted research interests as an emerging technology towards 5G and beyond cellular networks. In this paper, we investigate the power allocation in D2D underlaying cellular networks with uplink channel reuse. We first develop an optimization problem to minimize the total power consumption subject to peruser Quality-of-Service (QoS) constraints. A distributed power allocation algorithm is proposed to allocate the power for both D2D and cellular users by exploiting the property of strictly non-negative inverse of a Z-matrix. It is shown that the power allocated for users can be considerably saved for low QoS requirements, especially with a large number of D2D users. The proposed algorithm is validated through simulation to realize the impacts of noise power, distance between D2D users and the number of D2D pairs in the network.
{"title":"On the Resource Allocation for D2D Underlaying Uplink Cellular Networks","authors":"Adeola Omorinoye, Quoc-Tuan Vien, T. Le, P. Shah","doi":"10.1109/ICT.2019.8798800","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798800","url":null,"abstract":"Deice-to-Device (D2D) communications has attracted research interests as an emerging technology towards 5G and beyond cellular networks. In this paper, we investigate the power allocation in D2D underlaying cellular networks with uplink channel reuse. We first develop an optimization problem to minimize the total power consumption subject to peruser Quality-of-Service (QoS) constraints. A distributed power allocation algorithm is proposed to allocate the power for both D2D and cellular users by exploiting the property of strictly non-negative inverse of a Z-matrix. It is shown that the power allocated for users can be considerably saved for low QoS requirements, especially with a large number of D2D users. The proposed algorithm is validated through simulation to realize the impacts of noise power, distance between D2D users and the number of D2D pairs in the network.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128047731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798770
B. Thai, Anissa Zergaïnoh-Mokraoui
This paper discusses the appropriate choice of the Tone Mapped Quality Index (TMQI) parameters. The TMQI metric has been developed to evaluate and compare the visual quality of the Tone Mapped (TM) High Dynamic Range (HDR) images. However, the parameters of this metric have been adjusted on a specific and reduced set of Tone Mapping Operators (TMO) and a restricted base of HDR images. The visual rendering evaluation of the TM images is then no longer consistent with the metric when new TMO (excluded from the initial training process) are used. To better adjust these parameters, discussions and experiments have been conducted on a large extension of the initial TMOs set and tone mapped HDR images dataset. The new parameters show a strong correlation between the revisited metric and the Mean Opinion Score (MOS).
{"title":"Performance Analysis of the Revisited Tone Mapped Quality Index for Tone Mapped HDR Images Evaluation","authors":"B. Thai, Anissa Zergaïnoh-Mokraoui","doi":"10.1109/ICT.2019.8798770","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798770","url":null,"abstract":"This paper discusses the appropriate choice of the Tone Mapped Quality Index (TMQI) parameters. The TMQI metric has been developed to evaluate and compare the visual quality of the Tone Mapped (TM) High Dynamic Range (HDR) images. However, the parameters of this metric have been adjusted on a specific and reduced set of Tone Mapping Operators (TMO) and a restricted base of HDR images. The visual rendering evaluation of the TM images is then no longer consistent with the metric when new TMO (excluded from the initial training process) are used. To better adjust these parameters, discussions and experiments have been conducted on a large extension of the initial TMOs set and tone mapped HDR images dataset. The new parameters show a strong correlation between the revisited metric and the Mean Opinion Score (MOS).","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125715680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798837
Thuy, M. Le, Phan Tran Truong, Trong Thuy Pham, Lap Pham Xuan, H. Ngo
A dual-polarized antenna element for 5G base station is investigated in this paper. The proposed element consists of two crossed printed dipoles and a power divider. To verify the designed antenna element, a prototype is fabricated and measured. The resonant frequency covers the spectrum allocation of 5G mobile network and the band from 3.2 GHz to 3.5 GHz.
{"title":"Novel Dual-Polarized 5G Base Station Antenna","authors":"Thuy, M. Le, Phan Tran Truong, Trong Thuy Pham, Lap Pham Xuan, H. Ngo","doi":"10.1109/ICT.2019.8798837","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798837","url":null,"abstract":"A dual-polarized antenna element for 5G base station is investigated in this paper. The proposed element consists of two crossed printed dipoles and a power divider. To verify the designed antenna element, a prototype is fabricated and measured. The resonant frequency covers the spectrum allocation of 5G mobile network and the band from 3.2 GHz to 3.5 GHz.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114512095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798855
Ji Zhou, Mengqi Guo, Yaojun Qiao, Haide Wang, Long Liu, Weiping Liu, Changyuan Yu, Jianping Li, Zhaohui Li
In recent years, faster-than-Nyquist (FTN) nonorthogonal systems draw more attention for high-capacity communication systems. In this paper, we will introduce digital signal processing for eliminating interference in FTN nonorthogonal systems. FTN non-orthogonal systems can be divided into single-carrier FTN (SC-FTN) and multi-carrier FTN (MC-FTN) non-orthogonal systems. In SC-FTN non-orthogonal systems, joint algorithms will be studied for compensating the serious inter-symbol interference, including joint feed-forward equalizer, post filter and maximum likelihood sequence detection (MLSD) algorithm and joint frequency-domain equalizer and MLSD algorithm. In MC-FTN non-orthogonal systems, intercarrier interference is similar to the interference in multiple input multiple output (MIMO) systems. The interference cancellation algorithm for MIMO systems is also effective for MC-FTN non-orthogonal systems. We will introduce MIMO decoding to eliminate the interference in MC-FTN non-orthogonal systems.
{"title":"Digital Signal Processing for Faster-than-Nyquist Non-Orthogonal Systems: An Overview","authors":"Ji Zhou, Mengqi Guo, Yaojun Qiao, Haide Wang, Long Liu, Weiping Liu, Changyuan Yu, Jianping Li, Zhaohui Li","doi":"10.1109/ICT.2019.8798855","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798855","url":null,"abstract":"In recent years, faster-than-Nyquist (FTN) nonorthogonal systems draw more attention for high-capacity communication systems. In this paper, we will introduce digital signal processing for eliminating interference in FTN nonorthogonal systems. FTN non-orthogonal systems can be divided into single-carrier FTN (SC-FTN) and multi-carrier FTN (MC-FTN) non-orthogonal systems. In SC-FTN non-orthogonal systems, joint algorithms will be studied for compensating the serious inter-symbol interference, including joint feed-forward equalizer, post filter and maximum likelihood sequence detection (MLSD) algorithm and joint frequency-domain equalizer and MLSD algorithm. In MC-FTN non-orthogonal systems, intercarrier interference is similar to the interference in multiple input multiple output (MIMO) systems. The interference cancellation algorithm for MIMO systems is also effective for MC-FTN non-orthogonal systems. We will introduce MIMO decoding to eliminate the interference in MC-FTN non-orthogonal systems.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124197618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798831
P. Banelli, G. Colavolpe, L. Rugini, A. Ugolini
This paper compares the spectral efficiency of some of the most popular multicarrier schemes proposed for the fifth generation (5G) of cellular systems, such as orthogonal frequency-division multiplexing (OFDM), filterbank multicarrier (FBMC), generalized frequency-division multiplexing (GFDM), and universal filtered multicarrier (UFMC). First, we propose a unified signal model valid for many multicarrier schemes. Second, we employ the mismatched detection theory, together with the unified signal model, to obtain closed-form achievable lower bounds on the channel capacity, conditioned on the multipath channel realization. Third, we numerically compare the achievable spectral efficiency (ASE) of OFDM, FBMC, GFDM and UFMC, in different multipath channel scenarios. Our analysis proves that the best (ASE-optimal) multicarrier scheme depends on the channel model and on the signal-to-noise ratio (SNR).
{"title":"Spectral Efficiency of Multicarrier Schemes for 5G","authors":"P. Banelli, G. Colavolpe, L. Rugini, A. Ugolini","doi":"10.1109/ICT.2019.8798831","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798831","url":null,"abstract":"This paper compares the spectral efficiency of some of the most popular multicarrier schemes proposed for the fifth generation (5G) of cellular systems, such as orthogonal frequency-division multiplexing (OFDM), filterbank multicarrier (FBMC), generalized frequency-division multiplexing (GFDM), and universal filtered multicarrier (UFMC). First, we propose a unified signal model valid for many multicarrier schemes. Second, we employ the mismatched detection theory, together with the unified signal model, to obtain closed-form achievable lower bounds on the channel capacity, conditioned on the multipath channel realization. Third, we numerically compare the achievable spectral efficiency (ASE) of OFDM, FBMC, GFDM and UFMC, in different multipath channel scenarios. Our analysis proves that the best (ASE-optimal) multicarrier scheme depends on the channel model and on the signal-to-noise ratio (SNR).","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132511753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798827
F. Alberge, Clément Feutry, P. Duhamel, P. Piantanida
Many Machine Learning algorithms aiming at classifying signals/images $X$ among a number of discrete labels $Y$ involve training instances, from which the predictor $P_{Yvert X}$ is extracted according to the data distribution $P_{Xvert Y}$. This predictor is later used to predict the appropriate label for other instances of $X$ that are hence assumed to be drawn from the same distribution. This is a fundamental requirement for many realworld applications, therefore it is of great importance to monitor the reliability of the classification provided by the algorithm based on the learned distributions, when the test set statistics differ from the training set ones. This paper makes a step in that direction by proposing a Black Box Shift Detector of the data evolution (covariate shift). ‘Black Box’ here means that it does not require any knowledge of the predictor's architecture. Experiments demonstrate accurate detection on different high-dimensional datasets of natural images.
{"title":"Detecting Covariate Shift with Black Box Predictors","authors":"F. Alberge, Clément Feutry, P. Duhamel, P. Piantanida","doi":"10.1109/ICT.2019.8798827","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798827","url":null,"abstract":"Many Machine Learning algorithms aiming at classifying signals/images $X$ among a number of discrete labels $Y$ involve training instances, from which the predictor $P_{Yvert X}$ is extracted according to the data distribution $P_{Xvert Y}$. This predictor is later used to predict the appropriate label for other instances of $X$ that are hence assumed to be drawn from the same distribution. This is a fundamental requirement for many realworld applications, therefore it is of great importance to monitor the reliability of the classification provided by the algorithm based on the learned distributions, when the test set statistics differ from the training set ones. This paper makes a step in that direction by proposing a Black Box Shift Detector of the data evolution (covariate shift). ‘Black Box’ here means that it does not require any knowledge of the predictor's architecture. Experiments demonstrate accurate detection on different high-dimensional datasets of natural images.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131619389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798769
Jieran Liu, Yuan Shen, Hanbing Yan
Malware homology analysis aims at detecting whether different malicious code originates from the same set of malicious code or is written by the same author or team, and whether it has intrinsic relevance and similarity. At the same time, the homology analysis of malicious code is also an important part of studying the groups behind different APT (Advanced Persistent Threat) attacks. At present, homology identification still relies on manual analysis and security experts' experience in the anti-malware industry. In addition, research on large-scale malicious code automated homology analysis is still insufficient. The method proposed in this paper is to solve the problem of large-scale malicious code homology automatic analysis, and hope to provide auxiliary information for discovering the group behind the APT attack. In this paper, we collected samples of different APT groups from public threat intelligence and proposed a novel approach to classify these samples into different APT groups to further analyze the homology of malware. We combined the CFG (Control Flow Graph) of the malicious code function and the disassembled code of the stripped malware to generate the embedding, i.e., a numeric vector, which formed a function feature database of the APT group, and presented a neural network model used for APT group classification. We have implemented our approach in a prototype system called MCrab. Our extensive evaluation showed that MCrab could produce high accuracy results, with few to no false positives. Our research also showed that deep learning can be successfully applied to malware homology analysis.
{"title":"Functions-based CFG Embedding for Malware Homology Analysis","authors":"Jieran Liu, Yuan Shen, Hanbing Yan","doi":"10.1109/ICT.2019.8798769","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798769","url":null,"abstract":"Malware homology analysis aims at detecting whether different malicious code originates from the same set of malicious code or is written by the same author or team, and whether it has intrinsic relevance and similarity. At the same time, the homology analysis of malicious code is also an important part of studying the groups behind different APT (Advanced Persistent Threat) attacks. At present, homology identification still relies on manual analysis and security experts' experience in the anti-malware industry. In addition, research on large-scale malicious code automated homology analysis is still insufficient. The method proposed in this paper is to solve the problem of large-scale malicious code homology automatic analysis, and hope to provide auxiliary information for discovering the group behind the APT attack. In this paper, we collected samples of different APT groups from public threat intelligence and proposed a novel approach to classify these samples into different APT groups to further analyze the homology of malware. We combined the CFG (Control Flow Graph) of the malicious code function and the disassembled code of the stripped malware to generate the embedding, i.e., a numeric vector, which formed a function feature database of the APT group, and presented a neural network model used for APT group classification. We have implemented our approach in a prototype system called MCrab. Our extensive evaluation showed that MCrab could produce high accuracy results, with few to no false positives. Our research also showed that deep learning can be successfully applied to malware homology analysis.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123587178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-01DOI: 10.1109/ICT.2019.8798810
Xiong Wu, Changjian Guo, Baoxian Yu, Yongsheng Xu, A. Lau, Chao Lu
We propose a symmetric spectrally-efficient frequency-division multiplexing (SEFDM) scheme using a logarithmic-maximum-a-posteriori (log-MAP) based detecting algorithm with reduced complexity due to I/Q separation, and successfully demonstrate 200-Gb/s optical SEFDM transmission using 16-QAM modulation over 500-m of standard single mode fiber (SSMF), with a bandwidth compression factor (BCF) of 0.8.
{"title":"200-Gb/s optical SEFDM transmission using low-complexity log-MAP based detection for short reach optical interconnects","authors":"Xiong Wu, Changjian Guo, Baoxian Yu, Yongsheng Xu, A. Lau, Chao Lu","doi":"10.1109/ICT.2019.8798810","DOIUrl":"https://doi.org/10.1109/ICT.2019.8798810","url":null,"abstract":"We propose a symmetric spectrally-efficient frequency-division multiplexing (SEFDM) scheme using a logarithmic-maximum-a-posteriori (log-MAP) based detecting algorithm with reduced complexity due to I/Q separation, and successfully demonstrate 200-Gb/s optical SEFDM transmission using 16-QAM modulation over 500-m of standard single mode fiber (SSMF), with a bandwidth compression factor (BCF) of 0.8.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125211976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：