Pub Date : 2016-06-04DOI: 10.1109/ICCSN.2016.7586629
Chaolan Li, B. Fang, Huijie Li, Pu Wang
The extraction of fetal electrocardiogram (FECG) signal has an important value in clinical application. The FECG is extracted from the maternal abdominal signal which is collected by several electrodes placed on the maternal abdomen. The traditional independent component analysis (ICA) model does not consider the temporal correlation in the process of separating maternal abdomenal signal. In this paper, a new method for extracting FECG is proposed, which combines self-correlation analysis with independent component analysis. Firstly, the self-correlation analysis is used for intercepting signals, which can decrease the temporal correlation. Then FastICA is applied to obtain the model parameters of ICA model. Finally, bring the mixed-signal into this model to extract the fetal ECG. The experiments are conducted by clinical signals. The results indicate that the method proposed in this paper could extract FECG well. This method is superior to traditional FastICA.
{"title":"A novel method of FECG extraction combined self-correlation analysis with ICA","authors":"Chaolan Li, B. Fang, Huijie Li, Pu Wang","doi":"10.1109/ICCSN.2016.7586629","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586629","url":null,"abstract":"The extraction of fetal electrocardiogram (FECG) signal has an important value in clinical application. The FECG is extracted from the maternal abdominal signal which is collected by several electrodes placed on the maternal abdomen. The traditional independent component analysis (ICA) model does not consider the temporal correlation in the process of separating maternal abdomenal signal. In this paper, a new method for extracting FECG is proposed, which combines self-correlation analysis with independent component analysis. Firstly, the self-correlation analysis is used for intercepting signals, which can decrease the temporal correlation. Then FastICA is applied to obtain the model parameters of ICA model. Finally, bring the mixed-signal into this model to extract the fetal ECG. The experiments are conducted by clinical signals. The results indicate that the method proposed in this paper could extract FECG well. This method is superior to traditional FastICA.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131348114","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586638
X. Peng, Yongfeng Huang, Fufang Li
Redundant information of low-bit rate speech is extremely small, thus it's very difficult to implement large capacity steganography on the low-bit rate speech. Based on multiple vector quantization characteristics of the Line Spectrum Pair (LSP) of the speech codec, this paper proposes a steganography scheme using a 3D-sudoku matrix to enlarge capacity and improve quality of speech. A cyclically moving algorithm to construct 3D-Sudoku matrix for steganography is proposed in this paper, as well as an embedding and an extracting algorithm of steganography based on 3D-Sudoku matrix in low-bit rate speech codec. Theoretical analysis is provided to demonstrate that the concealment and the hidden capacity are greatly improved with the proposed scheme. Experimental results show the hidden capacity is raised to 200bps in ITU-T G.723.1 codec. Moreover, the quality of steganography speech in Perceptual Evaluation of Speech Quality (PESQ) reduces no more than 4%, indicating little impact on the quality of speech.
{"title":"A steganography scheme in a low-bit rate speech codec based on 3D-sudoku matrix","authors":"X. Peng, Yongfeng Huang, Fufang Li","doi":"10.1109/ICCSN.2016.7586638","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586638","url":null,"abstract":"Redundant information of low-bit rate speech is extremely small, thus it's very difficult to implement large capacity steganography on the low-bit rate speech. Based on multiple vector quantization characteristics of the Line Spectrum Pair (LSP) of the speech codec, this paper proposes a steganography scheme using a 3D-sudoku matrix to enlarge capacity and improve quality of speech. A cyclically moving algorithm to construct 3D-Sudoku matrix for steganography is proposed in this paper, as well as an embedding and an extracting algorithm of steganography based on 3D-Sudoku matrix in low-bit rate speech codec. Theoretical analysis is provided to demonstrate that the concealment and the hidden capacity are greatly improved with the proposed scheme. Experimental results show the hidden capacity is raised to 200bps in ITU-T G.723.1 codec. Moreover, the quality of steganography speech in Perceptual Evaluation of Speech Quality (PESQ) reduces no more than 4%, indicating little impact on the quality of speech.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134160991","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586673
Lan Wang, Yuhong Yang, Pengxu Li, Liangshan Li
A new algorithm for narrowband interference suppression in Direct Sequence Spread Spectrum (DSSS) system is presented. The algorithm combines the optimum frequency shift and the Undecimated Wavelet Packet Transform (UWPT) to locate the interference energy in as little sub-band as possible. In addition, the adaptive algorithm is used to reduce the harm to the signal caused by eliminating the disturbed sub-band. Simulation results show that the proposed algorithm has a better performance than the traditional Undecimated Wavelet Packet Transform with frequency shift (SUWPT) algorithm in the suppression of the Multi-Tone Interference (MTI).
{"title":"Multi-tone interference suppression in DSSS system based on the optimal frequency shift of undecimated wavelet packets","authors":"Lan Wang, Yuhong Yang, Pengxu Li, Liangshan Li","doi":"10.1109/ICCSN.2016.7586673","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586673","url":null,"abstract":"A new algorithm for narrowband interference suppression in Direct Sequence Spread Spectrum (DSSS) system is presented. The algorithm combines the optimum frequency shift and the Undecimated Wavelet Packet Transform (UWPT) to locate the interference energy in as little sub-band as possible. In addition, the adaptive algorithm is used to reduce the harm to the signal caused by eliminating the disturbed sub-band. Simulation results show that the proposed algorithm has a better performance than the traditional Undecimated Wavelet Packet Transform with frequency shift (SUWPT) algorithm in the suppression of the Multi-Tone Interference (MTI).","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116251","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586688
Yue Qiu, Yuping Zhao, Dou Li
In order to further improve the packet data service performance, the Continuous Packet Connectivity (CPC) mode has been proposed as a configuration in 3GPP Rel'07. For the burst type data, even in the case of no data transmission, the frequent power control signaling also needs to be performed, which brings considerable overhead to system and increases system instability. In this paper, a simplified centralized power control strategy is proposed for small packet transmission by taking full consideration of resource allocation and interference of different users in the sector, in replacement of the one in the conventional strategy. Simulation results indicate that the proposed strategy can use system resources more efficiently and improve the system stability effectively. User throughput can be improved by nearly 25% without increasing the packet delay.
{"title":"Centralized power control strategy for small packet service in UMTS","authors":"Yue Qiu, Yuping Zhao, Dou Li","doi":"10.1109/ICCSN.2016.7586688","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586688","url":null,"abstract":"In order to further improve the packet data service performance, the Continuous Packet Connectivity (CPC) mode has been proposed as a configuration in 3GPP Rel'07. For the burst type data, even in the case of no data transmission, the frequent power control signaling also needs to be performed, which brings considerable overhead to system and increases system instability. In this paper, a simplified centralized power control strategy is proposed for small packet transmission by taking full consideration of resource allocation and interference of different users in the sector, in replacement of the one in the conventional strategy. Simulation results indicate that the proposed strategy can use system resources more efficiently and improve the system stability effectively. User throughput can be improved by nearly 25% without increasing the packet delay.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133101548","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586624
Liu Shuai, Chen Hui, Cong Haixia
In this paper, a DOA (direction of arrival) estimation method of coherent signals based on uniform circular arrays, in the presence of sensor mutual coupling, is proposed. Firstly, the array considering mutual coupling is transformed into a virtual array of geometric proportion through preprocessing. Then a new covariance matrix is reconstructed with the eigenvector corresponding to the largest eigenvalue, which consists of all signals' information. In addition, the new signal covariance matrix is diagonal, which means a complete de-correlation. Finally, DOA can be estimated in conjunction with MUSIC algorithm based on the new covariance matrix. Compared with conventional methods, it has higher angular resolution and lower SNR (signal to noise ratio) threshold. Besides, this method also works well in the presence of mutual coupling between sensors.
{"title":"DOA estimation of coherent signals on uniform circular array in the presence of mutual coupling","authors":"Liu Shuai, Chen Hui, Cong Haixia","doi":"10.1109/ICCSN.2016.7586624","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586624","url":null,"abstract":"In this paper, a DOA (direction of arrival) estimation method of coherent signals based on uniform circular arrays, in the presence of sensor mutual coupling, is proposed. Firstly, the array considering mutual coupling is transformed into a virtual array of geometric proportion through preprocessing. Then a new covariance matrix is reconstructed with the eigenvector corresponding to the largest eigenvalue, which consists of all signals' information. In addition, the new signal covariance matrix is diagonal, which means a complete de-correlation. Finally, DOA can be estimated in conjunction with MUSIC algorithm based on the new covariance matrix. Compared with conventional methods, it has higher angular resolution and lower SNR (signal to noise ratio) threshold. Besides, this method also works well in the presence of mutual coupling between sensors.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131126604","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586648
Jinbo Zhang, Su Qu, Hang Zhang
In order to improve the capacity of hierarchical interference alignment (HIA) scheme for heterogeneous networks in the low Signal to Noise Ratio (SNR) regime, a regularized interference alignment (RIA) scheme for heterogeneous networks is proposed in this paper. In the proposed scheme, the equivalent channel matrices in hierarchical interference alignment scheme are used as weighed matrices, and the transmit and receive beam forming matrices are iteratively optimized by weighed Minimum Mean Square Error (W-MMSE) criterion, hence the interferences are eliminated and Signal to Interference plus Noise Ratio (SINR) is optimized. Theoretical analysis and simulation results show that, the proposed scheme can converge by a few iterations, and improve the capacity of heterogeneous networks in the low SNR regime.
{"title":"Regularized interference alignment for heterogeneous networks","authors":"Jinbo Zhang, Su Qu, Hang Zhang","doi":"10.1109/ICCSN.2016.7586648","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586648","url":null,"abstract":"In order to improve the capacity of hierarchical interference alignment (HIA) scheme for heterogeneous networks in the low Signal to Noise Ratio (SNR) regime, a regularized interference alignment (RIA) scheme for heterogeneous networks is proposed in this paper. In the proposed scheme, the equivalent channel matrices in hierarchical interference alignment scheme are used as weighed matrices, and the transmit and receive beam forming matrices are iteratively optimized by weighed Minimum Mean Square Error (W-MMSE) criterion, hence the interferences are eliminated and Signal to Interference plus Noise Ratio (SINR) is optimized. Theoretical analysis and simulation results show that, the proposed scheme can converge by a few iterations, and improve the capacity of heterogeneous networks in the low SNR regime.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131593098","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586616
Jian Wang, Xinke Lv, Xiao Chen
Task Scheduling for parallel computing is a process to map the application to the multi-processors while minimize the execution time. Task scheduling is classified into static scheduling and dynamic scheduling. List scheduling is a class of static heuristic based scheduling algorithms with low complexity and good performance. Based on the principle of list scheduling algorithm with limited numbers of homogeneous multi-processors, this study analyzes the complexity and property of six typical kinds of list scheduling algorithms including HLFET, ISH, MCP, ETF, DLS and CPND. By using three types of task graphs including peer set graphs, traced graphs and random graphs, the schedule lengths of the six list scheduling algorithms are compared and analyzed. It can be concluded that the algorithms based on the critical path nodes (such as MCP, CPND) are generally better than other algorithms. The algorithms using dynamic properties (such as DLS, ETF) perform better than most of the algorithms adopting static properties.
{"title":"Comparative analysis of list scheduling algorithms on homogeneous multi-processors","authors":"Jian Wang, Xinke Lv, Xiao Chen","doi":"10.1109/ICCSN.2016.7586616","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586616","url":null,"abstract":"Task Scheduling for parallel computing is a process to map the application to the multi-processors while minimize the execution time. Task scheduling is classified into static scheduling and dynamic scheduling. List scheduling is a class of static heuristic based scheduling algorithms with low complexity and good performance. Based on the principle of list scheduling algorithm with limited numbers of homogeneous multi-processors, this study analyzes the complexity and property of six typical kinds of list scheduling algorithms including HLFET, ISH, MCP, ETF, DLS and CPND. By using three types of task graphs including peer set graphs, traced graphs and random graphs, the schedule lengths of the six list scheduling algorithms are compared and analyzed. It can be concluded that the algorithms based on the critical path nodes (such as MCP, CPND) are generally better than other algorithms. The algorithms using dynamic properties (such as DLS, ETF) perform better than most of the algorithms adopting static properties.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127838079","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586697
Zengqi Wang, Jinhe Zhou
The explosive growth of the wireless network data brings a lot of pressure to the limited network resources, the network energy saving problem is increasingly outstanding. Software defined wireless networking separates wireless network control plane from the packet forwarding plane, and makes the network more flexible, thus software defined wireless networking has been widely used. Aiming at software defined wireless networking energy saving problem, this paper proposed a power control mechanism which is based on software defined wireless networking, on the basis of this mechanism a power allocation strategy is proposed based on game theory, the strategy controls node's transmission power under the requirements of node's transmission signal-to-noise ratio. Simulation results show that the proposed mechanism can ensure reliable transmission network at the same time to achieve the purpose of energy conservation through the rational allocation transmission power of nodes.
{"title":"Power control mechanism in software defined wireless networking","authors":"Zengqi Wang, Jinhe Zhou","doi":"10.1109/ICCSN.2016.7586697","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586697","url":null,"abstract":"The explosive growth of the wireless network data brings a lot of pressure to the limited network resources, the network energy saving problem is increasingly outstanding. Software defined wireless networking separates wireless network control plane from the packet forwarding plane, and makes the network more flexible, thus software defined wireless networking has been widely used. Aiming at software defined wireless networking energy saving problem, this paper proposed a power control mechanism which is based on software defined wireless networking, on the basis of this mechanism a power allocation strategy is proposed based on game theory, the strategy controls node's transmission power under the requirements of node's transmission signal-to-noise ratio. Simulation results show that the proposed mechanism can ensure reliable transmission network at the same time to achieve the purpose of energy conservation through the rational allocation transmission power of nodes.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133372255","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586593
Wang Ren-qun, Peng Li
In this paper it introduces a rearrangeable non-blocking topology of data center networks called Hyper-DC. Firstly, combining the merits of k-dilated k-bristled hypercube topology and k-ary hyper-mesh topology, this paper introduces the definition of Hyper-DC topology in the view of graph theory; Secondly, it analyzes properties of Hyper-DC topology especially proving rearrangeable non-blocking property by the mathematical induction, which benefits line speed transmission of flow and simplification of cache mechanism in data center networks; Thirdly, this paper realizes the optimal embedment of many other topologies into Hyper-DC, which benefits the realization of a large number of parallel algorithms and stimulations of many other topologies; Finally, it compares with several topologies which have rearrangeable non-blocking property in the aspects of properties of latency, link complexity, switch complexity and scalability.
{"title":"Hyper-DC: A rearrangeable non-blocking data center networks topology","authors":"Wang Ren-qun, Peng Li","doi":"10.1109/ICCSN.2016.7586593","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586593","url":null,"abstract":"In this paper it introduces a rearrangeable non-blocking topology of data center networks called Hyper-DC. Firstly, combining the merits of k-dilated k-bristled hypercube topology and k-ary hyper-mesh topology, this paper introduces the definition of Hyper-DC topology in the view of graph theory; Secondly, it analyzes properties of Hyper-DC topology especially proving rearrangeable non-blocking property by the mathematical induction, which benefits line speed transmission of flow and simplification of cache mechanism in data center networks; Thirdly, this paper realizes the optimal embedment of many other topologies into Hyper-DC, which benefits the realization of a large number of parallel algorithms and stimulations of many other topologies; Finally, it compares with several topologies which have rearrangeable non-blocking property in the aspects of properties of latency, link complexity, switch complexity and scalability.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134110829","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 : 2016-06-04DOI: 10.1109/ICCSN.2016.7586678
Zhi Quan, Ting Tian
The measurement and characterization of electric power grid as medium to provide data communication is a task of practical importance as well as pursuing new generation of Power Line Communication (PLC) technologies. Contrary to other communication channels, the power line channel does not represent an additive white noise environment. It is mostly dominated by narrow band interference and impulsive noise, particularly the impulsive noise leads significant time variance into to powerline. The root mean square delay spread associated with the power line can provide important information for determining the data transmission rate and designing the appropriate equalization techniques for PLC. With this regard, an outdoor measurement is made in Zhengzhou, China. Based on the measurement results, the noise in the tested channel is obtained. The noise shows the impulsive behavior which is consistent with the theory statistical model. Furthermore, the maximum, average and minimum variances of the noise are examined. Finally, the root mean square delay spread of the tested channel is calculated, which follows that the maximum transmission rate of the tested channel is approximately 1.6 Mbps.
{"title":"The analysis of the outdoor powerline channel in Zhengzhou","authors":"Zhi Quan, Ting Tian","doi":"10.1109/ICCSN.2016.7586678","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586678","url":null,"abstract":"The measurement and characterization of electric power grid as medium to provide data communication is a task of practical importance as well as pursuing new generation of Power Line Communication (PLC) technologies. Contrary to other communication channels, the power line channel does not represent an additive white noise environment. It is mostly dominated by narrow band interference and impulsive noise, particularly the impulsive noise leads significant time variance into to powerline. The root mean square delay spread associated with the power line can provide important information for determining the data transmission rate and designing the appropriate equalization techniques for PLC. With this regard, an outdoor measurement is made in Zhengzhou, China. Based on the measurement results, the noise in the tested channel is obtained. The noise shows the impulsive behavior which is consistent with the theory statistical model. Furthermore, the maximum, average and minimum variances of the noise are examined. Finally, the root mean square delay spread of the tested channel is calculated, which follows that the maximum transmission rate of the tested channel is approximately 1.6 Mbps.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121951000","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
扫码关注我们
求助内容：
应助结果提醒方式：