Pub Date : 2009-12-04DOI: 10.1109/IWSDA.2009.5346427
Takafumi Hayashi, S. Matsufuji
The present paper introduces a new approach to the construction of a sequence set with a zero-correlation zone (ZCZ). This sequence set is referred to as a zero-correlation zone sequence set. The proposed sequence construction can generate an optimal ZCZ sequence set, the member size of which reaches the theoretical bound. The proposed sequence construction generates a ZCZ sequence set from a perfect sequence and a Hadamard matrix.
{"title":"A generalized construction of optimal zero-correlation zone sequence set from a perfect sequence","authors":"Takafumi Hayashi, S. Matsufuji","doi":"10.1109/IWSDA.2009.5346427","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346427","url":null,"abstract":"The present paper introduces a new approach to the construction of a sequence set with a zero-correlation zone (ZCZ). This sequence set is referred to as a zero-correlation zone sequence set. The proposed sequence construction can generate an optimal ZCZ sequence set, the member size of which reaches the theoretical bound. The proposed sequence construction generates a ZCZ sequence set from a perfect sequence and a Hadamard matrix.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"28 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":"116559778","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.5346433
Yang Yang, Zhengchun Zhou, Xiaohu Tang
In this paper, in terms of binary sequences with ideal autocorrelation, we present a systematic construction of quaternary low correlation zone (LCZ) sequence sets with flexible parameters. By the proposed construction, new optimal quaternary LCZ sequence sets inequivalent to known ones can be generated. In addition, we give a classification of the constructed optimal quaternary LCZ sequence sets.
{"title":"Classification of optimal quaternary low correlation zone sequence sets","authors":"Yang Yang, Zhengchun Zhou, Xiaohu Tang","doi":"10.1109/IWSDA.2009.5346433","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346433","url":null,"abstract":"In this paper, in terms of binary sequences with ideal autocorrelation, we present a systematic construction of quaternary low correlation zone (LCZ) sequence sets with flexible parameters. By the proposed construction, new optimal quaternary LCZ sequence sets inequivalent to known ones can be generated. In addition, we give a classification of the constructed optimal quaternary LCZ sequence sets.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"40 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":"125072412","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.5346442
Junghyun Kim, Hong‐Yeop Song
This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.
{"title":"Reduced complexity-and-latency variable-to-check residual belief propagation decoding algorithms for LDPC codes","authors":"Junghyun Kim, Hong‐Yeop Song","doi":"10.1109/IWSDA.2009.5346442","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346442","url":null,"abstract":"This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"26 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":"132562928","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.5346409
Ryusuke Mayuzumi, T. Kojima
Signal design methods for the approximately synchronized CDMA systems based on complete complementary codes have been proposed. It has been shown that both the information transmission rate and the frequency usage rate can be increased in these kinds of CDMA systems. The bit error rate (BER) properties of these systems have been also reported recently. However, it's not been considered sufficiently why bit errors occur. In this paper, we analyze the bit error distribution and discuss the cause of bit errors in these systems. In addition, we propose the effective demodulation scheme to decrease bit errors and compare the BER performances of the proposed method with that of the original demodulation scheme of CDMA systems using complete complementary codes through some numerical simulations.
{"title":"A new demodulation procedure for CDMA systems based on complete complementary codes","authors":"Ryusuke Mayuzumi, T. Kojima","doi":"10.1109/IWSDA.2009.5346409","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346409","url":null,"abstract":"Signal design methods for the approximately synchronized CDMA systems based on complete complementary codes have been proposed. It has been shown that both the information transmission rate and the frequency usage rate can be increased in these kinds of CDMA systems. The bit error rate (BER) properties of these systems have been also reported recently. However, it's not been considered sufficiently why bit errors occur. In this paper, we analyze the bit error distribution and discuss the cause of bit errors in these systems. In addition, we propose the effective demodulation scheme to decrease bit errors and compare the BER performances of the proposed method with that of the original demodulation scheme of CDMA systems using complete complementary codes through some numerical simulations.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":" 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113951842","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.5346432
Rema Hariharan
We present a modified construction of a class of near perfect sequences of odd length m(2j+1) where m=3,5,7…;j=2,4,6…, using a shift sequence associated with a primitive polynomial of degree 2j together with a pair of completely orthogonal sequences.
{"title":"Near perfect sequences of odd length","authors":"Rema Hariharan","doi":"10.1109/IWSDA.2009.5346432","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346432","url":null,"abstract":"We present a modified construction of a class of near perfect sequences of odd length m(2j+1) where m=3,5,7…;j=2,4,6…, using a shift sequence associated with a primitive polynomial of degree 2j together with a pair of completely orthogonal sequences.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"11 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":"116798417","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.5346403
Y. Tanada, Kiminori Sato
Huffman sequence has impulsive autocorrelation function and is applicable to radar and communications. This paper describes approximate expression for the sequence and considers sequence values. The sequence spectrum is expanded to polynomial groups related to approximate sequences. The first-order approximate sequence with real value is similar to a real-valued orthogonal periodic sequence with phase parameters {0,π } . The maximum absolute value of the Huffman sequence is estimated on the basis of the maximum absolute value of the first-order approximate sequence.
{"title":"Approximate expression for long length huffman sequence","authors":"Y. Tanada, Kiminori Sato","doi":"10.1109/IWSDA.2009.5346403","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346403","url":null,"abstract":"Huffman sequence has impulsive autocorrelation function and is applicable to radar and communications. This paper describes approximate expression for the sequence and considers sequence values. The sequence spectrum is expanded to polynomial groups related to approximate sequences. The first-order approximate sequence with real value is similar to a real-valued orthogonal periodic sequence with phase parameters {0,π } . The maximum absolute value of the Huffman sequence is estimated on the basis of the maximum absolute value of the first-order approximate sequence.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"24 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":"127762868","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.5346448
Yi-Chan Kao, Ying Li
The matrix representations of aperiodic auto- and cross-correlation functions are useful in revealing new properties of correlation functions. The “shared autocorrelation function property” related to nonstandard PSK Golay sequences previously observed through computer search only are shown to propagate to infinite sequence lengths. The additivity property for mod-H codeword sequences and the aperiodic autocorrelation function matrices of phase shift keying (H-PSK) sequences is also discussed. This shows that sequences with specific autocorrelation functions are more naturally described using the codeword sequences, in agreement with Davis and Jedwab's discovery that a large collection of PSK Golay complementary sequences can be concisely described as Reed Muller codewords.
{"title":"Matrix representations of aperiodic auto and cross correlation functions","authors":"Yi-Chan Kao, Ying Li","doi":"10.1109/IWSDA.2009.5346448","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346448","url":null,"abstract":"The matrix representations of aperiodic auto- and cross-correlation functions are useful in revealing new properties of correlation functions. The “shared autocorrelation function property” related to nonstandard PSK Golay sequences previously observed through computer search only are shown to propagate to infinite sequence lengths. The additivity property for mod-H codeword sequences and the aperiodic autocorrelation function matrices of phase shift keying (H-PSK) sequences is also discussed. This shows that sequences with specific autocorrelation functions are more naturally described using the codeword sequences, in agreement with Davis and Jedwab's discovery that a large collection of PSK Golay complementary sequences can be concisely described as Reed Muller codewords.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"26 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":"125167315","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.5346405
T. Kaida, Junru Zheng
A method of construction for non- binary periodic sequences from the cyclic difference set is proposed. Two numerical examples are given, and their value distributions and some Hamming distances between self-cyclic shift and cross-cyclic shift of two sequences are evaluated.
{"title":"A note a constant weight sequences over q-ary from cyclic difference sets","authors":"T. Kaida, Junru Zheng","doi":"10.1109/IWSDA.2009.5346405","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346405","url":null,"abstract":"A method of construction for non- binary periodic sequences from the cyclic difference set is proposed. Two numerical examples are given, and their value distributions and some Hamming distances between self-cyclic shift and cross-cyclic shift of two sequences are evaluated.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"147 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":"131465882","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.5346438
M. Saber, Y. Jitsumatsu, T. Kohda
A low power architecture to compute arctangent function which is suitable for broad-band communication applications is presented. This architecture aims to avoid high power consumption and long latency which are the main disadvantages to other methods based on CORDIC algorithm or conventional LUT methods or polynomial approximation. The architecture is implemented using FPGA, computes arctangent function with 3 clock pulses, and it is power dissipation is lower than Cordic algorithm by 80%.
{"title":"A low-power implementation of arctangent function for communication applications using FPGA","authors":"M. Saber, Y. Jitsumatsu, T. Kohda","doi":"10.1109/IWSDA.2009.5346438","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346438","url":null,"abstract":"A low power architecture to compute arctangent function which is suitable for broad-band communication applications is presented. This architecture aims to avoid high power consumption and long latency which are the main disadvantages to other methods based on CORDIC algorithm or conventional LUT methods or polynomial approximation. The architecture is implemented using FPGA, computes arctangent function with 3 clock pulses, and it is power dissipation is lower than Cordic algorithm by 80%.","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":"130932350","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.5346439
T. Shohon, Y. Ogawa, H. Ogiwara
This article proposes two methods to improve the sum-product soft-in/soft-out decoding performance of convolutional codes. The first method is to transform a parity check equation in such a way as to remove cycles of length four in a Tanner graph of a convolutional code, and performs sum-product algorithm (SPA) with the transformed parity check equation. This method improves the performance of (7,5)8 convolutional code (CC1). However, for (45,73)8 convolutional code (CC2), the method does not effect. The second proposed method is to use a higher order parity check equation in comparison with a normal parity check equation for SPA decoding. This method improves the performance for both convolutional codes (CC1, CC2). The performance is close to that by BCJR algorithm and it is less complex than BCJR algorithm.
{"title":"Sum-product decoding of convolutional codes","authors":"T. Shohon, Y. Ogawa, H. Ogiwara","doi":"10.1109/IWSDA.2009.5346439","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346439","url":null,"abstract":"This article proposes two methods to improve the sum-product soft-in/soft-out decoding performance of convolutional codes. The first method is to transform a parity check equation in such a way as to remove cycles of length four in a Tanner graph of a convolutional code, and performs sum-product algorithm (SPA) with the transformed parity check equation. This method improves the performance of (7,5)8 convolutional code (CC1). However, for (45,73)8 convolutional code (CC2), the method does not effect. The second proposed method is to use a higher order parity check equation in comparison with a normal parity check equation for SPA decoding. This method improves the performance for both convolutional codes (CC1, CC2). The performance is close to that by BCJR algorithm and it is less complex than BCJR algorithm.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"44 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018418","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
扫码关注我们
求助内容：
应助结果提醒方式：