{"title":"Synchronization of PPM over Wideband Multipath Channels","authors":"D. Porrat, U. Mitra","doi":"10.1109/IZS.2006.1649106","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649106","url":null,"abstract":"The acquisition, or synchronization, of the multipath profile for ultra-wideband pulse position modulation (PPM) communication systems is considered. The rate of increase of the number of paths (as the bandwidth grows) determines whether synchronization can occur. It is shown that if the number of paths increases without bound, but slower than the square root of the bandwidth, then the system cannot synchronize in the limit. This result holds for an exponential or a uniform power delay profile, for IID Gaussian paths or deterministic paths","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"4 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":"128534802","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":"Regularity in Sensor Networks","authors":"R. Ganti, M. Haenggi","doi":"10.1109/IZS.2006.1649111","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649111","url":null,"abstract":"We motivate the need for a metric to characterize the regularity of node placement in sensor networks. Practical metrics are proposed and evaluated for different stationary point process models","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":"130107940","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 CDMA Load and the Perron Root","authors":"C. Fischer","doi":"10.1109/IZS.2006.1649096","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649096","url":null,"abstract":"In this paper, we show how the Perron root and the concept of load in CDMA cellular systems are linked and propose to estimate the load by the Perron root. Various methods to simply estimate the Perron root are analysed with respect to their suitability for analytical use and early-stage network planning. In contrast to the traditional load equations, the proposed methods do not require the solution of the power allocation problem","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"39 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":"134251158","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":"Two-Way Radio Networks with a Star Topology","authors":"R. Knopp","doi":"10.1109/IZS.2006.1649103","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649103","url":null,"abstract":"Achievable rates for two-way half-duplex relay channels are considered. This channel model is applicable to wireless networks with a star topology characterized by a traffic model where all traffic in the network traverses the relay due to the lack of a reliable direct link between the nodes. The coding and multiple-access strategies make use of network coding at the relay in addition to analog forwarding with interference cancellation at the receivers. An achievable rate region for discrete-memoryless networks is given as well as extensions for the additive white Gaussian network","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":"133929823","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":"Path Pruning for Unequal Error Protection Turbo Codes","authors":"W. Henkel, N. von Deetzen","doi":"10.1109/IZS.2006.1649100","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649100","url":null,"abstract":"For some applications in communications, it is desirable to provide unequal error protection for different types of information data. In image coding, e.g., types of bits exist which have to be protected with different protection levels when transmitting these data over noisy channels. In this paper, we concentrate on turbo codes C. Berrou et al., 1993) with unequal error protection capabilities which are achieved by modifying the code rate R = k/n. After pointing out that puncturing and path pruning are modifications of the rate in the denominator and numerator, respectively, the latter is studied in more detail. Design rules are given and EXIT charts for performance analysis of turbo codes with path-pruned convolutional component codes are presented","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":"131560963","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 Optimization of the V-BLAST Algorithm","authors":"V. Kostina, S. Loyka","doi":"10.1109/IZS.2006.1649092","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649092","url":null,"abstract":"Optimum power allocation for the V-BLAST algorithm, which is based on various criteria (average and instantaneous block and total error rates (BLER and TBER)), is considered. Closed-form expressions are derived for high-SNR case in a Rayleigh fading channel. It is demonstrated that, in that case, the optimization \"on average\" is almost identical to the instantaneous one (while the former requires only the feedback \"on average\", the latter requires instantaneous feedback and hence is of higher complexity). The BLER and TBER optimization criteria result in the same performance. Power optimization (of un-ordered BLAST) and optimal ordering result in the same performance improvement at high SNR","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":"131054339","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":"An improved algorithm for UWB-bases positioning in a multi-path environment","authors":"Stefan Mangold, A. Jarosch, Claude Monney","doi":"10.1109/IZS.2006.1649116","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649116","url":null,"abstract":"In this paper, we derive and analyze novel distributed algorithms for calculating the position of tags in a wireless ad-hoc network. The raw data for determining the tag positions stems from time-of-arrival (ToA) measurements of radio frequency (RF) pulses transmitted in between the tags. The sensor network is expected to operate indoors, i.e., the wireless channel is characterized by heavy multi-path propagation. It turns out that the probability density function (PDF) of the TOA measurement error has heavy tails due to this multi-path environment, which has a tremendous impact on the performance of the tag position calculation. We propose a novel position calculation algorithm, which utilizes the tails in the measurement error PDF and easy to implement. This is in contrast to existing approaches, which assume that the measurement error PDF is Gaussian. The novel positioning algorithm allows distributing the required calculations onto the tags and fusing TOA measurements from a large number of tags","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"9 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":"116902667","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":"Multiuser Diversity in Delay-Limited Cellular Wideband Systems","authors":"R. Müller, G. Caire, R. Knopp","doi":"10.1109/ITW.2005.1531874","DOIUrl":"https://doi.org/10.1109/ITW.2005.1531874","url":null,"abstract":"We consider the uplink and the downlink of a multiuser wireless system with one base station and K user terminals. Each user is affected by a propagation path loss, fixed in time, and by a slowly time-varying frequency-selective fading channel, modeled as M parallel block-fading channels. We investigate \"multiuser diversity\", i.e., the gain achieved by a multiuser system over a single-user system. In particular, we compare \"delay-limited\" systems with \"delay-tolerant\" systems based on proportional fair scheduling. Our analysis allows us to quantify the loss incurred by a strict delay constraint in a cellular environment, for given M, K and channel statistics","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"1 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":"131385098","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}