2007 Information Theory and Applications Workshop最新文献

筛选
英文 中文
From Information Rate Computation to Communication System Design 从信息率计算到通信系统设计
2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357599
M. Franceschini, R. Pighi, G. Ferrari, R. Raheli
{"title":"From Information Rate Computation to Communication System Design","authors":"M. Franceschini, R. Pighi, G. Ferrari, R. Raheli","doi":"10.1109/ITA.2007.4357599","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357599","url":null,"abstract":"This paper investigates the application of information-theoretic techniques to the design of advanced communication and storage systems. We use the information rate (IR), evaluated using a recently proposed efficient numerical technique, as the key parameter characterizing the system performance. As case studies, we consider three different scenarios: (i) single-carrier (SC) and multi-carrier (MC) transmission systems over linear dispersive channels, (ii) digital storage systems impaired by media noise, and (iii) optical communication systems with direct photo-detection. The obtained results show that a clever IR analysis can provide significant insights into system performance and design in several scenarios of interest in current applications.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127639325","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
Delay-Constrained Energy Efficient Data Transmission over a Wireless Fading Channel 基于无线衰落信道的时延约束节能数据传输
2007 Information Theory and Applications Workshop Pub Date : 2007-10-22 DOI: 10.1109/ITA.2007.4357594
M. Zafer, E. Modiano
{"title":"Delay-Constrained Energy Efficient Data Transmission over a Wireless Fading Channel","authors":"M. Zafer, E. Modiano","doi":"10.1109/ITA.2007.4357594","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357594","url":null,"abstract":"We study optimal rate control for transmitting deadline-constrained data over a time-varying channel. Specifically, we consider a wireless transmitter where the channel gain varies stochastically over time and the packets in the queue have strict delay constraints. The transmitter can adapt the rate over time by varying the power and the goal is to obtain the rate-control policy that minimizes the expected energy expenditure while meeting the deadline constraints. We first consider the case of B bits of data that must be transmitted by a deadline T and using a novel continuous-time stochastic control formulation obtain the optimal policy. Based on a cumulative curves methodology and a decomposition approach, we then obtain the optimal policy when the queue has packets with variable deadline constraints. Finally, we present a heuristic policy for the case of arbitrary packet arrivals to the queue and compare its performance using simulation results with a non-adaptive scheme.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115144439","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}
引用次数: 69
The Gaussian multiple access wire-tap channel: wireless secrecy and cooperative jamming 高斯多址有线监听信道:无线保密与协同干扰
2007 Information Theory and Applications Workshop Pub Date : 2007-02-08 DOI: 10.1109/ITA.2007.4357611
Ender Tekin, A. Yener
{"title":"The Gaussian multiple access wire-tap channel: wireless secrecy and cooperative jamming","authors":"Ender Tekin, A. Yener","doi":"10.1109/ITA.2007.4357611","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357611","url":null,"abstract":"We consider the general Gaussian multiple access wire-tap channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy measures, termed individual and collective, to reflect the confidence in the system for this multi-access environment. We determine achievable rates such that secrecy to some predetermined degree can be maintained, using Gaussian codebooks. We also find outer bounds for the case when the eavesdropper receives a degraded version of the intended receiver's signal. In the degraded case, Gaussian codewords are shown to achieve the sum capacity for collective constraints. In addition, a TDMA scheme is shown to also achieve sum capacity for both sets of constraints. Numerical results showing the new rate region are presented and compared with the capacity region of the Gaussian multiple-access channel (GMAC) with no secrecy constraints. We then find the secrecy sum-rate maximizing power allocations for the transmitters, and show that a cooperative jamming scheme can be used to increase achievable rates in this scenario.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114883751","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}
引用次数: 47
Searching for low weight pseudo-codewords 搜索低权重伪码字
2007 Information Theory and Applications Workshop Pub Date : 2007-02-04 DOI: 10.1109/ITA.2007.4357567
M. Chertkov, M. Stepanov
{"title":"Searching for low weight pseudo-codewords","authors":"M. Chertkov, M. Stepanov","doi":"10.1109/ITA.2007.4357567","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357567","url":null,"abstract":"Belief propagation (BP) and linear programming (LP) decodings of low density parity check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach developed for analysis of the error-floor domain of the codes. Instantons are special, code and decoding specific, configurations of the channel noise contributing most to the Frame-Error-Rate (FER). Instantons are decoded into pseudo- codewords. Instanton/pseudo-codeword with the lowest weight describes the largest Signal-to-Noise-Ratio (SNR) asymptotic of FER, while the whole spectra of the low weight instantons is descriptive of the FER vs SNR profile in the extended error-floor domain. First, we describe a general optimization method that allows to find the instantons for any coding/decoding. Second, we introduce LP-specific pseudo-codeword search algorithm that allows efficient calculations of the pseudo-codeword spectra. Finally, we discuss results of combined BP/LP error-floor exploration experiments for two model codes.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116330447","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
Parametrized Stochastic Grammars for RNA Secondary Structure Prediction RNA二级结构预测的参数化随机语法
2007 Information Theory and Applications Workshop Pub Date : 2007-01-24 DOI: 10.1109/ITA.2007.4357589
Robert S. Maier
{"title":"Parametrized Stochastic Grammars for RNA Secondary Structure Prediction","authors":"Robert S. Maier","doi":"10.1109/ITA.2007.4357589","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357589","url":null,"abstract":"We propose a two-level stochastic context-free grammar (SCFG) architecture for parametrized stochastic modeling of a family of RNA sequences, including their secondary structure. A stochastic model of this type can be used for maximum a posteriori estimation of the secondary structure of any new sequence in the family. The proposed SCFG architecture models RNA subsequences comprising paired bases as stochastically weighted Dyck-language words, i.e., as weighted balanced- parenthesis expressions. The length of each run of unpaired bases, forming a loop or a bulge, is taken to have a phase-type distribution: that of the hitting time in a finite-state Markov chain. Without loss of generality, each such Markov chain can be taken to have a bounded complexity. The scheme yields an overall family SCFG with a manageable number of parameters.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132282193","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
Multiuser Water-filling in the Presence of Crosstalk 存在串音的多用户充水
2007 Information Theory and Applications Workshop Pub Date : 2007-01-01 DOI: 10.1109/ITA.2007.4357612
Wei Yu
{"title":"Multiuser Water-filling in the Presence of Crosstalk","authors":"Wei Yu","doi":"10.1109/ITA.2007.4357612","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357612","url":null,"abstract":"Spectrum optimization is an important part of the design of interference-limited multiuser communication systems. While traditional water-filling provides a closed-form solution to the transmit optimization problem in a single-user system, the multiuser version of the problem often leads to nonconvex problem formulations which are difficult to solve. Motivated by high-speed parallel-link and digital subscriber line applications, this paper investigates two practical multiuser settings in which global or local optimal solutions to the multiuser spectrum optimization problems can be found efficiently. The first part of this paper considers a high-speed transmission system in which practical (but suboptimal) minimum-mean-squared-error linear equalizers (MMSE-LEs) are used at the receiver. The optimal single-user transmit spectrum in this case involves a modified water-filling solution. Surprisingly, such a modified water-filling spectrum can be shown to be near-optimal in a multiuser setting as well, if the direct-link and the crosstalk characteristics are symmetric and if crosstalk is reasonably small. Thus, for practical parallel-link systems using MMSE linear equalizers, the optimal single-user and multiuser spectra are nearly identical. The second part of this paper considers numerical techniques for solving a nonconvex multiuser rate maximization problem for digital subscriber line applications. A new ingredient in the proposed approach is a taxation scheme that takes into account the effect of interference between neighboring lines. This leads to a modified iterative water-filling algorithm which is capable of finding local optimum solutions to the multiuser spectrum optimization problem efficiently.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121778565","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}
引用次数: 173
On Cooperative Lattice Coding and Decoding 合作格编码与译码
2007 Information Theory and Applications Workshop Pub Date : 2006-02-13 DOI: 10.1109/ITA.2007.4357558
Arul D. Murugan, K. Azarian, H. E. Gamal
{"title":"On Cooperative Lattice Coding and Decoding","authors":"Arul D. Murugan, K. Azarian, H. E. Gamal","doi":"10.1109/ITA.2007.4357558","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357558","url":null,"abstract":"We propose novel lattice coding/decoding schemes for half-duplex outage-limited cooperative channels. These schemes are inspired by the cooperation protocols of Azarian et al. and enjoy an excellent performance-complexity tradeoff. More specifically, for the relay channel, we devise a novel variant of the dynamic decode and forward protocol, along with a lattice-coded implementation, which enjoys a near-optimal diversity-multiplexing tradeoff with a low encoding/decoding complexity. On the other hand, for the cooperative multiple-access channel, we present a lattice-coded implementation of the optimal non- orthogonal amplify and forward protocol. Finally, we establish the performance gains of our proposed protocols via a comprehensive simulation study.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356785","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}
引用次数: 18
Design and Analysis of Low-Density Parity-Check Codes for Block-Fading Channels 块衰落信道低密度奇偶校验码的设计与分析
2007 Information Theory and Applications Workshop Pub Date : 1900-01-01 DOI: 10.1109/ITA.2007.4357562
J. Boutros, A. G. Fàbregas, E. Biglieri, Gilles Zémor
{"title":"Design and Analysis of Low-Density Parity-Check Codes for Block-Fading Channels","authors":"J. Boutros, A. G. Fàbregas, E. Biglieri, Gilles Zémor","doi":"10.1109/ITA.2007.4357562","DOIUrl":"https://doi.org/10.1109/ITA.2007.4357562","url":null,"abstract":"We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We present a new family of full-diversity LDPC codes that exhibit near outage limit performance. This family competes with multiplexed parallel turbo codes suitable for non-ergodic channels and recently reported in the literature.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124809567","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}
引用次数: 28
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学术官方微信