Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.最新文献_第8页

The new construction of rank codes 等级代码的新构造

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523717

A. Kshevetskiy, E. Gabidulin

引用次数: 126

Code design for the low SNR noncoherent MIMO block Rayleigh fading channel 低信噪比非相干MIMO块瑞利衰落信道的编码设计

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523741

S. G. Srinivasan, M. Varanasi

引用次数: 7

A fixed-rate bit stuffing approach for high efficiency k-constrained codes 一种高效k约束码的固定速率位填充方法

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523394

Y. Sankarasubramaniam, S. McLaughlin

{"title":"A fixed-rate bit stuffing approach for high efficiency k-constrained codes","authors":"Y. Sankarasubramaniam, S. McLaughlin","doi":"10.1109/ISIT.2005.1523394","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523394","url":null,"abstract":"Binary sequences where successive ones are separated by at most k consecutive zeros, are said to be k-constrained. We introduce a new fixed-rate algorithm for efficiently encoding and decoding k-constrained sequences. Our approach is based on bit stuffing proposed by Bender and Wolf. Bit stuffing is a simple algorithm that can produce near-optimal codes for a wide range of constraints. While bit stuffing achieves rates very close to the noiseless capacity, encoding is variable-rate, which severely limits its practical use. In this paper, we present a fixed-rate version of the bit stuff algorithm. High encoding efficiency is achieved by iterative pre-processing of the fixed-length input data to conform it to bit insertion. The encoder then inserts bits to produce a fixed-length output word. Rate computations for the proposed encoding algorithm are discussed, and upper and lower bounds are derived for the asymptotic (in input block length) encoding rate. It is seen that encoding rates very close to the average bit stuff rate are possible with long, fixed-length, input and output blocks. Upper and lower bounds on the asymptotic encoding rate are listed for values of k = 1 to 15","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115958854","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

Throughput-delay scaling in wireless networks with constant-size packets 具有固定大小数据包的无线网络中的吞吐量延迟缩放

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523558

A. Gamal, J. Mammen, B. Prabhakar, D. Shah

{"title":"Throughput-delay scaling in wireless networks with constant-size packets","authors":"A. Gamal, J. Mammen, B. Prabhakar, D. Shah","doi":"10.1109/ISIT.2005.1523558","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523558","url":null,"abstract":"In previous work (2004), we characterized the optimal throughput-delay trade-off in static wireless networks as D(n) = Theta(nT(n)), where D(n) and T(n) are the average packet delay and throughput in a network of n nodes, respectively. While this trade-off captured the essential network dynamics, packets needed to scale down with the network size. In this \"fluid model\", no buffers were required. Due to this packet scaling, D(n) did not correspond to the average delay per bit. That led to the question whether the trade-off remains the same when the packet size is kept constant, which necessitates buffers and packet scheduling in the network. In this paper, we answer this question in the affirmative by showing that the optimal throughput-delay trade-off is still D(n) = Theta(nT(n)), where now D(n) is the average delay per bit. Packets of constant size necessitate the use of buffers in the network, which in turn requires scheduling packet transmissions in a discrete-time queueing network and analyzing the corresponding delay. Our method consists of deriving packet schedules in the discrete-time network by looking at a corresponding continuous-time network and then analyzing the delay induced in the actual discrete network using results from queueing theory for continuous-time networks","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131466544","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}

引用次数: 13

A throughput-delay trade-off in packetized systems with erasures 带擦除的分组系统中的吞吐量-延迟权衡

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523667

Mikko Vehkaperä, M. Médard

{"title":"A throughput-delay trade-off in packetized systems with erasures","authors":"Mikko Vehkaperä, M. Médard","doi":"10.1109/ISIT.2005.1523667","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523667","url":null,"abstract":"In this paper we propose an information theoretic framework for studying coding and throughput optimization for multi-layered packet transmission systems. Our approach assumes that the system is divided into two separate layers: One code word forms a packet at the physical layer and the code at the network layer spans over these packets. At the receiver, the network layer assumes that the decoded packets arriving from the physical layer either have no errors or are marked as deleted. Thus, albeit the packet loss may be caused, for example, by decoding error, congestion or channel conditions, the network layer treats all decoding errors as erasures regardless of the cause. This allows us to view the system at the network layer as transmission over memoryless erasure channel. We study the throughput optimization and code design across the layers under a total code length constraint while taking also into account the network layer imperfections in the transmission. We use random coding error exponents to achieve results that do not depend on specific coding scheme used. The proposed scheme provides also means for investigating important physical layer phenomena, such as, channel model and lower layer error correction coding in the packet erasure models. Our approach extends to fading channels and networks of multiple nodes and by viewing the two layers of coding as a concatenated coding scheme, a comparison between layer-by-layer and joint cross-layer rate optimization can be made, as outlined in this paper","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127717673","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}

引用次数: 30

On the limits of sphere decoding 论球面译码的极限

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523633

J. Jaldén, B. Ottersten

引用次数: 19

Cyclotomic numbers of order 5 over F/sub p//sup n/ 5阶分环数/ F/ p//sup n/

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523688

Jung-Soo Chung, Young-Sik Kim, Tae-Hyung Lim, Jong-Seon No, Habong Chung

引用次数: 0

Optimal transmit covariance for MIMO channels with statistical transmitter side information 具有统计发射机侧信息的MIMO信道的最优发射协方差

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523659

L. Hanlen, A. Grant

引用次数: 32

On multiple user channels with state information at the transmitters 在多用户信道上发送状态信息

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523295

S. Sigurjonsson, Young-Han Kim

引用次数: 66

New results on DNA codes DNA密码的新结果

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523339

A. D'yachkov, A. Macula, T. Renz, P. Vilenkin, I. K. Ismagilov

引用次数: 14