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

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)最新文献

筛选
英文 中文
Signal codes 信号编码
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2008-06-29 DOI: 10.1109/ITW.2003.1216761
O. Shalvi, N. Sommer, M. Feder
{"title":"Signal codes","authors":"O. Shalvi, N. Sommer, M. Feder","doi":"10.1109/ITW.2003.1216761","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216761","url":null,"abstract":"Motivated by signal processing, we present a new class of channel codes, called signal codes, for continuous-alphabet channels. We analyze the codes and provide simulation results indicating that these codes can be practical and are an attractive alternative to trellis-code techniques.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114981437","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}
引用次数: 17
A multiple power analysis breaks the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks 多重功率分析打破了随机加减链对抗侧信道攻击的高级版本
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216723
K. Okeya, K. Sakurai
{"title":"A multiple power analysis breaks the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks","authors":"K. Okeya, K. Sakurai","doi":"10.1109/ITW.2003.1216723","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216723","url":null,"abstract":"We show that the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks is vulnerable to a multiple power analysis attack, a new kind of side channel attack, under distinguishability between addition and doubling. The side channel attack takes advantage of information leaked during execution of a cryptographic procedure. The randomized addition-subtraction chains countermeasure was proposed by E. Oswald and M. Aigner (see Lect. Notes in Comp. Sci., vol.2162, p.39-50, 2001), and is based on a random decision inserted into computations. The countermeasure has two versions; the basic version and the advanced version. The basic version has been proved to be vulnerable to a side channel attack. This is due to a shrinkage of states for randomization if a bit of the secret scalar is zero. However, the advanced version does not have such a shrinkage. The multiple power analysis uses plural AD sequences, which are sequences of additions and doublings, and obtained by the distinguishability and measurements. The multiple power analysis relates the AD sequences to each other, and deduces the secret scalar. A point of the multiple power analysis against the advanced version is that two different states are combined, and regarded as the same state. This provides a shrinkage of states if a bit of the secret scalar is zero.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122479616","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
Codes, lattices and modular forms 代码，格和模形式
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216743
Y. Choie, S. Dougherty
{"title":"Codes, lattices and modular forms","authors":"Y. Choie, S. Dougherty","doi":"10.1109/ITW.2003.1216743","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216743","url":null,"abstract":"We describe various constructions of unimodular lattices from codes over finite rings and modular forms constructed from those lattices.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129542907","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
An algorithm for cycle and add property of m-sequence m序列的循环和相加性质的一种算法
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216709
F. Zeng, L. Ge
{"title":"An algorithm for cycle and add property of m-sequence","authors":"F. Zeng, L. Ge","doi":"10.1109/ITW.2003.1216709","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216709","url":null,"abstract":"The cycle and add properties (CAP) of m-sequences are discussed. For given integers /spl tau/ and /spl eta/, a method which decides /spl lambda/ to satisfy the CAP {a/sub k+/spl eta//}+{a/sub k+/spl tau//}={a/sub k+/spl lambda//} is proposed; the acquisition of the CAP of an m-sequence, {a/sub k/}, only depends on the reciprocal polynomial of the primitive polynomial which produces the m-sequence and the cyclotomic cosets mod p/sup n/-1.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128607053","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
Optimised constructions for variable-length error correcting codes 变长纠错码的优化结构
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216725
C. Lamy, Johann Paccaut
{"title":"Optimised constructions for variable-length error correcting codes","authors":"C. Lamy, Johann Paccaut","doi":"10.1109/ITW.2003.1216725","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216725","url":null,"abstract":"An optimised construction of variable-length error-correcting (VLEC) codes is proposed. Compared to the state-of-the-art, the three main improvements consist in: (1) improving the codewords search algorithm complexity/efficiency trade-off; (2) loosening the codewords deletion rule; (3) taking advantage of eventual previous searches. It is shown that the optimised algorithm can find good VLEC codes for alphabets of up to 200 symbols, and outperforms existing algorithms.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131462315","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
Wheel codes: turbo-like codes on graphs of small order 轮代码:小阶图上的类似涡轮的代码
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216699
Carey Radebaugh, R. Koetter, Clint Powell
{"title":"Wheel codes: turbo-like codes on graphs of small order","authors":"Carey Radebaugh, R. Koetter, Clint Powell","doi":"10.1109/ITW.2003.1216699","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216699","url":null,"abstract":"We investigate a specific class of codes on graphs called wheel codes, where the underlying graph of a wheel code is constructed by the wheel construction. Wheel codes were first introduced by N. Wiberg (\"Codes and Decoding on General Graphs\", PhD thesis, U. Linkping, Sweden, 1996). They are very similar to turbo codes except that the interleaver has more structure, which allows for a simpler implementation of the encoder and decoder. Wheel codes also allow for no loss of rate due to termination of the involved trellis codes, which is especially beneficial for codes of short lengths. We provide a more thorough discussion of the wheel construction itself and the codes that result. A sliding-window decoder for the wheel codes is also discussed and decoding performance charts are presented.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130267320","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}
引用次数: 7
Performance analysis of MAP decoded space-time orthogonal block codes for non-uniform sources 非均匀源下MAP解码空时正交分组码的性能分析
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216691
F. Behnamfar, F. Alajaji, T. Linder
{"title":"Performance analysis of MAP decoded space-time orthogonal block codes for non-uniform sources","authors":"F. Behnamfar, F. Alajaji, T. Linder","doi":"10.1109/ITW.2003.1216691","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216691","url":null,"abstract":"We derive a closed-form expression for the exact pairwise error probability (PEP) of a non-uniform memoryless binary source transmitted over a Rayleigh fading channel using space-time orthogonal block codes and maximum a posteriori (MAP) detection. The expression is easy to evaluate and holds for any signaling scheme. We then use this result to minimize the bit error rate of the binary antipodal signaling scheme. Numerical results for the case of binary antipodal signaling (BPSK and optimal) verify the accuracy of our formula and quantify substantial gains of MAP decoding over maximum likelihood (ML) decoding for sources with strong non-uniformity.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131227852","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
The turbo principle in joint source-channel coding 联合信源信道编码中的turbo原理
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216747
J. Hagenauer, N. Goertz
{"title":"The turbo principle in joint source-channel coding","authors":"J. Hagenauer, N. Goertz","doi":"10.1109/ITW.2003.1216747","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216747","url":null,"abstract":"The turbo principle (iterative decoding between component decoders) is a general scheme, which we apply to joint source-channel decoding. As a realistic example (e.g., speech parameter coding), we discuss joint source-channel decoding for auto-correlated continuous-amplitude source samples. At the transmitter, the source samples are quantized and their indexes are appropriately mapped onto bitvectors. Afterwards, the bits are interleaved and channel-encoded; an AWGN channel is assumed for transmission. The auto-correlations of the source samples act as implicit outer channel codes that are serially concatenated with the inner explicit channel code. Thus, by applying the turbo principle, we can perform iterative decoding at the receiver. As an example, we show that, with a proper bit mapping for a 5-bit quantizer, iterative source-channel decoding saves up to 2 dB in channel SNR or 8 dB in source SNR for an auto-correlated Gaussian source.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124377550","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
On MIMO capacity for various types of partial channel knowledge at the transmitter 关于MIMO容量的各种类型的部分信道知识在发射机
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216704
A. Medles, S. Visuri, D. Slock
{"title":"On MIMO capacity for various types of partial channel knowledge at the transmitter","authors":"A. Medles, S. Visuri, D. Slock","doi":"10.1109/ITW.2003.1216704","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216704","url":null,"abstract":"For a transmitter that has a perfect knowledge of the MIMO channel, the maximum achievable capacity corresponds to the waterfilling solution. In practice, the available knowledge may only be partial due to the time selectivity of the channel, and the delay or absence of feedback from the receiver. However, exploiting the partial knowledge leads to a significant improvement when compared to the capacity without any channel knowledge. We analyze the MIMO capacity with various types of partial knowledge of the channel under practical frequency flat channel models.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114895143","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
Performance and complexity of CDMA iterative multiuser detection CDMA迭代多用户检测的性能和复杂度
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) Pub Date : 2003-08-04 DOI: 10.1109/ITW.2003.1216707
C. Schlegel, Zhenning Shi
{"title":"Performance and complexity of CDMA iterative multiuser detection","authors":"C. Schlegel, Zhenning Shi","doi":"10.1109/ITW.2003.1216707","DOIUrl":"https://doi.org/10.1109/ITW.2003.1216707","url":null,"abstract":"Low complexity multistage filters are inserted into the soft-information exchange paths of an iterative joint detector for error control coded CDMA signals. It is shown that these filters approach the performance of the optimal, but complex, per-user minimum-mean square error filter with a few stages. A variance transfer analysis is presented to quantify the performance of this method and to study the case of unequal received power distributions.","PeriodicalId":363490,"journal":{"name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115039764","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}
引用次数: 7
下一页 尾页
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学术官方微信