发布求助
文献互助 智能选刊 最新文献

2006 International Zurich Seminar on Communications最新文献

筛选
英文 中文
A New Full Rate Full Diversity ST Code with Nonvanishing Determinant for TH-UWB Systems 一种新的TH-UWB系统非消失行列式全速率全分集ST码
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649114
C. Abou-Rjeily, N. Daniele, J. Belfiore
{"title":"A New Full Rate Full Diversity ST Code with Nonvanishing Determinant for TH-UWB Systems","authors":"C. Abou-Rjeily, N. Daniele, J. Belfiore","doi":"10.1109/IZS.2006.1649114","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649114","url":null,"abstract":"In this paper, we propose a new space time (ST) coding scheme for time hopping (TH) ultra wideband (UWB) systems. The proposed scheme encodes the pulses used to transmit one information symbol. This permits to achieve full rate and full diversity with a non-vanishing coding gain for all number of transmit antennas. The proposed code shows to be the optimal extension of the codes constructed from cyclic division algebras when inter-pulse coding is performed","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122618454","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
Fair Resource Bargaining Solutions for Cooperative Multi-Operator Networks 合作多运营商网络公平资源议价解决方案
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649078
Siew-Lee Hew, L. White
{"title":"Fair Resource Bargaining Solutions for Cooperative Multi-Operator Networks","authors":"Siew-Lee Hew, L. White","doi":"10.1109/IZS.2006.1649078","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649078","url":null,"abstract":"The high cost associated with the rollout of 3G services encourages operators to share network infrastructure. Network sharing poses a new challenge in devising fair, efficient and Pareto-optimal resource allocation strategies to distribute system resources among users of different operators in the network. Cooperative game theory provides a framework for formulating such strategies. In this paper, we propose a model for cooperative resource allocation game in shared networks and derive a set of bargaining solutions based on the concept of preference functions that depends on the weight that players place on their own gain and the losses of others. We then extend our analysis to nonlinear utility functions","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121855289","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}
引用次数: 8
On Cooperation Via Noisy Feedback 基于噪声反馈的合作
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649101
Michael Gastpar, Gerhard Kramer
{"title":"On Cooperation Via Noisy Feedback","authors":"Michael Gastpar, Gerhard Kramer","doi":"10.1109/IZS.2006.1649101","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649101","url":null,"abstract":"An upper bound is established on the usefulness of noisy feedback for the two-user multiple-access channel (MAC). The bound generalizes a dependence-balance argument developed by Hekstra and Willems for the common-output two-way channel and the MAC with noiseless output feedback. Lower bounds based on block-coding and linear feedback strategies are also derived","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133289825","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}
引用次数: 25
Cooperation in Outage-Limited Multiple-Access Channels 限断网多址通道合作
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649102
K. Azarian, H. E. Gamal
{"title":"Cooperation in Outage-Limited Multiple-Access Channels","authors":"K. Azarian, H. E. Gamal","doi":"10.1109/IZS.2006.1649102","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649102","url":null,"abstract":"We consider three variants of the multiple-access (MA) channel and propose protocols that simultaneously achieve the corresponding full-diversity and full-multiplexing gains. The three variants considered in this work are the scalar cooperative MA (CMA) channel, the scalar MA relay (MAR) channel and the vector automatic retransmission request CMA (ARQ-CMA) channel. For the scalar CMA channel, we propose a recursive amplify and forward (AF) protocol and prove its optimality with respect to the diversity-multiplexing tradeoff (DMT). For the scalar MAR channel, we characterize the performance of the dynamic decode and forward (DDF) protocol. This characterization proves that DDF simultaneously achieves the full-diversity and full-multiplexing gains. It also shows that the protocol is DMT optimal, over the range of multiplexing gains 0.5 ges r ges 0. The last variant considered in this paper is the vector ARQ-CMA channel. For this scenario, we propose a protocol and characterize its achieved tradeoff. This characterization reveals that the devised protocol achieves both, the full-diversity and full-multiplexing gains. It also establishes the asymptotic optimality of the proposed protocol as the number of transmission rounds grows to infinity","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114287927","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
Scaling Laws for Two-Dimensional Random Ad-Hoc Wireless Networks 二维随机自组织无线网络的尺度规律
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649090
A. Ozgur, O. Lévêque
{"title":"Scaling Laws for Two-Dimensional Random Ad-Hoc Wireless Networks","authors":"A. Ozgur, O. Lévêque","doi":"10.1109/IZS.2006.1649090","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649090","url":null,"abstract":"We derive an information theoretic scaling law for the maximum achievable rate per communication pair in a two-dimensional random ad-hoc wireless network. Our scaling law holds for non-absorptive media and when the path loss exponent (describing the decay of the amplitude of the signal) is between 1 and 2. The key ingredient of our result is the recently established information theoretic scaling law for one-dimensional ad-hoc wireless networks in the attenuation regime of interest","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123804800","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
A classification of multiple antenna channels 多天线信道的一种分类
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649067
J. Boutros, F. Kharrat-Kammoun, H. Randriambololona
{"title":"A classification of multiple antenna channels","authors":"J. Boutros, F. Kharrat-Kammoun, H. Randriambololona","doi":"10.1109/IZS.2006.1649067","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649067","url":null,"abstract":"We propose a new classification of multiple antenna channels. The classification is performed in the space of Hermitian forms defined by the channel representation. We introduce a geodesic metric between Hermitian forms and we build a finite number of classes. The centroids of the classification are found by a generalized Lloyd algorithm. Numerical examples illustrate the geodesic orbits, capacity and error rate for 2 and 4 antennas","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114568001","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}
引用次数: 7
On the Asymptotic Performance of Multi-Dwell Signal Acquisition in Dense Multipath Channels 密集多径信道中多驻留信号采集的渐近性能研究
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649108
W. Suwansantisuk, M. Win
{"title":"On the Asymptotic Performance of Multi-Dwell Signal Acquisition in Dense Multipath Channels","authors":"W. Suwansantisuk, M. Win","doi":"10.1109/IZS.2006.1649108","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649108","url":null,"abstract":"This paper investigates the mean acquisition time (MAT) of an acquisition system that employs an optimal multi-dwell detector at the detection layer. We derive lower bound and upper bound expressions for the cases when the search layer employs the optimal search procedure and the conventional serial search. The bounds depend only on a few parameters at the detection layer and can be used for the design and analysis of a broad class of multi-dwell detectors. The results indicate that in a high signal-to-noise ratio (SNR) regime, an intelligent search procedure improves the MAT of the conventional serial search by approximately Nhit times, where Nhit is proportional to the number of propagation paths. On the other hand, for a low SNR regime, only moderate improvement can be obtained. The results in this paper are valid for any fading statistic","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132293903","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
RapidFlow: An Experimental Testbed for Information Flows with Network Coding RapidFlow:基于网络编码的信息流实验平台
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649083
Mea Wang, Baochun Li
{"title":"RapidFlow: An Experimental Testbed for Information Flows with Network Coding","authors":"Mea Wang, Baochun Li","doi":"10.1109/IZS.2006.1649083","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649083","url":null,"abstract":"Network coding refers to the capability of coding incoming information flows before transmitting to other nodes in the network, beyond the traditional capabilities of message forwarding and replication on a network node. It has been envisioned that network coding is best applied to overlay networks, in which network nodes are computers at the edge of the Internet and are sufficiently capable and flexible to perform coding operations. There exist a wide range of theoretical studies on the benefits of network coding, especially with respect to throughput improvements in the multicast case. However, there has been very little published work on the empirical analysis regarding the benefits and drawbacks of network coding in realistic overlay networks. Towards this objective, we have designed and implemented RapidFlow, a complete and easy-to-use experimental testbed for studying information flows with network coding. In RapidFlow, each node is equipped with a high-performance overlay message switch and a randomized network coding mechanism. In this paper, we present the design and implementation of RapidFlow in an emulated overlay network running on a cluster of work-stations, as well as our initial experimental observations with respect to the performance of coded information flows","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133592221","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
Turbo Equalisation for MIMO-OFDM Transmission with Insufficient Guard Interval 保护间隔不足时MIMO-OFDM传输的Turbo均衡
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649093
Marcus Grossmann, C. Schneider, R. Thoma
{"title":"Turbo Equalisation for MIMO-OFDM Transmission with Insufficient Guard Interval","authors":"Marcus Grossmann, C. Schneider, R. Thoma","doi":"10.1109/IZS.2006.1649093","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649093","url":null,"abstract":"In this paper, we propose a novel frequency domain turbo equaliser for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) transmission in channels where the maximum excess delay exceeds the length of the guard interval. The turbo equaliser is based on minimum mean square error filtering and utilizes the soft feedback from channel decoding for the joint separation of the spatially multiplexed streams and cancellation of intersymbol interference (ISI) and intercarrier interference (ICI). To reduce complexity, only significant ISI/ICI terms are taken into account for signal detection, while the remaining terms are regarded as noise. Simulation results reveal that the proposed receiver shows a good compromise between complexity and performance","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117318230","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}
引用次数: 15
An Improved Space-Division Multiple-Access Strategy for Rayleigh-Fading Channels 一种改进的瑞利衰落信道空域多址策略
2006 International Zurich Seminar on Communications Pub Date : 2006-02-21 DOI: 10.1109/IZS.2006.1649075
A. Kannan, J. Barry
{"title":"An Improved Space-Division Multiple-Access Strategy for Rayleigh-Fading Channels","authors":"A. Kannan, J. Barry","doi":"10.1109/IZS.2006.1649075","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649075","url":null,"abstract":"We propose a new transmission strategy for the Rayleigh-fading multiple-access channel called space-time active rotation (STAR). STAR is a simple enhancement of the traditional space-division multiple-access (SDMA) strategy that enables a successive-cancellation (SC) decoder to approach the outage probability of the underlying multiple-access channel. We derive the outage probability of a STAR system with SC decoding and propose an ordering algorithm that minimizes this outage probability. We derive an upper bound on the diversity-multiplexing tradeoff of the system. We present numerical results for a 4-user Rayleigh-fading multiple-access channel, with 2 transmit antennas per user and 8 receive antennas, which show that the STAR strategy with SC decoding falls only 1.6 dB short of the optimum outage probability. When restricted to SC decoding, STAR outperforms conventional SDMA by 8.2 dB","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122240627","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
首页 上一页 下一页 尾页
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学术官方微信