Pub Date : 2015-06-08DOI: 10.1109/ICCW.2015.7247372
M. Safari
This work investigates the problem of efficient signalling for optical wireless communication systems in the presence of signal-dependent noise. We propose a novel scheme based on signalling in the square-root domain (as defined by a square-root transform) where the optical channel originally distorted by signal-dependent noise is transformed into a stationary white Gaussian noise channel. The bit error rate (BER) of the proposed scheme is derived and compared with the BER performance of the conventional signalling in time domain. As an alternative solution, signalling in frequency domain is analyzed in the presence of signal-dependent noise.
{"title":"Efficient optical wireless communication in the presence of signal-dependent noise","authors":"M. Safari","doi":"10.1109/ICCW.2015.7247372","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247372","url":null,"abstract":"This work investigates the problem of efficient signalling for optical wireless communication systems in the presence of signal-dependent noise. We propose a novel scheme based on signalling in the square-root domain (as defined by a square-root transform) where the optical channel originally distorted by signal-dependent noise is transformed into a stationary white Gaussian noise channel. The bit error rate (BER) of the proposed scheme is derived and compared with the BER performance of the conventional signalling in time domain. As an alternative solution, signalling in frequency domain is analyzed in the presence of signal-dependent noise.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77749873","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247536
Sicong Liu, Fang Yang, Wenbo Ding, Jian Song
In this paper, a novel narrowband interference (NBI) cancellation scheme based on structured compressive sensing (SCS) for dependable vehicular communications systems is proposed. The temporal joint correlation of the repeated training sequences in the preamble are exploited by SCS-based differential measuring (SCS-DM) to acquire the joint measurements matrix of the NBI. Using the proposed structured sparsity adaptive matching pursuit (S-SAMP) algorithm, the sparse high-dimensional NBI signal can be accurately recovered and cancelled out at the receiver. Simulation results validate that the proposed SCS-DM approach outperforms conventional CS-based and non-CS-based NBI mitigation schemes under wireless vehicular channels.
{"title":"Structured compressive sensing based narrowband interference mitigation for vehicular communications","authors":"Sicong Liu, Fang Yang, Wenbo Ding, Jian Song","doi":"10.1109/ICCW.2015.7247536","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247536","url":null,"abstract":"In this paper, a novel narrowband interference (NBI) cancellation scheme based on structured compressive sensing (SCS) for dependable vehicular communications systems is proposed. The temporal joint correlation of the repeated training sequences in the preamble are exploited by SCS-based differential measuring (SCS-DM) to acquire the joint measurements matrix of the NBI. Using the proposed structured sparsity adaptive matching pursuit (S-SAMP) algorithm, the sparse high-dimensional NBI signal can be accurately recovered and cancelled out at the receiver. Simulation results validate that the proposed SCS-DM approach outperforms conventional CS-based and non-CS-based NBI mitigation schemes under wireless vehicular channels.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80281912","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247212
Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami
This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.
{"title":"Joint scheduling and power allocation in Cognitive Radio systems","authors":"Raouia Masmoudi, E. Belmega, I. Fijalkow, N. Sellami","doi":"10.1109/ICCW.2015.7247212","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247212","url":null,"abstract":"This paper investigates a joint spectrum scheduling and power allocation problem in Cognitive Radio (CR) network composed of several secondary (SU) and primary users (PU). The objective is to minimize the overall SU system power consumption (over several orthogonal frequency bands) under minimum Quality of Service (QoS) constraints, maximum peak and average interference to the PUs constraints. The main challenge lies in the non-convexity of the problem because of the discrete spectrum scheduling policies. We overcome this issue by considering a simpler and convex problem based on Lagrangian relaxation. It turns out that, this problem has discrete solutions which are the optimal solutions to our initial non-convex problem. We propose an iterative sub-gradient algorithm to compute the optimal solution, when it exists, assuming that the channels are drawn randomly. In the case of symmetric systems, this algorithm is not suitable. Therefore, we study such a case for which we give an analytical solution. Several numerical results that sustain and give insight into the resolution of this problem are also provided.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80419254","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247394
Shenglan Huang, E. Izquierdo, Pengwei Hao
This paper proposed an optimized packet scheduling algorithm for live peer-to-peer streaming system, where network coding technique is extended to improve the efficiency in bandwidth utilization. We identify a problem of undesirable non-innovative packet transmission due to the latency of buffer-map update among peers, which, with many previous proposed techniques, yields to bandwidth inefficiencies. In the proposed system, we present an optimized packet scheduling algorithm for forecasting the number of required packets at parent nodes in advance, a selection mechanism for selecting and encoding packets for forwarding, and an adaptive push algorithm for smart frame skipping. The proposed optimized packet scheduling algorithm calculates the minimum number of required packets for full rate transmission. Transmitting as the scheduled results can reduce non-innovative packet transmission, save limited bandwidth for innovative transmission, thereby improving the streaming continuity. The simulation results show that the proposed scheme provides significantly better video quality, delivery ratio, lower redundancy rate, and higher innovative video packet rate compared with previous packet scheduling algorithms.
{"title":"Optimized packet scheduling for live streaming on peer-to-peer network with network coding","authors":"Shenglan Huang, E. Izquierdo, Pengwei Hao","doi":"10.1109/ICCW.2015.7247394","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247394","url":null,"abstract":"This paper proposed an optimized packet scheduling algorithm for live peer-to-peer streaming system, where network coding technique is extended to improve the efficiency in bandwidth utilization. We identify a problem of undesirable non-innovative packet transmission due to the latency of buffer-map update among peers, which, with many previous proposed techniques, yields to bandwidth inefficiencies. In the proposed system, we present an optimized packet scheduling algorithm for forecasting the number of required packets at parent nodes in advance, a selection mechanism for selecting and encoding packets for forwarding, and an adaptive push algorithm for smart frame skipping. The proposed optimized packet scheduling algorithm calculates the minimum number of required packets for full rate transmission. Transmitting as the scheduled results can reduce non-innovative packet transmission, save limited bandwidth for innovative transmission, thereby improving the streaming continuity. The simulation results show that the proposed scheme provides significantly better video quality, delivery ratio, lower redundancy rate, and higher innovative video packet rate compared with previous packet scheduling algorithms.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79153462","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247226
Maksym A. Girnyk, Frederic Gabry, Mikko Vehkaperä, L. Rasmussen, M. Skoglund
Security issues in wireless networks have become a subject of growing interest in recent years due to the broadcast nature of wireless channels. In this paper, we investigate secure communication over a multi-antenna wiretap channel in the presence of randomly distributed eavesdroppers. In the fast fading environment, the overall performance of this channel is traditionally characterized by the ergodic secrecy capacity, which, in general, cannot be derived explicitly. Nevertheless, based on the assumption that the numbers of antennas at legitimate terminals and the number of eavesdroppers grow large without bound, we derive a deterministic approximation of an achievable ergodic secrecy rate for arbitrary inputs. In addition, we characterize the secrecy rates for practically relevant separate-decoding scheme at the receiver. We validate the proposed large-system approximation through numerical simulations and observe a good match with the actual secrecy rates. Finally, we also analyze some interesting behavior of the secrecy rates in the given scenario depending on the geometry of the nodes.
{"title":"MIMO wiretap channels with randomly located eavesdroppers: Large-system analysis","authors":"Maksym A. Girnyk, Frederic Gabry, Mikko Vehkaperä, L. Rasmussen, M. Skoglund","doi":"10.1109/ICCW.2015.7247226","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247226","url":null,"abstract":"Security issues in wireless networks have become a subject of growing interest in recent years due to the broadcast nature of wireless channels. In this paper, we investigate secure communication over a multi-antenna wiretap channel in the presence of randomly distributed eavesdroppers. In the fast fading environment, the overall performance of this channel is traditionally characterized by the ergodic secrecy capacity, which, in general, cannot be derived explicitly. Nevertheless, based on the assumption that the numbers of antennas at legitimate terminals and the number of eavesdroppers grow large without bound, we derive a deterministic approximation of an achievable ergodic secrecy rate for arbitrary inputs. In addition, we characterize the secrecy rates for practically relevant separate-decoding scheme at the receiver. We validate the proposed large-system approximation through numerical simulations and observe a good match with the actual secrecy rates. Finally, we also analyze some interesting behavior of the secrecy rates in the given scenario depending on the geometry of the nodes.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85096572","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247507
Yunbae Kim, G. Hwang, Jungsun Um, Sungjin Yoo, Hoiyoon Jung, Seungkeun Park
As Wireless Local Area Networks (WLANs) become denser and denser recently, the contention-based MAC protocol such as the IEEE 802.11 DCF, the de facto standard for the WLAN, should be modified to handle such dense WLANs. To this end, we consider a recently proposed novel MAC protocol called the Renewal Access Protocol (RAP) in this paper. With the RAP, we consider two strategies for resolving collisions efficiently and achieving high throughput performance in a super dense WLAN: strategies without and with grouping. First, we analyze the asymptotic behavior of the RAP itself (i.e., without grouping) as the number of terminals goes to infinity. We show that the RAP can achieve optimal throughput even in a super dense WLAN and the related optimal access probability of the RAP can be derived in a closed-form from the analysis. Second, we propose a new grouping strategy in the RAP and call it the grouped RAP (G-RAP). While a grouping strategy in the IEEE 802.11ah standard is based on time division, which can cause a waste of channel, our grouping strategy is based on transmission attempts, which does not waste channel resources. From the analysis we show that the G-RAP easily achieves the optimal network throughput performance for any group structure (i.e., unform group size and arbitrary group size) if terminals use the optimal access probability that we derive. Our analytical results are validated by simulation.
{"title":"Optimal throughput analysis of a super dense wireless network with the Renewal Access Protocol","authors":"Yunbae Kim, G. Hwang, Jungsun Um, Sungjin Yoo, Hoiyoon Jung, Seungkeun Park","doi":"10.1109/ICCW.2015.7247507","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247507","url":null,"abstract":"As Wireless Local Area Networks (WLANs) become denser and denser recently, the contention-based MAC protocol such as the IEEE 802.11 DCF, the de facto standard for the WLAN, should be modified to handle such dense WLANs. To this end, we consider a recently proposed novel MAC protocol called the Renewal Access Protocol (RAP) in this paper. With the RAP, we consider two strategies for resolving collisions efficiently and achieving high throughput performance in a super dense WLAN: strategies without and with grouping. First, we analyze the asymptotic behavior of the RAP itself (i.e., without grouping) as the number of terminals goes to infinity. We show that the RAP can achieve optimal throughput even in a super dense WLAN and the related optimal access probability of the RAP can be derived in a closed-form from the analysis. Second, we propose a new grouping strategy in the RAP and call it the grouped RAP (G-RAP). While a grouping strategy in the IEEE 802.11ah standard is based on time division, which can cause a waste of channel, our grouping strategy is based on transmission attempts, which does not waste channel resources. From the analysis we show that the G-RAP easily achieves the optimal network throughput performance for any group structure (i.e., unform group size and arbitrary group size) if terminals use the optimal access probability that we derive. Our analytical results are validated by simulation.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85203614","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247213
José Reis, Miguel Luís, Luís Bernardo, Rodolfo Oliveira, R. Dinis, Paulo Pinto
This paper proposes a new analytical model for the performance of a p persistent slotted Aloha medium access protocol in a Cognitive Radio Network (CRN) composed by a single Primary user (PU) and several Secondary users (SUs) with Poisson traffic. SUs run a synchronized sensing-access operation cycle, and when they have a packet to transmit and the channel is sensed free, they access to the data slots with probability p. PU change their activity state (ON/OFF) independently of the SUs, and an energy-based sensing performance model is considered. This paper proposes a new analytical model for the SU's delay and throughput which, contrarily to the existing models, considers the effect of the duration of the PU's ON state in the SUs delay. The model is validated through simulations, and the optimal p value is calculated for different scenarios. Two context-aware configurations are proposed: the optimal p value when only the number of SUs is known, and when the number and load are known.
{"title":"Performance of a cognitive p-persistent slotted Aloha protocol","authors":"José Reis, Miguel Luís, Luís Bernardo, Rodolfo Oliveira, R. Dinis, Paulo Pinto","doi":"10.1109/ICCW.2015.7247213","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247213","url":null,"abstract":"This paper proposes a new analytical model for the performance of a p persistent slotted Aloha medium access protocol in a Cognitive Radio Network (CRN) composed by a single Primary user (PU) and several Secondary users (SUs) with Poisson traffic. SUs run a synchronized sensing-access operation cycle, and when they have a packet to transmit and the channel is sensed free, they access to the data slots with probability p. PU change their activity state (ON/OFF) independently of the SUs, and an energy-based sensing performance model is considered. This paper proposes a new analytical model for the SU's delay and throughput which, contrarily to the existing models, considers the effect of the duration of the PU's ON state in the SUs delay. The model is validated through simulations, and the optimal p value is calculated for different scenarios. Two context-aware configurations are proposed: the optimal p value when only the number of SUs is known, and when the number and load are known.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85860023","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247287
T. Chu, H. Zepernick, Hoc Phan
In this paper, we propose a strategy to coordinate the dynamic spectrum access (DSA) of different types of traffic. It is assumed that the DSA assigns spectrum bands to three kinds of prioritized traffic, the traffic of the primary network, the Class 1 traffic and Class 2 traffic of the secondary network. Possessing the licensed spectrum, the primary traffic has the highest access priority and can access the spectrum bands at anytime. The secondary Class 1 traffic has higher priority compared to secondary Class 2 traffic. In this system, a channel reservation scheme is deployed to control spectrum access of the traffic. Specifically, the optimal number of reservation channels is applied to minimize the forced termination probability of the secondary traffic while satisfying a predefined blocking probability of the primary network. To investigate the system performance, we model state transitions of the DSA as a multi-dimensional Markov chain with three-state variables representing the number of primary, Class 1, and Class 2 packets in the system. Based on this chain, important performance measures, i.e., blocking probability and forced termination probability are derived for the Class 1 and Class 2 secondary traffic.
{"title":"Channel reservation for dynamic spectrum access of cognitive radio networks with prioritized traffic","authors":"T. Chu, H. Zepernick, Hoc Phan","doi":"10.1109/ICCW.2015.7247287","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247287","url":null,"abstract":"In this paper, we propose a strategy to coordinate the dynamic spectrum access (DSA) of different types of traffic. It is assumed that the DSA assigns spectrum bands to three kinds of prioritized traffic, the traffic of the primary network, the Class 1 traffic and Class 2 traffic of the secondary network. Possessing the licensed spectrum, the primary traffic has the highest access priority and can access the spectrum bands at anytime. The secondary Class 1 traffic has higher priority compared to secondary Class 2 traffic. In this system, a channel reservation scheme is deployed to control spectrum access of the traffic. Specifically, the optimal number of reservation channels is applied to minimize the forced termination probability of the secondary traffic while satisfying a predefined blocking probability of the primary network. To investigate the system performance, we model state transitions of the DSA as a multi-dimensional Markov chain with three-state variables representing the number of primary, Class 1, and Class 2 packets in the system. Based on this chain, important performance measures, i.e., blocking probability and forced termination probability are derived for the Class 1 and Class 2 secondary traffic.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85813417","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247425
S. Yoon, Suwon Lee, Youngjin Kim, Panhyung Lee, Chang-Yeong Oh, I. Youn, E. Monroy, Ziaul Hasany, Jungah Choi
Quality of Experience (QoE) has emerged as the key performance metric to evaluate end-user service quality perception. We propose a system for video and web QoE assessment in LTE networks that we call QoE Analytics system. We build the proposed system and run it on a LTE network and successfully estimates QoE metrics per UE in real-time by inspecting user plane data on S1 interface without any QoE report from UEs. QoE metrics measured by QoE Analytics are verified to be in close match to actual UE observations such as initial playout delay, rebuffering percentage and rebuffering duration for video applications and download time for web traffic. Optimization of eNB scheduler performance based on this real-time QoE Analytics feedback is demonstrated by video QoE-aware scheduler and a significant improvement in QoE metrics is observed in congested situation.
{"title":"Mobile data service QoE analytics and optimization","authors":"S. Yoon, Suwon Lee, Youngjin Kim, Panhyung Lee, Chang-Yeong Oh, I. Youn, E. Monroy, Ziaul Hasany, Jungah Choi","doi":"10.1109/ICCW.2015.7247425","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247425","url":null,"abstract":"Quality of Experience (QoE) has emerged as the key performance metric to evaluate end-user service quality perception. We propose a system for video and web QoE assessment in LTE networks that we call QoE Analytics system. We build the proposed system and run it on a LTE network and successfully estimates QoE metrics per UE in real-time by inspecting user plane data on S1 interface without any QoE report from UEs. QoE metrics measured by QoE Analytics are verified to be in close match to actual UE observations such as initial playout delay, rebuffering percentage and rebuffering duration for video applications and download time for web traffic. Optimization of eNB scheduler performance based on this real-time QoE Analytics feedback is demonstrated by video QoE-aware scheduler and a significant improvement in QoE metrics is observed in congested situation.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78297789","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 : 2015-06-08DOI: 10.1109/ICCW.2015.7247502
D. Nguyen, Hang Nguyen
This paper proposes an improved Logarithmic Maximum A Posteriori (Log-MAP) algorithm for Turbo decoding in the Third Generation Partnership Project Long Term Evolution (3GPP LTE). In the proposed algorithm, we exploit the understanding of polynomial regression function to approximately compute the logarithm term (also called correction function) in the Jacobian logarithmic function. The goal is to replace the correction function with another function with the approximated performance and the reduced computational complexity. Simulation results show that the performance of the proposed algorithm is closest to the Log-MAP algorithm for Turbo decoding under Additive White Gaussian Noise (AWGN) channel and can offer about maximum 0.4dB performance gain than the Max-Log-MAP algorithm and higher than other Log-MAP-based algorithms. The proposed algorithm has much simpler computational complexity in comparison with the Log-MAP algorithm and slightly increased compared to the Max-Log-MAP algorithm.
{"title":"An improved Log-MAP algorithm based on polynomial regression function for LTE Turbo decoding","authors":"D. Nguyen, Hang Nguyen","doi":"10.1109/ICCW.2015.7247502","DOIUrl":"https://doi.org/10.1109/ICCW.2015.7247502","url":null,"abstract":"This paper proposes an improved Logarithmic Maximum A Posteriori (Log-MAP) algorithm for Turbo decoding in the Third Generation Partnership Project Long Term Evolution (3GPP LTE). In the proposed algorithm, we exploit the understanding of polynomial regression function to approximately compute the logarithm term (also called correction function) in the Jacobian logarithmic function. The goal is to replace the correction function with another function with the approximated performance and the reduced computational complexity. Simulation results show that the performance of the proposed algorithm is closest to the Log-MAP algorithm for Turbo decoding under Additive White Gaussian Noise (AWGN) channel and can offer about maximum 0.4dB performance gain than the Max-Log-MAP algorithm and higher than other Log-MAP-based algorithms. The proposed algorithm has much simpler computational complexity in comparison with the Log-MAP algorithm and slightly increased compared to the Max-Log-MAP algorithm.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78112511","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
扫码关注我们
求助内容：
应助结果提醒方式：