发布求助
文献互助 智能选刊 最新文献

Proceedings. IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Comparison of l/sub /spl infin//-norm and l/sub 1/-norm optimization for multi-antenna downlink transmission 多天线下行传输l/sub /spl infin//-norm与l/sub / 1/-norm优化比较
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023724
H. Boche, M. Schubert
{"title":"Comparison of l/sub /spl infin//-norm and l/sub 1/-norm optimization for multi-antenna downlink transmission","authors":"H. Boche, M. Schubert","doi":"10.1109/ISIT.2002.1023724","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023724","url":null,"abstract":"The authors consider a typical downlink scenario, where independent data streams are submitted via an M-element antenna array to K non-cooperating single antenna receivers. Assuming that meaningful channel information is available at the transmitting base station, recent results indicate that the optimal transmission strategy is to use a spatial linear pre-filter per user (also known as beamformer). The spatial diversity and processing gain that is obtained by spreading the signals in the spatial domain, may significantly improve the signal-to-interference-ratio (SIR). Assuming that a fair sharing of resources is required, the design goal should be to balance the SIR levels so as to meet certain target values /spl gamma//sub 1/.../spl gamma//sub K/.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"14 1","pages":"452-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75094727","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
On asymptotically optimal sequential lossless coding for memoryless switching sources 无记忆开关源的渐近最优顺序无损编码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023396
G. Shamir
{"title":"On asymptotically optimal sequential lossless coding for memoryless switching sources","authors":"G. Shamir","doi":"10.1109/ISIT.2002.1023396","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023396","url":null,"abstract":"Two strategies are used to exploit a set D/sub n/ of dormant nodes. The first creates /spl sigma/ nodes each time a new node should be created. One node with reset occurrence counts, while the others assume counts of all dormant nodes. When sufficient data is available, all new nodes but the one that is likely to represent a true state are eliminated. The second strategy creates only one instance, but when sufficient data is available, the occurrence counts of the new node are changed to those of the most likely dormant state, if such exists. If some mild regularity conditions hold, and only the most recent /spl sigma/ states may repeat, both strategies are asymptotically optimal. In practice, the strategies vary in complexity and performance.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1 1","pages":"124-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75200359","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
Design of LDPC graphs for hardware implementation LDPC图形的硬件实现设计
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023755
J. Thorpe
{"title":"Design of LDPC graphs for hardware implementation","authors":"J. Thorpe","doi":"10.1109/ISIT.2002.1023755","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023755","url":null,"abstract":"A methodology for generating bipartite graphs for LDPC codes which both exhibit good performance under message passing decoding and are amenable to direct hardware implementation is described. To this end, we define a novel quantitative measure of the \"loopiness\" of a graph, as well as a quantitative measure of the cost of direct hardware implementation, and use the well-known simulated annealing algorithm to simultaneously minimize both quantities. Finally, we simulate the decoding of several rather short codes to show that the performance is indeed predicted by our loopiness measure.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"19 1","pages":"483-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75374073","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}
引用次数: 21
Parallel decoding for burst error control codes 突发错误控制码的并行解码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023701
E. Fujiwara, K. Namba, M. Kitakami
{"title":"Parallel decoding for burst error control codes","authors":"E. Fujiwara, K. Namba, M. Kitakami","doi":"10.1109/ISIT.2002.1023701","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023701","url":null,"abstract":"In some applications, such as in holographic memories, high-speed parallel decoding is strongly required for burst error correction and detection. From this viewpoint, this paper demonstrates a parallel decoding method for burst error control codes and presents the decoding circuit implemented by combinational circuits, not by LFSRs.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"12 4 1","pages":"429-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77896492","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}
引用次数: 14
Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(p/sup k/) whose characteristic polynomial is over GF(p) 任意符号上序列的线性复杂性及特征多项式为GF(p)的GF(p/sup k/)上序列的构造
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023740
Yun-Pyo Hong, Yu-Chang Eun, Jeong-Heon Kim, Hong‐Yeop Song
{"title":"Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(p/sup k/) whose characteristic polynomial is over GF(p)","authors":"Yun-Pyo Hong, Yu-Chang Eun, Jeong-Heon Kim, Hong‐Yeop Song","doi":"10.1109/ISIT.2002.1023740","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023740","url":null,"abstract":"We propose an appropriate approach of defining the linear complexity of sequences over an unknown symbol set. We are able to characterize those p-ary sequences whose k-tuple versions now over GF(p/sup k/) have the same characteristic polynomial as the original with respect to any basis. This leads to a construction of p/sup k/-ary sequences whose characteristic polynomial is essentially over GF(p).","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"118 1","pages":"468-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77930391","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
LDPC code design for MMSE turbo equalization MMSE turbo均衡的LDPC代码设计
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023687
K. Narayanan, Xiaodong Wang, G. Yue
{"title":"LDPC code design for MMSE turbo equalization","authors":"K. Narayanan, Xiaodong Wang, G. Yue","doi":"10.1109/ISIT.2002.1023687","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023687","url":null,"abstract":"The design of low density parity check (LDPC) codes with minimum mean squared error (MMSE) turbo equalization is considered. Techniques to compute the probability density function of the extrinsic information at the output of the equalizer and the decoder are discussed. Using these techniques, it is shown that thresholds can be computed for LDPC codes for intersymbol interference (ISI) channels and good LDPC code ensembles can be designed. The distinct features of this work include: (1) The input-output pdf of the equalizer is expressed in closed-form, and evaluated analytically - no simulation of the equalizer or the code is needed during the design process; (2) ISI channels with very long memory can be easily handled; (3) Codes for fading ISI channels can be designed without the need for extensive numerical computation.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"9 1","pages":"415-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73063750","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}
引用次数: 12
Identification of new classes of non-Shannon type constrained information inequalities and their relation to finite groups 一类新的非shannon型约束信息不等式及其与有限群的关系
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023508
I. Sason
{"title":"Identification of new classes of non-Shannon type constrained information inequalities and their relation to finite groups","authors":"I. Sason","doi":"10.1109/ISIT.2002.1023508","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023508","url":null,"abstract":"The existence of the so called non-Shannon type (NST) information inequalities stems from the fact that the basic inequalities which are based on the non-negativity of Shannon's information measures provide an incomplete characterization of the joint entropy function of n /spl ges/ 4 discrete random variables (DRVs). Based on a certain NST inequality which was derived by Zhang and Yeung (1998), we identify new classes of NST constrained information inequalities which grow double exponentially with n (n /spl ges/ 4), and generalize a previously reported result for n = 4. Relying on a fundamental relation between information theory and group theory which was devised by Chan and Yeung (see Proceedings 2000 IEEE International Symposium on Information Theory, p.492, Sorrento, Italy, June, 2000), we relate our discussion to finite groups.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"16 1","pages":"236-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75224989","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
A new reliability output algorithm 一种新的可靠性输出算法
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023613
M. Bossert, J. Freudenberger, B. Stender
{"title":"A new reliability output algorithm","authors":"M. Bossert, J. Freudenberger, B. Stender","doi":"10.1109/ISIT.2002.1023613","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023613","url":null,"abstract":"A non-recursive algorithm with low complexity is presented that permits a receiver to quantify the reliability of segments within an estimated code sequence. This reliability output may be used for example in repeat request schemes with partial retransmissions, for decoding concatenated code structures or in error concealment schemes.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"20 1","pages":"341-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75300688","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}
引用次数: 0
A note on the existence of optimal entropy-constrained vector quantizers 关于存在最优熵约束向量量化器的注解
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023309
A. Gyorgy, T. Linder
{"title":"A note on the existence of optimal entropy-constrained vector quantizers","authors":"A. Gyorgy, T. Linder","doi":"10.1109/ISIT.2002.1023309","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023309","url":null,"abstract":"Chou and Betts (1998) showed that for any source distribution with sufficiently light tails the optimal entropy-constrained vector quantizer (ECVQ) has a finite number of code points. This result addressed those optimal vector quantizers that achieve the lower convex hull of the operational distortion-rate function, i.e., quantizers Q that minimize the Lagrangian performance D(Q)+/spl lambda/H(Q) for some /spl lambda/>0, where D(Q) is the quantizer's expected distortion and H(Q) is its output entropy. This Lagrangian optimality criterion also matches the Lloyd-type algorithm used to optimize ECVQs, and corresponds to the fixed-slope approach in variable-rate lossy source coding. The existence of Lagrangian-optimal quantizers, however, was an open question. In this paper we show that optimal ECVQs minimizing the Lagrangian performance always exist under general conditions on the source and the distortion measure. A related result showing the existence of a mean-square optimal ECVQ in the class of regular ECVQs is also presented.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"1 1","pages":"37-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74403180","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}
引用次数: 1
Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions 具有不对称分布的大型字母源的快速自适应算术代码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023591
B. Ryabko, J. Rissanen
{"title":"Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions","authors":"B. Ryabko, J. Rissanen","doi":"10.1109/ISIT.2002.1023591","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023591","url":null,"abstract":"We address the problem of constructing an adaptive arithmetic code in the case where the source alphabet is large and there are lots of different symbols with equal counts of occurrence. For an alphabet of N symbols and r distinct symbol weights we describe a code for which the number of operations of encoding and decoding is equal to c log r + c/sub 1/ instead of c log N + c/sub 2/ as in previous arithmetic codes, c, c/sub 1/, c/sub 2/ are constants. When r is small relative to N - which is the case for most practical coding problems on large alphabets - the encoding and decoding speed of the suggested code will be substantially greater than with known methods.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"12 1","pages":"319-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74408792","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}
引用次数: 1
首页 上一页 下一页 尾页
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学术官方微信
小红书