Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633454
Lin-Chuan Tsai, W. Lai
A synthesizing method is proposed to design and implement wideband amplifiers in the microwave frequency range. The wideband amplifier is implemented by using Chebyshev matching transformers (CMT). In particular, the effective bandwidth of the CMT wideband amplifier increases 2.3GHz over the balance amplifier. The size of the CMT amplifier reduces to 30% of the balance amplifier. Two types of amplifier are built and tested. A methodology of designing the CMT amplifier is presented and implemented to validate this new method correct by measuring.
{"title":"Design and implementation of microwave amplifiers with matching transformers","authors":"Lin-Chuan Tsai, W. Lai","doi":"10.1109/WCSP.2010.5633454","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633454","url":null,"abstract":"A synthesizing method is proposed to design and implement wideband amplifiers in the microwave frequency range. The wideband amplifier is implemented by using Chebyshev matching transformers (CMT). In particular, the effective bandwidth of the CMT wideband amplifier increases 2.3GHz over the balance amplifier. The size of the CMT amplifier reduces to 30% of the balance amplifier. Two types of amplifier are built and tested. A methodology of designing the CMT amplifier is presented and implemented to validate this new method correct by measuring.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"34 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":"114791248","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.5633835
Y. Dandach, P. Siohan
Offset Quadrature Amplitude Modulation (OQAM) presents several advantages for single carrier and multicarrier transmission when combined with OFDM. However, as the transmitted pulse shapes have an offset and overlap together this may be detrimental for the transmission of frames with very short length. In this paper we show that, under certain conditions, a slight modification of the demodulation process permits a total recovery of the high spectral efficiency these systems can attain when there is no framing constraint.
{"title":"Packet transmission for overlapped offset QAM","authors":"Y. Dandach, P. Siohan","doi":"10.1109/WCSP.2010.5633835","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633835","url":null,"abstract":"Offset Quadrature Amplitude Modulation (OQAM) presents several advantages for single carrier and multicarrier transmission when combined with OFDM. However, as the transmitted pulse shapes have an offset and overlap together this may be detrimental for the transmission of frames with very short length. In this paper we show that, under certain conditions, a slight modification of the demodulation process permits a total recovery of the high spectral efficiency these systems can attain when there is no framing constraint.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"12 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":"114814416","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.5633767
Jinfeng Du, Ming Xiao, M. Skoglund
We investigate the capacity bounds for relay-aided two-source two-destination wireless networks with backhaul support between source nodes. Each source multicasts its own message to all destinations with the help of an intermediate relay node, which is full-duplex and shared by both sources. We are aiming to characterize the capacity region of this model given discrete memoryless Gaussian channels. We establish three capacity upper bounds by relaxing the cut-set bound, and by extending two capacity bounds originally derived for MIMO relay channels. We also present one lower bound by using decoding-and-forward relaying combined with network beam-forming.
{"title":"Capacity bounds for relay-aided wireless multiple multicast with backhaul","authors":"Jinfeng Du, Ming Xiao, M. Skoglund","doi":"10.1109/WCSP.2010.5633767","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633767","url":null,"abstract":"We investigate the capacity bounds for relay-aided two-source two-destination wireless networks with backhaul support between source nodes. Each source multicasts its own message to all destinations with the help of an intermediate relay node, which is full-duplex and shared by both sources. We are aiming to characterize the capacity region of this model given discrete memoryless Gaussian channels. We establish three capacity upper bounds by relaxing the cut-set bound, and by extending two capacity bounds originally derived for MIMO relay channels. We also present one lower bound by using decoding-and-forward relaying combined with network beam-forming.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"3 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":"115169220","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.5633740
Qiming Tian, Chuan Ma, Guanding Yu, Aiping Huang
In the cognitive radio networks, the users' spectrum access behavior determines the system capacity and spectrum utilization. There are three classical schemes for cognitive radio spectrum access: the random channel assignment, the reservation based assignment and the non-random channel assignment. In this paper, we study the performance of these schemes in a new scenario: a cognitive radio network with finite primary users and infinite secondary users. We model the users' behavior in these schemes by Markov chains. Moreover, the blocking, transition and dropping probabilities of the secondary users based on the user connection rate are derived as the performance metrics. Furthermore, we evaluate the secondary system capacity of these schemes. Numerical results show that the random and non-random channel assignments can get the lowest blocking probability, the reservation based assignment can get the lowest dropping probability, and the non-random channel assignment can provide the most system capacity and avoid the channel handoff for the secondary users.
{"title":"Analysis of cognitive radio spectrum access with finite primary users and infinite secondary users","authors":"Qiming Tian, Chuan Ma, Guanding Yu, Aiping Huang","doi":"10.1109/WCSP.2010.5633740","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633740","url":null,"abstract":"In the cognitive radio networks, the users' spectrum access behavior determines the system capacity and spectrum utilization. There are three classical schemes for cognitive radio spectrum access: the random channel assignment, the reservation based assignment and the non-random channel assignment. In this paper, we study the performance of these schemes in a new scenario: a cognitive radio network with finite primary users and infinite secondary users. We model the users' behavior in these schemes by Markov chains. Moreover, the blocking, transition and dropping probabilities of the secondary users based on the user connection rate are derived as the performance metrics. Furthermore, we evaluate the secondary system capacity of these schemes. Numerical results show that the random and non-random channel assignments can get the lowest blocking probability, the reservation based assignment can get the lowest dropping probability, and the non-random channel assignment can provide the most system capacity and avoid the channel handoff for the secondary users.","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":"116915323","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.5633313
He Yishan, Chen Yufan
This paper analyzed the single tone frequency estimation method, using pulse pairs method to simplify the iterative filtering method. Statistical analysis of this algorithm is given and simulation is carried out in the presence of additive white Gaussian noise and colored noise. Through simulation, this algorithm is shown to be able to achieve CRB asymptotically in both environment mentioned above and perform efficiently even at short data length.
{"title":"Frequency estimation method based on iterative filtering and pulse-pairs","authors":"He Yishan, Chen Yufan","doi":"10.1109/WCSP.2010.5633313","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633313","url":null,"abstract":"This paper analyzed the single tone frequency estimation method, using pulse pairs method to simplify the iterative filtering method. Statistical analysis of this algorithm is given and simulation is carried out in the presence of additive white Gaussian noise and colored noise. Through simulation, this algorithm is shown to be able to achieve CRB asymptotically in both environment mentioned above and perform efficiently even at short data length.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"25 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":"116528786","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}
This paper considers a cognitive radio model where the secondary users (SUs) apply cooperative relay to fulfill the communication demand. Specially, under the constraint that the interference power introduced to primary users (PUs) is kept under a tolerable threshold, we investigate the system throughput maximization problem during the cognitive relay transmission. In order to make the formulated problem feasible to solve, Maclaurin expansions are employed as substitutions. Moreover, based on convex optimization theory, an iterative power allocation algorithm repeated between the powers of secondary source node and relay node is developed to obtain the optimal solution. Corroborant numerical examples are provided to illustrate the quick convergence behavior of the proposed algorithm and the superiority of applying cooperative relay in cognitive radio networks is also presented.
{"title":"An efficient power allocation algorithm for relay assisted cognitive radio network","authors":"Zhongjun Liu, Youyun Xu, Dongmei Zhang, Shaohua Guan","doi":"10.1109/WCSP.2010.5631742","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5631742","url":null,"abstract":"This paper considers a cognitive radio model where the secondary users (SUs) apply cooperative relay to fulfill the communication demand. Specially, under the constraint that the interference power introduced to primary users (PUs) is kept under a tolerable threshold, we investigate the system throughput maximization problem during the cognitive relay transmission. In order to make the formulated problem feasible to solve, Maclaurin expansions are employed as substitutions. Moreover, based on convex optimization theory, an iterative power allocation algorithm repeated between the powers of secondary source node and relay node is developed to obtain the optimal solution. Corroborant numerical examples are provided to illustrate the quick convergence behavior of the proposed algorithm and the superiority of applying cooperative relay in cognitive radio networks is also presented.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"46 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":"115012761","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.5633541
I. Jantarayat, M. Uthansakul, P. Uthansakul
Relay station is a recent approach for multihop cellular networks to increase a signal quality as well as support a high speed data transmission. The coverage range of relay station is determined by its transmit power and level of handover between relay station and its base station. This coverage range directly influences to handover performance. If number of handover increases, the expense of signaling overheads and capacity deficiency will be increased. In this paper, the investigation into number of handover related to coverage range of relay station is presented. In addition, various handover scenarios in cellular networks are also examined. The results indicate that the tradeoff between number of handover scenarios and coverage range depends on type of handover scenarios.
{"title":"Tradeoffs between handover performance and coverage range of relay stations in multihop cellular networks","authors":"I. Jantarayat, M. Uthansakul, P. Uthansakul","doi":"10.1109/WCSP.2010.5633541","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633541","url":null,"abstract":"Relay station is a recent approach for multihop cellular networks to increase a signal quality as well as support a high speed data transmission. The coverage range of relay station is determined by its transmit power and level of handover between relay station and its base station. This coverage range directly influences to handover performance. If number of handover increases, the expense of signaling overheads and capacity deficiency will be increased. In this paper, the investigation into number of handover related to coverage range of relay station is presented. In addition, various handover scenarios in cellular networks are also examined. The results indicate that the tradeoff between number of handover scenarios and coverage range depends on type of handover scenarios.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"66 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":"115535776","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.5633730
Jianling Hu
Tempo and beats are very important elements in the perceptual music. This paper proposes a real-time perceptual tempo estimation algorithm, which calculates the envelope autocorrelation of the music signals firstly, and then a weighted tempo function based on envelope autocorrelation is constructed to estimate the music's perceptual tempo. The weighted tempo function is computed according to the peak amplitudes and positions of the envelope autocorrelation, which can demonstrate the real-time tempo information of the music signal, and its statistics can be used to represent the rhythm of the whole piece of music. Our experiment results show that the proposed weighted tempo function is highly related to the sense of auditory rhythm, and is capable of describing the music tempo changes at real-time.
{"title":"Real-time perceptual tempo estimation for music signal based on envelope autocorrelation","authors":"Jianling Hu","doi":"10.1109/WCSP.2010.5633730","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633730","url":null,"abstract":"Tempo and beats are very important elements in the perceptual music. This paper proposes a real-time perceptual tempo estimation algorithm, which calculates the envelope autocorrelation of the music signals firstly, and then a weighted tempo function based on envelope autocorrelation is constructed to estimate the music's perceptual tempo. The weighted tempo function is computed according to the peak amplitudes and positions of the envelope autocorrelation, which can demonstrate the real-time tempo information of the music signal, and its statistics can be used to represent the rhythm of the whole piece of music. Our experiment results show that the proposed weighted tempo function is highly related to the sense of auditory rhythm, and is capable of describing the music tempo changes at real-time.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"199 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":"121437207","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.5633673
X. Rui
In this paper, the method of missing data imputation based on the emergent field of compressive sensing for the front end of a speaker identification system in noisy conditions is investigated. Firstly, noisy speech signals are transformed into Gammatone spectrum by using cochlear filtering; then, unreliable spectral components are reconstructed given an incomplete set of reliable ones; finally, speaker features with auditory model are extracted from reconstructed Gammatone spectral data. Experimental results demonstrate that our method can improve the identification accuracy of speaker identification in noisy environments.
{"title":"Missing data imputation based on compressive sensing for robust speaker identification","authors":"X. Rui","doi":"10.1109/WCSP.2010.5633673","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633673","url":null,"abstract":"In this paper, the method of missing data imputation based on the emergent field of compressive sensing for the front end of a speaker identification system in noisy conditions is investigated. Firstly, noisy speech signals are transformed into Gammatone spectrum by using cochlear filtering; then, unreliable spectral components are reconstructed given an incomplete set of reliable ones; finally, speaker features with auditory model are extracted from reconstructed Gammatone spectral data. Experimental results demonstrate that our method can improve the identification accuracy of speaker identification in noisy environments.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"34 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":"124857174","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.5633441
Yingquan Zou, Chunguo Li, Luxi Yang
Distributed precoder for multicell multi-input multi-output (MEMO) networks is designed in this paper, which is implemented in a distributed manner instead of the central manner. Considering the interference can be transformed into the useful contribution, the criterion of maximizing the signal to leakage plus noise ratio (SLNR) is first introduced for the distributed precoder design. Moreover, in order to further reduce the channel state information feedback overhead, another precoder in terms of matching filter (MF) is then proposed for the distributed precoder design in multicell MIMO systems. Computer simulations have shown that the proposed precoding schemes outperform the existing method in terms of the achievable rate and the cumulative distribution function of the whole multicell MIMO system.
{"title":"Distributed precoding for multicell MIMO networks","authors":"Yingquan Zou, Chunguo Li, Luxi Yang","doi":"10.1109/WCSP.2010.5633441","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633441","url":null,"abstract":"Distributed precoder for multicell multi-input multi-output (MEMO) networks is designed in this paper, which is implemented in a distributed manner instead of the central manner. Considering the interference can be transformed into the useful contribution, the criterion of maximizing the signal to leakage plus noise ratio (SLNR) is first introduced for the distributed precoder design. Moreover, in order to further reduce the channel state information feedback overhead, another precoder in terms of matching filter (MF) is then proposed for the distributed precoder design in multicell MIMO systems. Computer simulations have shown that the proposed precoding schemes outperform the existing method in terms of the achievable rate and the cumulative distribution function of the whole multicell MIMO system.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"41 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":"121963460","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
扫码关注我们
求助内容：
应助结果提醒方式：