2011 Wireless Telecommunications Symposium (WTS)最新文献

Optimized iterative (turbo) reception for QAM OFDM with CFO over unknown double-selective channels 未知双选择信道下带CFO的QAM OFDM优化迭代(turbo)接收

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960876

T. Ketseoglou, H. Wymeersch

{"title":"Optimized iterative (turbo) reception for QAM OFDM with CFO over unknown double-selective channels","authors":"T. Ketseoglou, H. Wymeersch","doi":"10.1109/WTS.2011.5960876","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960876","url":null,"abstract":"A novel iterative (turbo) receiver is introduced, suitable for orthogonal frequency division multiplexing (OFDM) employing quadrature amplitude modulation (QAM) and receiver diversity. The system operates over a double-selective channel and includes a carrier frequency offset (CFO). We propose a maximum a posteriori probability expectation-maximization (MAP-EM) receiver with a different EM parameter division than standard methods. In such standard MAP-EM receivers, the E-step parameters correspond to the channel, while the M-step parameters correspond to the CFO and data symbols. This standard receiver parameter division results into a highly complex receiver for QAM, due to the large modulated symbol alphabet size, and the non-constant constellation symbol amplitude. In this paper, a new receiver framework introduces a different parameter division that leads to reduced complexity turbo receivers for QAM signaling, while still achieving close to optimal system performance. The new approach adapts the sum-product algorithm (SPA) parameter framework to the MAP-EM receiver. Thus, in the new receiver framework, the E-step parameters are data symbols, while the M-step parameters are the channel and the CFO. We evaluate the performance of the proposed receiver with and without automatic repeat request (ARQ), where in the former case packet combining applies to further improve performance.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"2023 186","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120977010","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}

引用次数: 1

Optimum selective mapping for PAPR reduction 减少PAPR的最佳选择映射

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960847

Yanyan Wu, K. Man, Y. Wang

引用次数: 9

An MGF approach for performance evaluation of non-regenerative cooperative relay networks with adaptive modulation and optimum power allocation in nakagami-m fading environments 基于自适应调制和最优功率分配的非再生中继网络性能评估的MGF方法

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.6403800

B. Modi, A. Annamalai, R. Palat

