Pub Date : 2013-12-11DOI: 10.1109/PIMRC.2013.6666225
Kai Chen, K. Niu, Jiaru Lin
A new bit-interleaved polar coded modulation (BIPCM) scheme is proposed. To reduce the construction complexity, the simplest kernel matrix for channel polarization is adopted. And auxiliary virtual channels with zero-capacities are introduced to adapt different modulation orders. The underlying polar codes are efficiently constructed by calculating the Bhattacharyya parameters of equivalent binary-input erasure channels (BECs) rather than computing-expensive density evolution. Further, to avoid exhaustive searching, an empirically good channel mapping scheme is provided. Compared with the existing BIPCM schemes, the proposed scheme has a lower construction complexity and can achieve a better performance. With cyclic redundancy check (CRC) aided decoding algorithms, the block error rate (BLER) performance of our proposed BIPCM scheme can outperform the turbo coded modulation scheme used in WCDMA (Wideband Code Division Multiple Access) wireless communication system by up to 0.5dB.
{"title":"An efficient design of bit-interleaved polar coded modulation","authors":"Kai Chen, K. Niu, Jiaru Lin","doi":"10.1109/PIMRC.2013.6666225","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666225","url":null,"abstract":"A new bit-interleaved polar coded modulation (BIPCM) scheme is proposed. To reduce the construction complexity, the simplest kernel matrix for channel polarization is adopted. And auxiliary virtual channels with zero-capacities are introduced to adapt different modulation orders. The underlying polar codes are efficiently constructed by calculating the Bhattacharyya parameters of equivalent binary-input erasure channels (BECs) rather than computing-expensive density evolution. Further, to avoid exhaustive searching, an empirically good channel mapping scheme is provided. Compared with the existing BIPCM schemes, the proposed scheme has a lower construction complexity and can achieve a better performance. With cyclic redundancy check (CRC) aided decoding algorithms, the block error rate (BLER) performance of our proposed BIPCM scheme can outperform the turbo coded modulation scheme used in WCDMA (Wideband Code Division Multiple Access) wireless communication system by up to 0.5dB.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122958777","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666748
K. Mase
In this study, we assume that a number of electric vehicles (EVs), each with its respective partner unmanned electric helicopter (EH), are cooperatively engaged in wide-area disaster surveillance and data delivery to the center node. We present a simple model for area zoning assuming a wide square area and one-dimensional EV placement. Specifically, each EV-EH pair is in charge of a non-overlapping sub-area surveillance, and the surveillance data are temporarily stored in the EV. The partner EH is used to transfer the surveillance data, which are obtained in the sub-area in addition to those transferred from the immediate downstream EV, to the upstream EV via carry and forward. We present two principles for time-efficient surveillance and data transfer, that is, task-balanced zoning and synchronous data handover. Numerical examples are provided to show that the task-balanced zoning yields a slightly lower cycle time than does the uniform zoning, and synchronous handover results in significantly shorter data delivery times than does asynchronous handover.
{"title":"Wide-area disaster surveillance using electric vehicles and helicopters","authors":"K. Mase","doi":"10.1109/PIMRC.2013.6666748","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666748","url":null,"abstract":"In this study, we assume that a number of electric vehicles (EVs), each with its respective partner unmanned electric helicopter (EH), are cooperatively engaged in wide-area disaster surveillance and data delivery to the center node. We present a simple model for area zoning assuming a wide square area and one-dimensional EV placement. Specifically, each EV-EH pair is in charge of a non-overlapping sub-area surveillance, and the surveillance data are temporarily stored in the EV. The partner EH is used to transfer the surveillance data, which are obtained in the sub-area in addition to those transferred from the immediate downstream EV, to the upstream EV via carry and forward. We present two principles for time-efficient surveillance and data transfer, that is, task-balanced zoning and synchronous data handover. Numerical examples are provided to show that the task-balanced zoning yields a slightly lower cycle time than does the uniform zoning, and synchronous handover results in significantly shorter data delivery times than does asynchronous handover.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124161485","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666764
Qingyuan Hu, Chunhong Zhang, Yang Ji
A mechanism for distributed semantic similar resource search is proposed in P2P network. The mechanism is based on the content addressable network (CAN). CAN, one of P2P networks, has the natural ability to support the semantic similar search with the semantic vector space model (SVSM) of resources. However, there exists a mismatching problem between the low-dimension CAN network and the high-dimension resources, which needs a dimensionality reduction algorithm. For the semantic similar search in distributed environment of CAN, the applied dimensionality reduction algorithm needs to meet two specific requirements: maintenance for semantic similarity of SVSM of resources, and distributed computing with large and dynamic data, which is not well researched. A distributed algorithm called D-PCA is proposed based on the statistical characteristic of resources in each node. It extracts the principal components of original high-dimensional SVSM to reduce the dimension in a distributed way. D-PCA is taken as a novel hash function to project high-dimensional SVSM into low-dimensional space of distributed hash table in CAN. A semantic indexing and searching process based on semantic DHT in CAN are simulated to show the applicability of D-PCA and the effectiveness of semantic similar search.
{"title":"A distributed semantic similar search for high-dimensional resources in low-dimensional content addressable network","authors":"Qingyuan Hu, Chunhong Zhang, Yang Ji","doi":"10.1109/PIMRC.2013.6666764","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666764","url":null,"abstract":"A mechanism for distributed semantic similar resource search is proposed in P2P network. The mechanism is based on the content addressable network (CAN). CAN, one of P2P networks, has the natural ability to support the semantic similar search with the semantic vector space model (SVSM) of resources. However, there exists a mismatching problem between the low-dimension CAN network and the high-dimension resources, which needs a dimensionality reduction algorithm. For the semantic similar search in distributed environment of CAN, the applied dimensionality reduction algorithm needs to meet two specific requirements: maintenance for semantic similarity of SVSM of resources, and distributed computing with large and dynamic data, which is not well researched. A distributed algorithm called D-PCA is proposed based on the statistical characteristic of resources in each node. It extracts the principal components of original high-dimensional SVSM to reduce the dimension in a distributed way. D-PCA is taken as a novel hash function to project high-dimensional SVSM into low-dimensional space of distributed hash table in CAN. A semantic indexing and searching process based on semantic DHT in CAN are simulated to show the applicability of D-PCA and the effectiveness of semantic similar search.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126198974","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666583
Yiqun Wu, Gaoning He, Shunqing Zhang, Yan Chen, Shugong Xu
In this paper, we consider energy efficient coverage planning in cellular networks. To save energy, each base station (BS) can work in sleep mode when there is no user in its coverage or the users can be served by neighbor base stations. With increasing coverage overlap, there is a tradeoff between the number of BSs per unit area and the proportion of active base stations. Analytical and numerical methods are presented to evaluate coverage planning schemes with different inter-BS distance. Evaluation results show that compared with the minimum coverage overlap scheme, the optimal planning scheme can reduce the network energy consumption by more than 20%, and the performance improvement depends on the user density, network topology, and the power consumption of sleep mode.
{"title":"Energy efficient coverage planning in cellular networks with sleep mode","authors":"Yiqun Wu, Gaoning He, Shunqing Zhang, Yan Chen, Shugong Xu","doi":"10.1109/PIMRC.2013.6666583","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666583","url":null,"abstract":"In this paper, we consider energy efficient coverage planning in cellular networks. To save energy, each base station (BS) can work in sleep mode when there is no user in its coverage or the users can be served by neighbor base stations. With increasing coverage overlap, there is a tradeoff between the number of BSs per unit area and the proportion of active base stations. Analytical and numerical methods are presented to evaluate coverage planning schemes with different inter-BS distance. Evaluation results show that compared with the minimum coverage overlap scheme, the optimal planning scheme can reduce the network energy consumption by more than 20%, and the performance improvement depends on the user density, network topology, and the power consumption of sleep mode.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125847381","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666474
Ibrahim Khalil Sileh, W. Xiang, A. Maxwell
Orthogonal frequency division multiplexing (OFDM) has been adopted as a promising technique to mitigate multi-path fading and provides high spectral efficiency in broadband communications. In this paper, we investigate resource allocation and sub-carrier permutation in OFDM-based hybrid relay protocol over frequency-selective channels. Selective multicarrier-adaptive hybrid relay protocol (MC-AHRP), involves the sub-carrier utilizing an amplify-and-forward (AF) scheme when the instantaneous signal-to-noise ratio (SNR) is larger than threshold value and an adaptive decode-and-forward (ADF) scheme when the instantaneous SNR is less than threshold value. The proposed protocol exploits the benefits of adaptive hybrid relay protocol, OFDM, resource allocation, and sub-carrier permutation to provide a substantial enhancement in the system performance. The simulation results show that when the protocol performs resource allocation (RA) and sub-carrier permutation (SP) can provide an excellent improvement in the capacity of the system. It also demonstrate that the proposed protocol can achieve a significant improvement in throughput compared with conventional protocols.
{"title":"Joint subcarrier pairing and resource allocation for adaptive hybrid relay protocol in OFDM systems","authors":"Ibrahim Khalil Sileh, W. Xiang, A. Maxwell","doi":"10.1109/PIMRC.2013.6666474","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666474","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) has been adopted as a promising technique to mitigate multi-path fading and provides high spectral efficiency in broadband communications. In this paper, we investigate resource allocation and sub-carrier permutation in OFDM-based hybrid relay protocol over frequency-selective channels. Selective multicarrier-adaptive hybrid relay protocol (MC-AHRP), involves the sub-carrier utilizing an amplify-and-forward (AF) scheme when the instantaneous signal-to-noise ratio (SNR) is larger than threshold value and an adaptive decode-and-forward (ADF) scheme when the instantaneous SNR is less than threshold value. The proposed protocol exploits the benefits of adaptive hybrid relay protocol, OFDM, resource allocation, and sub-carrier permutation to provide a substantial enhancement in the system performance. The simulation results show that when the protocol performs resource allocation (RA) and sub-carrier permutation (SP) can provide an excellent improvement in the capacity of the system. It also demonstrate that the proposed protocol can achieve a significant improvement in throughput compared with conventional protocols.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131967376","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666271
Peng Zhang, F. Willems, Li Huang
Noncoherent pulse-position modulation (PPM) with simple channel codes has the potential to realize ultra-low power (ULP) wireless design. In this paper, we develop a Wagnerlike decoding rule for single-parity-check and high-rate Reed-Solomon (RS) coded PPM schemes by simply `flipping' the most unreliable received PPM symbol(s) to obtain a good balance between performance and coding complexity. The proposed algorithm can be considered as a list decoding algorithm that first generates a candidate codeword list based on the algebraic structure of the code before applying soft decisions to decode. This approach can result in more power-efficient realizations of the studied schemes. It is shown that our decoding approach can achieve near maximum likelihood decoding performance based on the trellis, while having a significantly lower decoding complexity. In addition, by exploiting the inherent advantage of PPM transmission, it is possible to reduce the candidate list to further simplify the decoding for RS-coded PPM without losing coding gain. This makes the proposed scheme more attractive for ULP communications.
{"title":"Wagner-like decoding for noncoherent PPM based ultra-low-power communications","authors":"Peng Zhang, F. Willems, Li Huang","doi":"10.1109/PIMRC.2013.6666271","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666271","url":null,"abstract":"Noncoherent pulse-position modulation (PPM) with simple channel codes has the potential to realize ultra-low power (ULP) wireless design. In this paper, we develop a Wagnerlike decoding rule for single-parity-check and high-rate Reed-Solomon (RS) coded PPM schemes by simply `flipping' the most unreliable received PPM symbol(s) to obtain a good balance between performance and coding complexity. The proposed algorithm can be considered as a list decoding algorithm that first generates a candidate codeword list based on the algebraic structure of the code before applying soft decisions to decode. This approach can result in more power-efficient realizations of the studied schemes. It is shown that our decoding approach can achieve near maximum likelihood decoding performance based on the trellis, while having a significantly lower decoding complexity. In addition, by exploiting the inherent advantage of PPM transmission, it is possible to reduce the candidate list to further simplify the decoding for RS-coded PPM without losing coding gain. This makes the proposed scheme more attractive for ULP communications.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"196 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133558636","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666391
Norberto Barroca, F. Velez, P. Chatzimisios
One of the fundamental reasons for the IEEE 802.15.4 standard Medium Access Control (MAC) inefficiency is overhead. The current paper proposes and analyses the Sensor Block Acknowledgment MAC (SBACK-MAC) protocol, a new innovative protocol that allows the aggregation of several acknowledgment responses in one special BACK Response packet. Two different solutions are addressed. The first one considers the SBACK-MAC protocol in the presence of BACK Request (concatenation) while the second one considers the SBACK-MAC in the absence of BACK Request (piggyback). The proposed solutions address a distributed scenario with single-destination and single-rate frame aggregation. The throughput and delay performance is mathematically derived under ideal conditions (a channel environment with no transmission errors). The proposed schemes are compared against the basic access mode of IEEE 802.15.4 through extensive simulations by employing the OM-NET++ simulator. We demonstrate that the network performance is significantly improved in terms of throughput and end-to-end delay.
{"title":"Block acknowledgment mechanisms for the optimization of channel use in wireless sensor networks","authors":"Norberto Barroca, F. Velez, P. Chatzimisios","doi":"10.1109/PIMRC.2013.6666391","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666391","url":null,"abstract":"One of the fundamental reasons for the IEEE 802.15.4 standard Medium Access Control (MAC) inefficiency is overhead. The current paper proposes and analyses the Sensor Block Acknowledgment MAC (SBACK-MAC) protocol, a new innovative protocol that allows the aggregation of several acknowledgment responses in one special BACK Response packet. Two different solutions are addressed. The first one considers the SBACK-MAC protocol in the presence of BACK Request (concatenation) while the second one considers the SBACK-MAC in the absence of BACK Request (piggyback). The proposed solutions address a distributed scenario with single-destination and single-rate frame aggregation. The throughput and delay performance is mathematically derived under ideal conditions (a channel environment with no transmission errors). The proposed schemes are compared against the basic access mode of IEEE 802.15.4 through extensive simulations by employing the OM-NET++ simulator. We demonstrate that the network performance is significantly improved in terms of throughput and end-to-end delay.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133988992","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666131
Sungkyu Jung, Jungwoo Lee
A novel interference alignment technique combined with interference cancellation is proposed. A new scenario of single-antenna 2-user X channel with a multiple-antenna relay is considered. The proposed interference alignment and cancellation scheme does not require any wireline links between receivers. In the proposed scheme, interference signals are not decoded. Instead, interference signals are just aligned, and the aligned signal is cancelled out to extract the desired signal. We call the proposed scheme an aligned interference cancellation technique. It is known that DoF of 4/2 is achievable for the two-user X channel using the interference alignment. In the proposed scheme, relay precoding matrices are designed to accomplish two purposes. One is to cancel out the aligned interference signals perfectly, and the other is to enable an equivalent received signal model of the Alamouti's codes. The proposed relay-aided interference alignment and cancellation technique not only makes interference alignment feasible, but also improves performance. The interference signals are aligned at a specific time slot, and the precoding matrices of the relay are designed to cancel the aligned interference. In simulations, it is verified that the diversity gain of 2 is achieved with the degrees-of-freedom (DoF) of 4/3.
{"title":"Interference alignment and cancellation for the two-user X channels with a relay","authors":"Sungkyu Jung, Jungwoo Lee","doi":"10.1109/PIMRC.2013.6666131","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666131","url":null,"abstract":"A novel interference alignment technique combined with interference cancellation is proposed. A new scenario of single-antenna 2-user X channel with a multiple-antenna relay is considered. The proposed interference alignment and cancellation scheme does not require any wireline links between receivers. In the proposed scheme, interference signals are not decoded. Instead, interference signals are just aligned, and the aligned signal is cancelled out to extract the desired signal. We call the proposed scheme an aligned interference cancellation technique. It is known that DoF of 4/2 is achievable for the two-user X channel using the interference alignment. In the proposed scheme, relay precoding matrices are designed to accomplish two purposes. One is to cancel out the aligned interference signals perfectly, and the other is to enable an equivalent received signal model of the Alamouti's codes. The proposed relay-aided interference alignment and cancellation technique not only makes interference alignment feasible, but also improves performance. The interference signals are aligned at a specific time slot, and the precoding matrices of the relay are designed to cancel the aligned interference. In simulations, it is verified that the diversity gain of 2 is achieved with the degrees-of-freedom (DoF) of 4/3.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132878157","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666144
Akis Kokkinis, M. Raspopoulos, L. Kanaris, A. Liotta, S. Stavrou
The objective of this work is to investigate potential accuracy improvements in the fingerprint-based indoor positioning processes, by imposing map-constraints into the positioning algorithms in the form of a-priori knowledge. In our approach, we propose the introduction of a Route Probability Factor (RPF), which reflects the possibility of a user, to be located on one position instead of all others. The RPF does not only affect the probabilities of the points along the pre-defined frequent routes, but also influences all the neighbouring points that lie at the proximity of each frequent route. The outcome of the evaluation process, indicates the validity of the RPF approach, demonstrated by the significant reduction of the positioning error.
{"title":"Map-aided fingerprint-based indoor positioning","authors":"Akis Kokkinis, M. Raspopoulos, L. Kanaris, A. Liotta, S. Stavrou","doi":"10.1109/PIMRC.2013.6666144","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666144","url":null,"abstract":"The objective of this work is to investigate potential accuracy improvements in the fingerprint-based indoor positioning processes, by imposing map-constraints into the positioning algorithms in the form of a-priori knowledge. In our approach, we propose the introduction of a Route Probability Factor (RPF), which reflects the possibility of a user, to be located on one position instead of all others. The RPF does not only affect the probabilities of the points along the pre-defined frequent routes, but also influences all the neighbouring points that lie at the proximity of each frequent route. The outcome of the evaluation process, indicates the validity of the RPF approach, demonstrated by the significant reduction of the positioning error.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122192997","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666233
A. Gokceoglu, S. Dikmese, M. Valkama, M. Renfors
Direct-conversion radio receivers can provide highly-integrated and low-cost hardware solutions for cognitive radio (CR) devices. However, such receiver structures are also known to suffer from various RF circuit imperfections, especially IQ imbalance. When studying the performance of various spectrum sensing methods, most existing work in literature neglect the effects of such RF imperfections. In this paper, we analyze the performance of a well-known eigenvalue based sensing method, namely maximum-to-minimum eigenvalue test, in the challenging multichannel spectrum sensing context under sensing receiver RF IQ imbalance. It is analytically shown that under RF IQ imbalance, the false alarm probability of the spectrum sensor is always higher compared to ideal RF front-end case. Then, in order to compensate for such degradation in the ability to identify free spectrum, a waveform level interference cancellation solution is deployed to enhance the performance, and optimum cancellation coefficient together with a practical sample estimator are formulated. Extensive computer simulations are provided to illustrate the degradation of false alarm probability in the presence of practical IQ imbalance values. Furthermore, the simulations also show that the proposed interference cancellation method can efficiently suppress the IQ imbalance effects, achieving identical false alarm probability with the ideal RF front-end case.
{"title":"Analysis and mitigation of RF IQ imbalance in eigenvalue based multichannel spectrum sensing","authors":"A. Gokceoglu, S. Dikmese, M. Valkama, M. Renfors","doi":"10.1109/PIMRC.2013.6666233","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666233","url":null,"abstract":"Direct-conversion radio receivers can provide highly-integrated and low-cost hardware solutions for cognitive radio (CR) devices. However, such receiver structures are also known to suffer from various RF circuit imperfections, especially IQ imbalance. When studying the performance of various spectrum sensing methods, most existing work in literature neglect the effects of such RF imperfections. In this paper, we analyze the performance of a well-known eigenvalue based sensing method, namely maximum-to-minimum eigenvalue test, in the challenging multichannel spectrum sensing context under sensing receiver RF IQ imbalance. It is analytically shown that under RF IQ imbalance, the false alarm probability of the spectrum sensor is always higher compared to ideal RF front-end case. Then, in order to compensate for such degradation in the ability to identify free spectrum, a waveform level interference cancellation solution is deployed to enhance the performance, and optimum cancellation coefficient together with a practical sample estimator are formulated. Extensive computer simulations are provided to illustrate the degradation of false alarm probability in the presence of practical IQ imbalance values. Furthermore, the simulations also show that the proposed interference cancellation method can efficiently suppress the IQ imbalance effects, achieving identical false alarm probability with the ideal RF front-end case.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336003","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
扫码关注我们
求助内容：
应助结果提醒方式：