Pub Date : 2016-06-04DOI: 10.1109/ICCSN.2016.7586596
Wang Xue, L. Yan, Tong Qian, Pu Lei
In the extraction of multiple target state by P-PHD filtering, the traditional K-Means clustering method may cause problems like extended clustering time and incorrect clustering for clusters with different sizes. To solve this problem, a new measurement extraction method based on K neighboring membership degree is proposed. In this method, the category of measurement of the target is estimated by likelihood relations between the measurement and the particle. The particle is then distributed to every actual measurement category of each estimation by K neighboring membership degree. On this basis, new particle set is formulated and target state can be extracted directly from the set. The simulation results reveal that the proposed method is with more stable retrieval precision and less time complexity.
{"title":"A multiple target measurement retrieval algorithm based on K-N eighborhood membership degree P-PHD filtering","authors":"Wang Xue, L. Yan, Tong Qian, Pu Lei","doi":"10.1109/ICCSN.2016.7586596","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586596","url":null,"abstract":"In the extraction of multiple target state by P-PHD filtering, the traditional K-Means clustering method may cause problems like extended clustering time and incorrect clustering for clusters with different sizes. To solve this problem, a new measurement extraction method based on K neighboring membership degree is proposed. In this method, the category of measurement of the target is estimated by likelihood relations between the measurement and the particle. The particle is then distributed to every actual measurement category of each estimation by K neighboring membership degree. On this basis, new particle set is formulated and target state can be extracted directly from the set. The simulation results reveal that the proposed method is with more stable retrieval precision and less time complexity.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"35 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":"125156244","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.7586585
Bo Zheng, Shaoshuai Gao
With the rapid development of wireless network and multimedia technology, the efficient transmission over unreliable channel is becoming more and more important. The error control technique for video coding and transmission has drawn considerable attention, tries to recover the data loss and bit errors due to congestion or physical channel fading. Currently, there are three kinds of error control schemes, namely, error resilient coding at the encoder, error concealment at the decoder and the retransmission in the transport layer. In this paper, an error control scheme is proposed which uses the soft information in channel decoding to recover the corrupted bit stream. When bit error is detected in a slice, soft information of channel decoding is employed to locate it, and the wrong bits are flipped and decoded again at the beginning of the slice. The combination of XOR at source and the syntax checking of H.264 decoder has increased the error detection rate from around 60% to 99% without increasing source redundancy. Simulation results show that, when the same error concealing algorithm is used, the PSNR of the proposed scheme using soft information of channel decoding at the decoder is 1-2dB higher than that using the traditional method.
{"title":"A soft-output error control method for wireless video transmission","authors":"Bo Zheng, Shaoshuai Gao","doi":"10.1109/ICCSN.2016.7586585","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586585","url":null,"abstract":"With the rapid development of wireless network and multimedia technology, the efficient transmission over unreliable channel is becoming more and more important. The error control technique for video coding and transmission has drawn considerable attention, tries to recover the data loss and bit errors due to congestion or physical channel fading. Currently, there are three kinds of error control schemes, namely, error resilient coding at the encoder, error concealment at the decoder and the retransmission in the transport layer. In this paper, an error control scheme is proposed which uses the soft information in channel decoding to recover the corrupted bit stream. When bit error is detected in a slice, soft information of channel decoding is employed to locate it, and the wrong bits are flipped and decoded again at the beginning of the slice. The combination of XOR at source and the syntax checking of H.264 decoder has increased the error detection rate from around 60% to 99% without increasing source redundancy. Simulation results show that, when the same error concealing algorithm is used, the PSNR of the proposed scheme using soft information of channel decoding at the decoder is 1-2dB higher than that using the traditional method.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"40 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":"133406241","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.7586671
Li Xinxin, Cai Xiaoxia, Dong Wei
The broadcast nature of wireless channels leads to the developments and applications of physical layer security techniques. The Artificial Noise (AN) aided technique is proposed to interfere with the eavesdropper for secure communications. A suppression method called Joint Approximate Diagonalization of Eigen-matrices (JADE), which is based on blind source separation algorithm (BSS), is presented under this circumstance. The eavesdropper is able to separate the communication signal and the noise. Simulation results demonstrate that the proposed method is feasible under certain circumstances, which helps the eavesdropper to defeat the AN aided secure communications effectively.
{"title":"Research on BSS in Artificial Noise aided secure communication","authors":"Li Xinxin, Cai Xiaoxia, Dong Wei","doi":"10.1109/ICCSN.2016.7586671","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586671","url":null,"abstract":"The broadcast nature of wireless channels leads to the developments and applications of physical layer security techniques. The Artificial Noise (AN) aided technique is proposed to interfere with the eavesdropper for secure communications. A suppression method called Joint Approximate Diagonalization of Eigen-matrices (JADE), which is based on blind source separation algorithm (BSS), is presented under this circumstance. The eavesdropper is able to separate the communication signal and the noise. Simulation results demonstrate that the proposed method is feasible under certain circumstances, which helps the eavesdropper to defeat the AN aided secure communications effectively.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"50 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":"124942388","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.7586662
Tan Jing, Cao Aihua, Yao Nan
Random errors of conformal array antenna effectively affect the radiation pattern and reduce the antenna directivity. In this paper, the excitation phase quantization error, random excitation amplitude and phase errors, the failure of element are studied by theoretical calculation and simulation. In order to analyze the effects on random errors of conformal array antenna, pattern synthesis modal of cylindrical array antenna in the far field are proposed firstly. The mean and variance of radiation pattern under these random errors are formulated with different error probability distribution. Moreover, we evaluate direction pattern of different excitation amplitude and phase random errors on cylindrical array antenna. The maximum radiation power under different failure probability is also discussed. Results indicate that various errors will have the side lobe level increasing with the different degrees.
{"title":"Effects of random errors on the radiation pattern of cylindrical array antenna","authors":"Tan Jing, Cao Aihua, Yao Nan","doi":"10.1109/ICCSN.2016.7586662","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586662","url":null,"abstract":"Random errors of conformal array antenna effectively affect the radiation pattern and reduce the antenna directivity. In this paper, the excitation phase quantization error, random excitation amplitude and phase errors, the failure of element are studied by theoretical calculation and simulation. In order to analyze the effects on random errors of conformal array antenna, pattern synthesis modal of cylindrical array antenna in the far field are proposed firstly. The mean and variance of radiation pattern under these random errors are formulated with different error probability distribution. Moreover, we evaluate direction pattern of different excitation amplitude and phase random errors on cylindrical array antenna. The maximum radiation power under different failure probability is also discussed. Results indicate that various errors will have the side lobe level increasing with the different degrees.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"39 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":"123469672","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.7586642
Cailing Qin, Kun Xiao
A novel relay selection scheme, which is easily implemented in practice, is proposed for wireless multi-user decode-and-forward (DF) relay networks in the presence of the co-channel interference. Differing from the schemes in the literatures, the proposed scheme produces a random number following a specific statistical distribution firstly, and then calculates the predicted signal to interference plus noise ratio (SINR) by adding this random number to the measured SINR. The relay node with the largest predicted SINR is selected for forwarding the data to the destination. The proposed scheme is effective in combating the outdated SINR due to the feedback of the SINR from the destination to the relay. Moreover, the performance of the proposed scheme is theoretically analyzed in terms of average bit error rate (BER) and outage probability. The Monte Carlo simulation results match the numerical results well and validate the advantages of the proposed scheme on the overall performance of multi-user DF relay system.
{"title":"Performance analysis of a multi-user relay selection scheme with predicted SINR in the presence of co-channel interference","authors":"Cailing Qin, Kun Xiao","doi":"10.1109/ICCSN.2016.7586642","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586642","url":null,"abstract":"A novel relay selection scheme, which is easily implemented in practice, is proposed for wireless multi-user decode-and-forward (DF) relay networks in the presence of the co-channel interference. Differing from the schemes in the literatures, the proposed scheme produces a random number following a specific statistical distribution firstly, and then calculates the predicted signal to interference plus noise ratio (SINR) by adding this random number to the measured SINR. The relay node with the largest predicted SINR is selected for forwarding the data to the destination. The proposed scheme is effective in combating the outdated SINR due to the feedback of the SINR from the destination to the relay. Moreover, the performance of the proposed scheme is theoretically analyzed in terms of average bit error rate (BER) and outage probability. The Monte Carlo simulation results match the numerical results well and validate the advantages of the proposed scheme on the overall performance of multi-user DF relay system.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"70 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":"126375743","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.7586649
Cheng Tan, Qingbing Ji
Cryptographic algorithm plays a significant role in a cryptosystem, which protects those sensitive and private data from been obtained by some malicious attackers. Actually, the details about the cryptographic algorithm applied in a cryptosystem are often unknown to one cryptanalyst. When a cryptanalyst works on cryptanalysis, he will have much trouble if he doesn't know anything about the used cryptographic algorithm. In this paper, we introduce an approach to identifying the cryptographic algorithm with no other information but ciphertext. Firstly, we present the whole implementation architecture of our identification system. Then we apply our identification system in identifying 5 common block ciphers, namely AES, Blowfish, 3DES, RC5 and DES. Through analyzing the experiment results, we conclude that the identification rate can obtain around 90% if keys are the same for training and testing ciphertexts. When we use different keys for training and testing ciphertexts, we can still identify AES from anyone of the other 4 cryptographic algorithms with a high identification rate in one to one identification.
{"title":"An approach to identifying cryptographic algorithm from ciphertext","authors":"Cheng Tan, Qingbing Ji","doi":"10.1109/ICCSN.2016.7586649","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586649","url":null,"abstract":"Cryptographic algorithm plays a significant role in a cryptosystem, which protects those sensitive and private data from been obtained by some malicious attackers. Actually, the details about the cryptographic algorithm applied in a cryptosystem are often unknown to one cryptanalyst. When a cryptanalyst works on cryptanalysis, he will have much trouble if he doesn't know anything about the used cryptographic algorithm. In this paper, we introduce an approach to identifying the cryptographic algorithm with no other information but ciphertext. Firstly, we present the whole implementation architecture of our identification system. Then we apply our identification system in identifying 5 common block ciphers, namely AES, Blowfish, 3DES, RC5 and DES. Through analyzing the experiment results, we conclude that the identification rate can obtain around 90% if keys are the same for training and testing ciphertexts. When we use different keys for training and testing ciphertexts, we can still identify AES from anyone of the other 4 cryptographic algorithms with a high identification rate in one to one identification.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"24 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":"127654573","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.7586687
Q. Yuan, Yanjun Hu, Hui Zhi, Mengmeng He
Two-way relaying can considerably improve spectral efficiency in relay-assisted bidirectional communication. However, most existing works focus on physical layer to exploit its resource optimizes. The benefits and flexible structures of two-way relaying on datalink layer are much less investigated. So in this paper, the cross-layer optimization for amplify-and-forward (AF) two-way relaying system is studied and an optimal power allocation scheme is proposed. Our goal is to find the optimal power allocation factors to maximize the weighted sum effective capacity of two sources in the physical layer while guaranteeing the statistical delay quality-of-service (QoS) requirement for each source in the datalink layer. This statistical delay QoS requirement is characterized by the QoS exponent θ, which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based scheme. By integrating the concept of effective capacity, the cross-layer optimization problem is equivalent to a weighted sum effective capacity maximization problem. This problem is formulated into a convex optimization problem, and an algorithm is presented to solve this problem. Simulation results show that proposed optimal power allocation scheme can achieve better weighted sum effective capacity than equal power allocation scheme and direct transmission scheme, and the relay transmission combined with direct links can get the max weighted sum effective capacity.
{"title":"Cross-layer power allocation scheme for two-way amplify-and-forward relaying system","authors":"Q. Yuan, Yanjun Hu, Hui Zhi, Mengmeng He","doi":"10.1109/ICCSN.2016.7586687","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586687","url":null,"abstract":"Two-way relaying can considerably improve spectral efficiency in relay-assisted bidirectional communication. However, most existing works focus on physical layer to exploit its resource optimizes. The benefits and flexible structures of two-way relaying on datalink layer are much less investigated. So in this paper, the cross-layer optimization for amplify-and-forward (AF) two-way relaying system is studied and an optimal power allocation scheme is proposed. Our goal is to find the optimal power allocation factors to maximize the weighted sum effective capacity of two sources in the physical layer while guaranteeing the statistical delay quality-of-service (QoS) requirement for each source in the datalink layer. This statistical delay QoS requirement is characterized by the QoS exponent θ, which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based scheme. By integrating the concept of effective capacity, the cross-layer optimization problem is equivalent to a weighted sum effective capacity maximization problem. This problem is formulated into a convex optimization problem, and an algorithm is presented to solve this problem. Simulation results show that proposed optimal power allocation scheme can achieve better weighted sum effective capacity than equal power allocation scheme and direct transmission scheme, and the relay transmission combined with direct links can get the max weighted sum effective capacity.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"34 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":"129026323","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.7587203
Yang Liu, Keyuan Qian
In ZigBee networks, ZigBee Tree Routing (ZTR) is the simplest routing protocol with low overhead in which only parent-child links shall be used for packet transfer. However, there exist hop redundancy and traffic concentration in ZTR due to the limitation of tree topology. In this paper, we propose a novel tree-based routing algorithm, which is called Improved Shortcut Tree Routing (ISTR), to decrease hop count and ease congestion in ZigBee networks by using the enhanced beacon frames and extended neighbor tables. ISTR suggests forwarding the packet to the appropriate neighbor node if it can ease network congestion and reduce the routing cost to the destination. The simulation results show that ISTR significantly improves the packet delivery ratio and reduces 20%~30% of the end-to-end delay compared to ZTR.
{"title":"A novel tree-based routing protocol in ZigBee wireless networks","authors":"Yang Liu, Keyuan Qian","doi":"10.1109/ICCSN.2016.7587203","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7587203","url":null,"abstract":"In ZigBee networks, ZigBee Tree Routing (ZTR) is the simplest routing protocol with low overhead in which only parent-child links shall be used for packet transfer. However, there exist hop redundancy and traffic concentration in ZTR due to the limitation of tree topology. In this paper, we propose a novel tree-based routing algorithm, which is called Improved Shortcut Tree Routing (ISTR), to decrease hop count and ease congestion in ZigBee networks by using the enhanced beacon frames and extended neighbor tables. ISTR suggests forwarding the packet to the appropriate neighbor node if it can ease network congestion and reduce the routing cost to the destination. The simulation results show that ISTR significantly improves the packet delivery ratio and reduces 20%~30% of the end-to-end delay compared to ZTR.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"1 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":"130703294","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.7586654
M. M. Harb, M. Al-Mistarihi
In this paper, the performance of the Dual Hop relaying systems is studied and analyzed. Differential Amplify-and-Forward is the used relaying scheme. Post-Detection Selection combining reception technique was proposed to achieve the cooperative diversity where No explicit channel estimation is needed. Instead, the receiver uses the previous received sample in each branch as the estimate of the current fading gain in that branch. The exact outage probability of the system over additive white Gaussian noise and Nakagami-m fading channels is derived assume independent fading in the channels. Simulation results are plotted for different fading parameters.
{"title":"Dual Hop Differential Amplify-and-Forward relaying with selection combining cooperative diversity over Nakagami-m fading channels","authors":"M. M. Harb, M. Al-Mistarihi","doi":"10.1109/ICCSN.2016.7586654","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586654","url":null,"abstract":"In this paper, the performance of the Dual Hop relaying systems is studied and analyzed. Differential Amplify-and-Forward is the used relaying scheme. Post-Detection Selection combining reception technique was proposed to achieve the cooperative diversity where No explicit channel estimation is needed. Instead, the receiver uses the previous received sample in each branch as the estimate of the current fading gain in that branch. The exact outage probability of the system over additive white Gaussian noise and Nakagami-m fading channels is derived assume independent fading in the channels. Simulation results are plotted for different fading parameters.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"24 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":"128101146","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.7586660
Xiaoting Du, Xianfan Xu
Based on the channel combination and split, the binary discrete channel will come up a channel polarization phenomenon, when the number of combined channels tends to infinity, part of the channels will become ideal channel without any noise and another part of the channels will became pure noisy channel. The polarization code is a kind of channel coding method based on channel polarization, which can reach Shannon limit in theory. The paper introduced the process of channel polarization, the generations of the generator matrix and the encode method of polar code; besides, it explain a decoding method called succession cancellation, according to any given a GN-cosset code, the estimated received-code can be solved out by calculating each level's LR. Finally, it simulated the channel capacity of polar code under binary erasure channel with MATLAB, as well, it simulated and analyzed d the influence of coding rate for the performance of polar code.
{"title":"The encode and decode theory of polar code and its performance simulating","authors":"Xiaoting Du, Xianfan Xu","doi":"10.1109/ICCSN.2016.7586660","DOIUrl":"https://doi.org/10.1109/ICCSN.2016.7586660","url":null,"abstract":"Based on the channel combination and split, the binary discrete channel will come up a channel polarization phenomenon, when the number of combined channels tends to infinity, part of the channels will become ideal channel without any noise and another part of the channels will became pure noisy channel. The polarization code is a kind of channel coding method based on channel polarization, which can reach Shannon limit in theory. The paper introduced the process of channel polarization, the generations of the generator matrix and the encode method of polar code; besides, it explain a decoding method called succession cancellation, according to any given a GN-cosset code, the estimated received-code can be solved out by calculating each level's LR. Finally, it simulated the channel capacity of polar code under binary erasure channel with MATLAB, as well, it simulated and analyzed d the influence of coding rate for the performance of polar code.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"1 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131957762","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
扫码关注我们
求助内容：
应助结果提醒方式：