{"title":"An MGF approach for performance evaluation of non-regenerative cooperative relay networks with adaptive modulation and optimum power allocation in nakagami-m fading environments","authors":"B. Modi, A. Annamalai, R. Palat","doi":"10.1109/WTS.2011.6403800","DOIUrl":"https://doi.org/10.1109/WTS.2011.6403800","url":null,"abstract":"This article analyzes the performance of CSI-assisted cooperative amplify-and-forward (CAF) relay networks that employ both the optimal power allocation strategy among collaborating nodes and adaptive M-ary quadrature amplitude modulation (MQAM) technique in Nakagami-m wireless fading environments. In particular, we advocate a simple yet unified numerical approach based on the marginal moment generating function (MGF) of the total received SNR to derive tight approximations or upper and lower bounds for the average bit error rate (ABER), mean achievable spectral efficiency, and outage probability performance metrics. The proposed analytical framework is sufficiently general to characterize the performance of adaptive-link CAF relay networks over a wide range of fading distributions (i.e., not restricted to Rayleigh fading) with independent but non-identically distributed (i.n.d) fading statistics across the spatially distributed diversity paths. Numerical results reveal that the optimal transmit power allocation among cooperative nodes in a practical CAF relay topologies could lead to a further substantial increase in the mean spectral efficiency compared to the equal power assignment case but at the expense of higher network overhead. The accuracies of our analytical results have been validated via Monte Carlo simulations.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126740742","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

Power allocation strategies for SVD multicell MIMO-OFDM based systems 基于SVD多小区MIMO-OFDM系统的功率分配策略

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960860

R. Holakouei, Adão Silva, A. Gameiro

引用次数: 6

Secure scheme during vertical handoff in integrated heterogeneous wireless systems 集成异构无线系统垂直切换中的安全方案

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960886

Nidhi Rastogi, Qing-An Zeng, Xiaolong Li

引用次数: 1

Transmitter preprocessing assisted multi-cell MIMO downlink communication over correlated frequency-selective channels 发射机预处理辅助相关选频信道上的多小区MIMO下行通信

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960884

P. Nagaradjane, Sabarish Karthik Vivek Sarathy, P. Muralidharan, Y. A. Rajan

{"title":"Transmitter preprocessing assisted multi-cell MIMO downlink communication over correlated frequency-selective channels","authors":"P. Nagaradjane, Sabarish Karthik Vivek Sarathy, P. Muralidharan, Y. A. Rajan","doi":"10.1109/WTS.2011.5960884","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960884","url":null,"abstract":"This paper studies the performance of joint Vertical Bell Laboratories layered space-time architecture (VBLAST)/Space-Time Block Coding (STBC) aided multiple-input multiple-output (MIMO) system in a multi-cell multi-user setting with multi-user transmitter preprocessing (MUTP) based on singular value decomposition (SVD), which exploits the channel state information (CSI) of all the users at the base stations (BSs) and only individual user's CSI at the mobile stations (MS) for downlink (DL) communication. Specifically, in this contribution, in contrast to previous work [6], we study the effects of four types of delay spread on MUTP assisted joint VBLAST/STBC MIMO system over correlated and uncorrelated frequency-selective channels. In a multi-cell scenario, in addition to multi stream interference (MSI) and multi-user interference (MUI), users conflict co-channel interference (CCI) which can severely degrade the system performance. Simulation study shows that MUTP can mitigate CCI and MSI with less detection complexity. Comparisons for correlated and uncorrelated frequency-selective channels with and without MUTP are also provided.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124097145","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}

引用次数: 1

Space-time block coding with symbol-wise decoding for polynomial phase modulated signals 多项式相位调制信号的符号解码空时分组编码

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960851

Omar Granados, J. Andrian

{"title":"Space-time block coding with symbol-wise decoding for polynomial phase modulated signals","authors":"Omar Granados, J. Andrian","doi":"10.1109/WTS.2011.5960851","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960851","url":null,"abstract":"Polynomial phase modulation (PPM) has been shown to provide improved error rate performance with respect to conventional modulation formats under additive white Gaussian noise and fading channels in single-input single-output (SISO) communication systems. In this paper, we evaluate the performance of systems with two and four transmit antennas using PPM as the modulation format. In both cases we employ full-rate space-time block codes in order to take advantage of the multipath channel. For two transmit antennas, we use the orthogonal space-time block code (OSTBC) proposed by Alamouti and perform symbol-wise decoding by estimating the phase coefficients of the PPM signal using three different methods: maximum-likelihood (ML), sub-optimal ML (S-ML), and the high-order ambiguity function (HAF). In the case of four transmit antennas, we employ the full-rate quasi-OSTBC (QOSTBC) proposed by Jafarkhani. Then, in order to perform low-complexity symbol-wise decoding, we find a decoupling matrix for the Jafarkhani scheme and apply a technique known as quasi-zero forcing (ZF). After that, the PPM signal parameters are estimated just as in the two-antenna case using ML, S-ML, and HAF. We show that the proposed systems using PPM and ML outperform OSTBC and ZF-QOSTBC using M-ary PSK as their modulation format.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131888401","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}

引用次数: 2

An efficient correction of carrier frequency offset and sample timing offset by feedback method 利用反馈方法对载波频率偏移和采样时间偏移进行了有效的校正

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960825

HuiKyu Lee, H. Ryu

引用次数: 0

MacroFemto cell handover with enhanced QoS in Mobile WiMAX 移动WiMAX中具有增强QoS的MacroFemto小区切换

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960837

Rami Ellouze, A. Guéroui, A. Alimi

引用次数: 12

Node ID assignment in group theoretic graphs for WSNs 基于群论图的wsn节点ID分配

2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960871

Junghun Ryu, Jaewook Yu, E. Noel, K. Tang

{"title":"Node ID assignment in group theoretic graphs for WSNs","authors":"Junghun Ryu, Jaewook Yu, E. Noel, K. Tang","doi":"10.1109/WTS.2011.5960871","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960871","url":null,"abstract":"In this paper, we investigate and present different node ID assignment algorithms for group-theoretic graphs such as Borel Cayley and de Bruijn graphs. These graphs have been shown to be effective logical topologies in wireless sensor networks when all the nodes are within communication range of each other. However, in practice a sensor node's communication range is limited and some nodes can be out of range with each other. Under this more realistic scenario, the original theoretic graph cannot be imposed to the network in its entirety. But rather, only partial connections of the original graphs can be imposed on the physical network. Thus, node ID assignment becomes an important issue. An effective assignment allows most connections to be imposed and hence resulting in a shorter diameter and the average path length. We investigate three algorithms: (a) ID swapping assignment, (b) simulated annealing based assignment, and (c) distributed ID swapping assignment. While the first two are centralized algorithms that are appropriate for wireless sensor network with fixed infrastructure, the latter is efficient for ad hoc WSNs. As expected, being most computationally intensive, simulated annealing has the best performance, and all three methods outperforms random ID assignment for our simulations.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114609289","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