GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference最新文献

筛选
英文 中文
Near-ML Detection over a Reduced Dimension Hypersphere 降维超球上的近ml检测
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426075
J. Choi, B. Shim, A. Singer
{"title":"Near-ML Detection over a Reduced Dimension Hypersphere","authors":"J. Choi, B. Shim, A. Singer","doi":"10.1109/GLOCOM.2009.5426075","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426075","url":null,"abstract":"In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partitioned search method that divides the symbol space into two groups and searches over the vector space of one group instead of that comprising all of the symbols. First, a minimum mean square error (MMSE) dimension reduction operator suppressing the interference from the second group is applied, and then a list tree search (LTS) is performed over the symbols in the first group. For each lattice point of symbols for the first group found from the LTS, the rest of symbols are estimated by MMSE-decision feedback (MMSE-DF) estimation. Among these lattice point candidates, a final solution is chosen as a minimizer of the L2-norm criterion. From an asymptotic error probability analysis, we show that the dimension reduction loss is potentially compensated by the LTS gain proportional to the size of the list. Furthermore, we demonstrate through simulation on multi-input multi-output (MIMO) transmissions that the RD-MLS detector achieves substantial complexity reduction with relatively little performance loss over ML detection.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130641664","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}
引用次数: 0
Low-Complexity Near-Optimal Presence Detection of a Linearly Modulated Signal 线性调制信号的低复杂度近最优存在检测
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425807
Jeong Ho Yeo, Joon Ho Cho
{"title":"Low-Complexity Near-Optimal Presence Detection of a Linearly Modulated Signal","authors":"Jeong Ho Yeo, Joon Ho Cho","doi":"10.1109/GLOCOM.2009.5425807","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425807","url":null,"abstract":"Spectrum sensing is an activity of a cognitive radio to detect the presence of a primary user in the frequency band of interest. In this paper, we consider under the Neyman-Pearson criterion the detection of a primary-user signal that linearly modulates codeword symbols from a Gaussian codebook. To reduce the complexity in computing the likelihood ratio, a simple method based on the approximation of signal covariance matrices is presented. By invoking the Central Limit Theorem, the approximate probability distribution of the decision statistic, the threshold for decision, and the performance of the proposed detector are computed and parameterized only by the overall pulse shape and noise variance. Numerical results show that the proposed detector with much lower computational complexity performs almost the same as the optimal detector. The signal-to-noise ratio wall of the proposed detector is also investigated to quantify the performance limit under uncertainty in the noise variance.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123959226","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}
引用次数: 0
Tradeoff Power Control for Cellular Systems 蜂窝系统的权衡功率控制
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426096
Changho Suh, A. Koç, S. Talwar
{"title":"Tradeoff Power Control for Cellular Systems","authors":"Changho Suh, A. Koç, S. Talwar","doi":"10.1109/GLOCOM.2009.5426096","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426096","url":null,"abstract":"We consider distributed uplink open-loop power control for orthogonal frequency division multiple access (OFDMA) cellular systems. To touch simultaneously on two main performance metrics in cellular systems, average throughput and cell-edge throughput, we focus on a metric of tradeoff performance. First we investigate two extreme cases to show that the well-known SNR-based scheme and the INR-based scheme maximize cell-edge throughput and average throughput, respectively. Based on these two extremes, we propose a new power control scheme that trades off well both metrics. The idea is to combine the optimum power of two extremes in a linear fashion. System-level simulations show that the proposed scheme has better tradeoff performance as compared to two schemes: (1) a trivial time-sharing scheme (where a tradeoff curve shows the straight line that connects two extreme points); (2) another alternative (that combines the optimum power of two extremes in an exponential way).","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124181297","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}
引用次数: 4
Analysis of Degrees of Freedom of Interfering MISO Broadcast Channels 干扰MISO广播信道的自由度分析
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425520
Seokhwan Park, Inkyu Lee
{"title":"Analysis of Degrees of Freedom of Interfering MISO Broadcast Channels","authors":"Seokhwan Park, Inkyu Lee","doi":"10.1109/GLOCOM.2009.5425520","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425520","url":null,"abstract":"In this paper, we provide a lower and upper bound for the number of degrees of freedom (DOF) of B multiple-input single-output (MISO) broadcast channels (BC) where each base station (BS) equipped with M antennas supports its corresponding K single antenna users suffering from inter-cell interference. We show that two bounds meet with each other when M = 1 or M ≥ K or B >max(M,K)/min(M,K). From the derived result, we learn that the available DOF of the B-user multiple-input multiple-output (MIMO) interference channels is degraded by disabling receive cooperation if and only if M < K and B ≤ max(M,K)/min(M,K). We observe that even for that case, the multiple BCs where interference mitigation should be fully performed at the transmitters due to the distributed receive antennas can achieve the DOF more than 2/3 of the DOF of the MIMO interference channels. In addition, the exact number of DOF is derived for two mutually interfering and deterministic broadcast channels in the presence of cognitive BSs. Our result shows that in two BCs interfering with each other, whether receive cooperation exists or not, it does not affect the DOF if one of two transmitters is a cognitive BS.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123311281","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}
引用次数: 14
Hybrid Video-Quality-Estimation Model for IPTV Services IPTV业务混合视频质量估计模型
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425823
Kazuhisa Yamagishi, Taichi Kawano, Takanori Hayashi
{"title":"Hybrid Video-Quality-Estimation Model for IPTV Services","authors":"Kazuhisa Yamagishi, Taichi Kawano, Takanori Hayashi","doi":"10.1109/GLOCOM.2009.5425823","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425823","url":null,"abstract":"We propose a no reference hybrid video-quality-estimation model for estimating video quality by using quality features derived from received packet headers and video signals. Our model is useful as a quality monitoring tool for estimating the video quality during use of an Internet protocol television service. It takes into account video quality dependence on video content and can estimate video quality per content, which our previously developed packet-layer model cannot do. We conducted subjective quality assessments to develop the model and validated its quality-estimation accuracy. The quality-estimation results showed that the Pearson-correlation coefficients were larger than 0.9 and the quality-estimation errors were equivalent to the statistical uncertainty of subjective quality.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123454894","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}
引用次数: 28
Erlang Capacity of UMTS Using Perceptual-Based Power Control: An Analytical Framework 使用基于感知的功率控制的UMTS的Erlang容量:一个分析框架
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425670
B. Rohani, H. Zepernick
{"title":"Erlang Capacity of UMTS Using Perceptual-Based Power Control: An Analytical Framework","authors":"B. Rohani, H. Zepernick","doi":"10.1109/GLOCOM.2009.5425670","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425670","url":null,"abstract":"An analytical framework for calculation of Erlang capacity per cell of UMTS with perceptual-based power control is derived. A comparison of the capacity of the system using the proposed power control algorithm with its conventional counterpart is performed. This is supported by numerical results on Erlang capacity over a variety of system parameters for both considered power control approaches. It is shown that the use of perceptual speech quality metrics in power control results in a capacity gain of at least 10% over that of conventional UMTS.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123638583","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}
引用次数: 0
On Study of Achievable Capacity with Hybrid Relay in Cognitive Radio Networks 认知无线网络中混合中继可达容量的研究
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425814
Lei Sun, Wenye Wang
{"title":"On Study of Achievable Capacity with Hybrid Relay in Cognitive Radio Networks","authors":"Lei Sun, Wenye Wang","doi":"10.1109/GLOCOM.2009.5425814","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425814","url":null,"abstract":"This work studies the capacity limits of Cognitive Radio (CR) networks with a hybrid relay scheme in which PRimary (PR) nodes dominate the spectrum usage, while coordinating with secondary or CR nodes in forwarding packets. This is in contrast to previous efforts that are focused on the analysis with cooperative relay scheme where only secondary (CR) nodes participate in relay operation [1]-[3]. Intuitively, it is expected that the hybrid scheme can improve network capacity because primary nodes have higher power and transmission capacity compared to CR nodes and data transmission with hybrid relay scheme can be much faster and more reliable. Therefore, we aim to investigate such potential benefits with respect to cooperative relay. However, we find that given the total data rate W, number of usable channels ||C|| and the number of CR nodes n in a network, the achievable capacity of CR networks with hybrid relay is of the order of Θ(W/||C||n). This result is much lower than the capacity of cooperative relay, which is of the same order as the capacity of multi-channel wireless networks (e.g., multi-channel multi-radio (MC-MR) networks), Θ(W1/√n log n). It is plausible that PR nodes can potentially become bottlenecks when they are used as high-priority relay nodes in the hybrid scheme. Thus, our study suggests that for delay-sensitive applications such as realtime traffic, hybrid relay is a good option; otherwise, cooperative relay is preferred.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121134603","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}
引用次数: 11
Iterative Versus Adaptive Equalizers in Time-Variant Channels 时变信道中的迭代与自适应均衡器
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425660
Clemens Buchacher, J. Wehinger, M. Huemer
{"title":"Iterative Versus Adaptive Equalizers in Time-Variant Channels","authors":"Clemens Buchacher, J. Wehinger, M. Huemer","doi":"10.1109/GLOCOM.2009.5425660","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425660","url":null,"abstract":"This paper discusses the application of iterative versus adaptive equalizers to a Universal Mobile Telecommunications System (UMTS) High Speed Downlink Packet Access (HSDPA) receiver. Among the investigated algorithms are the Least Mean Square (LMS) and Recursive Least Square (RLS) algorithms and their adaptions to Code Division Multiple Access (CDMA), such as Griffith's algorithm, as well as the conjugate gradient (CG) algorithm. We show that adaptive algorithms do not perform well in HSDPA scenarios at medium to high mobile speed, and that the conjugate gradient algorithm achieves higher performance at the same or even lower complexity than any of the investigated adaptive algorithms. We also discuss the necessity to consider oversampling.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121178276","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}
引用次数: 3
EXIT Chart Evaluation of a Receiver Structure for Multi-User Multi-Antenna OFDM Systems 多用户多天线OFDM系统接收机结构的出口图评估
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426288
P. Hammarberg, F. Rusek, P. Rossi, O. Edfors
{"title":"EXIT Chart Evaluation of a Receiver Structure for Multi-User Multi-Antenna OFDM Systems","authors":"P. Hammarberg, F. Rusek, P. Rossi, O. Edfors","doi":"10.1109/GLOCOM.2009.5426288","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426288","url":null,"abstract":"In this paper we evaluate, by means of Extrinsic Information Transfer (EXIT) charts, an iterative receiver that has emerged as a promising candidate for non-coherent multi-user multi-antenna OFDM systems. The receiver performs parallel interference cancellation (followed by linear filtering) and channel estimation, using soft symbols obtained from a bank of single-user decoders. For the sake of conceptual clarity we study a system with two single antenna users and a receiver with two antennas, and we demonstrate how the convergence behavior of the receiver can be visualized using paired three dimensional EXIT surfaces. Our results show that the actual decoder trajectories obtained through simulations are well predicted from the EXIT charts. \u0000 \u0000For the iterative receiver under investigation we identify a very specific problem with EXIT chart generation; the EXIT curve for the inner component decoder depends on the outer encoder. To handle this problem we propose a modification to the iterative receiver which solves the aforementioned problem; the performance degradation is demonstrated to be small.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116318759","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}
引用次数: 5
An Evolutionary Game Approach to P2P Video Streaming P2P视频流的进化博弈方法
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425512
L. Chisci, F. Papi, T. Pecorella, R. Fantacci
{"title":"An Evolutionary Game Approach to P2P Video Streaming","authors":"L. Chisci, F. Papi, T. Pecorella, R. Fantacci","doi":"10.1109/GLOCOM.2009.5425512","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425512","url":null,"abstract":"This paper deals with the allocation of resources and the creation of distribution trees for P2P video streaming. Assuming that the video distribution is based on a Multiple Description Codec (MDC), the proposed approach performs jointly the two tasks, in a completely distributed client-based fashion, by means of an evolutionary (socially inspired) game played by all peers. The key idea of the evolutionary game is that each peer continuously measures its own utility (i.e., video quality) and, by periodical comparison with other randomly chosen peers, tries to mimic the behavior (i.e., resource allocation and video distributors) of peers with higher utility. Extensive simulation experiments by Peersim have been carried out in order to assess the performance of the proposed technique. The obtained results have highlighted remarkable benefits in terms of scalability, fast adaptation to churning, high degree of cooperation among peers and self-organization of the distribution multitree network.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116359553","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}
引用次数: 11
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信