Pub Date : 2016-07-06DOI: 10.1109/CITS.2016.7546459
Amrit Kharel, Lei Cao
Luby transform (LT) codes are defined by degree distribution functions of encoded symbols. In erasure channels, good degree distribution functions should prevent the ripple of degree-one symbols from vanishing until the successful termination of decoding process. In this paper, we show that for binary input additive white Gaussian noise (BIAWGN) channels, performance of LT codes also depends on the time at which source nodes in the decoding graph of the codes start receiving non-zero log-likelihood ratio (LLR) values. We show that source nodes can be categorized based on this time, and those in lower categories, i.e., those source nodes updated with non-zero LLR values at earlier iterations have higher probability of being decoded correctly. We theoretically derive formulas that can find the percentages of source nodes in each category for any given degree distribution function. We finally show that by increasing the number of source nodes in the lower categories, the bit error rate (BER) performance of LT codes can be drastically improved. This work provides a new perspective for the performance and design of such codes for BIAWGN channels.
{"title":"On the performance of LT codes over BIAWGN channel","authors":"Amrit Kharel, Lei Cao","doi":"10.1109/CITS.2016.7546459","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546459","url":null,"abstract":"Luby transform (LT) codes are defined by degree distribution functions of encoded symbols. In erasure channels, good degree distribution functions should prevent the ripple of degree-one symbols from vanishing until the successful termination of decoding process. In this paper, we show that for binary input additive white Gaussian noise (BIAWGN) channels, performance of LT codes also depends on the time at which source nodes in the decoding graph of the codes start receiving non-zero log-likelihood ratio (LLR) values. We show that source nodes can be categorized based on this time, and those in lower categories, i.e., those source nodes updated with non-zero LLR values at earlier iterations have higher probability of being decoded correctly. We theoretically derive formulas that can find the percentages of source nodes in each category for any given degree distribution function. We finally show that by increasing the number of source nodes in the lower categories, the bit error rate (BER) performance of LT codes can be drastically improved. This work provides a new perspective for the performance and design of such codes for BIAWGN channels.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133748118","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-07-06DOI: 10.1109/CITS.2016.7546408
Yu Guo, Yun Zhang, Zhenqiang Mi, Yang Yang, M. Obaidat
Wireless sensor and actor network (WSAN) has received growing interests with the rapid development of Internet of things. Multiple function actors are added into the traditional wireless sensor networks to sense the environment, conduct tasks and give feedback. In this paper, an efficient distributed actor deployment strategy is proposed to address the connectivity maintenance and coverage optimization issues in WSAN with the consideration of unknown sensors' locations. In this proposed strategy, an artificial potential force based algorithm is utilized to detect the unknown sensors, and a fully distributed link deletion algorithm is introduced to delete redundant communication links thus expanding the search area. Then, an actor location optimization algorithm is developed based on the Voronoi diagram method to get a better coverage result. The global connectivity of the actors is guaranteed during the entire process. The performances of proposed strategy are validated analytically and experimentally.
{"title":"A distributed coverage optimization and connectivity maintenance strategy based on unknown sensors in WSAN","authors":"Yu Guo, Yun Zhang, Zhenqiang Mi, Yang Yang, M. Obaidat","doi":"10.1109/CITS.2016.7546408","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546408","url":null,"abstract":"Wireless sensor and actor network (WSAN) has received growing interests with the rapid development of Internet of things. Multiple function actors are added into the traditional wireless sensor networks to sense the environment, conduct tasks and give feedback. In this paper, an efficient distributed actor deployment strategy is proposed to address the connectivity maintenance and coverage optimization issues in WSAN with the consideration of unknown sensors' locations. In this proposed strategy, an artificial potential force based algorithm is utilized to detect the unknown sensors, and a fully distributed link deletion algorithm is introduced to delete redundant communication links thus expanding the search area. Then, an actor location optimization algorithm is developed based on the Voronoi diagram method to get a better coverage result. The global connectivity of the actors is guaranteed during the entire process. The performances of proposed strategy are validated analytically and experimentally.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132370151","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-07-06DOI: 10.1109/CITS.2016.7546426
Qingming Yi, Min Shi, Ming-min Chen, Song Li
The commercial embedded microprocessor requires to be authorized, which increases the cost of the chip. The free embedded microprocessor soft-core is of poor portability, which causes difficulty on system design. In order to solve the above problems, this paper introduces an improved IP core base on ARMv4 instruction set. With an independent architecture, the IP core possesses good portability and compatibility. Firstly, hardware multiplier is used to solve the problem of the delay of multiplier, which can raise the speed of arithmetic. Secondly, taking the place of the three-stage instruction pipeline, a five-stage instruction pipeline is used to solve the problem of low efficiency. Finally, the whole core is implemented on FPGA, the utilization of resource is increased with resource sharing technique. The experiment results show that the ARMv4 instruction set can run correctly on the embedded microprocessor described in this paper. Compared with the similar ARMv4 microprocessor, it not only contains the advantage of high performance and open interface, but also is easy to design. The embedded microprocessor can be used in both the SOC system and the FPGA embedded system.
{"title":"A design method for an improved soft core of ARMv4 instruction set based on FPGA","authors":"Qingming Yi, Min Shi, Ming-min Chen, Song Li","doi":"10.1109/CITS.2016.7546426","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546426","url":null,"abstract":"The commercial embedded microprocessor requires to be authorized, which increases the cost of the chip. The free embedded microprocessor soft-core is of poor portability, which causes difficulty on system design. In order to solve the above problems, this paper introduces an improved IP core base on ARMv4 instruction set. With an independent architecture, the IP core possesses good portability and compatibility. Firstly, hardware multiplier is used to solve the problem of the delay of multiplier, which can raise the speed of arithmetic. Secondly, taking the place of the three-stage instruction pipeline, a five-stage instruction pipeline is used to solve the problem of low efficiency. Finally, the whole core is implemented on FPGA, the utilization of resource is increased with resource sharing technique. The experiment results show that the ARMv4 instruction set can run correctly on the embedded microprocessor described in this paper. Compared with the similar ARMv4 microprocessor, it not only contains the advantage of high performance and open interface, but also is easy to design. The embedded microprocessor can be used in both the SOC system and the FPGA embedded system.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133040643","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-07-06DOI: 10.1109/CITS.2016.7546420
Junli Lu, Lizhen Wang, Yuan Fang
Spatial co-locations represent the subsets of spatial features which are frequently located together in a geographic space. Spatial co-location mining has been a research hot in recent years. But the research on causal rule discovery hidden in spatial co-locations has not been reported. Maybe the features in a co-location accidentally share the similar environment, and maybe they are competitively living in the same environment, they themselves have no causal relationships. So mining causal rules in amount of prevalent co-locations is more interesting. This paper proposes a novel algorithm to mine causal rules from prevalent co-locations based on dynamic spatial databases. Because of large collections of prevalent co-locations and amount of rules in one co-location, the computational cost for the discovery is high, thus the pruning strategies are presented to solve the problem in an acceptable period of time. The extensive experiments evaluate the proposed algorithms with “real + synthetic” data sets and the results show that causal rules are just about 60% of co-location rules, and which are more powerful.
{"title":"Mining causal rules hidden in spatial co-locations based on dynamic spatial databases","authors":"Junli Lu, Lizhen Wang, Yuan Fang","doi":"10.1109/CITS.2016.7546420","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546420","url":null,"abstract":"Spatial co-locations represent the subsets of spatial features which are frequently located together in a geographic space. Spatial co-location mining has been a research hot in recent years. But the research on causal rule discovery hidden in spatial co-locations has not been reported. Maybe the features in a co-location accidentally share the similar environment, and maybe they are competitively living in the same environment, they themselves have no causal relationships. So mining causal rules in amount of prevalent co-locations is more interesting. This paper proposes a novel algorithm to mine causal rules from prevalent co-locations based on dynamic spatial databases. Because of large collections of prevalent co-locations and amount of rules in one co-location, the computational cost for the discovery is high, thus the pruning strategies are presented to solve the problem in an acceptable period of time. The extensive experiments evaluate the proposed algorithms with “real + synthetic” data sets and the results show that causal rules are just about 60% of co-location rules, and which are more powerful.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442892","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-07-06DOI: 10.1109/CITS.2016.7546407
Yangqin Cao, Jun Yan, Weiping Zhu
In this paper, a secure compressive sensing (CS) based localization approach is proposed to cope with the attacked measurements from the malicious node by the residual error analysis. First, the intermediate target positions are estimated by the CS recovery method and then the residual errors are calculated as the indicator to identify each measurement. Second, according to the proposed residual error deviation rule, the suspicious attacked measurements set are obtained. So, based on the proposed largest residual error rule, the final attacked measurements are determined from the suspicious attacked measurements. At last, the final target positions are estimated by the CS approach with the attack-free measurements once again. Extensive simulation results demonstrate that the proposed algorithm can outperform the existing algorithms under malicious node attack environments.
{"title":"A residual error analysis based secure CS approach for malicious node attack","authors":"Yangqin Cao, Jun Yan, Weiping Zhu","doi":"10.1109/CITS.2016.7546407","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546407","url":null,"abstract":"In this paper, a secure compressive sensing (CS) based localization approach is proposed to cope with the attacked measurements from the malicious node by the residual error analysis. First, the intermediate target positions are estimated by the CS recovery method and then the residual errors are calculated as the indicator to identify each measurement. Second, according to the proposed residual error deviation rule, the suspicious attacked measurements set are obtained. So, based on the proposed largest residual error rule, the final attacked measurements are determined from the suspicious attacked measurements. At last, the final target positions are estimated by the CS approach with the attack-free measurements once again. Extensive simulation results demonstrate that the proposed algorithm can outperform the existing algorithms under malicious node attack environments.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"16 5-6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131691398","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-07-06DOI: 10.1109/CITS.2016.7546399
Pengwu Wan, Zan Li, B. Hao
The time delay estimation of the TDOA is signification in passive source localization systems, and the estimation accuracy may directly affect the source location performance. We address the problem of passive blind estimation of time-delay for uncorrelated co-frequency interference source signal based on wireless sensor network (WSN). The received mixtures are modeled as unknown linear combinations of differently delayed versions of communication signal and interference signal. Two methods of Blind Source Separation (BSS) and Secondary Interference Signal Extracting (SISE) are introduced in the proposed method. The interference signals in the mixed receiving signals of all sensors are extracted effectively and the affection of the mixed communication signals can be significantly reduced. Simulations results demonstrate that the proposed method has a more accurate performance compared to some other time delay estimation methods.
{"title":"Time delay estimation of co-frequency signals in TDOA localization based on WSN","authors":"Pengwu Wan, Zan Li, B. Hao","doi":"10.1109/CITS.2016.7546399","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546399","url":null,"abstract":"The time delay estimation of the TDOA is signification in passive source localization systems, and the estimation accuracy may directly affect the source location performance. We address the problem of passive blind estimation of time-delay for uncorrelated co-frequency interference source signal based on wireless sensor network (WSN). The received mixtures are modeled as unknown linear combinations of differently delayed versions of communication signal and interference signal. Two methods of Blind Source Separation (BSS) and Secondary Interference Signal Extracting (SISE) are introduced in the proposed method. The interference signals in the mixed receiving signals of all sensors are extracted effectively and the affection of the mixed communication signals can be significantly reduced. Simulations results demonstrate that the proposed method has a more accurate performance compared to some other time delay estimation methods.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127429234","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-07-06DOI: 10.1109/CITS.2016.7546415
Haolin Jin, Chengrong Wu, Shiyong Zhang
IPv4 is now being replaced by IPv6 gradually, which means that a lot of software specific to IPv4, such as sniffing software, need to be upgraded to adjust to IPv6. However, due to the big difference between IPv4 and IPv6, it is expensive and time consuming to upgrade an existed stable product. We design and implement STRESS, an IPv6 to IPv4 converter for sniffing software to make these products keep working during the transition time. STRESS handles received IPv6 packets, rewrite them to IPv4 packets, and send them back to IPv4 based software. After such process, the old IPv4 software can now identify contents in IPv6 packets properly.
{"title":"STRESS: An IPv6 to IPv4 Converter for Sniffing Software","authors":"Haolin Jin, Chengrong Wu, Shiyong Zhang","doi":"10.1109/CITS.2016.7546415","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546415","url":null,"abstract":"IPv4 is now being replaced by IPv6 gradually, which means that a lot of software specific to IPv4, such as sniffing software, need to be upgraded to adjust to IPv6. However, due to the big difference between IPv4 and IPv6, it is expensive and time consuming to upgrade an existed stable product. We design and implement STRESS, an IPv6 to IPv4 converter for sniffing software to make these products keep working during the transition time. STRESS handles received IPv6 packets, rewrite them to IPv4 packets, and send them back to IPv4 based software. After such process, the old IPv4 software can now identify contents in IPv6 packets properly.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599817","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-07-06DOI: 10.1109/CITS.2016.7546401
Fanrong Sun, Songchen Han
With the increasing number of long range free flight, the flight path planning becomes an important issue. In this paper, the expected path is defined as linear potential field. The trajectory equation to determine maximum likelihood flight heading is established by calculating aircraft potential field gravitation of the trajectory at any space position. The air speed degradation model is built by the analysis of the upper air wind influence, and the distance cost can be defined at any position by taking flight performance constraints into consideration. Finally, an optimization model of flight path is established, which selects distance cost and simplicity as the optimization targets, and an ant colony algorithm is proposed. Many groups of flight paths from the Pareto ant colony algorithm are conducive to collaborative decision scientifically and rationally. Experimental results verify the validity of the method.
{"title":"A flight path planning method based on improved artificial potential field","authors":"Fanrong Sun, Songchen Han","doi":"10.1109/CITS.2016.7546401","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546401","url":null,"abstract":"With the increasing number of long range free flight, the flight path planning becomes an important issue. In this paper, the expected path is defined as linear potential field. The trajectory equation to determine maximum likelihood flight heading is established by calculating aircraft potential field gravitation of the trajectory at any space position. The air speed degradation model is built by the analysis of the upper air wind influence, and the distance cost can be defined at any position by taking flight performance constraints into consideration. Finally, an optimization model of flight path is established, which selects distance cost and simplicity as the optimization targets, and an ant colony algorithm is proposed. Many groups of flight paths from the Pareto ant colony algorithm are conducive to collaborative decision scientifically and rationally. Experimental results verify the validity of the method.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124546807","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-07-06DOI: 10.1109/CITS.2016.7546391
Xiang-zhong Dong, Jie Guan
SIMON is a family of the lightweight block ciphers designed by the U.S National Security Agency in 2013 which is a classical Feistel scheme. The round function uses bitwise AND, rotation and XOR operations. This paper studies on differential distribution properties of the general SIMON-like round function F[a, b, c](x) = (x<;<;<;a) ⊙(x<;<;<;b)⊕(x<;<;<;<;c) It gives the relationship between the differential probability and the hamming weight of the input difference, and solves the constructing and counting issue of the corresponding input and output differences when the differential probabilities are 1/2, 1/4, 1/8, 1/16, 1/2(n-1), and also proposes a fast algorithm to compute the combined differential (α→ β)·p(α→ β) of the iterative differential characteristic with a computation complexity of O(2r n3). It provides theoretical guidance for the differential cryptanalysis and design of SIMON family.
{"title":"Differential distribution properties of the SIMON block cipher family","authors":"Xiang-zhong Dong, Jie Guan","doi":"10.1109/CITS.2016.7546391","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546391","url":null,"abstract":"SIMON is a family of the lightweight block ciphers designed by the U.S National Security Agency in 2013 which is a classical Feistel scheme. The round function uses bitwise AND, rotation and XOR operations. This paper studies on differential distribution properties of the general SIMON-like round function F<sub>[a, b, c]</sub>(x) = (x<;<;<;a) ⊙(x<;<;<;b)⊕(x<;<;<;<;c) It gives the relationship between the differential probability and the hamming weight of the input difference, and solves the constructing and counting issue of the corresponding input and output differences when the differential probabilities are 1/2, 1/4, 1/8, 1/16, 1/2<sup>(n-1)</sup>, and also proposes a fast algorithm to compute the combined differential (α→ β)·p(α→ β) of the iterative differential characteristic with a computation complexity of O(2<sup>r</sup> n<sup>3</sup>). It provides theoretical guidance for the differential cryptanalysis and design of SIMON family.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132212559","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}
This paper studies the parameter-tuned stochastic resonance (PSR) effect in Binary PAM Signal Processing under coherent and non-coherent received by the measure of Bit Error Rate (BER). Based on probability density function of general Gaussian noise, we derive an analytical expression of the BER under coherent and non-coherent received through different types of noise. The theoretical and numerical results demonstrate that the noise-enhanced transmission BER occur for non-coherent received in various noise scenarios. The BER of the signal from a nonlinear system over that of a linear system. For coherent received, whatever background noise is not favorable for the signal processing. The performance of a linear system is best.
{"title":"Comparison results of stochastic resonance effects realized by coherent and non-coherent receiver","authors":"Linlin Liang, Zan Li, Danyang Wang, Wenchao Zhai, Nina Zhang","doi":"10.1109/CITS.2016.7546427","DOIUrl":"https://doi.org/10.1109/CITS.2016.7546427","url":null,"abstract":"This paper studies the parameter-tuned stochastic resonance (PSR) effect in Binary PAM Signal Processing under coherent and non-coherent received by the measure of Bit Error Rate (BER). Based on probability density function of general Gaussian noise, we derive an analytical expression of the BER under coherent and non-coherent received through different types of noise. The theoretical and numerical results demonstrate that the noise-enhanced transmission BER occur for non-coherent received in various noise scenarios. The BER of the signal from a nonlinear system over that of a linear system. For coherent received, whatever background noise is not favorable for the signal processing. The performance of a linear system is best.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123225789","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
扫码关注我们
求助内容：
应助结果提醒方式：