Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895654
Jung-Soo Chung, Young-Sik Kim, Jong-Seon No, Habong Chung
In this paper, we enumerate the number of distinct autocorrelation distributions of M-ary Sidel'nikov sequences of given length, while we change the primitive element for generating the sequence.
本文列举了给定长度的m - y Sidel'nikov序列的不同自相关分布的个数，并改变了生成序列的原元。
{"title":"On the number of distinct autocorrelation distributions of M-ary Sidel'nikov sequences","authors":"Jung-Soo Chung, Young-Sik Kim, Jong-Seon No, Habong Chung","doi":"10.1109/ISITA.2008.4895654","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895654","url":null,"abstract":"In this paper, we enumerate the number of distinct autocorrelation distributions of M-ary Sidel'nikov sequences of given length, while we change the primitive element for generating the sequence.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"45 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":"123928971","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895541
X. Liang, Wei Li, T. Gulliver
Due to the fact that wireless sensor nodes are spatially distributed throughout the area of interest, event detection must be implemented in a distributed way. Unlike related distributed detection schemes, our proposed approach does not need a pre-designated fusion node. This greatly improves network scalability. In this paper, we provide closed-form expressions for the probability of detection error and probability of false alarm. These results are validated by extensive simulation.
{"title":"Random distributed detection for wireless sensor networks","authors":"X. Liang, Wei Li, T. Gulliver","doi":"10.1109/ISITA.2008.4895541","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895541","url":null,"abstract":"Due to the fact that wireless sensor nodes are spatially distributed throughout the area of interest, event detection must be implemented in a distributed way. Unlike related distributed detection schemes, our proposed approach does not need a pre-designated fusion node. This greatly improves network scalability. In this paper, we provide closed-form expressions for the probability of detection error and probability of false alarm. These results are validated by extensive simulation.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"43 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":"124142034","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895503
Jiliang Zhang, K. C. Teh, K. H. Li
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.
{"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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895616
Shunsuke Araki, Takeru Miyazaki, S. Uehara
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.
{"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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895581
N. Sharma, S. Shamai
The capacity-achieving input distribution for many channels like the additive white Gaussian noise (AWGN) channels under a peak power constraint is discrete with a finite number of mass points. The number of mass points is itself a variable and figuring it out is part of the optimization problem. We wish to understand the behavior of the optimal input distribution at the transition points where the number of mass points changes. We give a new set of necessary and sufficient conditions at the transition points, which offer new insights into the transition and make the computation of the optimal distribution easier. These conditions can be simplified, at least in the real channel case, by assuming the conjecture that the number of mass points increases monotonically and by at most one as the constraint on the input is relaxed. In particular, we show that for zero mean, unit variance Gaussian noise, the peak amplitude A of 1:671 and 2:786 mark the points where the binary and ternary signaling respectively are no longer optimal.
{"title":"Characterizing the discrete capacity achieving distribution with peak power constraint at the transition points","authors":"N. Sharma, S. Shamai","doi":"10.1109/ISITA.2008.4895581","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895581","url":null,"abstract":"The capacity-achieving input distribution for many channels like the additive white Gaussian noise (AWGN) channels under a peak power constraint is discrete with a finite number of mass points. The number of mass points is itself a variable and figuring it out is part of the optimization problem. We wish to understand the behavior of the optimal input distribution at the transition points where the number of mass points changes. We give a new set of necessary and sufficient conditions at the transition points, which offer new insights into the transition and make the computation of the optimal distribution easier. These conditions can be simplified, at least in the real channel case, by assuming the conjecture that the number of mass points increases monotonically and by at most one as the constraint on the input is relaxed. In particular, we show that for zero mean, unit variance Gaussian noise, the peak amplitude A of 1:671 and 2:786 mark the points where the binary and ternary signaling respectively are no longer optimal.","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":"129641946","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895625
Chin Keong Ho, K. Gowda, Sumei Sun
We introduce the multiple access relay channel with generalized feedback (MARC-GF), which is more general than the known MARC (without feedback) and MAC-GF (without relay). In the MARC-GF, two sources, assisted by a common relay, send independent messages to a destination. The sources and relay each receives some feedback that may facilitate this communication. We propose and analyze a decode-and-forward scheme for the MARC-GF to obtain an achievable rate region. This scheme facilitates cooperation between the two sources, in addition to cooperation by the relay, via block Markov superposition encoding.
{"title":"Achievable rates for multiple access relay channel with generalized feedback","authors":"Chin Keong Ho, K. Gowda, Sumei Sun","doi":"10.1109/ISITA.2008.4895625","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895625","url":null,"abstract":"We introduce the multiple access relay channel with generalized feedback (MARC-GF), which is more general than the known MARC (without feedback) and MAC-GF (without relay). In the MARC-GF, two sources, assisted by a common relay, send independent messages to a destination. The sources and relay each receives some feedback that may facilitate this communication. We propose and analyze a decode-and-forward scheme for the MARC-GF to obtain an achievable rate region. This scheme facilitates cooperation between the two sources, in addition to cooperation by the relay, via block Markov superposition encoding.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"179 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":"131300414","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895401
M. Kim, O. Miyagi, I. Garcia, K. Sakaguchi, K. Araki
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.
{"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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895583
S. Wahls, H. Boche
We consider equalization of multiple-input multiple-output (MIMO) two-tap channels under a causality constraint. Due to the work of Treil it is well known, that for causal equalizers of N + 1 times N channels the stability norm can grow exponentially fast with N, while it is upper bounded independently of N for the pseudoinverse. In this paper we give a illustrative example for a two-tap channel which exhibits this effect. Monte-Carlo simulations indicate, that this behavior is exemplary for two-tap channels with a strong second tap. Based on further simulations, we observe a rule of thumb on how much antenna diversity is necessary for causal equalization in the general N + K times N case.
{"title":"Impact of dimension on causal equalization of the MIMO two-tap channel","authors":"S. Wahls, H. Boche","doi":"10.1109/ISITA.2008.4895583","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895583","url":null,"abstract":"We consider equalization of multiple-input multiple-output (MIMO) two-tap channels under a causality constraint. Due to the work of Treil it is well known, that for causal equalizers of N + 1 times N channels the stability norm can grow exponentially fast with N, while it is upper bounded independently of N for the pseudoinverse. In this paper we give a illustrative example for a two-tap channel which exhibits this effect. Monte-Carlo simulations indicate, that this behavior is exemplary for two-tap channels with a strong second tap. Based on further simulations, we observe a rule of thumb on how much antenna diversity is necessary for causal equalization in the general N + K times N case.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"14 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":"116031338","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 : 2008-12-01DOI: 10.1109/ISITA.2008.4895568
Chia-Lung Wu, Po-Ning Chen, Y.S. Han, Shih-Wei Wang
Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers can now be further extended, and therefore facilitates their applications.
{"title":"A self-orthogonal code and its maximum-likelihood decoder for combined channel estimation and error protection","authors":"Chia-Lung Wu, Po-Ning Chen, Y.S. Han, Shih-Wei Wang","doi":"10.1109/ISITA.2008.4895568","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895568","url":null,"abstract":"Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers can now be further extended, and therefore facilitates their applications.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"33 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":"121269208","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}
We propose and evaluate new quantum secret sharing schemes (QSSS) for sharing a classical secret between two groups, group 1 and group 2. It is observed that the proposed scheme is secure against well-known attacks on QSSS, particularly attacks with single photons or EPR pairs.
{"title":"Quantum secret sharing between multiparty and multiparty against the attacks with single photons or EPR-pair","authors":"Atsushi Waseda, Takayuki Takagi, Masakazu Soshi, Atsuko Miyaji","doi":"10.1109/ISITA.2008.4895427","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895427","url":null,"abstract":"We propose and evaluate new quantum secret sharing schemes (QSSS) for sharing a classical secret between two groups, group 1 and group 2. It is observed that the proposed scheme is secure against well-known attacks on QSSS, particularly attacks with single photons or EPR pairs.","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":"122240209","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
扫码关注我们
求助内容：
应助结果提醒方式：