Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523775
Jian-Qin Liu, K. Shimohara
In this paper, we propose a new encoding algorithm and its corresponding decoding algorithm, which are designed by biomolecular computation based on the signaling pathways of Rho family GTPases. These algorithms can carry out encoding/decoding processes that are capable of correcting possible errors, and are expected to be realized by corresponding engineered cellular pathways according to their biochemical faithfulness
{"title":"On designing error-correctable codes by biomolecular computation","authors":"Jian-Qin Liu, K. Shimohara","doi":"10.1109/ISIT.2005.1523775","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523775","url":null,"abstract":"In this paper, we propose a new encoding algorithm and its corresponding decoding algorithm, which are designed by biomolecular computation based on the signaling pathways of Rho family GTPases. These algorithms can carry out encoding/decoding processes that are capable of correcting possible errors, and are expected to be realized by corresponding engineered cellular pathways according to their biochemical faithfulness","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"18 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":"117262469","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523296
Leonard H. Grokop, A. Sahai, M. Gastpar
We introduce a new problem of broadcast source coding with a discrimination requirement - there is an eavesdropping user from whom we wish to withhold the true message in an entropic sense. Binning can achieve the Slepian-Wolf rate, but at the cost of full information leakage to the eavesdropper. Our main result is a lower bound that implies that any entropically efficient broadcast scheme must be "like binning" in that it also must leak significant information to eavesdroppers
{"title":"Discriminatory source coding for a noiseless broadcast channel","authors":"Leonard H. Grokop, A. Sahai, M. Gastpar","doi":"10.1109/ISIT.2005.1523296","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523296","url":null,"abstract":"We introduce a new problem of broadcast source coding with a discrimination requirement - there is an eavesdropping user from whom we wish to withhold the true message in an entropic sense. Binning can achieve the Slepian-Wolf rate, but at the cost of full information leakage to the eavesdropper. Our main result is a lower bound that implies that any entropically efficient broadcast scheme must be \"like binning\" in that it also must leak significant information to eavesdroppers","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"214 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":"117347838","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523443
S. Furrer, D. Dahlhaus
Multiple-antenna concepts for wireless communication systems promise high spectral efficiencies by proper exploitation of the randomness in multipath propagation. In this paper, we investigate the impact of channel uncertainty caused by channel estimation errors on the capacity of Rayleigh and Ricean block-fading channels. We consider a training-based multiple-antenna system that reserves a portion of time to sound the channel. The training symbols are used to estimate the channel state information (CSI) at the receiver by means of an arbitrary linear estimation filter. No CSI is assumed at the transmitter. We present an equivalent system model for training-based multiple-antenna systems, which specifies the channel by the estimated (and hence, known) channel coefficients and an uncorrelated, data-dependent noise. Based on this equivalent model, which includes the special cases of perfect CSI and no CSI, we derive upper and lower bounds on the maximum instantaneous mutual information and the ergodic capacity, and extend previous results to arbitrary (and possibly mismatched) linear channel estimators and to correlated Ricean fading
{"title":"Bounds on the ergodic capacity of training-based multiple-antenna systems","authors":"S. Furrer, D. Dahlhaus","doi":"10.1109/ISIT.2005.1523443","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523443","url":null,"abstract":"Multiple-antenna concepts for wireless communication systems promise high spectral efficiencies by proper exploitation of the randomness in multipath propagation. In this paper, we investigate the impact of channel uncertainty caused by channel estimation errors on the capacity of Rayleigh and Ricean block-fading channels. We consider a training-based multiple-antenna system that reserves a portion of time to sound the channel. The training symbols are used to estimate the channel state information (CSI) at the receiver by means of an arbitrary linear estimation filter. No CSI is assumed at the transmitter. We present an equivalent system model for training-based multiple-antenna systems, which specifies the channel by the estimated (and hence, known) channel coefficients and an uncorrelated, data-dependent noise. Based on this equivalent model, which includes the special cases of perfect CSI and no CSI, we derive upper and lower bounds on the maximum instantaneous mutual information and the ergodic capacity, and extend previous results to arbitrary (and possibly mismatched) linear channel estimators and to correlated Ricean fading","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"21 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120851538","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523458
Hachiro Fujita, Maki Ohata, K. Sakaniwa
In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes
{"title":"An algebraic method for constructing efficiently encodable irregular LDPC codes","authors":"Hachiro Fujita, Maki Ohata, K. Sakaniwa","doi":"10.1109/ISIT.2005.1523458","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523458","url":null,"abstract":"In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"17 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":"124102845","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523543
Vijay Ahirwar, B. Rajan
It is known that in an OFDM system using Hadamard transform or phase alteration before the IDFT operation can reduce the peak-to-average power ratio (PAPR). Both these techniques can be viewed as constellation preceding for PAPR reduction. In general, using non-diagonal transforms, like Hadamard transform, increases the ML decoding complexity. In this paper we propose the use of block-IDFT matrices and show that appropriate block-IDFT matrices give lower PAPR as well as lower decoding complexity compared to using Hadamard transform. Moreover, we present a detailed study of the tradeoff between PAPR reduction and the ML decoding complexity when using block-IDFT matrices with various sizes of the blocks
{"title":"Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems","authors":"Vijay Ahirwar, B. Rajan","doi":"10.1109/ISIT.2005.1523543","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523543","url":null,"abstract":"It is known that in an OFDM system using Hadamard transform or phase alteration before the IDFT operation can reduce the peak-to-average power ratio (PAPR). Both these techniques can be viewed as constellation preceding for PAPR reduction. In general, using non-diagonal transforms, like Hadamard transform, increases the ML decoding complexity. In this paper we propose the use of block-IDFT matrices and show that appropriate block-IDFT matrices give lower PAPR as well as lower decoding complexity compared to using Hadamard transform. Moreover, we present a detailed study of the tradeoff between PAPR reduction and the ML decoding complexity when using block-IDFT matrices with various sizes of the blocks","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"103 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":"124593815","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523662
M. Madiman, Ioannis Kontoyiannis
Using a simple inequality about the relative entropy, its so-called "tensorization property," we give a simple proof of a functional inequality which is satisfied by any compound Poisson distribution. This functional inequality belongs to the class of modified logarithmic Sobolev inequalities. We use it to obtain measure concentration bounds for compound Poisson distributions under a variety of assumptions on their tail behavior. In particular, we show how the celebrated "Herbst argument" can be modified to yield sub-exponential concentration bounds. For example, suppose Z is a compound Poisson random variable with values on the nonnegative integers, and let f be a function such that |f(k+1) - f(k)| les 1 for all k. Then, if the base distribution of Z does not have a finite moment-generating function but has finite moments up to some order L > 1, we show that the probability that f(Z) exceeds its mean by a positive amount t or more decays approximately like (const)middott-L, where the constant is explicitly identified. This appears to be one of the very first examples of concentration bounds with power-law decay
利用一个关于相对熵的简单不等式，即所谓的“张紧化性质”，我们给出了一个简单的证明，证明了任何复合泊松分布都满足的一个泛函不等式。这个泛函不等式属于修正对数Sobolev不等式。我们用它来获得复合泊松分布在其尾部行为的各种假设下的测量浓度界限。特别是，我们展示了如何修改著名的“赫布斯特论证”以产生次指数浓度界限。例如,假设Z是一个复合泊松随机变量值的非负整数,并让f是一个函数,这样| (k + 1) - f (k) | les 1 k。然后,如果Z的基地分布没有一个有限矩量母函数,但有限时刻一些秩序L > 1,我们表明,f (Z)的概率超过它的意思积极t以上衰变大约像(常量)middott-L常数是明确确定。这似乎是浓度界限具有幂律衰减的最早例子之一
{"title":"Concentration and relative entropy for compound Poisson distributions","authors":"M. Madiman, Ioannis Kontoyiannis","doi":"10.1109/ISIT.2005.1523662","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523662","url":null,"abstract":"Using a simple inequality about the relative entropy, its so-called \"tensorization property,\" we give a simple proof of a functional inequality which is satisfied by any compound Poisson distribution. This functional inequality belongs to the class of modified logarithmic Sobolev inequalities. We use it to obtain measure concentration bounds for compound Poisson distributions under a variety of assumptions on their tail behavior. In particular, we show how the celebrated \"Herbst argument\" can be modified to yield sub-exponential concentration bounds. For example, suppose Z is a compound Poisson random variable with values on the nonnegative integers, and let f be a function such that |f(k+1) - f(k)| les 1 for all k. Then, if the base distribution of Z does not have a finite moment-generating function but has finite moments up to some order L > 1, we show that the probability that f(Z) exceeds its mean by a positive amount t or more decays approximately like (const)middott-L, where the constant is explicitly identified. This appears to be one of the very first examples of concentration bounds with power-law decay","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"55 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":"124639693","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523288
A. Bennatan, D. Burshtein
We consider coset LDPC codes over GF(q), designed for use over arbitrary channels (particularly nonbinary and asymmetric channels). We show that the random selection of the nonzero elements of the GF(q) parity-check matrix induces a permutation-invariance property on the densities of the messages produced by the decoder. We use this property to show that under a Gaussian approximation, the entire q - 1 dimensional distribution of the vector messages is described by a single scalar parameter. We apply this result to develop EXIT charts for our codes. We use appropriately designed signal constellations to obtain substantial shaping gains. Simulation results indicate that our codes outperform multilevel codes at short block lengths. We also present results for the AWGN channel at 0.56 dB of the unconstrained Shannon limit (i.e. not restricted to any signal constellation) at a spectral efficiency of 6 bits/s/Hz
{"title":"EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels","authors":"A. Bennatan, D. Burshtein","doi":"10.1109/ISIT.2005.1523288","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523288","url":null,"abstract":"We consider coset LDPC codes over GF(q), designed for use over arbitrary channels (particularly nonbinary and asymmetric channels). We show that the random selection of the nonzero elements of the GF(q) parity-check matrix induces a permutation-invariance property on the densities of the messages produced by the decoder. We use this property to show that under a Gaussian approximation, the entire q - 1 dimensional distribution of the vector messages is described by a single scalar parameter. We apply this result to develop EXIT charts for our codes. We use appropriately designed signal constellations to obtain substantial shaping gains. Simulation results indicate that our codes outperform multilevel codes at short block lengths. We also present results for the AWGN channel at 0.56 dB of the unconstrained Shannon limit (i.e. not restricted to any signal constellation) at a spectral efficiency of 6 bits/s/Hz","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"22 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":"129414823","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523770
T. Murayama
This paper provides the asymptotic analysis for the sparse matrix codes in the CEO problem. In this problem, a firm's chief executive officer (CEO) is interested in the data sequence which cannot be observed directly. Therefore, the CEO deploys a team of L agents who encodes his/her noisy observation of the data sequence without sharing any information. The CEO then collects all the L codeword sequences to recover the data sequence, where the combined data rate R at which the agents can communicate with the CEO is limited. In our scenario, each agent is supposed to use his/her LDPC-like code for lossy compression, while the CEO estimates each data bit by a majority vote of the L reproductions. The replica ansatz and the central limit theorem allow us to derive an analytical description of the problem in the case of large L. Here, the expected error frequency can be numerically evaluated for a given R, indicating that the optimum decentralization strategy depends largely on the bandwidth, as well as the observation noise level
{"title":"On the asymptotic properties of sparse matrix codes in the CEO problem","authors":"T. Murayama","doi":"10.1109/ISIT.2005.1523770","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523770","url":null,"abstract":"This paper provides the asymptotic analysis for the sparse matrix codes in the CEO problem. In this problem, a firm's chief executive officer (CEO) is interested in the data sequence which cannot be observed directly. Therefore, the CEO deploys a team of L agents who encodes his/her noisy observation of the data sequence without sharing any information. The CEO then collects all the L codeword sequences to recover the data sequence, where the combined data rate R at which the agents can communicate with the CEO is limited. In our scenario, each agent is supposed to use his/her LDPC-like code for lossy compression, while the CEO estimates each data bit by a majority vote of the L reproductions. The replica ansatz and the central limit theorem allow us to derive an analytical description of the problem in the case of large L. Here, the expected error frequency can be numerically evaluated for a given R, indicating that the optimum decentralization strategy depends largely on the bandwidth, as well as the observation noise level","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"6 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":"128489658","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523726
J. Muramatsu, K. Yoshimura, Kenichi Arai, P. Davis
This paper considers the capacity for secret key agreement under a sampling attack. Given the number of the eavesdropper's sources, we evaluate the secret key capacity bound which is defined as the supremum of the secret key capacity divided by the description length of the alphabet, where the supremum is taken over a set of probability distributions corresponding to the correlated sources. In particular, we consider symmetric sources and permutation-invariant sources. We derive inequalities which show the scaling of the secret key capacity bound with the number of the eavesdropper's sources
{"title":"Secret key agreement under sampling attack","authors":"J. Muramatsu, K. Yoshimura, Kenichi Arai, P. Davis","doi":"10.1109/ISIT.2005.1523726","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523726","url":null,"abstract":"This paper considers the capacity for secret key agreement under a sampling attack. Given the number of the eavesdropper's sources, we evaluate the secret key capacity bound which is defined as the supremum of the secret key capacity divided by the description length of the alphabet, where the supremum is taken over a set of probability distributions corresponding to the correlated sources. In particular, we consider symmetric sources and permutation-invariant sources. We derive inequalities which show the scaling of the secret key capacity bound with the number of the eavesdropper's sources","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"7 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":"128657363","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523649
S. Hemati, A. Banihashemi, C. Plett
Current-mode circuits are presented for implementing analog min-sum (MS) iterative decoders. Proposed circuits are devised based on current mirrors. Therefore, in any fabrication technology that accurate current mirrors can be designed, analog MS decoders can be implemented. The functionality of the proposed modules was verified by implementing an analog MS decoder for a (32,8,10) regular LDPC code in 0.18-mum CMOS technology. In low signal to noise ratios when the circuit imperfections are dominated by the noise of the channel, the measured error correcting performance of this chip in steady-state condition surpasses that of the conventional MS decoder, and is close to the performance predicted by the earlier work on the dynamics of the continuous-time analog decoding by Hemati and Banihashemi, ISIT2004. At a throughput of 24 Mb/s, loss in the coding gain compared to the conventional MS decoder at BER of 10-3 is about 0.3 dB. To the best of our knowledge, this decoder has the highest throughput and the lowest power/speed ratio among the reported analog CMOS iterative decoders
本文介绍了用于实现模拟最小和（MS）迭代解码器的电流模式电路。所提出的电路是基于电流镜设计的。因此，在任何可以设计出精确电流镜的制造技术中，都可以实现模拟 MS 解码器。通过在 0.18 微米 CMOS 技术中实现 (32,8,10) 规则 LDPC 代码的模拟 MS 解码器，验证了所提模块的功能。在信噪比较低的情况下，当电路缺陷由信道噪声主导时，该芯片在稳态条件下的测量纠错性能超过了传统 MS 解码器，并接近 Hemati 和 Banihashemi（ISIT2004）早期关于连续时间模拟解码动态的工作所预测的性能。在吞吐量为 24 Mb/s 时，与误码率为 10-3 的传统 MS 解码器相比，编码增益损失约为 0.3 dB。据我们所知，在已报道的模拟 CMOS 迭代解码器中，该解码器具有最高的吞吐量和最低的功率/速度比。
{"title":"A high-speed analog min-sum iterative decoder","authors":"S. Hemati, A. Banihashemi, C. Plett","doi":"10.1109/ISIT.2005.1523649","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523649","url":null,"abstract":"Current-mode circuits are presented for implementing analog min-sum (MS) iterative decoders. Proposed circuits are devised based on current mirrors. Therefore, in any fabrication technology that accurate current mirrors can be designed, analog MS decoders can be implemented. The functionality of the proposed modules was verified by implementing an analog MS decoder for a (32,8,10) regular LDPC code in 0.18-mum CMOS technology. In low signal to noise ratios when the circuit imperfections are dominated by the noise of the channel, the measured error correcting performance of this chip in steady-state condition surpasses that of the conventional MS decoder, and is close to the performance predicted by the earlier work on the dynamics of the continuous-time analog decoding by Hemati and Banihashemi, ISIT2004. At a throughput of 24 Mb/s, loss in the coding gain compared to the conventional MS decoder at BER of 10-3 is about 0.3 dB. To the best of our knowledge, this decoder has the highest throughput and the lowest power/speed ratio among the reported analog CMOS iterative decoders","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"2016 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":"127401966","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
扫码关注我们
求助内容：
应助结果提醒方式：