Pub Date : 2018-04-01DOI: 10.1109/WCNCW.2018.8369030
Zhanmao Cao, C. Wu, M. Berry, Yongqiang Wang
Multi-Radio Multi-Channel (MRMC) wireless mesh networks (WMNs) feature fast connection and low cost in providing ubiquitous access as broadband backbones. The transmission efficiency of such networks highly depends on the coordination of routing and scheduling over user requests and network properties. Considering a set of resource factors including network topology, node interface, and channel and time availability, this paper formulates an optimization problem on joint routing and scheduling, and proposes a resource-aware heuristic solution that cooperatively combines coexisting links to support multi-pair traffic requests. Extensive simulation results show the robustness and efficiency of the proposed solution. This research provides a rigorous approach to the evaluation of network topology planning, and lays down a solid foundation for the analysis and development of effective strategies to refine existing deployments of MRMC WMNs.
{"title":"Resource-aware routing and scheduling in multi-radio multi-channel wireless mesh networks","authors":"Zhanmao Cao, C. Wu, M. Berry, Yongqiang Wang","doi":"10.1109/WCNCW.2018.8369030","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369030","url":null,"abstract":"Multi-Radio Multi-Channel (MRMC) wireless mesh networks (WMNs) feature fast connection and low cost in providing ubiquitous access as broadband backbones. The transmission efficiency of such networks highly depends on the coordination of routing and scheduling over user requests and network properties. Considering a set of resource factors including network topology, node interface, and channel and time availability, this paper formulates an optimization problem on joint routing and scheduling, and proposes a resource-aware heuristic solution that cooperatively combines coexisting links to support multi-pair traffic requests. Extensive simulation results show the robustness and efficiency of the proposed solution. This research provides a rigorous approach to the evaluation of network topology planning, and lays down a solid foundation for the analysis and development of effective strategies to refine existing deployments of MRMC WMNs.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121808549","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 : 2018-04-01DOI: 10.1109/WCNCW.2018.8369034
Narges Gholipoor, H. Saeedi, N. Mokari
The tactile internet requires an ultra short end-to-end (E2E) latency of about 1 ms and is proposed as one of the fifth-generation (5G) wireless cellular network applications. In a typical 5G framework, inclusion of tactile data that imposes different delay requirements than traditional data to the system, makes the system implementation more challenging. This paper is concerned with resource allocation to maximize the uplink sum rate of traditional data while satisfying the delay requirements for tactile data. To do so, we propose a practical model for delay in which the queuing delay both at the source and the base station is considered. We use sparse code multiple access (SCMA), one of the candidate multiple access techniques in 5G cellular network, in our system model. Consequently, for a given number of traditional data streams, we can quantify the reduction in the traditional data sum rate caused by increasing the number of tactile data streams. In addition, we investigate the effect of quality of service coefficient, referred to as θ on the uplink sum rate of traditional data and show that there is a threshold behavior such that if θ gets larger than a certain value, the sum rate of traditional data drastically decreases toward zero.
{"title":"Cross-layer resource allocation for mixed tactile Internet and traditional data in SCMA based wireless networks","authors":"Narges Gholipoor, H. Saeedi, N. Mokari","doi":"10.1109/WCNCW.2018.8369034","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369034","url":null,"abstract":"The tactile internet requires an ultra short end-to-end (E2E) latency of about 1 ms and is proposed as one of the fifth-generation (5G) wireless cellular network applications. In a typical 5G framework, inclusion of tactile data that imposes different delay requirements than traditional data to the system, makes the system implementation more challenging. This paper is concerned with resource allocation to maximize the uplink sum rate of traditional data while satisfying the delay requirements for tactile data. To do so, we propose a practical model for delay in which the queuing delay both at the source and the base station is considered. We use sparse code multiple access (SCMA), one of the candidate multiple access techniques in 5G cellular network, in our system model. Consequently, for a given number of traditional data streams, we can quantify the reduction in the traditional data sum rate caused by increasing the number of tactile data streams. In addition, we investigate the effect of quality of service coefficient, referred to as θ on the uplink sum rate of traditional data and show that there is a threshold behavior such that if θ gets larger than a certain value, the sum rate of traditional data drastically decreases toward zero.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130892699","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 : 2018-04-01DOI: 10.1109/WCNCW.2018.8369036
D. Laselva, M. Mattina, T. Kolding, J. Hui, Lily Liu, Arne Weber
Although QoE evaluation methodologies for human communication services in mobile networks — such as voice and video streaming — are a widely researched topic, several challenges remain yet unresolved including industry-agreed definitions of end-to-end performance indicators. With 5G, a wide variety of new use cases and diverse services shall be introduced, posing further challenges to the QoE assessment. For instance, emerging machine communication services may suffer from interdependencies across machines (i.e. systemic effects), which have yet to be fully understood. Further, to support reliable real-time services with ultra-high availability, future QoE optimization must take a more balanced approach across all network domains as opposed to the RAN focused approach of today. This paper discusses those challenges and presents the foreseen evolution of the QoE evaluation methodologies suitable to 5G mobile networks to accommodate the identified challenges. Building on today's best practices, we describe a flexible QoE service model and evaluation framework, which relies on Key Quality Indicators (KQIs) and allows for objective assessment of the QoE on a per service basis. At the same time, the model can effectively guide network optimization processes according to the network operator's strategy and actual network design. We validate the proposed framework in a live LTE network of a Tier-1 operator, demonstrating its capability to clearly identify the phases of performance optimization as well as we indicate how it could be applied to 5G to support machine-driven communications.
{"title":"Advancements of QoE assessment and optimization in mobile networks in the machine era","authors":"D. Laselva, M. Mattina, T. Kolding, J. Hui, Lily Liu, Arne Weber","doi":"10.1109/WCNCW.2018.8369036","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369036","url":null,"abstract":"Although QoE evaluation methodologies for human communication services in mobile networks — such as voice and video streaming — are a widely researched topic, several challenges remain yet unresolved including industry-agreed definitions of end-to-end performance indicators. With 5G, a wide variety of new use cases and diverse services shall be introduced, posing further challenges to the QoE assessment. For instance, emerging machine communication services may suffer from interdependencies across machines (i.e. systemic effects), which have yet to be fully understood. Further, to support reliable real-time services with ultra-high availability, future QoE optimization must take a more balanced approach across all network domains as opposed to the RAN focused approach of today. This paper discusses those challenges and presents the foreseen evolution of the QoE evaluation methodologies suitable to 5G mobile networks to accommodate the identified challenges. Building on today's best practices, we describe a flexible QoE service model and evaluation framework, which relies on Key Quality Indicators (KQIs) and allows for objective assessment of the QoE on a per service basis. At the same time, the model can effectively guide network optimization processes according to the network operator's strategy and actual network design. We validate the proposed framework in a live LTE network of a Tier-1 operator, demonstrating its capability to clearly identify the phases of performance optimization as well as we indicate how it could be applied to 5G to support machine-driven communications.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123310524","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 : 2018-04-01DOI: 10.1109/WCNCW.2018.8369014
Valerio Bioglio, I. Land
In this paper, we propose to add one or more internal edge permutations in the Tanner graph of polar codes, shuffling the columns of one or more sub-matrices of the overall transformation matrix of the code. As a consequence, the code changes as compared to the polar code without such inner edge permutations: properly designed permutations lead to an increase of the minimum distance or at least a decrease of the number of codewords (multiplicity) at the minimum distance. In both cases, the error rate performance is significantly improved, without effecting the polarization effect and hence the bit reliabilities.
{"title":"Polar codes with internal edge permutations","authors":"Valerio Bioglio, I. Land","doi":"10.1109/WCNCW.2018.8369014","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369014","url":null,"abstract":"In this paper, we propose to add one or more internal edge permutations in the Tanner graph of polar codes, shuffling the columns of one or more sub-matrices of the overall transformation matrix of the code. As a consequence, the code changes as compared to the polar code without such inner edge permutations: properly designed permutations lead to an increase of the minimum distance or at least a decrease of the number of codewords (multiplicity) at the minimum distance. In both cases, the error rate performance is significantly improved, without effecting the polarization effect and hence the bit reliabilities.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126559077","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 : 2018-04-01DOI: 10.1109/WCNCW.2018.8369029
M. Machin, Julio A. Sanguesa, Piedad Garrido, F. Martinez
Due to the progressive increase in the population and the complexity of their mobility needs, the evolution of transportation systems to solve advanced mobility problems has been necessary. Additionally, there are many situations where the application of traditional solutions is not entirely effective, e.g., when the processing of large amounts of data collected from in-vehicle sensors and network devices is required. To overcome these issues, several Artificial Intelligence-based techniques have been applied to different areas related to the transportation environment. In this paper, we present a study of the diverse Artificial Intelligence (AI) techniques which have been implemented to improve Intelligent Transportation Systems (ITS). In particular, we grouped them into three main areas depending on the main field where they were applied: (i) Vehicle control, (ii) Traffic control and prediction, as well as (iii) Road safety and accident prediction. The results of this study reveal that the combination of different AI techniques seems to be very promising, especially to manage and analyze the massive amount of data generated in transportation.
{"title":"On the use of artificial intelligence techniques in intelligent transportation systems","authors":"M. Machin, Julio A. Sanguesa, Piedad Garrido, F. Martinez","doi":"10.1109/WCNCW.2018.8369029","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369029","url":null,"abstract":"Due to the progressive increase in the population and the complexity of their mobility needs, the evolution of transportation systems to solve advanced mobility problems has been necessary. Additionally, there are many situations where the application of traditional solutions is not entirely effective, e.g., when the processing of large amounts of data collected from in-vehicle sensors and network devices is required. To overcome these issues, several Artificial Intelligence-based techniques have been applied to different areas related to the transportation environment. In this paper, we present a study of the diverse Artificial Intelligence (AI) techniques which have been implemented to improve Intelligent Transportation Systems (ITS). In particular, we grouped them into three main areas depending on the main field where they were applied: (i) Vehicle control, (ii) Traffic control and prediction, as well as (iii) Road safety and accident prediction. The results of this study reveal that the combination of different AI techniques seems to be very promising, especially to manage and analyze the massive amount of data generated in transportation.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129292760","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}
In this paper, we consider a device-to-device (D2D) wireless network, in which the wireless users act as helpers to provide the nearby users requested files through the D2D communication. We study an optimal caching strategy to minimize the outage probability where the co-channel interference among different D2D links is considered. In particular, we model the average file outage probability as a function of the signal-to-interference ratio (SINR), target data rate, capacity of caching storage, and file popularity with the assumption that users are randomly distributed by a Poisson point process (PPP). Simulation results show that our optimal caching strategy outperforms the existing ones in terms of average file outage probability.
{"title":"Optimal caching strategy in device-to-device wireless networks","authors":"Shao Peng, Liying Li, Xianing Tan, Guodong Zhao, Zhi Chen","doi":"10.1109/WCNCW.2018.8369013","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369013","url":null,"abstract":"In this paper, we consider a device-to-device (D2D) wireless network, in which the wireless users act as helpers to provide the nearby users requested files through the D2D communication. We study an optimal caching strategy to minimize the outage probability where the co-channel interference among different D2D links is considered. In particular, we model the average file outage probability as a function of the signal-to-interference ratio (SINR), target data rate, capacity of caching storage, and file popularity with the assumption that users are randomly distributed by a Poisson point process (PPP). Simulation results show that our optimal caching strategy outperforms the existing ones in terms of average file outage probability.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127892637","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 : 2018-04-01DOI: 10.1109/WCNCW.2018.8368987
Abdulkadir Karaagac, J. Haxhibeqiri, I. Moerman, J. Hoebeke
In Industry, there are number of time-critical applications with strong requirements for network services with latency and reliability guarantees. However, the lack of open and flexible, but also reliable and deterministic wireless communication solutions hinders the realization of fully connected and digital industrial spaces. In this paper, we investigate the approach of 6TiSCH architecture for deterministic networking performance and highlight its potential to be used in time-critical applications based on an experimental study.
{"title":"Time-critical communication in 6TiSCH networks","authors":"Abdulkadir Karaagac, J. Haxhibeqiri, I. Moerman, J. Hoebeke","doi":"10.1109/WCNCW.2018.8368987","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368987","url":null,"abstract":"In Industry, there are number of time-critical applications with strong requirements for network services with latency and reliability guarantees. However, the lack of open and flexible, but also reliable and deterministic wireless communication solutions hinders the realization of fully connected and digital industrial spaces. In this paper, we investigate the approach of 6TiSCH architecture for deterministic networking performance and highlight its potential to be used in time-critical applications based on an experimental study.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"161 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113959286","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 : 2018-01-29DOI: 10.1109/WCNCW.2018.8369038
G. Wunder, I. Roth, Rick Fritschek, Benedikt Groß, J. Eisert
The Internet of Things and specifically the Tactile Internet give rise to significant challenges for notions of security. In this work, we introduce a novel concept for secure massive access. The core of our approach is a fast and low-complexity blind deconvolution algorithm exploring a bi-linear and hierarchical compressed sensing framework. We show that blind deconvolution has two appealing features: 1) There is no need to coordinate the pilot signals, so even in the case of collisions in user activity, the information messages can be resolved. 2) Since all the individual channels are recovered in parallel, and by assumed channel reciprocity, the measured channel entropy serves as a common secret and is used as an encryption key for each user. We will outline the basic concepts underlying the approach and describe the blind deconvolution algorithm in detail. Eventually, simulations demonstrate the ability of the algorithm to recover both channel and message. They also exhibit the inherent trade-offs of the scheme between economical recovery and secret capacity.
{"title":"Secure massive IoT using hierarchical fast blind deconvolution","authors":"G. Wunder, I. Roth, Rick Fritschek, Benedikt Groß, J. Eisert","doi":"10.1109/WCNCW.2018.8369038","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369038","url":null,"abstract":"The Internet of Things and specifically the Tactile Internet give rise to significant challenges for notions of security. In this work, we introduce a novel concept for secure massive access. The core of our approach is a fast and low-complexity blind deconvolution algorithm exploring a bi-linear and hierarchical compressed sensing framework. We show that blind deconvolution has two appealing features: 1) There is no need to coordinate the pilot signals, so even in the case of collisions in user activity, the information messages can be resolved. 2) Since all the individual channels are recovered in parallel, and by assumed channel reciprocity, the measured channel entropy serves as a common secret and is used as an encryption key for each user. We will outline the basic concepts underlying the approach and describe the blind deconvolution algorithm in detail. Eventually, simulations demonstrate the ability of the algorithm to recover both channel and message. They also exhibit the inherent trade-offs of the scheme between economical recovery and secret capacity.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130231973","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 : 2017-12-01DOI: 10.1109/WCNCW.2018.8369026
P. Giard, A. Burg
Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern error-correcting codes. However, high-speed list-based decoders with moderate complexity are challenging to implement. Successive-cancellation (SC)-flip decoding was shown to be capable of a competitive error-correction performance compared to that of list decoding with a small list size, at a fraction of the complexity, but suffers from a variable execution time and a higher worst-case latency. In this work, we show how to modify the state-of-the-art high-speed SC decoding algorithm to incorporate the SC-flip ideas. The algorithmic improvements are presented as well as average execution-time results tailored to a hardware implementation. The results show that the proposed fast-SSC-flip algorithm has a decoding speed close to an order of magnitude better than the previous works while retaining a comparable error-correction performance.
{"title":"Fast-SSC-flip decoding of polar codes","authors":"P. Giard, A. Burg","doi":"10.1109/WCNCW.2018.8369026","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8369026","url":null,"abstract":"Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern error-correcting codes. However, high-speed list-based decoders with moderate complexity are challenging to implement. Successive-cancellation (SC)-flip decoding was shown to be capable of a competitive error-correction performance compared to that of list decoding with a small list size, at a fraction of the complexity, but suffers from a variable execution time and a higher worst-case latency. In this work, we show how to modify the state-of-the-art high-speed SC decoding algorithm to incorporate the SC-flip ideas. The algorithmic improvements are presented as well as average execution-time results tailored to a hardware implementation. The results show that the proposed fast-SSC-flip algorithm has a decoding speed close to an order of magnitude better than the previous works while retaining a comparable error-correction performance.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129837775","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 : 2017-11-29DOI: 10.1109/WCNCW.2018.8368991
C. Condo, Furkan Ercan, W. Gross
Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for 5th generation wireless communication standards. Successive-cancellation (SC) decoding of polar codes has mediocre error-correction performance on short to moderate codeword lengths: the SC-Flip decoding algorithm is one of the solutions that have been proposed to overcome this issue. On the other hand, SC-Flip has a higher implementation complexity compared to SC due to the required log-likelihood ratio (LLR) selection and sorting process. Moreover, it requires a high number of iterations to reach good error-correction performance. In this work, we propose two techniques to improve the SC-Flip decoding algorithm for low-rate codes, based on the observation of channel-induced error distributions. The first one is a fixed index selection (FIS) scheme to avoid the substantial implementation cost of LLR selection and sorting with no cost on error-correction performance. The second is an enhanced index selection (EIS) criterion to improve the error-correction performance of SC-Flip decoding. A reduction of 24.6% in the implementation cost of logic elements is estimated with the FIS approach, while simulation results show that EIS leads to an improvement on error-correction performance improvement up to 0.34 dB at a target FER of 10−4.
{"title":"Improved successive cancellation flip decoding of polar codes based on error distribution","authors":"C. Condo, Furkan Ercan, W. Gross","doi":"10.1109/WCNCW.2018.8368991","DOIUrl":"https://doi.org/10.1109/WCNCW.2018.8368991","url":null,"abstract":"Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for 5th generation wireless communication standards. Successive-cancellation (SC) decoding of polar codes has mediocre error-correction performance on short to moderate codeword lengths: the SC-Flip decoding algorithm is one of the solutions that have been proposed to overcome this issue. On the other hand, SC-Flip has a higher implementation complexity compared to SC due to the required log-likelihood ratio (LLR) selection and sorting process. Moreover, it requires a high number of iterations to reach good error-correction performance. In this work, we propose two techniques to improve the SC-Flip decoding algorithm for low-rate codes, based on the observation of channel-induced error distributions. The first one is a fixed index selection (FIS) scheme to avoid the substantial implementation cost of LLR selection and sorting with no cost on error-correction performance. The second is an enhanced index selection (EIS) criterion to improve the error-correction performance of SC-Flip decoding. A reduction of 24.6% in the implementation cost of logic elements is estimated with the FIS approach, while simulation results show that EIS leads to an improvement on error-correction performance improvement up to 0.34 dB at a target FER of 10−4.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124713982","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
扫码关注我们
求助内容：
应助结果提醒方式：