Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261932
Amir Winshtok, Y. Steinberg
In this work we characterize the capacity region of the arbitrarily varying degraded memoryless broadcast channel, with noncausal channel state information at the transmitter (CSIT), and full channel state information at the receiver of the stronger user (CSIR). The analysis follows ideas of Ahlswede. The techniques used in this work can be used to derive an inner bound on the capacity region of an arbitrarily varying degraded broadcast channel without CSIR
{"title":"The Arbitrarily Varying Degraded Broadcast Channel with States Known at the Encoder","authors":"Amir Winshtok, Y. Steinberg","doi":"10.1109/ISIT.2006.261932","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261932","url":null,"abstract":"In this work we characterize the capacity region of the arbitrarily varying degraded memoryless broadcast channel, with noncausal channel state information at the transmitter (CSIT), and full channel state information at the receiver of the stronger user (CSIR). The analysis follows ideas of Ahlswede. The techniques used in this work can be used to derive an inner bound on the capacity region of an arbitrarily varying degraded broadcast channel without CSIR","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127881564","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261883
Taiwen Tang, C. Chae, R. Heath, S. Cho
In this paper, we investigate a multiple input multiple output (MIMO) multiuser relay channel, where a source with multiple antennas sends data to multiple users via a relay with multiple antennas. The relay applies linear processing to the received signal and forwards the processed signal to multiple users. In our system model, the direct links from the source to the users are neglected. We propose algorithms to compute achievable sum rates of this system based on dirty paper coding. An achievable sum rate defines a sum rate that can be achieved in the MIMO multiuser relay channel with zero error probability for any user, hence it is also a lower bound of the capacity of this channel. These algorithms also produce coefficients of the precoder at the source node and the coefficients of the linear processing unit at the relay. Simulations show that the proposed system architecture and algorithms achieve sum rate performance that is close to the derived performance upper bound
{"title":"On Achievable Sum Rates of A Multiuser MIMO Relay Channel","authors":"Taiwen Tang, C. Chae, R. Heath, S. Cho","doi":"10.1109/ISIT.2006.261883","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261883","url":null,"abstract":"In this paper, we investigate a multiple input multiple output (MIMO) multiuser relay channel, where a source with multiple antennas sends data to multiple users via a relay with multiple antennas. The relay applies linear processing to the received signal and forwards the processed signal to multiple users. In our system model, the direct links from the source to the users are neglected. We propose algorithms to compute achievable sum rates of this system based on dirty paper coding. An achievable sum rate defines a sum rate that can be achieved in the MIMO multiuser relay channel with zero error probability for any user, hence it is also a lower bound of the capacity of this channel. These algorithms also produce coefficients of the precoder at the source node and the coefficients of the linear processing unit at the relay. Simulations show that the proposed system architecture and algorithms achieve sum rate performance that is close to the derived performance upper bound","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126475526","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.262112
S. G. Srinivasa, S. McLaughlin
We present lower bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints. The bounds extend and generalize our previous work on binary constraints. We also give sequential coding algorithms achieving the derived capacity lower bounds
{"title":"Capacity Lower Bounds for Two-Dimensional M-ary (0, k) and (d, ∞) Runlength-limited Channels","authors":"S. G. Srinivasa, S. McLaughlin","doi":"10.1109/ISIT.2006.262112","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262112","url":null,"abstract":"We present lower bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints. The bounds extend and generalize our previous work on binary constraints. We also give sequential coding algorithms achieving the derived capacity lower bounds","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"126 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128022719","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261573
S. Sarvotham, D. Baron, Richard Baraniuk
Sudocodes are a new scheme for lossless compressive sampling and reconstruction of sparse signals. Consider a sparse signal x isin RopfN containing only K Lt N non-zero values. Sudo-encoding computes the codeword via the linear matrix-vector multiplication y = Phix, with K < M Lt N. We propose a non-adaptive construction of a sparse Phi comprising only the values 0 and 1; hence the computation of y involves only sums of subsets of the elements of x. An accompanying sudodecoding strategy efficiently recovers x given y. Sudocodes require only M = O(Klog(N)) measurements for exact reconstruction with worst-case computational complexity O(Klog(K) log(N)). Sudocodes can be used as erasure codes for real-valued data and have potential applications in peer-to-peer networks and distributed data storage systems. They are also easily extended to signals that are sparse in arbitrary bases
{"title":"Sudocodes ߝ Fast Measurement and Reconstruction of Sparse Signals","authors":"S. Sarvotham, D. Baron, Richard Baraniuk","doi":"10.1109/ISIT.2006.261573","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261573","url":null,"abstract":"Sudocodes are a new scheme for lossless compressive sampling and reconstruction of sparse signals. Consider a sparse signal x isin RopfN containing only K Lt N non-zero values. Sudo-encoding computes the codeword via the linear matrix-vector multiplication y = Phix, with K < M Lt N. We propose a non-adaptive construction of a sparse Phi comprising only the values 0 and 1; hence the computation of y involves only sums of subsets of the elements of x. An accompanying sudodecoding strategy efficiently recovers x given y. Sudocodes require only M = O(Klog(N)) measurements for exact reconstruction with worst-case computational complexity O(Klog(K) log(N)). Sudocodes can be used as erasure codes for real-valued data and have potential applications in peer-to-peer networks and distributed data storage systems. They are also easily extended to signals that are sparse in arbitrary bases","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121729991","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}
Pub Date : 2006-07-09DOI: 10.1093/ietfec/e89-a.10.2589
J. Muramatsu, K. Yoshimura, P. Davis
Secret key agreement is a procedure for agreeing on a secret key by exchanging messages over a public channel when a sender, a legitimate receiver and an eavesdropper have access to correlated sources. Maurer, IEEE Trans. Inf. Theory 1993 defined secret key capacity, which is the least upper bound of the key generation rate of the secret key agreement, and presented an upper and a lower bound for the secret key capacity. In this paper, the advantage distillation capacity is introduced and it is shown that this quantity equals to the secret key capacity. A naive information theoretical expression of the secret key capacity and the advantage distillation capacity is also presented. An example of correlated sources, for which an analytic expression of the secret key capacity can be obtained, is also presented
密钥协议是在发送方、合法接收方和窃听方可以访问相关源时，通过在公共通道上交换消息，就密钥达成一致的过程。Maurer, IEEE译。Inf. Theory 1993将密钥容量定义为密钥协议密钥生成速率的最小上界，并给出了密钥容量的上界和下界。本文介绍了优势蒸馏容量，并证明了优势蒸馏容量等于密钥容量。给出了密钥容量和优势蒸馏容量的朴素信息理论表达式。最后给出了一个相关源的实例，给出了密钥容量的解析表达式
{"title":"Secret Key Capacity and Advantage Distillation Capacity","authors":"J. Muramatsu, K. Yoshimura, P. Davis","doi":"10.1093/ietfec/e89-a.10.2589","DOIUrl":"https://doi.org/10.1093/ietfec/e89-a.10.2589","url":null,"abstract":"Secret key agreement is a procedure for agreeing on a secret key by exchanging messages over a public channel when a sender, a legitimate receiver and an eavesdropper have access to correlated sources. Maurer, IEEE Trans. Inf. Theory 1993 defined secret key capacity, which is the least upper bound of the key generation rate of the secret key agreement, and presented an upper and a lower bound for the secret key capacity. In this paper, the advantage distillation capacity is introduced and it is shown that this quantity equals to the secret key capacity. A naive information theoretical expression of the secret key capacity and the advantage distillation capacity is also presented. An example of correlated sources, for which an analytic expression of the secret key capacity can be obtained, is also presented","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121754892","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261961
Mostafa El-Khamy, J. Hou, N. Bhushan
In this paper, we design families of rate-compatible structured LDPC codes suitable for hybrid ARQ applications with high throughput. We devise a systematic technique of low complexity for the design of structured low-rate LDPC codes from higher rate ones. These codes have a good performance on the AWGN channel and are robust against erasures and puncturing. The codes designed here are protograph-based codes and have fast encoding and decoding structures. These low rate codes are used as the parent codes of rate-compatible families. Then, we propose a number of algorithms for puncturing the codes in a rate compatible manner to construct codes of higher rates. The two most promising ones are the random puncturing search technique and progressive node puncturing. We show that using the techniques in this paper one could construct a high throughput rate compatible family with codes whose rates are in the range from 0.1 to 0.9 and which are within 1 dB from the channel capacity and have good error floors
{"title":"H-ARQ Rate-Compatible Structured LDPC Codes","authors":"Mostafa El-Khamy, J. Hou, N. Bhushan","doi":"10.1109/ISIT.2006.261961","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261961","url":null,"abstract":"In this paper, we design families of rate-compatible structured LDPC codes suitable for hybrid ARQ applications with high throughput. We devise a systematic technique of low complexity for the design of structured low-rate LDPC codes from higher rate ones. These codes have a good performance on the AWGN channel and are robust against erasures and puncturing. The codes designed here are protograph-based codes and have fast encoding and decoding structures. These low rate codes are used as the parent codes of rate-compatible families. Then, we propose a number of algorithms for puncturing the codes in a rate compatible manner to construct codes of higher rates. The two most promising ones are the random puncturing search technique and progressive node puncturing. We show that using the techniques in this paper one could construct a high throughput rate compatible family with codes whose rates are in the range from 0.1 to 0.9 and which are within 1 dB from the channel capacity and have good error floors","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131361921","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261937
Hayato Takahashi
We introduce a universal Bayes test, which is a Bayesian version of Martin-Lof test. Then we define random sequences with respect to parametric models based on our universal Bayes test. We state some theorems related to Bayesian statistical inference in terms of random sequence
{"title":"Bayesian approach to a definition of random sequences and its applications to statistical inference","authors":"Hayato Takahashi","doi":"10.1109/ISIT.2006.261937","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261937","url":null,"abstract":"We introduce a universal Bayes test, which is a Bayesian version of Martin-Lof test. Then we define random sequences with respect to parametric models based on our universal Bayes test. We state some theorems related to Bayesian statistical inference in terms of random sequence","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"21 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132237538","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.261948
Wenyi Jin, M. Fossorier
In this work, an efficient approach is introduced for reliability-based list decoding of a linear block code. This method terminates the decoding if a local optimal candidate satisfies a probabilistic sufficient condition. The average computation complexity is greatly reduced with this method. The false alarm probability associated with the use of the probabilistic sufficient condition is also derived. Simulation results confirm the analysis with no performance degradation and important computation savings on average for soft decision decoding of the (255,239) RS code (reduction by a factor between 2 and 20)
{"title":"Probabilistic Sufficient Conditions on Optimality for Reliability Based Decoding of Linear Block Codes","authors":"Wenyi Jin, M. Fossorier","doi":"10.1109/ISIT.2006.261948","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261948","url":null,"abstract":"In this work, an efficient approach is introduced for reliability-based list decoding of a linear block code. This method terminates the decoding if a local optimal candidate satisfies a probabilistic sufficient condition. The average computation complexity is greatly reduced with this method. The false alarm probability associated with the use of the probabilistic sufficient condition is also derived. Simulation results confirm the analysis with no performance degradation and important computation savings on average for soft decision decoding of the (255,239) RS code (reduction by a factor between 2 and 20)","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132540472","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.262029
J. Kieffer
We consider the nonergodic channel model obtained by averaging binary symmetric channel components with respect to a weighting distribution. For a fixed epsi isin (0,1), suppose one wishes to compute the e-capacity of the nonergodic channel model, which is the optimum asymptotic rate at which the channel can be encoded via a sequence of channel codes which each yield maximal probability of decoding error les epsi. In 1963, Parthasarathy provided a formula for epsi-capacity valid for all but at most countably many values of epsi. Parthasarathy's formula fails at precisely those epsi values in (0,1) at which the epsi-capacity function undergoes a discontinuity. We present a formula for the epsi-capacity function which is valid at a discontinuity whenever the jump in the epsi-capacity function at that discontinuity is not too large
{"title":"Epsilon-Capacity of a Class of Nonergodic Channels","authors":"J. Kieffer","doi":"10.1109/ISIT.2006.262029","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262029","url":null,"abstract":"We consider the nonergodic channel model obtained by averaging binary symmetric channel components with respect to a weighting distribution. For a fixed epsi isin (0,1), suppose one wishes to compute the e-capacity of the nonergodic channel model, which is the optimum asymptotic rate at which the channel can be encoded via a sequence of channel codes which each yield maximal probability of decoding error les epsi. In 1963, Parthasarathy provided a formula for epsi-capacity valid for all but at most countably many values of epsi. Parthasarathy's formula fails at precisely those epsi values in (0,1) at which the epsi-capacity function undergoes a discontinuity. We present a formula for the epsi-capacity function which is valid at a discontinuity whenever the jump in the epsi-capacity function at that discontinuity is not too large","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134207337","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}
Pub Date : 2006-07-09DOI: 10.1109/ISIT.2006.262105
Yabo Li, Wei Zhang, X. Xia
In user cooperative communications, relay nodes are usually asynchronous. By realizing that the processing in the frequency domain is insensitive to the errors in the time domain, Mei et. al., (2005) recently applied the OFDM technique to achieve the full cooperative diversity for asynchronous cooperative communications, where orthogonal space-time block codes, Alamouti code in particular, were used for relay nodes and the channels from nodes to nodes are assumed flat fading. In this paper, we also consider asynchronous cooperative communications, but the channels from nodes to nodes are assumed to be frequency-selective fading. We use high rate space-frequency codes to encode the correctly detected information symbols across some subcarriers at relay nodes to achieve both full cooperative diversity and full multipath diversity for asynchronous communications, which, we show, holds if the recent high rate space-frequency codes constructed in W. Zhang et al., (2005) are used
{"title":"Distributive High-Rate Full-Diversity Space-Frequency Codes for Asynchronous Cooperative Communications","authors":"Yabo Li, Wei Zhang, X. Xia","doi":"10.1109/ISIT.2006.262105","DOIUrl":"https://doi.org/10.1109/ISIT.2006.262105","url":null,"abstract":"In user cooperative communications, relay nodes are usually asynchronous. By realizing that the processing in the frequency domain is insensitive to the errors in the time domain, Mei et. al., (2005) recently applied the OFDM technique to achieve the full cooperative diversity for asynchronous cooperative communications, where orthogonal space-time block codes, Alamouti code in particular, were used for relay nodes and the channels from nodes to nodes are assumed flat fading. In this paper, we also consider asynchronous cooperative communications, but the channels from nodes to nodes are assumed to be frequency-selective fading. We use high rate space-frequency codes to encode the correctly detected information symbols across some subcarriers at relay nodes to achieve both full cooperative diversity and full multipath diversity for asynchronous communications, which, we show, holds if the recent high rate space-frequency codes constructed in W. Zhang et al., (2005) are used","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133958959","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：