Pub Date : 2009-12-04DOI: 10.1109/IWSDA.2009.5346425
T. Helleseth
Let s(t) and s(dt) be two binary m-sequences of the same period 2m − 1 where gcd(d,2m − 1)=1 . The cross-correlation between these two m-sequences is defined to be where the summation is over a full period t = 0,1,…2m−2. The main problem is to find the distribution of the cross-correlation i.e., the values that occur and their multiplicity when τ ranges through 0,1…,2m − 2. The cross-correlation between m-sequences is a well studied problem during the last 40 years. A survey over known results as well as an overview of some interesting remaining open problems is presented. In particular new recent results are presented for the cross-correlation of sequences with decimations on the form d = (2k + 1)/2r + 1) using connections to Dickson polynomials and calculations of some special exponential sums.
{"title":"Cross-correlation of M-sequences, exponential sums and dickson polynomials","authors":"T. Helleseth","doi":"10.1109/IWSDA.2009.5346425","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346425","url":null,"abstract":"Let s(t) and s(dt) be two binary m-sequences of the same period 2<sup>m</sup> − 1 where gcd(d,2<sup>m</sup> − 1)=1 . The cross-correlation between these two m-sequences is defined to be where the summation is over a full period t = 0,1,…2<sup>m</sup>−2. The main problem is to find the distribution of the cross-correlation i.e., the values that occur and their multiplicity when τ ranges through 0,1…,2<sup>m</sup> − 2. The cross-correlation between m-sequences is a well studied problem during the last 40 years. A survey over known results as well as an overview of some interesting remaining open problems is presented. In particular new recent results are presented for the cross-correlation of sequences with decimations on the form d = (2<sup>k</sup> + 1)/2<sup>r</sup> + 1) using connections to Dickson polynomials and calculations of some special exponential sums.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127554629","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346426
Kai Liu, Chengqian Xu, K. T. Arasu
Based on the equivalent relationship between binary sequence pairs with two-level periodic autocorrelation function (BSPT) and difference set pairs (DSP), several families of BSPT including perfect binary sequence pairs are constructed by recursively constructing DSP on the integer ring.
{"title":"Construction of binary sequence pairs with two-level periodic autocorrelation function","authors":"Kai Liu, Chengqian Xu, K. T. Arasu","doi":"10.1109/IWSDA.2009.5346426","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346426","url":null,"abstract":"Based on the equivalent relationship between binary sequence pairs with two-level periodic autocorrelation function (BSPT) and difference set pairs (DSP), several families of BSPT including perfect binary sequence pairs are constructed by recursively constructing DSP on the integer ring.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126508295","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346421
Takeru Miyazaki, Shunsuke Araki, S. Uehara
We are interested in properties of the logistic maps with finite precision and theirs sequences. In this paper, we focus on a cyclic part, which we call a loop, in a sequence generated by the logistic map over integers successively, since the loop always exists in the sequence. We can observe loops in sequences generated by the logistic map with irrational numbers as initial values. We will show the relations between loops in sequences generated by the map over integers and real numbers. We will also show a correspondence between these loops by averages of squared differences.
{"title":"A study on relations between loops in sequences generated by the logistic map over integers and real numbers","authors":"Takeru Miyazaki, Shunsuke Araki, S. Uehara","doi":"10.1109/IWSDA.2009.5346421","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346421","url":null,"abstract":"We are interested in properties of the logistic maps with finite precision and theirs sequences. In this paper, we focus on a cyclic part, which we call a loop, in a sequence generated by the logistic map over integers successively, since the loop always exists in the sequence. We can observe loops in sequences generated by the logistic map with irrational numbers as initial values. We will show the relations between loops in sequences generated by the map over integers and real numbers. We will also show a correspondence between these loops by averages of squared differences.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127846279","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346423
Xianfu Lei, P. Fan, P. Mathiopoulos
We consider a dual-hop relay communication system with channel state information (CSI)-assisted amplify-and-forward (AF) relaying protocol. Assuming that the system operates in the presence of Nakagami-m fading, novel closed-form expressions for the exact average bit error rate (ABER) of BPSK signals and the ergodic capacity are derived. The proposed analysis is accompanied by numerical results, clearly demonstrating the usefulness of the theoretical approach.
{"title":"BER and ergodic capacity of dual-hop relay channel in Nakagami-m fading","authors":"Xianfu Lei, P. Fan, P. Mathiopoulos","doi":"10.1109/IWSDA.2009.5346423","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346423","url":null,"abstract":"We consider a dual-hop relay communication system with channel state information (CSI)-assisted amplify-and-forward (AF) relaying protocol. Assuming that the system operates in the presence of Nakagami-m fading, novel closed-form expressions for the exact average bit error rate (ABER) of BPSK signals and the ergodic capacity are derived. The proposed analysis is accompanied by numerical results, clearly demonstrating the usefulness of the theoretical approach.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130841504","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346417
Nigang Sun, Chang-lu Lin
A large family of p-phase highest coordinate sequences, where p is an odd prime, is constructed by using the highest coordinate of the generalized Kerdock codes over the ring ℤpl, for l ≥ 3. Utilizing the local Weil bound and spectral analysis over the additive group of ℤpl, we derive an estimate of the correlation of the sequences. And the result shows that these sequences have low nontrivial autocorrelation and crosscorrelation, which makes it possible as code sequences in CDMA communication systems.
{"title":"A large family of prime-phase sequences with low correlation","authors":"Nigang Sun, Chang-lu Lin","doi":"10.1109/IWSDA.2009.5346417","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346417","url":null,"abstract":"A large family of p-phase highest coordinate sequences, where p is an odd prime, is constructed by using the highest coordinate of the generalized Kerdock codes over the ring ℤpl, for l ≥ 3. Utilizing the local Weil bound and spectral analysis over the additive group of ℤpl, we derive an estimate of the correlation of the sequences. And the result shows that these sequences have low nontrivial autocorrelation and crosscorrelation, which makes it possible as code sequences in CDMA communication systems.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127949994","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346441
Muhammad Ahsan Ullah, H. Ogiwara
Bit error performance of a threshold decoder with feedback for self-orthogonal convolutional codes are analyzed. The difference triangle method is applied to determine the effect of feedback for consecutive decoded symbols. Instead of stochastic method proposed by Morrissey, the difference triangle method is faster, easier and implementable for any constraint length convolutional codes with large correcting capability. The analytical results show more closer estimation of error probability than that of Genie and definite decoder for same codes at high Eb/N0 region.
{"title":"Performance analysis of threshold decoder with feedback for self-orthogonal convolutional codes","authors":"Muhammad Ahsan Ullah, H. Ogiwara","doi":"10.1109/IWSDA.2009.5346441","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346441","url":null,"abstract":"Bit error performance of a threshold decoder with feedback for self-orthogonal convolutional codes are analyzed. The difference triangle method is applied to determine the effect of feedback for consecutive decoded symbols. Instead of stochastic method proposed by Morrissey, the difference triangle method is faster, easier and implementable for any constraint length convolutional codes with large correcting capability. The analytical results show more closer estimation of error probability than that of Genie and definite decoder for same codes at high Eb/N0 region.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122674109","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346437
Ryo Enomoto, H. Habuchi
This paper is described the properties of the pseudo-ternary M-sequence such as the periodic autocorrelation function, the balance properties, the preferred pairs and so on. This paper is also discussed the tracking performances of the Spread Spectrum (SS) systems with the delay locked loop (DLL) using the pseudo-ternary M-sequence. As a result, the tracking error performance can be improved by the pseudo-ternary M-sequence as compared with the performance of the system with the M-sequences.
{"title":"Properties of the pseudo-ternary M-sequences","authors":"Ryo Enomoto, H. Habuchi","doi":"10.1109/IWSDA.2009.5346437","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346437","url":null,"abstract":"This paper is described the properties of the pseudo-ternary M-sequence such as the periodic autocorrelation function, the balance properties, the preferred pairs and so on. This paper is also discussed the tracking performances of the Spread Spectrum (SS) systems with the delay locked loop (DLL) using the pseudo-ternary M-sequence. As a result, the tracking error performance can be improved by the pseudo-ternary M-sequence as compared with the performance of the system with the M-sequences.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654514","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346416
Yier Yan, Xueqin Jiang, M. Lee
The main problem to apply the non-binary low-density parity (LDPC) codes in multiple-input multiple-output (MIMO) channel with a high order Galois field is to compute the log likelihood ratios (LLRs) for each transmitted symbol. The complexity of computation of LLRs grows exponentially with the number of the order of the Galois field. In this paper, we combine the space-time block coding (STBC) decoder with the LDPC decoder together to achieve the full diversity in MIMO channels. In order to reduce the complexity of computation of LLRs, the multiuser concept is used in our design. Consequently, the complexity grows only linearly with the number of the order of the Galois field. The simulations show that the BER curve exits an accepted gap (0–1dB).
{"title":"A combined decoder for STBC and non-binary LDPC codes with spatial diversity","authors":"Yier Yan, Xueqin Jiang, M. Lee","doi":"10.1109/IWSDA.2009.5346416","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346416","url":null,"abstract":"The main problem to apply the non-binary low-density parity (LDPC) codes in multiple-input multiple-output (MIMO) channel with a high order Galois field is to compute the log likelihood ratios (LLRs) for each transmitted symbol. The complexity of computation of LLRs grows exponentially with the number of the order of the Galois field. In this paper, we combine the space-time block coding (STBC) decoder with the LDPC decoder together to achieve the full diversity in MIMO channels. In order to reduce the complexity of computation of LLRs, the multiuser concept is used in our design. Consequently, the complexity grows only linearly with the number of the order of the Galois field. The simulations show that the BER curve exits an accepted gap (0–1dB).","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116326297","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346411
M. Nakamura, H. Torii, Motoka Nagashima
The digital watermarking scheme is designed for high quality music by using the direct-sequence spread spectrum technique. Both the un-detection probability for the music with the watermark and the erroneous detection probability for the music without the watermark are examined. Excellent results are obtained, that is, both of the probabilities are less than 10−8. The quality of the music embedded by watermark is evaluated by the subjective opinion test. The quality deterioration is also little. It is shown that the spread spectrum scheme is attractive for the digital watermarking on high quality music.
{"title":"A study on digital watermarking scheme using direct-sequence spread spectrum for high quality music","authors":"M. Nakamura, H. Torii, Motoka Nagashima","doi":"10.1109/IWSDA.2009.5346411","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346411","url":null,"abstract":"The digital watermarking scheme is designed for high quality music by using the direct-sequence spread spectrum technique. Both the un-detection probability for the music with the watermark and the erroneous detection probability for the music without the watermark are examined. Excellent results are obtained, that is, both of the probabilities are less than 10−8. The quality of the music embedded by watermark is evaluated by the subjective opinion test. The quality deterioration is also little. It is shown that the spread spectrum scheme is attractive for the digital watermarking on high quality music.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125444646","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 : 2009-12-04DOI: 10.1109/IWSDA.2009.5346435
Ming Liu, M. Crussiére, J. Helard
The classical channel estimation method in TDS-OFDM is carried out based on the PN sequence in the GI which suffers from the intersymbol interference of the previous OFDM data symbols. This paper presents a novel data-aided channel estimation method to refine the initial channel estimation obtained from PN sequence. The data symbols are rebuilt based on the log-likelihood ratio (LLR) from the output of the demapper. The second channel estimation is made based on these data symbols. The moving average within the coherence bandwidth is performed on the second channel estimation to reduce noise. Finally, the initial and second channel estimations are combined according to the minimum mean square error (MMSE) criteria. The simulation results demonstrate that the proposed method can significantly improve the mean square error (MSE) performance of the initial channel estimator and the bit error rate (BER) performance of real TDS-OFDM based systems.
{"title":"A novel iterative data-aided channel estimation for time domain synchronous-OFDM","authors":"Ming Liu, M. Crussiére, J. Helard","doi":"10.1109/IWSDA.2009.5346435","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346435","url":null,"abstract":"The classical channel estimation method in TDS-OFDM is carried out based on the PN sequence in the GI which suffers from the intersymbol interference of the previous OFDM data symbols. This paper presents a novel data-aided channel estimation method to refine the initial channel estimation obtained from PN sequence. The data symbols are rebuilt based on the log-likelihood ratio (LLR) from the output of the demapper. The second channel estimation is made based on these data symbols. The moving average within the coherence bandwidth is performed on the second channel estimation to reduce noise. Finally, the initial and second channel estimations are combined according to the minimum mean square error (MMSE) criteria. The simulation results demonstrate that the proposed method can significantly improve the mean square error (MSE) performance of the initial channel estimator and the bit error rate (BER) performance of real TDS-OFDM based systems.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"614 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117081706","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
扫码关注我们
求助内容：
应助结果提醒方式：