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

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

筛选
英文 中文
The optimum approximation of signals having quite small side-lobes 副瓣很小的信号的最佳近似
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895626
Y. Kida, T. Kida
{"title":"The optimum approximation of signals having quite small side-lobes","authors":"Y. Kida, T. Kida","doi":"10.1109/ISITA.2008.4895626","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895626","url":null,"abstract":"We consider set of signals with a main-lobe and a pair of small side-lobes. Weighted square-integral of the main-lobe is assumed to be bounded. Moreover, in order to define divergence of side-lobes of error in the sense of worst-case amplitude in attenuation band, we introduce a measure like Kullback-Leibler divergence and this measure is assumed to be bounded. We prove that the presented approximation minimizes various measures of error of running approximation at the same time.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"5 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":"131075511","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
Bursty narrowband relay networks in the low-SNR regime 低信噪比条件下的突发窄带中继网络
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895549
Tony Q. S. Quek, Hyundong Shin
{"title":"Bursty narrowband relay networks in the low-SNR regime","authors":"Tony Q. S. Quek, Hyundong Shin","doi":"10.1109/ISITA.2008.4895549","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895549","url":null,"abstract":"In a wireless network, the use of cooperation among nodes can significantly improve capacity and robustness to fading. Node cooperation can take many forms, including relaying and coordinated beamforming. However, many cooperation techniques have been developed for operation in narrowband systems for high signal-to-noise ratio (SNR) applications. It is important to study how relay networks perform in a low-SNR regime, where the available degrees of freedom is large and the resulting SNR per degree of freedom is small. In this paper, we investigate the achievable rates and scaling laws of bursty amplify-and-forward relay networks in the low-SNR regime. Specifically, our results allow us to understand the effect of different system parameters on the achievable rates and scaling laws in the low-SNR regime, and highlight the role of bursty transmissions in this regime. These results entirely depend on the geographic locations of the nodes and are applicable for both fixed and random networks. We identify four scaling regimes that depend on the growth of the number of relay nodes and the increase of burstiness relative to the SNR.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"13 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":"130435322","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
A study on occurrence rates per bit for the logistic map over integers 整数逻辑映射每比特出现率的研究
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895616
Shunsuke Araki, Takeru Miyazaki, S. Uehara
{"title":"A study on occurrence rates per bit for the logistic map over integers","authors":"Shunsuke Araki, Takeru Miyazaki, S. Uehara","doi":"10.1109/ISITA.2008.4895616","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895616","url":null,"abstract":"We are investigating the logistic map over integers with finite precisions and sequences out-putted by the iterative mapping. In our proposed simple pseudo-random number generator with the logistic map over integers, we implicitly assumed that 0 and 1 occurrence frequencies per bit of outputs by the map are nearly equal. By some numerical experiments, we got the conjecture that occurrence rates per bit are nearly equal for many bits of 2n-bit values in the intermediate step of the map by one iteration and many iterations.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"1 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":"130275924","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}
引用次数: 11
Suppression of partial-band-noise jamming for FFH/MFSK systems over frequency-selective Rician-fading channels 频率选择性衰落信道上FFH/MFSK系统部分带噪声干扰的抑制
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895503
Jiliang Zhang, K. C. Teh, K. H. Li
{"title":"Suppression of partial-band-noise jamming for FFH/MFSK systems over frequency-selective Rician-fading channels","authors":"Jiliang Zhang, K. C. Teh, K. H. Li","doi":"10.1109/ISITA.2008.4895503","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895503","url":null,"abstract":"The effects of partial-band-noise jamming and additive white Gaussian noise on the bit-error rate (BER) performance of fast frequency-hopped M-ary frequency-shift-keying (FFH/MFSK) systems over frequency-selective Rician-fading channels are studied. The FFH/MFSK systems employing the linear-combining receiver and the product-combining receiver are investigated. The analytical BER expressions are derived based on characteristic function approach, which is applicable for higher diversity levels. The analytical expressions, validated by simulation results, show that the product-combining receiver is superior to the linear-combining receiver when the jamming power is relatively strong.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"30 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":"125096993","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
Effect of ranging error on Base Station Cooperation OFDM system 测距误差对基站合作OFDM系统的影响
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895401
M. Kim, O. Miyagi, I. Garcia, K. Sakaguchi, K. Araki
{"title":"Effect of ranging error on Base Station Cooperation OFDM system","authors":"M. Kim, O. Miyagi, I. Garcia, K. Sakaguchi, K. Araki","doi":"10.1109/ISITA.2008.4895401","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895401","url":null,"abstract":"Base Station Cooperation Transmission of OFDM symbols (BSC-OFDM) is a promising approach to increase cell-edge capacity. The effect of Ranging Error on BSC-OFDM is investigated in this paper. Timing offset greater than 1 OFDM symbol in analytically duration creates asynchronous interference. Results show that a single ranging code transmitted by a mobile station provides greater capacity over a scheme with a separate orthogonal ranging code for each base station.","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":"125607006","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
Beamforming design for the MIMO downlink for maximizing Weighted Sum-Rate 最大化加权和速率的MIMO下行波束成形设计
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895555
R. Agarwal, J. Cioffi
{"title":"Beamforming design for the MIMO downlink for maximizing Weighted Sum-Rate","authors":"R. Agarwal, J. Cioffi","doi":"10.1109/ISITA.2008.4895555","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895555","url":null,"abstract":"This work studies linear transmit filter design for weighted sum-rate (WSR) maximization in the multiple input multiple output broadcast channel (MIMO-BC). The problem of finding the optimal transmit filter is non-convex and intractable to solve. Motivated by the iterative algorithm that solves for the optimal transmit and receive filters for minimizing sum-mean square error (MSE), this paper suggests to use weighted minimum mean square error (WMMSE) optimization in the MIMO-BC. The paper presents an iterative algorithm to maximize WSR. Numerical results for sum-rate using the derived filter are provided under different system settings.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"56 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":"125974282","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}
引用次数: 8
Lossy source coding algorithm using lossless multi-terminal source codes 有损源编码算法采用无损多终端源代码
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895482
J. Muramatsu, S. Miyake
{"title":"Lossy source coding algorithm using lossless multi-terminal source codes","authors":"J. Muramatsu, S. Miyake","doi":"10.1109/ISITA.2008.4895482","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895482","url":null,"abstract":"A lossy source coding algorithm is presented that employs lossless multi-terminal source codes. By using nearly optimal lossless multi-terminal source codes, the proposed algorithm achieves the rate-distortion limit. The construction of lossless multi-terminal source codes, which are needed for the lossy source coding algorithm, can be realized by using sparse matrices, known as Low Density Parity Check (LDPC) matrices, or Turbo codes, and practically efficient decoding algorithms such as the Belief Propagation (BP) algorithm and the Linear Codes Linear Program (LCLP) algorithm.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"42 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":"127152112","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
On security enhancement of long-term private key for the tripartite authenticated key agreement protocol 三方认证密钥协议中长期私钥的安全性增强
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895437
M. Nomura, K. Nakamura
{"title":"On security enhancement of long-term private key for the tripartite authenticated key agreement protocol","authors":"M. Nomura, K. Nakamura","doi":"10.1109/ISITA.2008.4895437","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895437","url":null,"abstract":"In this paper, we propose a scheme that enhances the security of long-term private key l<sub>ID</sub> used in the tripartite authenticated key agreement protocol. In this scheme, we use (H(l<sub>ID</sub>Pmacr)l<sub>ID</sub>)P (H: hash function) instead of l<sub>ID</sub>P (P: a rational point of the defined elliptic curve over F<sub>p</sub>) as a static public key and tau<sub>ID1</sub>, tau<sub>ID2</sub> as two ephemeral private keys. From this, even though the bit length of p (p's security parameter) is more lessened, we can preserve equal security to conventional schemes in respect of the secrecy of the long-term private key.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"32 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":"114487168","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
Rate adaptive modulation with MIMO mode switching between spatial multiplexing and diversity 在空间复用和分集之间进行MIMO模式切换的速率自适应调制
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895551
Chanhong Kim, Jungwoo Lee
{"title":"Rate adaptive modulation with MIMO mode switching between spatial multiplexing and diversity","authors":"Chanhong Kim, Jungwoo Lee","doi":"10.1109/ISITA.2008.4895551","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895551","url":null,"abstract":"Multiple-input multiple-output (MIMO) systems give high data rates through spatial multiplexing or diversity using space-time codes. We propose a rate-adaptive modulation scheme combined with mode switching between spatial multiplexing and orthogonal space-time block coding. We first find out which modulation level and mode maximize the spectral efficiency with a given target bit error ratio (BER). If the rates of the two MIMO modes are the same, we select one mode which gives lower BER than the other. We also propose a simple mode switching algorithm using effective SNR and constellation specific constant. Numerical results demonstrate improvement over each fixed mode with adaptive modulation in terms of average spectral efficiency.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"32 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":"121037700","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
Deniable ring authenticated private key establishment 可否认环认证私钥建立
2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI: 10.1109/ISITA.2008.4895467
E.T. Taniguchi, H. Yamamoto
{"title":"Deniable ring authenticated private key establishment","authors":"E.T. Taniguchi, H. Yamamoto","doi":"10.1109/ISITA.2008.4895467","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895467","url":null,"abstract":"In this paper, we extend the work by M. Naor [7] on deniable ring authentication to include key establishment. Two secure deniable private key establishment protocols will be proposed. These two related schemes create only a secure private channel between Alice and Bob where the identity of Bob remains completely hidden. The first scheme does not require Alice to been within the user set S and in fact does not even require Alice to have a public-private key pair. The second scheme requires that Alice choose a user set S such that she is also within set S. This scheme also indirectly requires that Alice have a public-private key pair. Similar to the deniable ring authentication protocol by Naor, the protocols proposed here only assumes the existence of strong public key encryption schemes where all members have already established public and private keys. Finally, the problem of ciphertext search and ciphertext ambiguity will also be examined and a solution will be proposed.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"EM-28 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":"126525741","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
首页 上一页 下一页 尾页
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学术官方微信