{"title":"Channel estimation and data detection with tracking channel variation in MIMO system using ZF-based SAGE algorithm","authors":"Takao Someya, T. Ohtsuki","doi":"10.1109/GLOCOM.2005.1578298","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578298","url":null,"abstract":"In recent years, multiple-input multiple-output (MIMO) systems, which use several transmit and receive antennas, have attracted much attention for high performance radio systems. In MIMO systems, the channel estimation is important to distinguish transmit signals from multiple transmit antennas. While the space-alternating generalized expectation-maximization (SAGE) algorithm is known to offer good channel estimation and data detection. We proposed earlier the minimum mean square error (MMSE)-based SAGE algorithm for MIMO systems where the MMSE estimation is used for channel estimation. We showed that the proposed MMSE-based SAGE algorithm can achieve the better bit error rate (BER) than the maximum likelihood (ML) detection with training symbols. The MMSE channel estimation needs the knowledge of the maximum Doppler frequency Fd for deriving the covariance matrix of the channel and the variance sigma2 of additive white Gaussian noise (AWGN). Additionally, the computation of the MMSE channel estimation requires O(L3) operations where L is the transmitted frame length. Thus, its computational complexity is high. In this paper, we propose a zero-forcing (ZF)-based SAGE algorithm for channel estimation and data detection in MIMO systems that does not need the knowledge of Fd and sigma2. Since the computation of the proposed ZF-based SAGE algorithm requires O(N3) operations where N is the number of transmit antennas, its computational complexity is low. We show that the proposed ZF-based tracking SAGE algorithm with less computational complexity can achieve almost the same BER as that of the MMSE-based tracking SAGE algorithm","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114548707","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}
{"title":"Non-coherent distributed space-time processing for multiuser cooperative transmissions","authors":"Tairan Wang, Yingwei Yao, G. Giannakis","doi":"10.1109/GLOCOM.2005.1578469","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578469","url":null,"abstract":"User cooperation can provide spatial transmit diversity gains, enhance coverage and potentially increase capacity. Existing works have focused on two-user cooperative systems with perfect channel state information at the receivers. In this paper, we develop several distributed space-time processing schemes for general TV-user cooperative systems, which do not require channel state information at either relays or destination. We prove that full spatial diversity gain can be achieved in such systems. Simulations demonstrate that these cooperative schemes achieve significant performance gain","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124423561","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}
{"title":"Throughput maximization transmission control scheme using channel prediction for MIMO systems","authors":"Yoshikazu Takei, T. Ohtsuki","doi":"10.1109/GLOCOM.2005.1578082","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578082","url":null,"abstract":"In multiple-input multiple-output (MIMO) systems, we need the scheme that attains high quality and high throughput data transmission. We proposed the throughput maximization transmission control scheme (TMTC) for MIMO systems. The proposed transmission control scheme selects a transmission scheme with maximum transmission rate based on signal to interference and noise ratio (SINR) and signal to noise ratio (SNR). In time-varying channels, however, the selected transmission scheme fed back to the transmitter becomes outdated. That is, there is a mismatch between \"the selected transmission scheme at the receiver\" and \"the optimum transmission scheme at the transmitter.\" Therefore, the throughput performance of TMTC may decrease. In this paper, we propose TMTC using a minimum-mean square error (MMSE) channel prediction for MIMO systems. From the computer simulation, we show that even when the large feedback delay exists, the proposed scheme attains high throughput","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128844587","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}
{"title":"Multicast tree in MPLS network","authors":"A. Boudani, Bernard A. Cousin","doi":"10.1109/GLOCOM.2005.1577790","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577790","url":null,"abstract":"In this paper, we study multicast tree construction in MPLS network. We discuss the difficulty in combining multicast and MPLS in a network. We describe some MPLS proposals for the multicast traffic and we justify the need for defining a new protocol. Thereafter we propose MMT, the MPLS multicast tree protocol, which uses MPLS LSP (label switched path) between multicast tree branching nodes in order to reduce the multicast routing states in routers and to increase scalability. We present improvements to MMT protocol and we evaluate it in term of scalability and efficiency. Finally, we present simulation results to validate our evaluation and we conclude that the MMT protocol seems promising and well adapted to a possible implementation of multicast traffic engineering in the network.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125159113","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}
{"title":"Currency boosts content dissemination in noncooperative ad-hoc networks","authors":"Kyunghan Lee, S. Chong","doi":"10.1109/GLOCOM.2005.1578263","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578263","url":null,"abstract":"In most of research works on the wireless ad-hoc network, it is often assumed that all nodes in the network are cooperative to relay packets. However, it is natural for nodes to be reluctant to cooperate by force due to the consumption of resources. Thus, a concept of noncooperative ad-hoc networks is being widely accepted in the latest research works. For the noncooperative ad-hoc networks, a framework which stimulates nodes to mutually cooperate was proposed by W. Yuen. It was shown that the framework utilizes more net capacity of the network than the multi-hop cooperative ad-hoc network does by exploiting data diversity and eliminating redundant bandwidth wastes for the multi-hop packet relays. In this paper, we suggest a content dissemination protocol which adopts currency and we show that adopting currency outperforms the previously proposed one through extensive simulations","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131056931","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}
{"title":"Integrated congestion-control mechanism in optical burst switching networks","authors":"Sungchang Kim, B. Mukherjee, Minho Kang","doi":"10.1109/GLOCOM.2005.1578011","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578011","url":null,"abstract":"Optical burst switching (OBS) is a promising solution to implement the optical Internet backbone. However, the lack of adequate congestion-control mechanisms may result in high burst loss. Schemes such as fiber delay line (FDL), wavelength conversion, and deflection routing to reduce burst collision are unable to prevent the network congestion effectively. To address this problem, we propose and investigate a global solution, called integrated congestion-control mechanism (ICCM), for OBS networks. ICCM, which combines congestion avoidance with recovery mechanism, restricts the amount of burst flows entering the network according to the feedback information from core routers to edge routers to prevent network congestion. Also, a flow-policing scheme is proposed to intentionally drop the overloaded traffic with a certain probability at a core router to support fairness among flows. Moreover, the transmission rate of each flow is controlled to achieve optimized performance such as maximizing throughput or minimizing loss probability using a two-step rate controller at the edge router. Simulation results show that ICCM effectively eliminates congestion within the network and that, when combined with a flow-policing mechanism, the fairness for competing flows can be supported while maintaining effective network performance","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"612 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123265590","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}
{"title":"Antenna partitioning for multiuser MIMO-CDMA","authors":"Wan Choi, J. Andrews, R. Heath","doi":"10.1109/GLOCOM.2005.1577908","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577908","url":null,"abstract":"Improving downlink CDMA capacity has been an area of intensive research for the past decade, especially as the downlink has become the capacity limiting link. Multi-antenna technologies are an obvious candidate for increasing the downlink capacity, but successfully decoding spatially multiplexed signals is very challenging in an interference-limited environment, such as that of CDMA cellular systems. In this paper, a simple and novel MIMO-CDMA system design is developed, in which users are assigned to a transmit antenna either without regard to channel knowledge (static) or based on antenna selection feedback bits (dynamic). These proposed antenna partitioning techniques have a minimal increase in complexity and require only small changes to existing CDMA standards. The outage probability and capacity of the proposed systems are derived and it is shown that they outperform conventional CDMA systems regardless of the number of antennas or antenna partitioning technique.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126143777","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}
{"title":"Application layer addressing, routing and naming framework for overlays","authors":"D. Magoni, P. Lorenz","doi":"10.1109/GLOCOM.2005.1577774","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1577774","url":null,"abstract":"A growing number of applications create overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility and security at the application layer. However overlays require some form of internal addressing, routing and naming. Therefore their topologies are usually kept simple but this limits their flexibility and scalability. Our aim is to design an efficient and robust addressing, routing and naming framework for complex overlays. Our only assumption is that they are constrained by the Internet topology. Applications using our framework will be relieved from managing their own overlay topologies. This paper presents our framework in detail as well as some performance results concerning its routing efficiency, its reliability to network dynamics and its naming scalability.","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129051145","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}
{"title":"A posteriori Rake finger selection in space-time coded CDMA systems","authors":"S. Kim, E. Y. Kim","doi":"10.1109/GLOCOM.2005.1578340","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578340","url":null,"abstract":"We present the optimal Rake finger selection criterion that minimizes the a posteriori probability of symbol error in space-time block coded code division multiple access (CDMA) systems. It can serve as a benchmark for the performance of all a posteriori Rake finger selection criteria. Then we present suboptimal, but more practical, finger selection criteria based on a posteriori symbol error probability bounds, and analyze the bit error probability as a function of constellation sizes and number of resolvable paths. Simulation results show that there is a significant gain over the traditional signal strength-based selection criterion","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502922","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}
{"title":"Accurate evaluation of packet error probabilities considering bit-to-bit error dependence","authors":"K. Hamdi, L. Pap, E. Alsusa","doi":"10.1109/GLOCOM.2005.1578212","DOIUrl":"https://doi.org/10.1109/GLOCOM.2005.1578212","url":null,"abstract":"This paper presents new accurate packet error rate analysis of ALOHA type networks that employ BPSK or QPSK modulation in a Rayleigh fading environment. Relying on a precise interference model, we derive new accurate expressions for the packet success probabilities that account for bit to bit error dependence, and are valid for unequal power levels. The accuracy of the new expressions is validated by simulation. These results are used to investigate the throughput performance of Aloha type networks in different local area environments","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"528 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116487114","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}