Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633460
Haifen Yang, Guangjun Li, Zhiyong Guo, Yong Xiong
The diversity-multiplexing tradeoff function is of extreme importance for a given multiple antenna channel. Since severely fading scenarios arise in a variety of applications, this paper makes efforts to derive the diversity-multiplexing tradeoff function for severely fading channels. It is found that the tradeoff performance is specially related to the maximum eigenvalue of the channel matrix and the channel model's degrees of freedom (CMDF), which represents the extent of the fading. For the infinite CMDF, the diversity-multiplexing tradeoff function coincides with the existing result for the richly scattered Rayleigh fading channel.
{"title":"On the tradeoff performance of severely fading channels","authors":"Haifen Yang, Guangjun Li, Zhiyong Guo, Yong Xiong","doi":"10.1109/WCSP.2010.5633460","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633460","url":null,"abstract":"The diversity-multiplexing tradeoff function is of extreme importance for a given multiple antenna channel. Since severely fading scenarios arise in a variety of applications, this paper makes efforts to derive the diversity-multiplexing tradeoff function for severely fading channels. It is found that the tradeoff performance is specially related to the maximum eigenvalue of the channel matrix and the channel model's degrees of freedom (CMDF), which represents the extent of the fading. For the infinite CMDF, the diversity-multiplexing tradeoff function coincides with the existing result for the richly scattered Rayleigh fading channel.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"439 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":"116018767","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.5633451
Chen Hui, Zheng Bao
A new decoupling algorithm is proposed to estimate DOA of concentric uniform circular arrays (C-UCA). The new algorithm can calibrates mutual coupling of the inner sub-arrays, compensate for mutual coupling between sub-arrays, and then estimate DOA of signal sources. This algorithm transforms joint problem into cascade problem and gets the parameters by one dimension spectrum peak value searching, which avoids multidimensional nonlinear searching of multi-parameters joint estimation. The simulation and theoretic analysis validate the good performance of the proposed algorithm.
{"title":"Performance analysis of self-calibration algorithm for concentric-UCA","authors":"Chen Hui, Zheng Bao","doi":"10.1109/WCSP.2010.5633451","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633451","url":null,"abstract":"A new decoupling algorithm is proposed to estimate DOA of concentric uniform circular arrays (C-UCA). The new algorithm can calibrates mutual coupling of the inner sub-arrays, compensate for mutual coupling between sub-arrays, and then estimate DOA of signal sources. This algorithm transforms joint problem into cascade problem and gets the parameters by one dimension spectrum peak value searching, which avoids multidimensional nonlinear searching of multi-parameters joint estimation. The simulation and theoretic analysis validate the good performance of the proposed algorithm.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"13 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":"128301697","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.5633780
Yongjun Li, Ge Huang, Hu Chen, Shaocong Zou, Rong Xie
In this paper, we propose a dynamic layered routing protocol (DLRP) for IP multicast, in which not only the multicast source disseminates data packages through multicast or unicast mode based on network environments of the involving autonomy systems, but also the multicast router within one autonomy system can adopt the same strategy to determine the data transmission method. To verify the DLRP's feasibility, we implement this protocol using UCLA parsec programming language in a simulated network environment. In addition, we propose a scheme to measure the multicast routing cost and discuss how to dynamically select the proper data transmission mode (unicast or multicast) so that the multicast routing cost is minimized. Unlike the other popular multicast routing protocols, our DRLP can adapt to the dynamic change of the multicast network topology to achieve the optimal data transmission. Its dynamic group member management and flexible datagram routing strategy allow it to embrace any other data routing models (unicast or multicast).
{"title":"DLRP: Dynamic layered routing protocol for IP multicast","authors":"Yongjun Li, Ge Huang, Hu Chen, Shaocong Zou, Rong Xie","doi":"10.1109/WCSP.2010.5633780","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633780","url":null,"abstract":"In this paper, we propose a dynamic layered routing protocol (DLRP) for IP multicast, in which not only the multicast source disseminates data packages through multicast or unicast mode based on network environments of the involving autonomy systems, but also the multicast router within one autonomy system can adopt the same strategy to determine the data transmission method. To verify the DLRP's feasibility, we implement this protocol using UCLA parsec programming language in a simulated network environment. In addition, we propose a scheme to measure the multicast routing cost and discuss how to dynamically select the proper data transmission mode (unicast or multicast) so that the multicast routing cost is minimized. Unlike the other popular multicast routing protocols, our DRLP can adapt to the dynamic change of the multicast network topology to achieve the optimal data transmission. Its dynamic group member management and flexible datagram routing strategy allow it to embrace any other data routing models (unicast or multicast).","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"11 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":"128479042","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.5633456
Ke Xu, B. Shahrrava, Jianwei Wan
In this paper, we propose a unified framework to examine the effect of SNR mismatch on the performance of turbo algorithms, such as turbo equalization and turbo decoding. The proposed framework is based on a general model for a biased estimate of the signal-to-noise ratio (SNR) of the channel. It is shown how the estimation model can unify previously SNR mismatch models, which become special cases. Finally, simulation results show the effect of SNR mismatch on the bit error rate (BER) performance of a turbo equalizer based on the biased estimate of the channel SNR
{"title":"A unified framework for SNR mismatch in turbo algorithms","authors":"Ke Xu, B. Shahrrava, Jianwei Wan","doi":"10.1109/WCSP.2010.5633456","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633456","url":null,"abstract":"In this paper, we propose a unified framework to examine the effect of SNR mismatch on the performance of turbo algorithms, such as turbo equalization and turbo decoding. The proposed framework is based on a general model for a biased estimate of the signal-to-noise ratio (SNR) of the channel. It is shown how the estimation model can unify previously SNR mismatch models, which become special cases. Finally, simulation results show the effect of SNR mismatch on the bit error rate (BER) performance of a turbo equalizer based on the biased estimate of the channel SNR","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"4 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":"134460913","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.5633715
Guodong Zhao, Chenyang Yang, Geoffrey Y. Li, Dongdong Li, A. Soong, Dandan Wang
Cooperative spectrum sensing improves detection performance over fading and shadowing channels by using multiple cognitive radio (CR) users. Compared with local spectrum sensing with individual CR user, it can either reduce sensitivity requirements for each CR user or shorten the overall sensing duration. These advantages are from spatial diversity when all cooperative users sense a common primary user. However, in practice, CR users at different locations may receive signals from different primary users, which may confuse the fusion user and result in the loss of communication opportunities. In this paper, we propose a cooperative sensing approach by taking the reliability of each partner user into account. Simulation results illustrate significant performance improvement of the proposed approach.
{"title":"Communication-oriented cooperative spectrum sensing in cognitive radio","authors":"Guodong Zhao, Chenyang Yang, Geoffrey Y. Li, Dongdong Li, A. Soong, Dandan Wang","doi":"10.1109/WCSP.2010.5633715","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633715","url":null,"abstract":"Cooperative spectrum sensing improves detection performance over fading and shadowing channels by using multiple cognitive radio (CR) users. Compared with local spectrum sensing with individual CR user, it can either reduce sensitivity requirements for each CR user or shorten the overall sensing duration. These advantages are from spatial diversity when all cooperative users sense a common primary user. However, in practice, CR users at different locations may receive signals from different primary users, which may confuse the fusion user and result in the loss of communication opportunities. In this paper, we propose a cooperative sensing approach by taking the reliability of each partner user into account. Simulation results illustrate significant performance improvement of the proposed approach.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"45 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":"133032109","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.5633438
Jianping Zheng, B. Bai, Ying Li, Jingmei Liu
This letter considers the lossy source compression of a binary symmetric source using low-density generator matrix (LDGM) codes and truthiness propagation encoding algorithm. And a simple variant on the truthiness propagation is proposed by softening the a priori probability of the reconstructed source sequence. Comparisons with the truthiness propagation reveal that the proposed algorithm has better rate-distortion performance at low-to-medium code rates.
{"title":"Modified truthiness propagation algorithm for lossy source compression based on LDGM codes","authors":"Jianping Zheng, B. Bai, Ying Li, Jingmei Liu","doi":"10.1109/WCSP.2010.5633438","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633438","url":null,"abstract":"This letter considers the lossy source compression of a binary symmetric source using low-density generator matrix (LDGM) codes and truthiness propagation encoding algorithm. And a simple variant on the truthiness propagation is proposed by softening the a priori probability of the reconstructed source sequence. Comparisons with the truthiness propagation reveal that the proposed algorithm has better rate-distortion performance at low-to-medium code rates.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"22 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":"125407395","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.5633636
Yongquan Jiang
Despite the time-domain channel estimation (TDCE) can obtain high estimate accuracy, it should be performed only by the block pilot arrangement, which is not suitable for the fast fading channels. Despite the frequency-domain channel estimation (FDCE) can be performed by the comb pilot arrangement, which is particularly suitable for fast fading channels, its estimate accuracy and channel efficiency are low. In order to combat the disadvantages of TDCE and FDCE, the hybrid-domain channel estimation (HDCE) is proposed based on the hybrid-domain system model (HDSM), where the direct relation between the frequency-domain signals and the channel impulse response (CIR) is given. The HDCE can be performed by both the block and comb pilot arrangements. With the block pilot arrangement, the HDCE can obtain high estimate accuracy as the TDCE. With the comb pilot arrangement, the HDCE can obtain much higher estimate accuracy and channel efficiency compared with the FDCE. The HDCE provides a practical solution of the channel estimation with high accuracy and channel efficiency for the MTMO-OFDM systems over fast fading channels.
{"title":"Novel channel estimation for MIMO-OFDM systems with high efficiency and accuracy","authors":"Yongquan Jiang","doi":"10.1109/WCSP.2010.5633636","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633636","url":null,"abstract":"Despite the time-domain channel estimation (TDCE) can obtain high estimate accuracy, it should be performed only by the block pilot arrangement, which is not suitable for the fast fading channels. Despite the frequency-domain channel estimation (FDCE) can be performed by the comb pilot arrangement, which is particularly suitable for fast fading channels, its estimate accuracy and channel efficiency are low. In order to combat the disadvantages of TDCE and FDCE, the hybrid-domain channel estimation (HDCE) is proposed based on the hybrid-domain system model (HDSM), where the direct relation between the frequency-domain signals and the channel impulse response (CIR) is given. The HDCE can be performed by both the block and comb pilot arrangements. With the block pilot arrangement, the HDCE can obtain high estimate accuracy as the TDCE. With the comb pilot arrangement, the HDCE can obtain much higher estimate accuracy and channel efficiency compared with the FDCE. The HDCE provides a practical solution of the channel estimation with high accuracy and channel efficiency for the MTMO-OFDM systems over fast fading channels.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"26 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":"125564380","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.5633477
Xu Yong, Zhao Fei, Wu Yuanliang, Min Rui, Sun Zheng, Tang Lu
A single chip design of class D audio power amplifier is presented. It is composed with a rail-to-rail operational amplifier and a closed-loop pulse width modulation. It achieves a maxim power of 3.75W and consumes about 1.9mA quiescent current as maxim efficiency is more than 90%. When sine wave input signal frequency is 1KHz and output power is 3.75W, the THE) of output signal is only 0.1%. The chip is designed with thermal protection which turns the device off when the junction temperature surpasses 150°C to prevent damage to the IC.
{"title":"Single chip design of closed-loop class D audio power amplifier","authors":"Xu Yong, Zhao Fei, Wu Yuanliang, Min Rui, Sun Zheng, Tang Lu","doi":"10.1109/WCSP.2010.5633477","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633477","url":null,"abstract":"A single chip design of class D audio power amplifier is presented. It is composed with a rail-to-rail operational amplifier and a closed-loop pulse width modulation. It achieves a maxim power of 3.75W and consumes about 1.9mA quiescent current as maxim efficiency is more than 90%. When sine wave input signal frequency is 1KHz and output power is 3.75W, the THE) of output signal is only 0.1%. The chip is designed with thermal protection which turns the device off when the junction temperature surpasses 150°C to prevent damage to the IC.","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":"129059951","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.5632199
Shenshen Gu
In the field of signal processing, many problems can be formulated as optimization problems. And most of these optimization problem can be further described in a formal form, that is binary quadratic programming problem(BQP). However, solving the BQP is proved to be NP-hard. Due to this reason, many novel algorithms have been proposed in order to improve the efficiency to solve the BQP [4]. In this paper, polynomial algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix is focused by taking advantage of the basic algorithm proposed in [1], [17], [3]. The basic algorithm is firstly reviewed and then this algorithm is modified to solve binary quadratic programming problems with Q being a tri-diagonal. Furthermore, by improving this algorithm, an algorithm is proposed to solve binary quadratic programming problems with Q being a five-diagonal matrix.
{"title":"Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix","authors":"Shenshen Gu","doi":"10.1109/WCSP.2010.5632199","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5632199","url":null,"abstract":"In the field of signal processing, many problems can be formulated as optimization problems. And most of these optimization problem can be further described in a formal form, that is binary quadratic programming problem(BQP). However, solving the BQP is proved to be NP-hard. Due to this reason, many novel algorithms have been proposed in order to improve the efficiency to solve the BQP [4]. In this paper, polynomial algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix is focused by taking advantage of the basic algorithm proposed in [1], [17], [3]. The basic algorithm is firstly reviewed and then this algorithm is modified to solve binary quadratic programming problems with Q being a tri-diagonal. Furthermore, by improving this algorithm, an algorithm is proposed to solve binary quadratic programming problems with Q being a five-diagonal matrix.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"2 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":"128926730","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.5633523
S. Cotton, William G. Scanlon, B. Madahar
Link duration is the time interval during which two nodes are within transmission range of each other. In this paper, the link duration of the random waypoint (RWP) mobility model is derived and the result indicate that it is determined by the speed as well as incident angle of the speeds. By estimating the link duration in route selection for AODV, the energy, delay and packet delivery ratio metrics are improved.
{"title":"Link-duration-oriented route lifetime computation for AODV in MANET","authors":"S. Cotton, William G. Scanlon, B. Madahar","doi":"10.1109/WCSP.2010.5633523","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633523","url":null,"abstract":"Link duration is the time interval during which two nodes are within transmission range of each other. In this paper, the link duration of the random waypoint (RWP) mobility model is derived and the result indicate that it is determined by the speed as well as incident angle of the speeds. By estimating the link duration in route selection for AODV, the energy, delay and packet delivery ratio metrics are improved.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"10 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":"127987513","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
扫码关注我们
求助内容：
应助结果提醒方式：