Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633882
Yan Lin, Guangxin Yue
A novel beamspace eigen-fllter 2D Rake receiver for DS-CDMA communication system is proposed in this paper. The proposed algorithm's performance is very close to the optimal space-time algorithm and it can outperform the beamspace-frequency algorithm. Another advantage is that the proposed algorithm is computationally more efficient in comparing with the beamspace-frequency algorithm.
{"title":"A novel beamspace eigen-filter algorithm for 2D Rake receiver","authors":"Yan Lin, Guangxin Yue","doi":"10.1109/WCSP.2010.5633882","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633882","url":null,"abstract":"A novel beamspace eigen-fllter 2D Rake receiver for DS-CDMA communication system is proposed in this paper. The proposed algorithm's performance is very close to the optimal space-time algorithm and it can outperform the beamspace-frequency algorithm. Another advantage is that the proposed algorithm is computationally more efficient in comparing with the beamspace-frequency algorithm.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130997652","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-11-11DOI: 10.1109/WCSP.2010.5633493
J. Dang, Zaichen Zhang, Xiaoyan Wang
In our previous work [1] we have proposed a new ultra-wideband (UWB) communication scheme referred to as two-level multicarrier (TLMC) UWB. TLMC UWB has some structurally inherited advantages compared to the conventional multiband orthogonal frequency division multiplexing UWB scheme, which make it a promising candidate for future ultra-high speed communications. However, in that work we presented the proposed scheme in a general manner. In this paper we study a specific type of TLMC UWB which is based on exponentially modulated filter banks. We will elaborate the system model and investigate the equalization task in detail. System performance is also evaluated through computer simulation.
{"title":"Two-level multicarrier UWB: A case study","authors":"J. Dang, Zaichen Zhang, Xiaoyan Wang","doi":"10.1109/WCSP.2010.5633493","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633493","url":null,"abstract":"In our previous work [1] we have proposed a new ultra-wideband (UWB) communication scheme referred to as two-level multicarrier (TLMC) UWB. TLMC UWB has some structurally inherited advantages compared to the conventional multiband orthogonal frequency division multiplexing UWB scheme, which make it a promising candidate for future ultra-high speed communications. However, in that work we presented the proposed scheme in a general manner. In this paper we study a specific type of TLMC UWB which is based on exponentially modulated filter banks. We will elaborate the system model and investigate the equalization task in detail. System performance is also evaluated through computer simulation.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132730043","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-11-11DOI: 10.1109/WCSP.2010.5633452
Ali Ghayoor, Saeed Ghorbani, A. Beheshti
A new method for image registration has been previously proposed by the authors, which the registration is based on physical forces. The registration parameters are translation and rotation. This method assumes images like charged materials that attract each other. In this case, one of the images moves in the same direction as the applied force while the other one is still. The movement of the image continues until the resultant force becomes zero. This approach estimates the registration parameters simultaneously and leading to a better optimized set of registration parameters. The registration error for this method is 1 to 3 pixels. In this paper we aim to develop this method for the applications which need sub-pixel accuracy. First, by applying the Canny edge detector on the input images, the edge information is also used for the registration process to increase the robustness of this method in the presence of noise. After that, sub-pixel accuracy is provided for this method by using interpolation techniques.
{"title":"Sub-pixel image registration based on physical forces","authors":"Ali Ghayoor, Saeed Ghorbani, A. Beheshti","doi":"10.1109/WCSP.2010.5633452","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633452","url":null,"abstract":"A new method for image registration has been previously proposed by the authors, which the registration is based on physical forces. The registration parameters are translation and rotation. This method assumes images like charged materials that attract each other. In this case, one of the images moves in the same direction as the applied force while the other one is still. The movement of the image continues until the resultant force becomes zero. This approach estimates the registration parameters simultaneously and leading to a better optimized set of registration parameters. The registration error for this method is 1 to 3 pixels. In this paper we aim to develop this method for the applications which need sub-pixel accuracy. First, by applying the Canny edge detector on the input images, the edge information is also used for the registration process to increase the robustness of this method in the presence of noise. After that, sub-pixel accuracy is provided for this method by using interpolation techniques.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134411476","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-11-11DOI: 10.1109/WCSP.2010.5633534
Meng Li-min, Wu Yi-fan, H. Jingyu, Xu Zhijiang
Ad Hoc networks is recently a hot spot in wireless network researching domain. The design of routing algorithm, which is as the core layer technology in Ad Hoc networks, has drawn great concern. In response to the drawbacks of traditional routing protocols such as bad convergence and providing no QoS guarantee, this paper gives the way to construct node vector function to represent QoS indices in networks. And then combining the idea of Grover quantum searching and DSR protocol, it puts forward a MANET routing model based on Quantum search algorithm. In the process of routing, this algorithm gets node probability vector by Grover computation on node vector function in networks. Results of simulation show that comparing with DSR protocol, routing algorithm based on Quantum search algorithm can converge quickly and provide QoS guarantee, which fills up the deficiency of the exiting algorithm.
{"title":"Research on routing model for MANET based on quantum search algorithm","authors":"Meng Li-min, Wu Yi-fan, H. Jingyu, Xu Zhijiang","doi":"10.1109/WCSP.2010.5633534","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633534","url":null,"abstract":"Ad Hoc networks is recently a hot spot in wireless network researching domain. The design of routing algorithm, which is as the core layer technology in Ad Hoc networks, has drawn great concern. In response to the drawbacks of traditional routing protocols such as bad convergence and providing no QoS guarantee, this paper gives the way to construct node vector function to represent QoS indices in networks. And then combining the idea of Grover quantum searching and DSR protocol, it puts forward a MANET routing model based on Quantum search algorithm. In the process of routing, this algorithm gets node probability vector by Grover computation on node vector function in networks. Results of simulation show that comparing with DSR protocol, routing algorithm based on Quantum search algorithm can converge quickly and provide QoS guarantee, which fills up the deficiency of the exiting algorithm.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123952922","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-11-11DOI: 10.1109/WCSP.2010.5633905
Hafiz Imitas, S. Fattah
In this paper, a spectral feature extraction algorithm is proposed for palm-print recognition, which can efficiently capture the detail spatial variations in a palm-print image. The entire image is segmented into several narrow-width bands and the task of feature extraction is carried out in each band using two dimensional Fourier transform. It is shown that the proposed dominant spectral feature selection algorithm is capable of capturing the variation within the palm-print image, which provides not only the advantage of very low feature dimension but also a very high within-class compactness and between-class separability. Extensive experimentations have been carried out upon different publicly available standard palm-print image databases and the recognition performance obtained by the proposed method is compared with those of some of the recent methods. It is found that the proposed method offers a very high degree of recognition accuracy along with huge computational savings.
{"title":"A spectral domain feature extraction scheme for palm-print recognition","authors":"Hafiz Imitas, S. Fattah","doi":"10.1109/WCSP.2010.5633905","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633905","url":null,"abstract":"In this paper, a spectral feature extraction algorithm is proposed for palm-print recognition, which can efficiently capture the detail spatial variations in a palm-print image. The entire image is segmented into several narrow-width bands and the task of feature extraction is carried out in each band using two dimensional Fourier transform. It is shown that the proposed dominant spectral feature selection algorithm is capable of capturing the variation within the palm-print image, which provides not only the advantage of very low feature dimension but also a very high within-class compactness and between-class separability. Extensive experimentations have been carried out upon different publicly available standard palm-print image databases and the recognition performance obtained by the proposed method is compared with those of some of the recent methods. It is found that the proposed method offers a very high degree of recognition accuracy along with huge computational savings.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121233957","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-11-11DOI: 10.1109/WCSP.2010.5633540
G. Kraidy, P. Rossi
In this paper we study the performance of space-time bit-interleaved coded modulation (ST-BICM) over block-fading multi-input multi-output (MIMO) channels with iterative receivers based on minimum mean square error (MMSE) detection. We show how full diversity can be achieved with a special class of space-time precoders. Performance in terms of symbol error rate (SER) and word error rate (WER), obtained via Monte Carlo simulations, is shown.
{"title":"Full-diversity iterative MMSE receivers with space-time precoders over block-fading MIMO channels","authors":"G. Kraidy, P. Rossi","doi":"10.1109/WCSP.2010.5633540","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633540","url":null,"abstract":"In this paper we study the performance of space-time bit-interleaved coded modulation (ST-BICM) over block-fading multi-input multi-output (MIMO) channels with iterative receivers based on minimum mean square error (MMSE) detection. We show how full diversity can be achieved with a special class of space-time precoders. Performance in terms of symbol error rate (SER) and word error rate (WER), obtained via Monte Carlo simulations, is shown.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128589063","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-11-11DOI: 10.1109/WCSP.2010.5633519
QUAN LIU, Jun Gao, Yunwei Guo, Siyang Liu
Multiuser collaboration can significantly improve the performance of spectrum sensing in cognitive radio networks. By admitting the noise power estimation error and fading/shadowing effects in practical implementation, this paper presents another look at the energy detection based cooperative spectrum sensing. The worst-case collective probability of miss detection due to the noise uncertainty is derived under the spectrum utilization constraint, and the numerical results over Log-normal shadowing channel confirm that the performance deterioration can be compensated for if more secondary users take part in the cooperative sensing, since there will be a higher chance for a user with its instantaneous SNR beyond the SNR wall. Further, the effect of noise uncertainty on cooperative spectrum sensing is quantized by the equivalent "SNR wall" as in the local sensing. Typical K out of N fusion strategies are considered and compared in terms of the equivalent SNR wall reduction relative to the local case. As is demonstrated by the results, the robustness gain to noise uncertainty brought by cooperative spectrum sensing can be adjusted to any required level if sufficient users and a reasonable fusion strategy are met, and among the three typical fusion strategies, OR rule performs the best, Major rule is the next, and AND rule is the worst.
多用户协作可以显著提高认知无线网络的频谱感知性能。考虑到实际实现中存在的噪声功率估计误差和衰落/阴影效应，本文从另一个角度研究了基于能量检测的协同频谱感知。在频谱利用约束下，导出了由于噪声不确定性导致的最坏情况下脱靶集体概率，对数正态阴影信道上的数值结果证实，如果有更多的二次用户参与协同感知，则性能下降可以得到补偿，因为瞬时信噪比超过信噪比墙的用户将有更高的机会参与协同感知。此外，噪声不确定性对协同频谱感知的影响通过等效的“信噪比墙”量化。考虑了典型的K out of N融合策略，并根据相对于局部情况的等效信噪比壁降低进行了比较。结果表明，在满足足够的用户和合理的融合策略的情况下，协同频谱感知对噪声不确定性的鲁棒性增益可以调整到任何需要的水平，在三种典型融合策略中，OR规则表现最好，Major规则次之，and规则最差。
{"title":"Robustness improvement against noise uncertainty by cooperative spectrum sensing","authors":"QUAN LIU, Jun Gao, Yunwei Guo, Siyang Liu","doi":"10.1109/WCSP.2010.5633519","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633519","url":null,"abstract":"Multiuser collaboration can significantly improve the performance of spectrum sensing in cognitive radio networks. By admitting the noise power estimation error and fading/shadowing effects in practical implementation, this paper presents another look at the energy detection based cooperative spectrum sensing. The worst-case collective probability of miss detection due to the noise uncertainty is derived under the spectrum utilization constraint, and the numerical results over Log-normal shadowing channel confirm that the performance deterioration can be compensated for if more secondary users take part in the cooperative sensing, since there will be a higher chance for a user with its instantaneous SNR beyond the SNR wall. Further, the effect of noise uncertainty on cooperative spectrum sensing is quantized by the equivalent \"SNR wall\" as in the local sensing. Typical K out of N fusion strategies are considered and compared in terms of the equivalent SNR wall reduction relative to the local case. As is demonstrated by the results, the robustness gain to noise uncertainty brought by cooperative spectrum sensing can be adjusted to any required level if sufficient users and a reasonable fusion strategy are met, and among the three typical fusion strategies, OR rule performs the best, Major rule is the next, and AND rule is the worst.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597159","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-11-11DOI: 10.1109/WCSP.2010.5633495
J. Trdlicka, Z. Hanzálek
This work proposes a distributed algorithm for the energy optimal routing in wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or the knowledge about the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links.
{"title":"Distributed algorithm for energy optimal multi-commodity network flow routing in sensor networks","authors":"J. Trdlicka, Z. Hanzálek","doi":"10.1109/WCSP.2010.5633495","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633495","url":null,"abstract":"This work proposes a distributed algorithm for the energy optimal routing in wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or the knowledge about the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128511838","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-11-11DOI: 10.1109/WCSP.2010.5633455
Lin-Chuan Tsai, W. Lai
In this paper, we investigate the cause of the second harmonic of the parasitic pass-band of coupled-serial-shunted lines band-pass filters. Filters are employed substrate suspension, wavy-edge coupling, ring resonators, and a combination of the wavy-edge coupling and ring resonators to suppress the harmonic pass-band. Using a continuous perturbation of the wavy-edge and ring resonators of the harmonic pass-band of the parallel-coupled line filter is rejected. A synthesizing method is presented to design Chebyshev type II band-pass filters in the microwave frequency range. Chebyshev type Π band-pass filters are implemented to validate this method correct by measuring.
{"title":"Wideband band-pass filters with spurious band suppression","authors":"Lin-Chuan Tsai, W. Lai","doi":"10.1109/WCSP.2010.5633455","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633455","url":null,"abstract":"In this paper, we investigate the cause of the second harmonic of the parasitic pass-band of coupled-serial-shunted lines band-pass filters. Filters are employed substrate suspension, wavy-edge coupling, ring resonators, and a combination of the wavy-edge coupling and ring resonators to suppress the harmonic pass-band. Using a continuous perturbation of the wavy-edge and ring resonators of the harmonic pass-band of the parallel-coupled line filter is rejected. A synthesizing method is presented to design Chebyshev type II band-pass filters in the microwave frequency range. Chebyshev type Π band-pass filters are implemented to validate this method correct by measuring.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115561122","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-11-11DOI: 10.1109/WCSP.2010.5633511
H. Gao, Rong-fang Song, Junxi Zhao
In multiuser wireless communication systems, adaptive modulation and scheduling are promising techniques for increasing the system throughput. To achieve this goal, it is necessary to feed back the information of channel quality indication (CQI). The required feedback rate can be prohibitively high in multicarrier OFDM systems and so the feedback information needs to be compressed. In this paper, a novel CQI feedback scheme is proposed based on the recently proposed compressive sensing theory, and the performance of the scheme is shown to outperform the DCT compression method which is usually considered as the best.
{"title":"Compression of CQI feedback with compressive sensing in adaptive OFDM systems","authors":"H. Gao, Rong-fang Song, Junxi Zhao","doi":"10.1109/WCSP.2010.5633511","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633511","url":null,"abstract":"In multiuser wireless communication systems, adaptive modulation and scheduling are promising techniques for increasing the system throughput. To achieve this goal, it is necessary to feed back the information of channel quality indication (CQI). The required feedback rate can be prohibitively high in multicarrier OFDM systems and so the feedback information needs to be compressed. In this paper, a novel CQI feedback scheme is proposed based on the recently proposed compressive sensing theory, and the performance of the scheme is shown to outperform the DCT compression method which is usually considered as the best.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114538690","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
扫码关注我们
求助内容：
应助结果提醒方式：