Pub Date : 2010-05-23DOI: 10.1109/ICC.2010.5502669
J. Mangues‐Bafalluy, M. Requena-Esteso, José Núñez-Martínez, A. Krendzel
This paper presents the experimental performance evaluation of the distributed Virtual Home Region Multi-Hash Location Service (VIMLOC). This is, up to our knowledge, the first location management scheme specifically designed and implemented for medium/large-scale wireless mesh networks (WMNs,) which are seen as a cost-effective solution to provide broadband wireless access in large areas. Therefore, if the use of geographic routing is assumed for scalability reasons, such a location management is needed to map between the identifier of a node and its current position in the network (i.e., location address). Furthermore, this paper also presents what is, up to our knowledge, the first experimental performance comparison over a WMN testbed of three different location management schemes, namely proactive, reactive, and VIMLOC. All three schemes have been implemented in the Click modular router framework. For the scenario under test, the quantitative results show that the VIMLOC protocol has comparable (or better) success rate to that of the proactive and reactive schemes. Additionally, VIMLOC outperforms these schemes in terms of overall overhead, state volume, and efficiency parameters, in general.
{"title":"VIMLOC Location Management in Wireless Meshes: Experimental Performance Evaluation and Comparison","authors":"J. Mangues‐Bafalluy, M. Requena-Esteso, José Núñez-Martínez, A. Krendzel","doi":"10.1109/ICC.2010.5502669","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502669","url":null,"abstract":"This paper presents the experimental performance evaluation of the distributed Virtual Home Region Multi-Hash Location Service (VIMLOC). This is, up to our knowledge, the first location management scheme specifically designed and implemented for medium/large-scale wireless mesh networks (WMNs,) which are seen as a cost-effective solution to provide broadband wireless access in large areas. Therefore, if the use of geographic routing is assumed for scalability reasons, such a location management is needed to map between the identifier of a node and its current position in the network (i.e., location address). Furthermore, this paper also presents what is, up to our knowledge, the first experimental performance comparison over a WMN testbed of three different location management schemes, namely proactive, reactive, and VIMLOC. All three schemes have been implemented in the Click modular router framework. For the scenario under test, the quantitative results show that the VIMLOC protocol has comparable (or better) success rate to that of the proactive and reactive schemes. Additionally, VIMLOC outperforms these schemes in terms of overall overhead, state volume, and efficiency parameters, in general.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"29 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78383775","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502594
Jie Gu, Zhi Xue
The main property of the self-healing key distribution scheme is that even if during a certain session some broadcast messages are lost due to network faults, the users are still capable of recovering lost session keys on their own, without requesting additional transmission from the group manager. In this paper, we propose and analyze an efficient self-healing key distribution scheme based on vector space secret sharing and one way hash function. We prove that our scheme achieves both forward and backward secrecy and resists to a collusion attack.
{"title":"An Efficient Self-Healing Key Distribution with Resistance to the Collusion Attack for Wireless Sensor Networks","authors":"Jie Gu, Zhi Xue","doi":"10.1109/ICC.2010.5502594","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502594","url":null,"abstract":"The main property of the self-healing key distribution scheme is that even if during a certain session some broadcast messages are lost due to network faults, the users are still capable of recovering lost session keys on their own, without requesting additional transmission from the group manager. In this paper, we propose and analyze an efficient self-healing key distribution scheme based on vector space secret sharing and one way hash function. We prove that our scheme achieves both forward and backward secrecy and resists to a collusion attack.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78504490","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502741
Yiyang Pei, Ying-Chang Liang, K. C. Teh, K. H. Li
In this paper, we investigate the optimal transmitter design, under the restriction of Gaussian signalling without preprocessing of information, for a secure multiple-input single-output (MISO) cognitive radio network (CRN), which consists of four terminals: a pair of secondary user transmitter (SU-Tx) and receiver, an eavesdropper and a primary user (PU). It is assumed that all the channel state information is not perfectly known at the SU-Tx due to the channel estimation errors and the loose cooperation between the SU and the PU. The design involves a nonconvex semi-infinite optimization problem, which maximizes the rate of the secondary link while avoiding harmful interference to the PU and preventing the eavesdropper from decoding the messages sent regardless of the uncertainties in the CSI. For this challenging optimization problem, we relate it with a sequence of semi-infinite capacity-achieving transmitter design problems in an auxiliary CRN without any eavesdropper, which can then be solved through transformations and using convex semidefinite programs. Finally, numerical examples are presented to evaluate the performance of the proposed algorithm.
{"title":"Achieving Robust, Secure and Cognitive Transmissions Using Multiple Antennas","authors":"Yiyang Pei, Ying-Chang Liang, K. C. Teh, K. H. Li","doi":"10.1109/ICC.2010.5502741","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502741","url":null,"abstract":"In this paper, we investigate the optimal transmitter design, under the restriction of Gaussian signalling without preprocessing of information, for a secure multiple-input single-output (MISO) cognitive radio network (CRN), which consists of four terminals: a pair of secondary user transmitter (SU-Tx) and receiver, an eavesdropper and a primary user (PU). It is assumed that all the channel state information is not perfectly known at the SU-Tx due to the channel estimation errors and the loose cooperation between the SU and the PU. The design involves a nonconvex semi-infinite optimization problem, which maximizes the rate of the secondary link while avoiding harmful interference to the PU and preventing the eavesdropper from decoding the messages sent regardless of the uncertainties in the CSI. For this challenging optimization problem, we relate it with a sequence of semi-infinite capacity-achieving transmitter design problems in an auxiliary CRN without any eavesdropper, which can then be solved through transformations and using convex semidefinite programs. Finally, numerical examples are presented to evaluate the performance of the proposed algorithm.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"107 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77391617","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 : 2010-05-23DOI: 10.1109/ICC.2010.5501788
V. Pla, J. Vidal, J. Martínez-Bauset, L. Guijarro
Cognitive Radio (CR) networks are envisaged as the key technology to realize dynamic spectrum access and solving the scarcity of radio spectrum. Having a temporal characterization of the spectrum white spaces in the primary network is a key element for studying and designing radio resource management mechanisms in CR networks. In that sense, most of the studies in the literature rely on an ON-OFF model with exponentially distributed on and off times. The usage of that model, however, is principally based on its analytical tractability. In this paper we propose a versatile Markovian model for the duration of the spectrum white spaces. Our model builds on a simple model of the channel holding time (CHT) in the primary network and then matrix-analytic techniques are applied to derive and analyze the duration of the white spaces. Despite its simplicity, the proposed approach is proven to be able to model very accurately scenarios where the CHT distribution is of a more complex type not amenable to mathematical analysis. Our numerical results show that the duration of the white spaces exhibits a low sensitivity to the distribution of the channel holding time beyond the mean.
{"title":"Modeling and Characterization of Spectrum White Spaces for Underlay Cognitive Radio Networks","authors":"V. Pla, J. Vidal, J. Martínez-Bauset, L. Guijarro","doi":"10.1109/ICC.2010.5501788","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501788","url":null,"abstract":"Cognitive Radio (CR) networks are envisaged as the key technology to realize dynamic spectrum access and solving the scarcity of radio spectrum. Having a temporal characterization of the spectrum white spaces in the primary network is a key element for studying and designing radio resource management mechanisms in CR networks. In that sense, most of the studies in the literature rely on an ON-OFF model with exponentially distributed on and off times. The usage of that model, however, is principally based on its analytical tractability. In this paper we propose a versatile Markovian model for the duration of the spectrum white spaces. Our model builds on a simple model of the channel holding time (CHT) in the primary network and then matrix-analytic techniques are applied to derive and analyze the duration of the white spaces. Despite its simplicity, the proposed approach is proven to be able to model very accurately scenarios where the CHT distribution is of a more complex type not amenable to mathematical analysis. Our numerical results show that the duration of the white spaces exhibits a low sensitivity to the distribution of the channel holding time beyond the mean.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"35 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77564094","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502818
R. Prabhu, B. Daneshrad
In this paper, we develop an energy-efficient power allocation algorithm for the parallel channels of an OFDM system. This algorithm provides the optimum solution to a nonlinear fractional program involving an objective function called textit{energy-per- goodbit} (EPG). The EPG objective function models the impact of both transmit power and constant circuit power consumption. The energy minimization problem formulation is quite general and subsumes both maximize rate (MR) and maximize margin (MM) problems as specific cases. As a result, the energy efficiency viewpoint provides a convenient and unified perspective of the various water-filling solutions. Using a numerical example, we show that the energy-efficient solution is quite different from the MM or MR solutions and can provide several dBs of performance improvement. We also study the impact of rounding to discrete constellation sizes.
{"title":"An Energy-Efficient Water-Filling Algorithm for OFDM Systems","authors":"R. Prabhu, B. Daneshrad","doi":"10.1109/ICC.2010.5502818","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502818","url":null,"abstract":"In this paper, we develop an energy-efficient power allocation algorithm for the parallel channels of an OFDM system. This algorithm provides the optimum solution to a nonlinear fractional program involving an objective function called textit{energy-per- goodbit} (EPG). The EPG objective function models the impact of both transmit power and constant circuit power consumption. The energy minimization problem formulation is quite general and subsumes both maximize rate (MR) and maximize margin (MM) problems as specific cases. As a result, the energy efficiency viewpoint provides a convenient and unified perspective of the various water-filling solutions. Using a numerical example, we show that the energy-efficient solution is quite different from the MM or MR solutions and can provide several dBs of performance improvement. We also study the impact of rounding to discrete constellation sizes.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"54 1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77660306","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502185
Stefan Schürmans, Elias Weingärtner, T. Kempf, G. Ascheid, Klaus Wehrle, R. Leupers
Nowadays, the development of embedded system hardware and related system software is mostly carried out using virtual platform environments. The high level of modeling detail (hardware elements are partially modeled in a cycle-accurate fashion) is required for many core design tasks. At the same time, the high computational complexity of virtual platforms caused by the detailed level of simulation hinders their application for modeling large networks of embedded systems. In this paper, we propose the integration of virtual platforms with network simulations, combining the accuracy of virtual platforms with the versatility and scalability of network simulation tools. Forming such a hybrid toolchain facilitates the detailed analysis of embedded network systems and related important design aspects, such as resource effectiveness, prior to their actual deployment.
{"title":"Towards Network Centric Development of Embedded Systems","authors":"Stefan Schürmans, Elias Weingärtner, T. Kempf, G. Ascheid, Klaus Wehrle, R. Leupers","doi":"10.1109/ICC.2010.5502185","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502185","url":null,"abstract":"Nowadays, the development of embedded system hardware and related system software is mostly carried out using virtual platform environments. The high level of modeling detail (hardware elements are partially modeled in a cycle-accurate fashion) is required for many core design tasks. At the same time, the high computational complexity of virtual platforms caused by the detailed level of simulation hinders their application for modeling large networks of embedded systems. In this paper, we propose the integration of virtual platforms with network simulations, combining the accuracy of virtual platforms with the versatility and scalability of network simulation tools. Forming such a hybrid toolchain facilitates the detailed analysis of embedded network systems and related important design aspects, such as resource effectiveness, prior to their actual deployment.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"39 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77674114","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502615
M. Khojastepour, Xiaodong Wang
We consider the interference relay channel (IRC) where a single relay assists the communications between multiple source-destination links under the half-duplex (HD) constraint. We assume each source has an independent message and its transmitted signal may cause interference at the other destinations. We assume each node only estimates its backward channels and has no knowledge of its forward channels as well as the other links. The role of the relay is to generate signals to cooperate with the intended signal and mitigate the interference at all destinations. Specifically, we propose coding schemes and transmission strategies for 2-user AWGN IRC with two sourcedestination pairs. We compare the performance of the proposed IRC coding schemes with that of a TDMA strategy where each source-destination pair communicates in alternative time slots with the assistance of the relay. Our simulation results based on practical turbo codes as underlying constituent codes show that the proposed transmission strategies result in a significant performance improvement over TDMA strategy in terms of outage probability and throughput.
{"title":"Achievable Rates for Multiuser Interference Relay Channel","authors":"M. Khojastepour, Xiaodong Wang","doi":"10.1109/ICC.2010.5502615","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502615","url":null,"abstract":"We consider the interference relay channel (IRC) where a single relay assists the communications between multiple source-destination links under the half-duplex (HD) constraint. We assume each source has an independent message and its transmitted signal may cause interference at the other destinations. We assume each node only estimates its backward channels and has no knowledge of its forward channels as well as the other links. The role of the relay is to generate signals to cooperate with the intended signal and mitigate the interference at all destinations. Specifically, we propose coding schemes and transmission strategies for 2-user AWGN IRC with two sourcedestination pairs. We compare the performance of the proposed IRC coding schemes with that of a TDMA strategy where each source-destination pair communicates in alternative time slots with the assistance of the relay. Our simulation results based on practical turbo codes as underlying constituent codes show that the proposed transmission strategies result in a significant performance improvement over TDMA strategy in terms of outage probability and throughput.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"119 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78168255","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 : 2010-05-23DOI: 10.1109/ICC.2010.5501817
C. Westphal, C. Perkins
The number of devices connected to the Internet has outstripped the number of effectively assignable IPv4 addresses. In order to be globally reachable, many devices must share the same IPv4 address; current mechanisms only provide reachability when the device sharing the IPv4 address itself initiates communication. We describe a mechanism to make nodes behind a NAT globally reachable, even when communications are initiated from the global Internet. The intended application of the mechanism, denoted SIPNAT, is to allow for the first time bidirectional global reachability of IPv6 addresses by nodes in the global IPv4 Internet, in a scalable manner, thus resolving the major issue associated with IPv4-IPv6 translation. SIPNAT involves filtering flows at the gateway between the IPv4 and IPv6 domain through a combination of DNS request and timing information for the IPv4 initiated connection (the IPv6 to IPv4 connections are performed using typical NAT mechanisms, where the IPv6 domain takes the role of the private address space). We study the performance of the SIPNAT mechanism using queuing theoretic analysis, and show that our SIPNAT model is accurate on actual data traces.
{"title":"A Queueing Theoretic Analysis of Source IP NAT","authors":"C. Westphal, C. Perkins","doi":"10.1109/ICC.2010.5501817","DOIUrl":"https://doi.org/10.1109/ICC.2010.5501817","url":null,"abstract":"The number of devices connected to the Internet has outstripped the number of effectively assignable IPv4 addresses. In order to be globally reachable, many devices must share the same IPv4 address; current mechanisms only provide reachability when the device sharing the IPv4 address itself initiates communication. We describe a mechanism to make nodes behind a NAT globally reachable, even when communications are initiated from the global Internet. The intended application of the mechanism, denoted SIPNAT, is to allow for the first time bidirectional global reachability of IPv6 addresses by nodes in the global IPv4 Internet, in a scalable manner, thus resolving the major issue associated with IPv4-IPv6 translation. SIPNAT involves filtering flows at the gateway between the IPv4 and IPv6 domain through a combination of DNS request and timing information for the IPv4 initiated connection (the IPv6 to IPv4 connections are performed using typical NAT mechanisms, where the IPv6 domain takes the role of the private address space). We study the performance of the SIPNAT mechanism using queuing theoretic analysis, and show that our SIPNAT model is accurate on actual data traces.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"8 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79760946","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502402
Zhezhuang Xu, C. Long, Cailian Chen, X. Guan
Dynamic Clustering is an efficient topology management approach for sensor networks. Observing the fact that the clustering has tight relations with inter-cluster routing problem, we propose a hybrid clustering and routing protocol (HCR) that considers both the cluster head selection and routing discovery problems. Random backoff and gradient routing strategies are used to achieve our design goals with low overhead. Considering the limited transmission range bounded by the hardware, the clustered network generated by HCR is ensured to be connected. Simulation results demonstrate that our proposed strategies ensure the connectivity of the network and improve the energy efficiency for data transmission.
{"title":"Hybrid Clustering and Routing Strategy with Low Overhead for Wireless Sensor Networks","authors":"Zhezhuang Xu, C. Long, Cailian Chen, X. Guan","doi":"10.1109/ICC.2010.5502402","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502402","url":null,"abstract":"Dynamic Clustering is an efficient topology management approach for sensor networks. Observing the fact that the clustering has tight relations with inter-cluster routing problem, we propose a hybrid clustering and routing protocol (HCR) that considers both the cluster head selection and routing discovery problems. Random backoff and gradient routing strategies are used to achieve our design goals with low overhead. Considering the limited transmission range bounded by the hardware, the clustered network generated by HCR is ensured to be connected. Simulation results demonstrate that our proposed strategies ensure the connectivity of the network and improve the energy efficiency for data transmission.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"8 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80270305","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 : 2010-05-23DOI: 10.1109/ICC.2010.5502283
A. Abrardo
In this paper, we focus on the design of optimized binary convolutional codes (CCs) and serially concatenated convolutional codes (SCCCs) in the presence of a-priori information (API) at the receiver. First, we propose a design criterion for CCs based on the minimization of the bit error proabability (BEP). In this case, relevant performance gains, with respect to previously proposed CCs, are obtained. These gains persist even in the presence of estimation errors on the API. Then, we apply the same BEP-based design criterion to SCCCs and derive good encoders' structures. In the SCCC case with API at the receiver, simulation results show substantial gains with respect to previously proposed parallel concatenated convolutional coding (PCCCing) schemes optimized under the assumption of no API at the decoder. Moreover, in the presence of strong API the proposed SCCCs allow to approach the Shannon limit (SL) more than any previously proposed turbo coding scheme.
{"title":"Design of Efficient Convolutional and Serially Concatenated Convolutional Codes with A-Priori Information","authors":"A. Abrardo","doi":"10.1109/ICC.2010.5502283","DOIUrl":"https://doi.org/10.1109/ICC.2010.5502283","url":null,"abstract":"In this paper, we focus on the design of optimized binary convolutional codes (CCs) and serially concatenated convolutional codes (SCCCs) in the presence of a-priori information (API) at the receiver. First, we propose a design criterion for CCs based on the minimization of the bit error proabability (BEP). In this case, relevant performance gains, with respect to previously proposed CCs, are obtained. These gains persist even in the presence of estimation errors on the API. Then, we apply the same BEP-based design criterion to SCCCs and derive good encoders' structures. In the SCCC case with API at the receiver, simulation results show substantial gains with respect to previously proposed parallel concatenated convolutional coding (PCCCing) schemes optimized under the assumption of no API at the decoder. Moreover, in the presence of strong API the proposed SCCCs allow to approach the Shannon limit (SL) more than any previously proposed turbo coding scheme.","PeriodicalId":6405,"journal":{"name":"2010 IEEE International Conference on Communications","volume":"57 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80486139","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
扫码关注我们
求助内容：
应助结果提醒方式：