{"title":"On the behavior of optimal scheduling algorithms under TCP sources","authors":"P. Giaccone, Emilio Leonardi, F. Neri","doi":"10.1109/IZS.2006.1649088","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649088","url":null,"abstract":"We focus on the dynamical interaction between regulated additive increase multiplicative decrease (AIMD) traffic sources and the max-scalar scheduling policy, which has been proved to be optimal in terms of throughput in case of stationary unregulated traffic sources. We describe the average dynamics of both sources and queues dynamics through a system of ordinary differential equations (ODEs), which is numerically solved","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"22 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":"121129808","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}
A. Chakrabarti, A. de Baynast, A. Sabharwal, B. Aazhang
{"title":"Codes for Half Duplex Relay Channels","authors":"A. Chakrabarti, A. de Baynast, A. Sabharwal, B. Aazhang","doi":"10.1109/IZS.2006.1649104","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649104","url":null,"abstract":"In this paper, we study LDPC code constructions for the half-duplex relay channels. Our work is motivated by the observation that half-duplex relaying where the relay cannot simultaneously transmit and receive in the same band yields substantially higher rate than both direct and two-hop communication with the same average power constraint. The profile optimization technique and the resulting LDPC codes prove to be very effective in fading environments. The performance thresholds determined using Gaussian approximation are extremely close to theoretical limits","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"52 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":"123926335","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":"Random Matrix Transforms and Applications via Non-Asymptotic Eigenanalysis","authors":"G. Alfano, A. Tulino, A. Lozano, S. Verdú","doi":"10.1109/IZS.2006.1649068","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649068","url":null,"abstract":"This work introduces an effective approach to derive the marginal density distribution of an unordered eigenvalue for finite-dimensional random matrices of Wishart and F type, based on which we give several examples of closed-form and series expressions for the Shannon and eta transforms of random matrices with nonzero mean and/or dependent entries. The newly obtained results allow for a compact non-asymptotic characterization of MIMO and multiuser vector channels in terms of both ergodic capacity and minimum mean square error (MMSE). In addition, the derived marginal density distributions can be of interest on their own in other fields of applied statistics","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":"133218505","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":"Approaches to Network Coding for Multiple Unicasts","authors":"N. Ratnakar, D. Traskov, Ralf Koetter","doi":"10.1109/IZS.2006.1649081","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649081","url":null,"abstract":"In this paper, we survey the application of linear network coding to a multiple unicasts scenario in directed graphs. We discuss related work concerning the complexity of the construction of capacity-achieving linear network codes. We briefly review the algebraic formulation of the problem and in the remainder of the paper, we investigate two approaches to construct network codes. One is based on state-space realizations and the other is a suboptimal, yet simpler approach based on linear optimization","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"2 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":"116936487","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":"On the asymptotic behavior of end-point-based multicast streaming","authors":"G. Dán, V. Fodor, G. Karlsson","doi":"10.1109/IZS.2006.1649080","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649080","url":null,"abstract":"In this paper we propose an analytical model of a resilient, tree-based end-node multicast streaming architecture that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We show that this architecture can distribute data to nodes arbitrarily far away from the root of the trees as long as the loss probability is lower than a certain threshold, but the probability of packet reception suddenly drops to zero once this threshold is exceeded. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"2012 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":"125990084","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}
A. Khumsi, K. Mori, K. Naito, Hideo Kobayashi, H. Aghvami
{"title":"Downlink Packet Transmission Control Based on Handoff Status in CDMA Cellular Packet Networks","authors":"A. Khumsi, K. Mori, K. Naito, Hideo Kobayashi, H. Aghvami","doi":"10.1093/ietcom/e90-b.5.1252","DOIUrl":"https://doi.org/10.1093/ietcom/e90-b.5.1252","url":null,"abstract":"This paper discusses packet transmission control in downlink of CDMA cellular communication systems and proposes a downlink packet transmission control scheme based on the soft handoff status to enhance the system performance. The proposed scheme controls the downlink packet transmissions by using a transmission window which is individually determined for each mobile station based on both its propagation condition and its geographical location. The system performance are evaluated by computer simulation and the results show that the proposed scheme can improve the delay performance and geographical fairness in service quality, compared with the conventional scheme","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"41 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":"128558467","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":"Adaptive transmit eigenbeamforming with stochastic unitary plane rotations in MIMO systems with linear receivers","authors":"E.B. Zacarias, S. Werner, R. Wichman","doi":"10.1109/IZS.2006.1649074","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649074","url":null,"abstract":"In this work we propose two adaptive transmit eigenbeamforming techniques for closed loop MIMO systems with low feedback rate. Both algorithms track a number of the dominant eigenmodes of a fading MIMO channel. The first algorithm applies unitary transformations incrementally, while the second runs a stochastic search over the space of angles that parameterize a set of orthonormal complex vectors. The eigenmode estimate updates rely on a single feedback bit and ensure orthonormality at every instant without enforcing the condition explicitly. We introduce a cost function that minimizes both the channel induced symbol stream coupling at the receiver and the noise coloring effects of the channel equalizer. We show that our choice of cost function improves the performance when using a suboptimal linear minimum mean-square error (MMSE) receiver. Our schemes outperform the algorithm recently proposed in J. Yang and D.B. Williams (2005) (which is based on B.C. Banister and J.R. Zeidler (2003)) by 1 dB in terms of bit error probability (BEP) performance, while keeping a similar computational complexity","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":"130614901","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":"Optimal Intra-Symbol Spectral Compensation for Multicarrier Modulation","authors":"T. Magesacher, P. Odling, P.O. Borjesson","doi":"10.1109/IZS.2006.1649099","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649099","url":null,"abstract":"Spectral compensation aims at maximising the throughput of a multicarrier transmission system under a given power spectral density (PSD) constraint. A set of carefully chosen tones, the so called compensation tones, is modulated with a linear combination of the data transmitted over the complementary set of tones. The compensation tones support shaping of the transmit PSD so that the overall transmit power and thus the throughput increase. The contribution of this paper is twofold. First, we compute the optimal solution for a given set of compensation tones - optimal in the sense of maximising the mutual information between transmit and receive blocks for a time-dispersive Gaussian channel known to the transmitter. Second, we present a low-complexity heuristic to find the set of compensation tones","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"55 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":"128630022","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":"Cooperative Spatial Multiplexing with Hybrid Channel Knowledge","authors":"D. Gesbert, A. Hjørungnes, H. Skjevling","doi":"10.1109/IZS.2006.1649073","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649073","url":null,"abstract":"We explore the concept of cooperative spatial multiplexing for use in MIMO multicell networks. One key application of this is the transmission of possibly correlated symbol streams jointly by several multiple-antenna access points toward multiple single antenna user terminals located in neighboring cells. To augment the realism of this setting, we consider different levels of channel state information at the transmitter (CSIT). In one case, we further introduce a constraint on hybrid channel state information (HCSI) in which any given transmitter knows its own CSI perfectly while it only has statistical information about other transmitters' channels. This yield a game situation in which each cooperating transmitter makes a guess about the behavior of the other transmitter. We show different transmission strategies under this setting and compare them with fully cooperative (full CSI) and non cooperative schemes. Our results show a substantial cooperation gain despite the lack of instantaneous information","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"77 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":"127867211","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":"Space-Time Product Convolutional Codes with Full Antenna Diversity","authors":"Carlos Medina, M. Gabrowska","doi":"10.1109/IZS.2006.1649094","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649094","url":null,"abstract":"Product convolutional codes are investigated as an alternative concatenated scheme to construct full antenna diversity space-time codes. The proposed space-time code construction is analyzed and the conditions to achieve full diversity are determined. The resulting space-time codes are compared with space-time serially concatenated and woven convolutional codes. Simulation results for quasi-static Rayleigh fading channels show that space-time product convolutional codes have a better performance (in terms of bit error rate) and a smaller iterative decoding complexity than space-time serially concatenated and woven convolutional codes","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"60 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":"132267004","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}