Pub Date : 2015-09-14DOI: 10.1109/IWSDA.2015.7458388
Jinchen Bao, Zheng Ma, Zhongliang Zhu, Mahamuda Alhaji, Z. Ding
Non-orthogonal multiple access (NOMA) employing nested lattice codes is investigated in a downlink transmission scenario. The fundamental idea is the multiple access scheme via Compute-and-Forward framework, which produces an equivalent MIMO channel such that multiuser detection can be performed. Approaches including the successive lattice decoding of linear functions of transmitted messages by cancelling decoded equations and ML detection are investigated. Power allocation as a precoding scheme as well as an allocation strategy are proposed to deal with channel fadings and to enhance system throughput.
{"title":"A lattice coding based non-orthogonal multiple access scheme","authors":"Jinchen Bao, Zheng Ma, Zhongliang Zhu, Mahamuda Alhaji, Z. Ding","doi":"10.1109/IWSDA.2015.7458388","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458388","url":null,"abstract":"Non-orthogonal multiple access (NOMA) employing nested lattice codes is investigated in a downlink transmission scenario. The fundamental idea is the multiple access scheme via Compute-and-Forward framework, which produces an equivalent MIMO channel such that multiuser detection can be performed. Approaches including the successive lattice decoding of linear functions of transmitted messages by cancelling decoded equations and ML detection are investigated. Power allocation as a precoding scheme as well as an allocation strategy are proposed to deal with channel fadings and to enhance system throughput.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"61 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120902215","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.7458406
Sheng Zhang, Jiashu Zhang
This paper presents a novel recursive least squares (RLS) algorithm which automatically determines its forgetting factor by an evolutionary method. The evolutionary method increases or decreases the forgetting factor by comparing the output error with a threshold. The experimental results show that the proposed algorithm has fast convergence speed and small steady-state error compared to the RLS.
{"title":"An RLS algorithm with evolving forgetting factor","authors":"Sheng Zhang, Jiashu Zhang","doi":"10.1109/IWSDA.2015.7458406","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458406","url":null,"abstract":"This paper presents a novel recursive least squares (RLS) algorithm which automatically determines its forgetting factor by an evolutionary method. The evolutionary method increases or decreases the forgetting factor by comparing the output error with a threshold. The experimental results show that the proposed algorithm has fast convergence speed and small steady-state error compared to the RLS.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"2676 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":"120944783","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.7458394
K. Tsuchiya, Y. Nogami
Recently, binary sequences generated by chaotic maps have been widely studied. In particular, the logistic map is used as one of the chaotic map. However, if the logistic map is implemented by using unite precision computer arithmetic, rounding is required. In order to avoid rounding, Miyazaki, Araki, Uehara and Nogami proposed the logistic map over finite fields, and show some properties of sequences generated by the logistic map over finite fields. In this paper, we show some properties of periods of sequences generated by the logistic map over finite fields with control parameter four. In particular, we show conditions for parameters and initial values to have a long period, and asymptotic properties for periods by numerical experiments.
{"title":"Periods of sequences generated by the logistic map over finite fields with control parameter four","authors":"K. Tsuchiya, Y. Nogami","doi":"10.1109/IWSDA.2015.7458394","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458394","url":null,"abstract":"Recently, binary sequences generated by chaotic maps have been widely studied. In particular, the logistic map is used as one of the chaotic map. However, if the logistic map is implemented by using unite precision computer arithmetic, rounding is required. In order to avoid rounding, Miyazaki, Araki, Uehara and Nogami proposed the logistic map over finite fields, and show some properties of sequences generated by the logistic map over finite fields. In this paper, we show some properties of periods of sequences generated by the logistic map over finite fields with control parameter four. In particular, we show conditions for parameters and initial values to have a long period, and asymptotic properties for periods by numerical experiments.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"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":"128431935","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.7458384
K. Shum, Q. T. Sun
Lattice network coding is an important building block of physical-layer network coding. The receiver is required to compute a linear combination of the source symbols belonging to a finite alphabet with an algebraic structure. In this paper, lattice network codes are constructed from lattices that have optimal packing density and the best known shaping gain in low dimensions. Using the efficient quantization functions of these optimal lattices, practical lattice network codes are constructed. Simulation results demonstrate that there is a 4 to 5 dB performance gain in comparison to the baseline lattice network code with hypercube shaping.
{"title":"Lattice network codes over optimal lattices in low dimensions","authors":"K. Shum, Q. T. Sun","doi":"10.1109/IWSDA.2015.7458384","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458384","url":null,"abstract":"Lattice network coding is an important building block of physical-layer network coding. The receiver is required to compute a linear combination of the source symbols belonging to a finite alphabet with an algebraic structure. In this paper, lattice network codes are constructed from lattices that have optimal packing density and the best known shaping gain in low dimensions. Using the efficient quantization functions of these optimal lattices, practical lattice network codes are constructed. Simulation results demonstrate that there is a 4 to 5 dB performance gain in comparison to the baseline lattice network code with hypercube shaping.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"24 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":"115210691","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.7458403
S. Matsufuji, Takafumi Hayashi, Sho Kuroda, Y. Ida, Takahiro Matsumoto
This paper discusses a set of sequences with a zero correlation zone such that their Fourier transform over GF(p) corresponding to the Hadamard transform over GF(p) takes only unit magnitude, called a bent ZCZ code. The constructions and properties of polyphase bent ZCZ codes of period pn including bi-phase and quadriphase ones are clarified.
{"title":"On bent ZCZ codes","authors":"S. Matsufuji, Takafumi Hayashi, Sho Kuroda, Y. Ida, Takahiro Matsumoto","doi":"10.1109/IWSDA.2015.7458403","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458403","url":null,"abstract":"This paper discusses a set of sequences with a zero correlation zone such that their Fourier transform over GF(p) corresponding to the Hadamard transform over GF(p) takes only unit magnitude, called a bent ZCZ code. The constructions and properties of polyphase bent ZCZ codes of period pn including bi-phase and quadriphase ones are clarified.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"151 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":"124349473","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.7458410
S. Boztaş, A. Alamer
Using the so-called m-sequences as input, the Self-Shrinking Generator (SSG) was introduced in 1996 and has largely withstood cryptanalytic attacks. It is natural to view the SSG as an ensemble of generators where the choice of the primitive polynomial corresponding to the specific m-sequence is considered to be a design parameter. Using this approach, we obtain computational results on certain randomness properties of the generalized SSG and their dependence on the specific polynomial. Our results suggest that the choice of the polynomial for the SSG is a delicate question that requires sufficient care.
{"title":"Statistical dependencies in the Self-Shrinking Generator","authors":"S. Boztaş, A. Alamer","doi":"10.1109/IWSDA.2015.7458410","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458410","url":null,"abstract":"Using the so-called m-sequences as input, the Self-Shrinking Generator (SSG) was introduced in 1996 and has largely withstood cryptanalytic attacks. It is natural to view the SSG as an ensemble of generators where the choice of the primitive polynomial corresponding to the specific m-sequence is considered to be a design parameter. Using this approach, we obtain computational results on certain randomness properties of the generalized SSG and their dependence on the specific polynomial. Our results suggest that the choice of the polynomial for the SSG is a delicate question that requires sufficient care.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"119 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":"116381491","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.7458400
Surajkumar Harikumar, Jayanthi Ramesh, Manikandan Srinivasan, A. Thangaraj
Exact density evolution of protograph Low Density Parity Check (LDPC) codes over the Binary Erasure Channel (BEC) is considered. Upper bounds on the threshold are derived and expressed as single-variable minimizations. A simplified version of the upper bound is expressed in closed form in terms of the degrees of the nodes in the protograph. By maximizing the upper bound, useful conditions are derived for optimizing protographs to get thresholds close to capacity bounds. Using these conditions, a randomized construction method for good small-sized protographs is presented.
{"title":"Threshold upper bounds and optimized design of protograph LDPC codes for the Binary Erasure Channel","authors":"Surajkumar Harikumar, Jayanthi Ramesh, Manikandan Srinivasan, A. Thangaraj","doi":"10.1109/IWSDA.2015.7458400","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458400","url":null,"abstract":"Exact density evolution of protograph Low Density Parity Check (LDPC) codes over the Binary Erasure Channel (BEC) is considered. Upper bounds on the threshold are derived and expressed as single-variable minimizations. A simplified version of the upper bound is expressed in closed form in terms of the degrees of the nodes in the protograph. By maximizing the upper bound, useful conditions are derived for optimizing protographs to get thresholds close to capacity bounds. Using these conditions, a randomized construction method for good small-sized protographs is presented.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"26 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":"117229081","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.7458419
Sumanta Sarkar, T. Cusick
For the first time in the literature, we investigate the negabent Boolean functions in the class of rotation symmetric Boolean functions. We derive a matrix to analyze the negabent property of rotation symmetric negabent Boolean functions. The dimension of this matrix is much smaller than the nega-Hadamard matrix. We show that for even n ≤ 8, there is no rotation symmetric negabent function which is also bent. Taking the cue from this numerical results, we prove that there is no rotation symmetric Boolean function of degree 2 which is both bent and negabent.
{"title":"Initial results on the rotation symmetric bent-negabent functions","authors":"Sumanta Sarkar, T. Cusick","doi":"10.1109/IWSDA.2015.7458419","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458419","url":null,"abstract":"For the first time in the literature, we investigate the negabent Boolean functions in the class of rotation symmetric Boolean functions. We derive a matrix to analyze the negabent property of rotation symmetric negabent Boolean functions. The dimension of this matrix is much smaller than the nega-Hadamard matrix. We show that for even n ≤ 8, there is no rotation symmetric negabent function which is also bent. Taking the cue from this numerical results, we prove that there is no rotation symmetric Boolean function of degree 2 which is both bent and negabent.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"90 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":"122658251","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.7458411
R. Bandi, Maheshanand Bhaintwal
In this paper, we study cyclic codes over the ring R = ℤ4 + uℤ4, u2 = 0. We discuss the Galois ring extensions of R and the ideal structure of these extensions. We have studied cyclic codes of odd lengths over R and also presented 1-generator cyclic codes over R interms nth roots of unity. Some examples are given to illustrate the results.
本文研究了环R = 4 + u4, u2 = 0上的循环码。讨论了R的伽罗瓦环扩展及其理想结构。我们研究了R上奇数长度的循环码，并给出了R上有n个单位根项的1-生成循环码。给出了一些例子来说明结果。
{"title":"Cyclic codes over ℤ4 + uℤ4","authors":"R. Bandi, Maheshanand Bhaintwal","doi":"10.1109/IWSDA.2015.7458411","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458411","url":null,"abstract":"In this paper, we study cyclic codes over the ring R = ℤ<sub>4</sub> + uℤ<sub>4</sub>, u<sup>2</sup> = 0. We discuss the Galois ring extensions of R and the ideal structure of these extensions. We have studied cyclic codes of odd lengths over R and also presented 1-generator cyclic codes over R interms nth roots of unity. Some examples are given to illustrate the results.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"15 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":"121844433","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.7458415
Nian Li, Zhengchun Zhou, T. Helleseth
Cyclic codes are an important class of linear codes and have been widely used in many areas such as consumer electronics, data storage and communication systems. Let C(1,e) denote the cyclic code with generator polynomial mα(x)mαe (x), where α is a primitive element of F3m and mαi (x) denotes the minimal polynomial of αi over F3 for 1 ≤ i ≤ 3m-1. In this paper, through some subtle manipulation on solving certain equations over finite fields, a conjecture proposed by Ding and Helleseth in 2013 about a class of optimal ternary cyclic codes C(1,e) for e = 2(1+3h) with parameters [3m -1, 3m-1-2m, 4] is settled, where m > 1 is an odd integer and 0 ≤ h ≤ m-1.
{"title":"On a conjecture about a class of optimal ternary cyclic codes","authors":"Nian Li, Zhengchun Zhou, T. Helleseth","doi":"10.1109/IWSDA.2015.7458415","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458415","url":null,"abstract":"Cyclic codes are an important class of linear codes and have been widely used in many areas such as consumer electronics, data storage and communication systems. Let C<sub>(1,e)</sub> denote the cyclic code with generator polynomial m<sub>α</sub>(x)m<sub>α</sub>e (x), where α is a primitive element of F<sub>3m</sub> and m<sub>α</sub>i (x) denotes the minimal polynomial of <sub>α</sub>i over F<sub>3</sub> for 1 ≤ i ≤ 3m-1. In this paper, through some subtle manipulation on solving certain equations over finite fields, a conjecture proposed by Ding and Helleseth in 2013 about a class of optimal ternary cyclic codes C<sub>(1,e)</sub> for e = 2(1+3<sup>h</sup>) with parameters [3<sup>m</sup> -1, 3<sup>m</sup>-1-2m, 4] is settled, where m > 1 is an odd integer and 0 ≤ h ≤ m-1.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"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":"130009846","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
扫码关注我们
求助内容：
应助结果提醒方式：