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

2008 International Symposium on Information Theory and Its Applications最新文献

筛选
英文 中文
The algebraic structure of Mutually Unbiased Bases 互无偏基的代数结构
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895426
J. Hall, A. Rao
{"title":"The algebraic structure of Mutually Unbiased Bases","authors":"J. Hall, A. Rao","doi":"10.1109/ISITA.2008.4895426","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895426","url":null,"abstract":"Mutually unbiased bases (MUBs) are important in quantum information theory. While constructions of complete sets of d + 1 MUBs in Copfd are known when d is a prime power, it is unknown if such complete sets exist in non-prime power dimensions. It has been conjectured that sets of complete MUBs only exist in Copfd if a projective plane of size d also exists. We investigate the structure of MUBs using two algebraic tools: relation algebras and group rings. We construct two relation algebras from MUBs and compare these to relation algebras constructed from projective planes. We show several examples of complete sets of MUBs in Copfd, that when considered as elements of a group ring form a commutative monoid. We conjecture that complete sets of MUBs will always form a monoid if the appropriate group ring is chosen.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131612457","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
New construction of p-ary sequence family with large linear span 大线性跨度p元序列族的新构造
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895653
Young-Sik Kim, Jung-Soo Chung, Jong-Seon No
{"title":"New construction of p-ary sequence family with large linear span","authors":"Young-Sik Kim, Jung-Soo Chung, Jong-Seon No","doi":"10.1109/ISITA.2008.4895653","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895653","url":null,"abstract":"In this paper, we propose a method to construct sequence family S<sub>r</sub> = {tr<sub>1</sub> <sup>m</sup> ([tr<sub>m</sub> <sup>n</sup> (alpha<sup>t</sup>) + tr<sub>m</sub> <sup>n</sup> (balpha<sup>dt</sup>)]<sup>r</sup>) | b isin F<sub>p</sub> <sup>n</sup>, 0 les t < p<sup>n</sup> - 1} with large linear span from a sequence family S<sub>1</sub>, where gcd(r, p<sup>m</sup> - 1) = 1. Let T = (p<sup>n</sup> - 1)/(p<sup>m</sup> - 1). If dT = T mod p<sup>n</sup> - 1, the correlation distributions of families S<sub>r</sub> are the same. Two examples of decimation factor d satisfying the condition dT = T mod p<sup>n</sup> - 1 are given and the linear span of the ternary sequences in S<sub>r</sub> with d = 2p<sup>m</sup> - 1 is derived for some cases.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121198344","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
Collaborative communications using bit-Interleaved coded DPSK with cyclic delay diversity 具有循环延迟分集的位交织编码DPSK协同通信
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895375
Y. Nakao, K. Ishibashi, R. Kohno
{"title":"Collaborative communications using bit-Interleaved coded DPSK with cyclic delay diversity","authors":"Y. Nakao, K. Ishibashi, R. Kohno","doi":"10.1109/ISITA.2008.4895375","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895375","url":null,"abstract":"We propose a new scheme for collaborative (or cooperative) communications using bit-Interleaved coded differential PSK with cyclic delay diversity in orthogonal frequency-division multiplexing (OFDM). bit-interleaved coded DPSK with cyclic delay diversity in OFDM can cope with the increased frequency selectivity, and enable picking up the spatial diversity in frequency-selectivity channels with unknown delay spread, conditioned on the minimum free distance dfree of the convolutional codes. Therefore, we show that our proposed collaborative technique can obtain an arbitrary number of diversity to dfree by transforming the spatial diversity into frequency diversity. Beside this scheme does not need channel estimation and recognition of the number of collaborative nodes.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128481074","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 novel ad-hoc network routing protocol with an acceleration sensor 一种新的带加速度传感器的自组网路由协议
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895410
W. Uemura, Y. Kuga, M. Murata
{"title":"A novel ad-hoc network routing protocol with an acceleration sensor","authors":"W. Uemura, Y. Kuga, M. Murata","doi":"10.1109/ISITA.2008.4895410","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895410","url":null,"abstract":"On an ad-hoc network which is consisted of movable nodes, the network topology is dynamic because each node is adaptive. So we must maintain the routing table in order to send a packet. In proactive routing protocols, each node exchanges their routing information in order to maintain the routing tables. In this type of protocol, we can send a packet quickly, but a lot of control packets are needed. So the battery life is short. On the other hand, in reactive routing protocols, a node starts making the routing table after receiving a packet sending request. So this protocol takes a lot of seconds to send a packet. In this paper, we focus on the cause that changes the routing table. Because we should update the routing table only when the node moves, we propose a novel routing protocol which has the acceleration information from the sensor. And a node exchanges the routing table only if it moves. We apply it to the surveillance camera system at a parking lot.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"381 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115910233","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
Nonsystematic turbo codes: Design and bounds on effective free distance 非系统涡轮码:有效自由距离的设计与限制
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895621
F. Vatta, A. Graell i Amat, A. Banerjee, D. Costello
{"title":"Nonsystematic turbo codes: Design and bounds on effective free distance","authors":"F. Vatta, A. Graell i Amat, A. Banerjee, D. Costello","doi":"10.1109/ISITA.2008.4895621","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895621","url":null,"abstract":"In this paper, we address the design of turbo codes employing nonsystematic constituent encoders. Nonsystematic encoders have superior effective free distances compared to equivalent systematic encoders of the same complexity, and hence they are capable of achieving lower error floors. We derive bounds on the effective free distance of turbo codes employing nonsystematic constituent encoders and compare their distance and convergence properties with systematic turbo codes.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117065869","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
Improving ranging accuracy by two-step TOA estimation for UWB radio 利用两步TOA估计提高超宽带无线电测距精度
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895504
C. Fukao, M. Sasaki, K. Ohno, M. Itami
{"title":"Improving ranging accuracy by two-step TOA estimation for UWB radio","authors":"C. Fukao, M. Sasaki, K. Ohno, M. Itami","doi":"10.1109/ISITA.2008.4895504","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895504","url":null,"abstract":"This paper discusses a ranging technique of Ultra Wideband (UWB) system. The Energy Detection (ED) and Matched Filter (MF) are common techniques as UWB pulse detection methods in TOA (Time of Arrival) ranging system. The two-step TOA estimation is combined the ED and the MF. The two-step detection enables higher ranging accuracy than the ED with the simpler receiver structure than the MF. In this paper, the modified two-step estimation is investigated. A dual window and a sampling interval compensation technique are proposed in the ED and the MF, respectively. The performances of MAE (Mean Absolute Error) are improved in the IEEE802.15.4a system.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116765694","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
Crosscorrelation of m-sequences with decimation d = (pl + 1)/(pk + 1) 抽取d = (pl + 1)/(pk + 1)的m序列的相互关系
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895655
A. Johansen, T. Helleseth
{"title":"Crosscorrelation of m-sequences with decimation d = (pl + 1)/(pk + 1)","authors":"A. Johansen, T. Helleseth","doi":"10.1109/ISITA.2008.4895655","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895655","url":null,"abstract":"The crosscorrelation between two m-sequences of period pm - 1 that differ by a decimation d is a well studied problem. In 1970 Trachtenberg showed that for odd m the two decimations d = (p2k + 1)/2 and d = (p3k + 1)/(pk + 1) have three-valued crosscorrelation and their correlation distribution was determined. This result was extended by Helleseth to the case m/ gcd(m, k) odd and who noted that the long and complicated proof of Trachtenberg could be modified to this case. We present a more direct and self-contained short proof of Helleseth's generalization of Trachtenberg's result for the second case. Furthermore, we show that the decimation d = (p5k +1)/(pk +1) has at most five-valued crosscorrelation when m/ gcd(m, k) is odd.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115848598","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
Application of LCLP to lossy source coding LCLP在有损源编码中的应用
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895479
S. Miyake, J. Honda, H. Yamamoto
{"title":"Application of LCLP to lossy source coding","authors":"S. Miyake, J. Honda, H. Yamamoto","doi":"10.1109/ISITA.2008.4895479","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895479","url":null,"abstract":"Linear code linear programming (LCLP) proposed by Feldman is one of the promising methods to implement the lossy source coding process efficiently. In the encoding and decoding of a lossy source code constructed by sparse matrices, we propose auxiliary methods to obtain approximate optimal values in the case where the output of LCLP takes non-integer values. In a simulation, the proposed method attains smaller average distortions than the time-sharing bound.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126073742","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
Extension of Golay's two pair construction for general complex complementary sequences 一般复互补序列的Golay二对构造的推广
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895651
Ying Li, Yen-Wen Huang
{"title":"Extension of Golay's two pair construction for general complex complementary sequences","authors":"Ying Li, Yen-Wen Huang","doi":"10.1109/ISITA.2008.4895651","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895651","url":null,"abstract":"An extension of Golay's two pair recursive construction of biphase complementary sequences to general complex alphabets is proposed. There are no restrictions on the alphabets, structures and lengths of the two component complementary pairs. Golay complementary sequences of various QAM constellations can be obtained, including new QAM Golay sequences from non-standard QPSK Golay pairs. Three parameters in the construction allow for flexible zero insertions.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122032518","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}
引用次数: 6
Collaborative diversity enhancements using rate-compatible turbo codes 协同多样性增强使用速率兼容涡轮码
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895376
K. Ishibashi, K. Ishii, H. Ochiai
{"title":"Collaborative diversity enhancements using rate-compatible turbo codes","authors":"K. Ishibashi, K. Ishii, H. Ochiai","doi":"10.1109/ISITA.2008.4895376","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895376","url":null,"abstract":"The use of the spatial diversity is known to greatly improve the performance over the quasi-static wireless channel. In this paper, we propose a new coded cooperation protocol based on rate-compatible turbo codes. We consider the communication scenario to take place between clusters of nearby nodes with single antenna and demonstrate by a simple example that the diversity gain may be realized by using our proposed approach similar to the conventional approach based on traditional space-time codes. Moreover, our proposed approach requires only a simple modification of the metric calculation to realize the collaborative diversity.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128047362","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学术文献互助群
群 号：481959085
Book学术官方微信