Pub Date : 2015-09-01DOI: 10.1109/IWSDA.2015.7458397
Kamal M. Captain, M. Joshi
In this paper, we study the performance of the wideband spectrum sensing for cognitive radio network under different fading channels. We compare the performance of wideband spectrum sensing where each channel in the band undergoes fading with that of additive white Gaussian noise channel. We used probability of excessive interference opportunity and probability of insufficient spectrum opportunity as the performance measure. Partial band Nyquist sampling is considered as the wideband sampling scheme throughout the paper. The effect of different parameters on the performance of the system is analyzed.
{"title":"Performance of wideband spectrum sensing under fading channel","authors":"Kamal M. Captain, M. Joshi","doi":"10.1109/IWSDA.2015.7458397","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458397","url":null,"abstract":"In this paper, we study the performance of the wideband spectrum sensing for cognitive radio network under different fading channels. We compare the performance of wideband spectrum sensing where each channel in the band undergoes fading with that of additive white Gaussian noise channel. We used probability of excessive interference opportunity and probability of insufficient spectrum opportunity as the performance measure. Partial band Nyquist sampling is considered as the wideband sampling scheme throughout the paper. The effect of different parameters on the performance of the system is analyzed.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127956051","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458404
Sho Kuroda, S. Matsufuji, Y. Ida, Takahiro Matsumoto
A quasi-synchronous CDMA scheme using a spreading code with a zero correlation zone called ZCZ code and a block coding technique with the Rake receiver with the pilot-symbol-aided channel estimation, which is called BC-ZCZ-CDMA, can almost remove the multiple access interference (MAI) and inter symbol interference (ISI) over multipass Rayleigh fading channel. In large delay spread with high-speed real-time transmission, it is necessary to increase the block size K in order to remove MAI and ISI. However the calculation of the inverse matrix in the Rake receiver lakes time of the cube order of the block size corresponding to the number of data symbols transmitted in one bundle, i.e., O(K3). This paper discusses BC-ZCZ-CDMA that LZCZ sequences is assigned to a user, and investigates the bit error rate performance over a mullipath Rayleigh fading channel. As final results, the number of users decreases, but the calculation time becomes O((K/L)3). Furthermore a pilot signal can be designed effectively, and the overall system will be simplified.
{"title":"On a block coding ZCZ-CDMA scheme with high-speed processing","authors":"Sho Kuroda, S. Matsufuji, Y. Ida, Takahiro Matsumoto","doi":"10.1109/IWSDA.2015.7458404","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458404","url":null,"abstract":"A quasi-synchronous CDMA scheme using a spreading code with a zero correlation zone called ZCZ code and a block coding technique with the Rake receiver with the pilot-symbol-aided channel estimation, which is called BC-ZCZ-CDMA, can almost remove the multiple access interference (MAI) and inter symbol interference (ISI) over multipass Rayleigh fading channel. In large delay spread with high-speed real-time transmission, it is necessary to increase the block size K in order to remove MAI and ISI. However the calculation of the inverse matrix in the Rake receiver lakes time of the cube order of the block size corresponding to the number of data symbols transmitted in one bundle, i.e., O(K3). This paper discusses BC-ZCZ-CDMA that LZCZ sequences is assigned to a user, and investigates the bit error rate performance over a mullipath Rayleigh fading channel. As final results, the number of users decreases, but the calculation time becomes O((K/L)3). Furthermore a pilot signal can be designed effectively, and the overall system will be simplified.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"3 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134505970","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458381
Domingo Gómez-Pérez, Ana-Isabel Gómez, J. Gutierrez, O. Moreno
Multidimensional arrays have proven to be useful in watermarking, therefore interest in this subject has increased in the previous years along with the number of publications. For one dimensional arrays (sequences), linear complexity is regarded as standard measure of complexity. Although linear complexity of sequences has been widely studied, only recently, we have extended it to the study of multidimensional arrays. In this paper, we show that the concept of multidimensional linear complexity is a powerful tool, by examining the results for selected constructs. We have obtained the linear complexity of logartihmic Moreno-Tirkel arrays and we show that they show high multidimensional linear complexity. Finally, we explicitly provide the minimal generators for quadratic Moreno-Tirkel arrays. The results show that these techniques are effective in finding the multidimensional linear complexity of the constructions, representing only a small fraction of the applicability of multidimensional linear complexity. The study of multidimensional arrays provides new ways to understand sequences and set the basis for forthcoming proof of the three years old conjectures related with CDMA sequences.
{"title":"Multidimensional arrays with maximal linear complexity","authors":"Domingo Gómez-Pérez, Ana-Isabel Gómez, J. Gutierrez, O. Moreno","doi":"10.1109/IWSDA.2015.7458381","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458381","url":null,"abstract":"Multidimensional arrays have proven to be useful in watermarking, therefore interest in this subject has increased in the previous years along with the number of publications. For one dimensional arrays (sequences), linear complexity is regarded as standard measure of complexity. Although linear complexity of sequences has been widely studied, only recently, we have extended it to the study of multidimensional arrays. In this paper, we show that the concept of multidimensional linear complexity is a powerful tool, by examining the results for selected constructs. We have obtained the linear complexity of logartihmic Moreno-Tirkel arrays and we show that they show high multidimensional linear complexity. Finally, we explicitly provide the minimal generators for quadratic Moreno-Tirkel arrays. The results show that these techniques are effective in finding the multidimensional linear complexity of the constructions, representing only a small fraction of the applicability of multidimensional linear complexity. The study of multidimensional arrays provides new ways to understand sequences and set the basis for forthcoming proof of the three years old conjectures related with CDMA sequences.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"98 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131439111","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458416
Su Wang, Lingye Wang, Jinhua Wang
In this paper, we give a direct construction for g-regular cyclic difference packings CDP(6, 1; gp)'s by utilizing Weil's theorem on character sum estimates over GF(p) with prime congruent to 7 modulo 12 and greater than 7, where g = 15, 20. As its application, we obtain a new class of optimal (gv, 6, 1) optical orthogonal codes with v a product of primes congruent to 7 modulo 12 and greater than 7 and g = 15, 20, 105, 140.
{"title":"A new class of optimal optical orthogonal codes with weight six","authors":"Su Wang, Lingye Wang, Jinhua Wang","doi":"10.1109/IWSDA.2015.7458416","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458416","url":null,"abstract":"In this paper, we give a direct construction for g-regular cyclic difference packings CDP(6, 1; gp)'s by utilizing Weil's theorem on character sum estimates over GF(p) with prime congruent to 7 modulo 12 and greater than 7, where g = 15, 20. As its application, we obtain a new class of optimal (gv, 6, 1) optical orthogonal codes with v a product of primes congruent to 7 modulo 12 and greater than 7 and g = 15, 20, 105, 140.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114303954","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458380
Meng-Chun Wu, Takafumi Hayashi
Peak to average power ratio (PAPR) is the major problem in wireless transmission system. Partial transmit sequences (PTS) is one of effective method to reduce PAPR. PTS divides the input data into sub-blocks, and each of sub-blocks are multiply by phase factor to generate numerous candidate sequences. Then choose one of candidate sequence with minimum PAPR to transmission. However, PTS suffer from high computational complexity when increases with number of sub-blocks. Single carrier frequency division multiplexing access (SC-FDMA) has provided lower PAPR compare with orthogonal frequency division multiplexing (OFDM), and has been choose for uplink system in long term evolution (LTE) technology. We proposed a combination based on particle swarm optimization (PSO) to decrease the computational complexity.
{"title":"An optimal partial transmit sequence combination method for peak-to-average power ratio reduction in SC-FDMA system","authors":"Meng-Chun Wu, Takafumi Hayashi","doi":"10.1109/IWSDA.2015.7458380","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458380","url":null,"abstract":"Peak to average power ratio (PAPR) is the major problem in wireless transmission system. Partial transmit sequences (PTS) is one of effective method to reduce PAPR. PTS divides the input data into sub-blocks, and each of sub-blocks are multiply by phase factor to generate numerous candidate sequences. Then choose one of candidate sequence with minimum PAPR to transmission. However, PTS suffer from high computational complexity when increases with number of sub-blocks. Single carrier frequency division multiplexing access (SC-FDMA) has provided lower PAPR compare with orthogonal frequency division multiplexing (OFDM), and has been choose for uplink system in long term evolution (LTE) technology. We proposed a combination based on particle swarm optimization (PSO) to decrease the computational complexity.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123693015","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458398
S. Ghorpade, Fernando L. Piñero
We explicitly determine an information set for the affine Grassmann codes of an arbitrary level and then use it to describe a systematic encoder for these codes. In the case of affine Grassmann codes of full level, we use our explicit information set together with some known results concerning duals of affine Grassmann codes to describe an iterative encoding algorithm and also show that permutation decoding is possible up to a reasonable bound.
{"title":"Information set and iterative encoding for Affine Grassmann codes","authors":"S. Ghorpade, Fernando L. Piñero","doi":"10.1109/IWSDA.2015.7458398","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458398","url":null,"abstract":"We explicitly determine an information set for the affine Grassmann codes of an arbitrary level and then use it to describe a systematic encoder for these codes. In the case of affine Grassmann codes of full level, we use our explicit information set together with some known results concerning duals of affine Grassmann codes to describe an iterative encoding algorithm and also show that permutation decoding is possible up to a reasonable bound.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114659076","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458412
A. Leukhin, A. Tirkel
Ensembles of periodic binary sequences with low off-peak autocorrelation and cross-correlation are highly valued and difficult to find. The small Kasami, Kamaletdinov 1&2, and Rational Cycle are versatile, because they can be converted into Costas-like arrays for frequency/time hopping. We present a unified construction of such ensembles using linear feedback shift registers.
{"title":"Ensembles of sequences and arrays","authors":"A. Leukhin, A. Tirkel","doi":"10.1109/IWSDA.2015.7458412","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458412","url":null,"abstract":"Ensembles of periodic binary sequences with low off-peak autocorrelation and cross-correlation are highly valued and difficult to find. The small Kasami, Kamaletdinov 1&2, and Rational Cycle are versatile, because they can be converted into Costas-like arrays for frequency/time hopping. We present a unified construction of such ensembles using linear feedback shift registers.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115089175","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458408
S. Pawar, Venkatesan N. Ekambaram, K. Ramchandran
We consider the problem of interpolating a high-degree sparse polynomial, where the sparsity is in the number of monomial terms with non-zero coefficients. We propose a probabilistic algorithm that requires only O(k) evaluations of a polynomial with complex coefficients, on the unit circle at specified points and has a complexity O(k log k), where k is the sparsity of the polynomial. Thus the evaluation complexity as well as the computational complexity are independent of the maximum degree n in contrast to existing algorithms in the literature. We extend our algorithm to polynomials defined over the finite field using fast algorithms in the literature to compute discrete logs for certain field sizes.
{"title":"Computationally-efficient sparse polynomial interpolation","authors":"S. Pawar, Venkatesan N. Ekambaram, K. Ramchandran","doi":"10.1109/IWSDA.2015.7458408","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458408","url":null,"abstract":"We consider the problem of interpolating a high-degree sparse polynomial, where the sparsity is in the number of monomial terms with non-zero coefficients. We propose a probabilistic algorithm that requires only O(k) evaluations of a polynomial with complex coefficients, on the unit circle at specified points and has a complexity O(k log k), where k is the sparsity of the polynomial. Thus the evaluation complexity as well as the computational complexity are independent of the maximum degree n in contrast to existing algorithms in the literature. We extend our algorithm to polynomials defined over the finite field using fast algorithms in the literature to compute discrete logs for certain field sizes.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129103475","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458390
V. E. Gantmakher, M. V. Zaleshin
A new family of multiphase sequences with quasi-orthogonal periodic autocorrelation function is proposed. The distinctive features of this family compared to the known sequences are: small absolute minimax side lobe values of PACF equal to one; period's grid; the number of phases which is a modifiable parameter.
{"title":"Quasi-orthogonal multiphase sequences based on Legendre symbols","authors":"V. E. Gantmakher, M. V. Zaleshin","doi":"10.1109/IWSDA.2015.7458390","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458390","url":null,"abstract":"A new family of multiphase sequences with quasi-orthogonal periodic autocorrelation function is proposed. The distinctive features of this family compared to the known sequences are: small absolute minimax side lobe values of PACF equal to one; period's grid; the number of phases which is a modifiable parameter.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131461662","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 : 2015-09-01DOI: 10.1109/IWSDA.2015.7458420
T. Kojima, Ryusuke Mayuzumi
Complete complementary code (CCC) is a spread spectrum sequence family with good correlation properties. A data hiding scheme based on CCC has been proposed and applied into image and audio signals. It is known that there is a trade-off between the payload of the embedded information and the quality of the stego media in general. In this study, we propose a method to improve the stego image quality without decreasing the quantity of the embedded secret data, and also without any bit errors in the extraction of the embedded message. The proposed strategy is based on two key ideas. One is employing independent embedding coefficient to each different embedded bit while the other is to replace the cover signal with the embedded signal approximately close to the cover signal. The effectiveness of the proposed method is evaluated through numerical experiments.
{"title":"An improvement of the data hiding scheme based on complete complementary codes","authors":"T. Kojima, Ryusuke Mayuzumi","doi":"10.1109/IWSDA.2015.7458420","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458420","url":null,"abstract":"Complete complementary code (CCC) is a spread spectrum sequence family with good correlation properties. A data hiding scheme based on CCC has been proposed and applied into image and audio signals. It is known that there is a trade-off between the payload of the embedded information and the quality of the stego media in general. In this study, we propose a method to improve the stego image quality without decreasing the quantity of the embedded secret data, and also without any bit errors in the extraction of the embedded message. The proposed strategy is based on two key ideas. One is employing independent embedding coefficient to each different embedded bit while the other is to replace the cover signal with the embedded signal approximately close to the cover signal. The effectiveness of the proposed method is evaluated through numerical experiments.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"5 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120894620","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
扫码关注我们
求助内容：
应助结果提醒方式：