Pub Date : 2009-12-04DOI: 10.1109/IWSDA.2009.5346428
S. Matsufuji, Takahiro Matsumoto, Tomohiro Hayashida, Takafumi Hayshi, N. Kuroyanagi, P. Fan
This paper presents a ZCZ code which are combinedly used to spread data and synchronization symbol in quasi-synchronous CDMA systems using PSK, ASK or BFSK. Furthermore a simple matched filter is presented, which calculates simultaneously correlations with arbitrary sequences in the ZCZ code.
{"title":"On a ZCZ code including a sequence useful for synchronization","authors":"S. Matsufuji, Takahiro Matsumoto, Tomohiro Hayashida, Takafumi Hayshi, N. Kuroyanagi, P. Fan","doi":"10.1109/IWSDA.2009.5346428","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346428","url":null,"abstract":"This paper presents a ZCZ code which are combinedly used to spread data and synchronization symbol in quasi-synchronous CDMA systems using PSK, ASK or BFSK. Furthermore a simple matched filter is presented, which calculates simultaneously correlations with arbitrary sequences in the ZCZ code.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"36 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":"130316612","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.5346420
Shunsuke Araki, Takeru Miyazaki, S. Uehara
We are investigating the logistic may over intergers with finite precision and sequences outputted by the interative mapping. One of our goals is to provide a guide-line for design of pseudorandom number generators with the map. In this paper, we set a basic model in which internal initial values are updated after a certain iteration, and show that an updating way of the internal initial value does not have a critical influence on radomness of output by the basic model with minor exceptions.
{"title":"A study on initial values of the logistic map over integers","authors":"Shunsuke Araki, Takeru Miyazaki, S. Uehara","doi":"10.1109/IWSDA.2009.5346420","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346420","url":null,"abstract":"We are investigating the logistic may over intergers with finite precision and sequences outputted by the interative mapping. One of our goals is to provide a guide-line for design of pseudorandom number generators with the map. In this paper, we set a basic model in which internal initial values are updated after a certain iteration, and show that an updating way of the internal initial value does not have a critical influence on radomness of output by the basic model with minor exceptions.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"8 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":"115105042","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.5346401
U. Parampalli
Low correlation zone (LCZ) sequences were introduced to address a specific requirement of a generalized quasi-synchronous code-division multiple access (QS-CDMA) communication system. In this talk I will introduce the problem of low correlation zone sequence design and present basic schemes using Interleaving techniques. The low correlation zone requirement presents new challenges in the area of bounds involving family size and low correlation parameters. I will talk about some of the results on limitations arises from the bounds. There have been several papers dealing with the construction methods involving finite fields, finite rings and several combinatorial objects such as Hadamard matrices. The talk will include key constructions and a brief survey some recent results in the area.
{"title":"Low correlation zone sequences over finite fields and rings","authors":"U. Parampalli","doi":"10.1109/IWSDA.2009.5346401","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346401","url":null,"abstract":"Low correlation zone (LCZ) sequences were introduced to address a specific requirement of a generalized quasi-synchronous code-division multiple access (QS-CDMA) communication system. In this talk I will introduce the problem of low correlation zone sequence design and present basic schemes using Interleaving techniques. The low correlation zone requirement presents new challenges in the area of bounds involving family size and low correlation parameters. I will talk about some of the results on limitations arises from the bounds. There have been several papers dealing with the construction methods involving finite fields, finite rings and several combinatorial objects such as Hadamard matrices. The talk will include key constructions and a brief survey some recent results in the area.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"21 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":"121700558","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.5346447
Zhengchun Zhou, Xiaohu Tang
Frequency hopping (FH) sequences have important applications in FH-CDMA systems. In this paper, a simple but general construction of optimal FH sequence sets using difference-balanced functions is presented. It generalizes several known algebraic constructions of optimal FH sequences. In addition, new optimal FH sequence sets can be generated by the proposed construciton.
{"title":"A new construction of optimal frequency hopping sequence sets","authors":"Zhengchun Zhou, Xiaohu Tang","doi":"10.1109/IWSDA.2009.5346447","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346447","url":null,"abstract":"Frequency hopping (FH) sequences have important applications in FH-CDMA systems. In this paper, a simple but general construction of optimal FH sequence sets using difference-balanced functions is presented. It generalizes several known algebraic constructions of optimal FH sequences. In addition, new optimal FH sequence sets can be generated by the proposed construciton.","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":"125383223","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.5346407
Takahiro Matsumoto, Y. Suwaki, S. Matsufuji
In the high speed parallel transmission of optical wireless communication, shifting of optical axis is important problem. An optical CDMA system using the optical ZCZ code is proposed as a method with the possibility that this problem can be solved without complicating hardware. The optical ZCZ code, which is a set of pairs of binary and bi-phase sequences with zero correlation zone, can provide optical code division multiple access (CDMA) communication system without co-channel interference. We proposed the compact construction of a code generator and a bank of matched filters for this code . In this paper, we verified that this system can remove co-channel interference even if an optical axis is shifted, by experiment of parallel transmission using an optical ZCZ-CDMA wireless communication system, consisting of a infrared light emitting diode(LED), an avalanche photo diode(APD) module and field programmable gate array( FPGA) boards corresponding to 400,000 logic gates. Desired to undesired signal ratio (DU ratio) in correlation output whose shiftings of optical axis are 0° and 45° are improved about 61.9dB and 39.1dB, respectively. As a result of experiment on the optical parallel transmission, it was proved that this system was able to suppress interference by shifting of optical axis.
{"title":"Experimental evaluation of parallel transmission using optical ZCZ-CDMA system","authors":"Takahiro Matsumoto, Y. Suwaki, S. Matsufuji","doi":"10.1109/IWSDA.2009.5346407","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346407","url":null,"abstract":"In the high speed parallel transmission of optical wireless communication, shifting of optical axis is important problem. An optical CDMA system using the optical ZCZ code is proposed as a method with the possibility that this problem can be solved without complicating hardware. The optical ZCZ code, which is a set of pairs of binary and bi-phase sequences with zero correlation zone, can provide optical code division multiple access (CDMA) communication system without co-channel interference. We proposed the compact construction of a code generator and a bank of matched filters for this code . In this paper, we verified that this system can remove co-channel interference even if an optical axis is shifted, by experiment of parallel transmission using an optical ZCZ-CDMA wireless communication system, consisting of a infrared light emitting diode(LED), an avalanche photo diode(APD) module and field programmable gate array( FPGA) boards corresponding to 400,000 logic gates. Desired to undesired signal ratio (DU ratio) in correlation output whose shiftings of optical axis are 0° and 45° are improved about 61.9dB and 39.1dB, respectively. As a result of experiment on the optical parallel transmission, it was proved that this system was able to suppress interference by shifting of optical axis.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"25 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":"134062362","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.5346402
Ki-Hyeon Park, Hong‐Yeop Song
In this paper, we derive a kind of classification of binary signal set by adopting Hadamard equivalence of binary matrices. We propose a fast algorithm for checking the Hadamard equivalence for general binary matrices, and give an intuitive analysis on its time complexity. For this, we define Hadamard-equivalence on the set of binary matrices, and a function which induces a total order on them. With respect to this order relation, we define the minimal element which is used as a representative of an equivalence class. We applied the proposed algorithm to binary matrices of smaller sizes, and show the results. Finally, we discuss a new combinatorial problem of counting the number of and enumerating all the inequivalent binary minimal matrices of size m × n, and show the solutions for small sizes, leaving many of the observed properties as open problems.
{"title":"A note on classification of binary signal set in the view of Hadamard equivalence","authors":"Ki-Hyeon Park, Hong‐Yeop Song","doi":"10.1109/IWSDA.2009.5346402","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346402","url":null,"abstract":"In this paper, we derive a kind of classification of binary signal set by adopting Hadamard equivalence of binary matrices. We propose a fast algorithm for checking the Hadamard equivalence for general binary matrices, and give an intuitive analysis on its time complexity. For this, we define Hadamard-equivalence on the set of binary matrices, and a function which induces a total order on them. With respect to this order relation, we define the minimal element which is used as a representative of an equivalence class. We applied the proposed algorithm to binary matrices of smaller sizes, and show the results. Finally, we discuss a new combinatorial problem of counting the number of and enumerating all the inequivalent binary minimal matrices of size m × n, and show the solutions for small sizes, leaving many of the observed properties as open problems.","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":"116144631","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.5346414
Xueqin Jiang, M. Lee
This paper presents an approach to the construction of low-density parity-check (LDPC) codes based on hyperplanes (μ-flats) of different dimensions in Euclidean geometries. Codes constructed by this method have quasicyclic and irregular structure. The degree distributions of these codes are optimized by the curve fitting approach in the extrinsic information transfer (EXIT) charts. By constraining the fraction of degree-2 nodes, we can lower the error floor at the cost of a small increase in the threshold SNR. Simulation results show that these codes perform very well at both of waterfall region and the error floor region with the iterative decoding.
{"title":"Design of irregular quasi-cyclic LDPC codes based on Euclidean geometries","authors":"Xueqin Jiang, M. Lee","doi":"10.1109/IWSDA.2009.5346414","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346414","url":null,"abstract":"This paper presents an approach to the construction of low-density parity-check (LDPC) codes based on hyperplanes (μ-flats) of different dimensions in Euclidean geometries. Codes constructed by this method have quasicyclic and irregular structure. The degree distributions of these codes are optimized by the curve fitting approach in the extrinsic information transfer (EXIT) charts. By constraining the fraction of degree-2 nodes, we can lower the error floor at the cost of a small increase in the threshold SNR. Simulation results show that these codes perform very well at both of waterfall region and the error floor region with the iterative decoding.","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":"129464532","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.5346440
T. Shohon, F. Razi, Y. Ogawa, H. Ogiwara
This paper proposes decoding methods for the convolutional code for the wireless Local Area Network (LAN) standard by using sum-product algorithm (SPA). The code is non-systematic. For this code, the conventional SPA decoding cannot provide good decoding performance. This paper shows the reason. The reason is that the conventional SPA uses a Tanner graph including information bits, however, no received signals for information bits are available for the code. This paper proposes two-step SPA decoding method (Proposed Method 1: PM1). The PM1 is as follows. (1) Only parity bits are decoded by SPA. (2) With decoded parity bits, information bits are decoded by SPA. The PM1 can provide much better decoding performance in comparison to the conventional SPA. Furthermore, this paper proposes the combined use of PM1 and method of [4] (Proposed Method 2: PM2). The PM2 provides good performance near BCJR performance. At BER=10−5, PM2 performance is only 0.7[dB] inferior to BCJR performance.
{"title":"Sum-Product decoding of convolutional code for wireless LAN standard","authors":"T. Shohon, F. Razi, Y. Ogawa, H. Ogiwara","doi":"10.1109/IWSDA.2009.5346440","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346440","url":null,"abstract":"This paper proposes decoding methods for the convolutional code for the wireless Local Area Network (LAN) standard by using sum-product algorithm (SPA). The code is non-systematic. For this code, the conventional SPA decoding cannot provide good decoding performance. This paper shows the reason. The reason is that the conventional SPA uses a Tanner graph including information bits, however, no received signals for information bits are available for the code. This paper proposes two-step SPA decoding method (Proposed Method 1: PM1). The PM1 is as follows. (1) Only parity bits are decoded by SPA. (2) With decoded parity bits, information bits are decoded by SPA. The PM1 can provide much better decoding performance in comparison to the conventional SPA. Furthermore, this paper proposes the combined use of PM1 and method of [4] (Proposed Method 2: PM2). The PM2 provides good performance near BCJR performance. At BER=10−5, PM2 performance is only 0.7[dB] inferior to BCJR performance.","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":"129751739","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.5346430
Jincheng Huang, S. Matsufuji, Takahiro Matsumoto, N. Kuroyanagi, P. Fan
Quasi-synchronous CDMA systems, which can remove co-channel interference by means of synchronization control and use of a ZCZ code, are useful for Short-Range Wireless communications. This paper proposes a BFSK-ZCZ-CDMA modulation system which appears more advantageous in bit-error-rate performance over multi-path fading channels than ASK or PSK modulation scheme. In this system, a balanced ZCZ code and a quasi-coherent detection with IQ separation are used. The bit-error-rate performances over AWGN and fading channels are simulated.
{"title":"On BFSK-ZCZ-CDMA systems","authors":"Jincheng Huang, S. Matsufuji, Takahiro Matsumoto, N. Kuroyanagi, P. Fan","doi":"10.1109/IWSDA.2009.5346430","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346430","url":null,"abstract":"Quasi-synchronous CDMA systems, which can remove co-channel interference by means of synchronization control and use of a ZCZ code, are useful for Short-Range Wireless communications. This paper proposes a BFSK-ZCZ-CDMA modulation system which appears more advantageous in bit-error-rate performance over multi-path fading channels than ASK or PSK modulation scheme. In this system, a balanced ZCZ code and a quasi-coherent detection with IQ separation are used. The bit-error-rate performances over AWGN and fading channels are simulated.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"43 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":"115106612","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.5346415
Wei Song, M. Lee
In this paper, we investigate a novel cooperative relay network over Rayleigh flat fading channel. It focus of single-relays equipped by two transmit antennas with the modulate-and-forward protocol, which corresponds to distributed implementations of MIMO system. For each relay node, the received signals are modulated via the sub-matrices of Jacket matrix and forwarded to destination node. We obtain an equivalent quasi-orthogonal distributed space-time block code (STBC), which achieves full rate and full diversity with the simple decoding. Moreover, the present STBC may be fast constructed by using the elegant recursive relations of Jacket transform. The results of analysis show that this scheme outperforms the previous schemes in terms of Pairwise Error Probability (PEP) and the decoding complexities.
{"title":"Fast distributed space-time block code in wireless relay networks","authors":"Wei Song, M. Lee","doi":"10.1109/IWSDA.2009.5346415","DOIUrl":"https://doi.org/10.1109/IWSDA.2009.5346415","url":null,"abstract":"In this paper, we investigate a novel cooperative relay network over Rayleigh flat fading channel. It focus of single-relays equipped by two transmit antennas with the modulate-and-forward protocol, which corresponds to distributed implementations of MIMO system. For each relay node, the received signals are modulated via the sub-matrices of Jacket matrix and forwarded to destination node. We obtain an equivalent quasi-orthogonal distributed space-time block code (STBC), which achieves full rate and full diversity with the simple decoding. Moreover, the present STBC may be fast constructed by using the elegant recursive relations of Jacket transform. The results of analysis show that this scheme outperforms the previous schemes in terms of Pairwise Error Probability (PEP) and the decoding complexities.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"3 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":"133861552","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
扫码关注我们
求助内容：
应助结果提醒方式：