LETTER Almost Perfect Sequences and Periodic Complementary Sequence Pairs over the 16-QAM Constellation
|
|
- Gwendoline Tyler
- 6 years ago
- Views:
Transcription
1 400 IEICE TRANS. FUNDAMENTALS VOL.E95 A NO.1 JANUARY 2012 LETTER Almost Perfect Sequences Periodic Complementary Sequence Pairs over the 16-QAM Constellation Fanxin ZENG a) Member Xiaoping ZENG Nonmember Zhenyu ZHANG Member Guixin XUAN Nonmember SUMMARY Based on quadriphase perfect sequences their cyclical shift versions three families of almost perfect 16-QAM sequences are presented. When one of two time shifts chosen equals half a period of quadriphase sequence employed another is zero two of the proposed three sequence families possess the property that their out-of-phase autocorrelation function values vanish except one. At the same time to the other time shifts the nontrivial autocorrelation function values in three families are zero except two or four. In addition two classes of periodic complementary sequence (PCS) pairs over the 16-QAM constellation whose autocorrelation is similar to the one of conventional PCS pairs are constructed as well. key words: 16-QAM sequence almost perfect sequence periodic complementary sequence pair quadriphase perfect sequence autocorrelation 1. Introduction Sequences with good autocorrelation play an important role in communications such as in synchronization. The best autocorrelation property of such sequences are with all zero nontrivial autocorrelation values i.e. so-called perfect sequences [1]. Unfortunately only a binary perfect sequence with length 4 has been found up to now which implies there do not exist the binary perfect sequences with other length. In order to satisfy the requirements of applications the replacers of perfect sequences have been widely investigated. Thereinto one of the replacers is called an almost perfect sequence. In fact an almost perfect sequence is a sub-optimal binary sequence with only a nonzero out-of-phase autocorrelation value which is investigated by Refs. [2] [6]. For instance in Ref. [7] an almost perfect binary sequence with length 16 is given as v r (t)} ( ) Manuscript received June Manuscript revised August The authors are with College of Communication Engineering Chongqing University Chongqing China. The authors are with the Chongqing Key Laboratory of Emergency Communication Chongqing Communication Institute Chongqing China. The work is supported by the National Natural Science Foundation of China (NSFC) under Grants the Ministry of Industry Information Technology of China (No.Equipment[2010]307) the Natural Science Project of CQ (CSTC 2009BA DA AB BB2203) the Open Research Foundation of Chongqing Key Laboratory of Signal Information Processing under Grant CQSIP a) fzengx@yahoo.com.cn DOI: /transfun.E95.A.400 (1) whose autocorrelation is R vr v r (0 τ 15) (2) ( ). Subsequently such sequences are generalized to almost perfect polyphase sequences by Lüke the number of the nonzero nontrivial autocorrelation values is enlarged to more than one [7]. An example given by Lüke is with four nonzero out-of-phase autocorrelation values [7]. However all methods mentioned above do not produced almost perfect QAM sequences. A complementary sequence pair is also one of many replacers which consist of two sub-sequences were firstly investigated by Golay [8]. Quickly a complementary sequence pair is generalized to the periodic case from the original aperiodic case [9] to polyphase case from binary case [10]. For more messages on complementary sequences the reader is recommended to refer to Refs. [1] [11]. In present communications the signals over the quadrature amplitude modulation (QAM) constellation have been widely used such as in 3GPP stard [12] where 16- QAM 64-QAM are recommended as modulation symbols. In addition Ref. [13] shows that the communication system using the QAM sequences has a higher transmission data rate (TDR) than the one making use of traditional sequences with the same sequence length. Reference [14] states that the application of the QAM sequences with zero correlation zone (ZCZ) can hold both no multiple access interference (MAI) high TDR Ref. [15] suggests that the QAM Golay complementary sequences can reduce the peak-to-mean envelope power ratio (PMEPR) of signals in an orthogonal frequency division multiplexing (OFDM) system. Therefore the research on the QAM sequences with various properties has been widely considered. In this letter the authors will focus on the investigation of almost perfect 16-QAM sequences three families of such sequences resulting from quadriphase perfect sequences are presented. In addition it is worth mentioning to the best authors s knowledge that there does not exist any almost perfect QAM sequence apart from ours. But when the enlarged QAM alphabet set QAM+ is considered that is QAM+QAM 0} (very different from the traditional QAM constellation) only a paper [16] discussing such sequences by m-sequences is found by the authors. On the other h the periodic complementary sequence (PCS) pairs over the 16-QAM constellation are constructed as well. Copyright c 2012 The Institute of Electronics Information Communication Engineers
2 LETTER Preliminaries In this section for convenience of the reader we will review the related definitions of almost perfect sequences an interleaved sequence the expression of 16-QAM constellation. 2.1 Almost Perfect Sequences Let v r v r (t)} (v r (0)v r (1)v r (2) v r (N 1)) v s v s (t)} (v s (0)v s (1)v s (2) v s (N 1)) be two complex sequences with each of length N. We define the correlation function between the sequences v r (t)} v s (t)} as follows. R vr v s (τ) v r (t)v s (t + τ) (3) where v s (t) denotes the complex-conjugate of v s (t) the addition t + τ is counted modulo N. Ifr s R vr v r (τ) isreferred to as an autocorrelation function otherwise a crosscorrelation function. If the autocorrelation of a sequence v r (t)} with period N satisfies N τ 0 (mod N) R vr v r (τ) (4) 0 other τ (except a few values) the sequence v r (t)} is referred to as an almost perfect sequence. Apparently when the condition except a few values in Eq. (4) is deleted the sequence v r (t)} is called a perfect sequence whose many constructions are given in Refs. [1] [17] [19]. In communication applications the nonzero out-ofphase autocorrelation values result in increase of error probability therefore the almost perfect sequences with only a nonzero nontrivial autocorrelation value are preferred. 2.2 Periodic Complementary Sequence Pair Let (v r v s ) consist of two sub-sequences with each of length N. Ifwehave > 0 τ 0 (mod N) R vr v r (τ) + R vs v s (τ) (5) 0 τ 0 (mod N) we refer to the sequence set (v r v s ) as a periodic complementary sequence (PCS) pair. Let us have two PCS pairs (v r v s )(v r v s ). If we have R vr v r (τ) + R vs v s (τ) 0 ( τ) (6) we say that those two PCS pairs are the mate to each other. 2.3 An Interleaved Sequence For sequences v r (t)} v s (t)} with the same period Nwe construct a new sequence called an interleaved sequence which is denoted by v I rs(t)} v r (k)} v s (k)} or v I rs v r v s as follows. vrs(t)} I v r (k)} v s (k)} (v r (0)v s (0)v r (1) v s (1) v r (N 1)v s (N 1)) (7) where 0 t 2N 10 k N 1 which implies that an interleaved sequence has a length 2N QAM Constellation The M 2 -QAM constellation is the set a + bi M + 1 a b M 1 a b odd} (8) where the symbol i denotes the imaginary unit that is i 2 1. When M 2 m them 2 -QAM constellation can be driven by the quaternary phase-shift keying (QPSK) constellation [20]. More clearly the M 2 -QAM constellation is equivalent to m 1 (1 + i) 2 k i a k a k Z 4 (9) where Z }. In particular the 16-QAM constellation has (1 + i)(i a 0 + 2i a 1 ) a 0 a 1 Z 4 }. (10) Apart from the expression referred to above the 16- QAM constellation can be equivalently described as [13] [21] (1 i)(i a 0 2i a 1 ) a 0 a 1 Z 4 }. (11) 3. Constructions of Almost Perfect 16-QAM Sequences In this section one of the main results in this letter will be given three almost perfect 16-QAM sequence families are proposed from quadriphase perfect sequences. Throughout Sects. 3 4 let the sequence u r (t)} be a quadriphase perfect sequence with length Nthatis R ur u r (τ) i u r(t) u r (t+τ) N τ 0 0 τ 0 (12) δ 1 δ 2 be two integers with 0 δ 1 δ 2 < N δ 1 δ 2. Note that the period N of the known quadriphase perfect sequences must be even. 3.1 Construction Methods Construction I: In accordance with Eq. (10) a 16-QAM sequence can be given by
3 402 IEICE TRANS. FUNDAMENTALS VOL.E95 A NO.1 JANUARY 2012 q 1 (t) (1 + i)[i u r(t+δ 1 ) + 2i u r(t+δ 2 ) ] (13) whose properties are given by Theorem 1: The sequence q 1 (t)} is an almost perfect 16- QAM sequence whose out-of-phase autocorrelation functions have at most two nonzero values. When δ 1 0 δ 2 N/2 or vice versa only one nonzero value occurs. Proof : For the sake of convenience let δ 2 >δ 1. In accordance with Eq. (3) we have R q1 q 1 (τ) q 1 (t)q 1 (t + τ) (1 + i)(1 i) [i u r(t+δ 1 ) + 2i u r(t+δ 2 ) ][i u r(t+δ 1 +τ) +2i u r(t+δ 2 +τ) ] 10R ur u r (τ)+4r ur u r (τ+δ 2 δ 1 )+4R ur u r (τ+δ 1 δ 2 ) 10N τ 0 4N τ δ 2 δ 1 (14) 4N τ N δ 2 + δ 1 0 other. It is apparent that apart from δ 1 0δ 2 N/2 R q1 q 1 (τ) has two nonzero values except the center shift. Whereas when δ 1 0δ 2 N/2 we have R q1 q 1 (τ) 10N τ 0 8N τ N/2 0 other (15) which results from τ N/2 τ + N/2 (modn). Therefore only a nonzero nontrivial autocorrelation value occurs in this case. Construction II: In accordance with Eq. (11) a 16-QAM sequence can be given by p 1 (t) (1 i)[i u r(t+δ 1 ) 2i u r(t+δ 2 ) ] (16) whose properties are given by Theorem 2: The sequence p 1 (t)} is an almost perfect 16- QAM sequence whose out-of-phase autocorrelation functions have at most two nonzero values. When δ 1 0 δ 2 N/2 or vice versa only one nonzero value appears. Proof : With the same argumentations in Theorem 1 nothing needs to be stated apart from that Eq. (14) is substituted into R p1 p 1 (τ) 10R ur u r (τ) 4R ur u r (τ + δ 2 δ 1 ) (17) 4R ur u r (τ + δ 1 δ 2 ). Construction III: In this construction an almost perfect 16-QAM sequence is produced by using an interleaved technique. Hence by employing (7) we have u I q 1 p 2 (t) q 1 or u I q 2 p 1 (t) q 2 p 1 (18) where q 2 (t) (1 + i)[i u r(t+δ 2 ) + 2i u r(t+δ 1 ) ] (19) p 2 (t) (1 i)[i u r(t+δ 2 ) 2i u r(t+δ 1 ) ] (20) Theorem 3: The interleaved sequences in (18) are almost perfect 16-QAM sequences with at most four nonzero outof-phase autocorrelation values. In particular when δ 1 0 δ 2 N/2 or vice versa only two nonzero out-of-phase autocorrelation values occur. Proof : For the sake of convenience simplicity we consider only q 1 δ 2 >δ 1 the others are omitted due to mostly similar derivation. Subsequently we investigate the autocorrelation to be coped with by the time shifts τ even odd respectively. Case 1: The time shift τ 2η. In this case the relationship between the interleaved sequences u I q 1 p 2 (t) its cyclical shift version is as follows. q 1 (0) p 2 (0) q 1 (1) p 2 (1) q 1 (η) p 2 (η) q 1 (η + 1) p 2 (η + 1). (21) Hence we have R u I q1 p 2 uq I (τ) q 1 p 1 (k)q 1 (k + η) 2 N 1 + p 2 (k)p 2 (k + η) 2[R ur u r (η)+2r ur u r (η+δ 2 δ 1 )+2R ur u r (η+δ 1 δ 2 ) +4R ur u r (η)] + 2[R ur u r (η) 2R ur u r (η + δ 1 δ 2 ) 2R ur u r (η + δ 2 δ 1 ) + 4R ur u r (η)] 20N η 0(i.e.τ 0) 20R ur u r (η). (22) 0 other Case 2: The shift time τ 2η + 1. In this case the relationship between the interleaved sequences u I q 1 p 2 (t) its cyclical shift version is as follows. q 1 (0) p 2 (0) q 1 (1) p 2 (1) p 2 (η) q 1 (η + 1) p 2 (η + 1) q 1 (η + 2). (23) Hence we have R u I q1 p 2 uq I (τ) q 1 p 1 (k)p 2 (k + η) 2 N 1 + p 2 (k)q 1 (k + η + 1) 2i[R ur u r (η + δ 2 δ 1 ) 2R ur u r (η) + 2R ur u r (η) 4R ur u r (η + δ 1 δ 2 )] 2i[R ur u r (η + δ 1 δ 2 + 1) +2R ur u r (η+1) 2R ur u r (η+1) 4R ur u r (η+δ 2 δ 1 +1)] 2i[R ur u r (η + δ 2 δ 1 ) 4R ur u r (η + δ 1 δ 2 ) R ur u r (η + δ 1 δ 2 + 1) + 4R ur u r (η + δ 2 δ 1 + 1)]
4 LETTER 2Ni η N δ 2 + δ 1 (i.e. τ 2(N δ 2 + δ 1 ) + 1) 8Ni η δ 2 δ 1 (i.e. τ 2(δ 2 δ 1 ) + 1) 2Ni η δ 2 δ 1 1(i.e.τ 2(δ 2 δ 1 ) 1) (24) 8Ni 0 other η N δ 2 + δ 1 1(i.e. τ 2(N δ 2 + δ 1 ) 1) which is apparently with four nonzero out-of-phase autocorrelation values apart from the following cases. Case: δ 1 0δ 2 N/2. Note that η N/2 η+ N/2(modN) η N/2+ 1 η + N/ Hence we have R u I q1 p 2 uq I (τ) 2i[R 1 p ur u r (η + N/2) 4R ur u r (η N/2) 2 R ur u r (η N/2 + 1) + 4R ur u r (η + N/2 + 1)] 6i[ R ur u r (η + N/2) + R ur u r (η + N/2 + 1)] 6Ni η N/2 (i.e.τ N + 1) 6Ni η N/2 1(i.e.τ N 1). (25) 0 other Obviously only two nonzero nontrivial autocorrelation values occur in this case. Example 1: In order to illuminate the proposed methods validity a simple example is given due to space limitation. We choose arbitrarily a quadriphase perfect sequence from Example 2 in Ref. [19] as follows. u r (t)} ( ). Take δ 1 0δ 2 N/2 8. As a consequence we have q 1 (t)} R q1 q 1 (τ) ( ) with a nonzero out-of-phase autocorrelation value exactly as predicted p 2 (t)} R p2 p 2 (τ) ( ) q 1 ( whose autocorrelation function to 0 τ 31 is R q1 p 2 (τ) ( i 0 ) 96i ) with the number 2 of the nonzero out-of-phase autocorrelation values exactly as predicted where ( a b ) denotes the element a + bi in the 16-QAM constellation QAM Periodic Complementary Sequence Pairs In this section another main result will be stated the PCS pairs over the 16-QAM constellation will be given. 4.1 Construction Methods Construction IV: Theorem 4: Let q 1 (t)} p 1 (t)} q 2 (t)} p 2 (t)} be produced by Eqs. (13) (16) (19) (20) respectively. Hence (q p ) is a PCS pair so is (p q ) Proof : In accordance with the definition in (5) Eqs. (14) (17) we have 20N τ0 R q1 q 1 (τ)+r p1 p 1 (τ)20r ur u r (τ) (26) 0 τ 0 due to Eq. (12). This theorem follows immediately. Theorem 5: Let q 1 (t)} p 1 (t)} q 2 (t)} p 2 (t)} be produced by Eqs. (13)(16) (19) (20) respectively. Hence (q p )(p q ) are the mate to each other Proof : In accordance with the definition in (6) Theorem 4 we only need to prove 403 R q1 p 2 (τ) + R p1 q 2 (τ) 0 ( τ). (27) Sincewehave R q1 p 2 (τ) + R p1 q 2 (τ) q 1 (t)p 2 (t + τ) p 1 (t)q 2 (t + τ) N 1 + (1 + i) 2[ i u r(t+δ 1 ) + 2i u r(t+δ 2 ) ][ i u r(t+δ 2 +τ) 2i u r(t+δ 1 +τ) ] + (1 i) 2[ i u r(t+δ 1 ) 2i u r(t+δ 2 ) ] [i u r(t+δ 2 +τ) + 2i u r(t+δ 1 +τ) ] 2i [ R ur u r (τ + δ 2 δ 1 ) 2R ur u r (τ) + 2R ur u r (τ) 4R ur u r (τ + δ 1 δ 2 ) ] 2i [ R ur u r (τ + δ 2 δ 1 ) + 2R ur u r (τ) 2R ur u r (τ) 4R ur u r (τ + δ 1 δ 2 ) ] 0. (28) This concludes our proof. Example 2: The quadriphase perfect sequence u r (t)} is the same as the one in Example 1 δ 1 0δ 2 8. Therefore we have q 2 (t)}
5 404 IEICE TRANS. FUNDAMENTALS VOL.E95 A NO.1 JANUARY 2012 R q2 q 2 (τ) ( ) p 1 (t)} R p1 p 1 (τ) ( ) with only a nonzero nontrivial autocorrelation value as predicted. After calculating crosscorrelation function to 0 τ 15 we have R q1 p 2 (τ) ( i ) R p1 q 2 (τ) ( i ). It is apparent that Eqs. (26) (27) hold which implies that (q p )(p q ) are the mate to each other Construction V: Theorem 6: Let q 1 (t)} p 1 (t)} q 2 (t)} p 2 (t)} be produced by Eqs. (13) (16) (19) (20) respectively. Hence (q p p q )isapcspair Prrof : Similar to the proof of Theorem 3 by the relationships in (21) (23) we have R q1 p 2 q 1 p 2 (2η) R q1 q 1 (η) + R p2 p 2 (η) (29) R q1 p 2 q 1 p 2 (2η + 1) R q1 p 2 (η) + R p2 q 1 (η + 1). (30) With the same argumentations we have R p1 q 2 p 1 q 2 (2η) R p1 p 1 (η) + R q2 q 2 (η) (31) R p1 q 2 p 1 q 2 (2η + 1) R p1 q 2 (η) + R q2 p 1 (η + 1). (32) Hence the sum of periodic autocorrelation functions of the two interleaved sequences q 1 p 1 q 2 can be given by R q1 p q p (2η) + R p1 q p q (2η) [R q1 q 1 (η) + R p1 p 1 (η)] + [R p2 p 2 (η) + R q2 q 2 (η)] 40N η 0 40R ur u r (η) (33) 0 η 0 which results from Theorem 4 R q1 p q p (2η + 1) + R p1 q p q (2η + 1) [R q1 p 2 (η)+r p1 q 2 (η)]+[r p2 q 1 (η+1)+r q2 p 1 (η+1)] 0 (34) which is due to Theorem 5. This theorem is true from (33) (34). Example 3: The quadriphase perfect sequence u r (t)} employed is unaltered δ 1 15 δ 2 3. Therefore the interleaved sequence q 1 is q p } 1 ( ) whose periodic autocorrelation to 0 τ 31 is R q1 p 2 q 1 p 2 (τ) ( i 0 128i i 0 32i ) the interleaved sequence p 1 q 2 is given as p q } 1 ( ) whose periodic autocorrelation to 0 τ 31 is R p1 q 2 p 1 q 2 (τ) ( i 0 128i i 0 32i ). It is apparent that we have R q1 p q p (τ) + R p1 q p q (τ) τ 0 (mod N) 0 other which indicates that (q 1 p 1 q 2 )isapcspair. 4.2 Discussion The simulation results by a computer show that if one of δ 1 δ 2 is given the other varies from 0 to N 1 apart from a given value the resultant 16-QAM PCS pairs are distinct in terms of cyclical shift equivalence. Hence we can obtain (N 1) M distinct 16-QAM PCS pairs with lengths N 2N respectively to a given N wherem denotes the family size of quaternary perfect sequences employed. For example in Ref. [19] 18 distinct quadriphase perfect sequences with length N 16 are proposed therefore we have distinct 16-QAM PCS pairs with lengths respectively. 5. Conclusion This letter presents three families of almost perfect 16-QAM sequences the PCS pairs over the 16-QAM constellation the simulation results by a computer illuminate the validity of the proposed methods. Therefore the resulting sequences over the 16-QAM constellation provide potential
6 LETTER 405 cidates for applications in the future. Acknowledgments The authors would like to thank anonymous referees for helpful suggestions that greatly improve the presentation quality of this letter. References [1] P.Z. Fan M. Darnell Sequence design for communications applications John Wilet & Sons [2] R.F. Brown G.C. Goodwin New class of pseudorom binary sequences Electron. Lett. vol.3 pp May [3] J. Wolfmann Almost perfect autocorrelation sequences IEEE Trans. Inf. Theory vol.38 pp July [4] P. Langevin Almost perfect binary functions Appl. Algebra in Eng. Commun. Comput. vol.4 pp [5] A. Pott S.P. Bradley Existence nonexistence of almostperfect autocorrelation sequences IEEE Trans. Inf. Theory vol.41 pp Jan [6] H.D. Lüke H.D. Schotten Odd-perfect almost binary correlation sequences IEEE Trans. Aerosp. Electron. Syst. vol.31 pp Jan [7] H.D. Lüke Almost-perfect polyphase sequences with small phase alphabet IEEE Trans. Inf. Theory vol.43 no.1 pp Jan [8] M.J.E. Golay Complementary series IRE Trans. Inf. Theory vol.it-7 pp April [9] L. Bömer M. Antweiler Periodic complementary binary sequences IEEE Trans. Inf. Theory vol.36 no.6 pp Nov [10] C.C. Tseng C.L. Liu Complementary sets of sequences IEEE Trans. Inf. Theory vol.it-18 no.5 pp Sept [11] M.G. Parker C. Tellambura K.G. Paterson Golay complementary sequences in Wiley Encyclopedia of Telecommunicatins ed. J.G. Proakis Wiley [12] 3GPP TS v Release 8 March [13] M. An P.V. Kumar Low-correlation sequences over the QAM constellation IEEE Trans. Inf. Theory vol.54 no.2 pp Feb [14] F.X. Zeng Z.Y. Zhang 16-QAM sequences with zero correlation zone from the known quadriphase ZCZ sequences IEICE Trans. Fundamentals vol.e94-a no.3 pp March [15] C.V. Chong R. Venkataramani V. Tarokh A new construction of 16-QAM Golay complementary sequences IEEE Trans. Inf. Theory vol.49 no.11 pp Nov [16] S. Boztas U. Parampalli Nonbinary sequences with perfect nearly perfect autocorrelations. Proc. of IEEE ISIT2010 pp Austin Texas U.S.A. June [17] D.C. Chu Polyphase codes with good periodic correlation properties IEEE Trans. Inf. Theory vol.18 no.4 pp July [18] R.L. Frank S.A. Zadoff Phase shift pulse codes with good periodic correlation properties IRE Trans. Inf. Theory (Corresp.) vol.it-8 pp Oct [19] F.X. Zeng New perfect polyphase sequences mutually orthogonal ZCZ polyphase sequence sets IEICE Trans. Fundamentals vol.e92-a no.7 pp July [20] B. Tarokh H.R. Sadjadpour Construction of OFDM-QAM sequences with low peak to average power ratio IEEE Trans. Commun. vol.51 no.1 pp Jan [21] G. Garg P.V. Kumar C.E. Veni Madhavan Low correlation interleaved QAM sequences Proc. IEEE ISIT2008 pp Toronto Canada July 2008.
New Polyphase Complementary Sequence Sets for Wireless Communication Systems
Vol.7 o. (04) pp.47-56 http://dx.doi.org/0.457/ijhit.04.7.. ew Polyphase Complementary Sequence Sets for Wireless Communication Systems Fanxin Zeng Xiaoping Zeng Zhenyu Zhang and Guixin Xuan Chongqing
More informationEven Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions
Even Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions Yang Yang 1,2,3 Xiaohu Tang 1 and Guang Gong 2 1 Institute of Mobile Communications, Southwest Jiaotong University
More informationLarge Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences
Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences Guang Gong 1 Fei Huo 1 and Yang Yang 2,3 1 Department of Electrical and Computer Engineering University of
More informationQuaternary Golay sequence pairs II: Odd length
Quaternary Golay sequence pairs II: Odd length Richard G. Gibson and Jonathan Jedwab 11 August 2009 (revised 9 July 2010) Abstract A 4-phase Golay sequence pair of length s 5 (mod 8) is constructed from
More informationConstructions of Complementary Sequences for Power-Controlled OFDM Transmission
Constructions of Complementary Sequences for Power-Controlled OFDM Transmission Kai-Uwe Schmidt and Adolf Finger Communications Laboratory Technische Universität Dresden 0106 Dresden, Germany schmidtk@ifn.et.tu-dresden.de
More informationIdentify More Non-Golay Complementary Sequences for OFDM with Low PMEPR Using Multi-dimensional Root Pairs
Identify More Non-Golay Complementary Sequences for OFDM with Low PMEPR Using Multi-dimensional Root Pairs Yajun Wang Cheng Zhao Wen Chen and Jun Li Department of Electronic Engineering Shanghai Jiaotong
More informationNew quaternary sequences of even length with optimal auto-correlation
. RESEARCH PAPER. SCIENCE CHINA Information Sciences February 2018, Vol. 61 022308:1 022308:13 doi: 10.1007/s11432-016-9087-2 New quaternary sequences of even length with optimal auto-correlation Wei SU
More informationOn the Cross-Correlation of a p-ary m-sequence of Period p 2m 1 and Its Decimated
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 3, MARCH 01 1873 On the Cross-Correlation of a p-ary m-sequence of Period p m 1 Its Decimated Sequences by (p m +1) =(p +1) Sung-Tai Choi, Taehyung Lim,
More informationResearch Article Z-Complementary Sets Based on Sequences with Periodic and Aperiodic Zero Correlation Zone
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 29, Article ID 4826, 9 pages doi:/29/4826 Research Article Z-Complementary Sets Based on Sequences with Periodic
More informationFULL rate and full diversity codes for the coherent
1432 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 4, APRIL 2005 The Golden Code: A 2 2 Full-Rate Space Time Code With Nonvanishing Determinants Jean-Claude Belfiore, Member, IEEE, Ghaya Rekaya,
More informationA Framework for the Construction of Golay Sequences
1 A Framework for the Construction of Golay Sequences Frank Fiedler, Jonathan Jedwab, and Matthew G Parker Abstract In 1999 Davis and Jedwab gave an explicit algebraic normal form for m! h(m+) ordered
More informationCorrelation of Binary Sequence Families Derived from Multiplicative Character of Finite Fields
Correlation of Binary Sequence Families Derived from Multiplicative Character of Finite Fields Zilong Wang and Guang Gong Department of Electrical and Computer Engineering, University of Waterloo Waterloo,
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU Nanyang Technological University Library Singapore. Title 16-QAM Almost-Complementary Sequences With Low PMEPR Authors Liu Zilong; Guan Yong Liang Citation Liu Z.
More informationDOPPLER RESILIENT GOLAY COMPLEMENTARY PAIRS FOR RADAR
DOPPLER RESILIENT GOLAY COMPLEMENTARY PAIRS FOR RADAR Ali Pezeshki 1, Robert Calderbank 1, Stephen D. Howard 2, and William Moran 3 1 Princeton University, Princeton, NJ 8544, USA 2 DSTO, Edinburgh 51,
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationLow Correlation Zone Sequences
Low Correlation Zone Sequences Jung-Soo Chung and Jong-Seon No Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul 151-744,
More informationA construction of binary Golay sequence pairs from odd-length Barker sequences
A construction of binary Golay sequence pairs from odd-length Barker sequences Jonathan Jedwab Matthew G. Parker 12 September 2008 (revised 20 January 2009) Abstract Binary Golay sequence pairs exist for
More informationAdaptive beamforming for uniform linear arrays with unknown mutual coupling. IEEE Antennas and Wireless Propagation Letters.
Title Adaptive beamforming for uniform linear arrays with unknown mutual coupling Author(s) Liao, B; Chan, SC Citation IEEE Antennas And Wireless Propagation Letters, 2012, v. 11, p. 464-467 Issued Date
More informationBinary construction of quantum codes of minimum distances five and six
Discrete Mathematics 308 2008) 1603 1611 www.elsevier.com/locate/disc Binary construction of quantum codes of minimum distances five and six Ruihu Li a, ueliang Li b a Department of Applied Mathematics
More informationClosed Form Designs of Complex Orthogonal. Space-Time Block Codes of Rates (k + 1)=(2k) for
Closed Form Designs of Complex Orthogonal Space-Time Block Codes of Rates (k + 1)(k) for k 1 or k Transmit Antennas Kejie Lu, Shengli Fu, Xiang-Gen Xia Abstract In this correspondence, we present a systematic
More informationMaximum Distance Separable Symbol-Pair Codes
2012 IEEE International Symposium on Information Theory Proceedings Maximum Distance Separable Symbol-Pair Codes Yeow Meng Chee, Han Mao Kiah, and Chengmin Wang School of Physical and Mathematical Sciences,
More informationConstellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 8, AUGUST /$ IEEE
IEEE TRANSACTIONS ON INFORATION THEORY, VOL. 52, NO. 8, AUGUST 2006 3817 Now, define S1 as S1 = 1 t! and t! t! 51;i ~ S15 T 1;i. Then, S1;mm = 1 ~S1 (m); (m) = 1 t1! t1 tr( S1) ~ (33) t! S1;mn = 1 ~S1
More informationLow Correlation Sequences for CDMA
Indian Institute of Science, Bangalore International Networking and Communications Conference Lahore University of Management Sciences Acknowledgement Prof. Zartash Afzal Uzmi, Lahore University of Management
More informationON THE EXISTENCE OF APERIODIC COMPLEMENTARY HEXAGONAL LATTICE ARRAYS
ON THE EXISTENCE OF APERIODIC COMPLEMENTARY HEXAGONAL LATTICE ARRAYS YIN TAN AND GUANG GONG Abstract. Binary (periodic aperiodic complementary sequences have been studied extensively due to their wide
More informationWavelength Isolation Sequence Pairs
Wavelength Isolation Sequence Pairs Jonathan Jedwab and Jane Wodlinger Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC, V5A S6, Canada {jed, jwodling}@sfu.ca 9 January
More informationConstructions of Quadratic Bent Functions in Polynomial Forms
1 Constructions of Quadratic Bent Functions in Polynomial Forms Nam Yul Yu and Guang Gong Member IEEE Department of Electrical and Computer Engineering University of Waterloo CANADA Abstract In this correspondence
More informationPower Spectral Density of Digital Modulation Schemes
Digital Communication, Continuation Course Power Spectral Density of Digital Modulation Schemes Mikael Olofsson Emil Björnson Department of Electrical Engineering ISY) Linköping University, SE-581 83 Linköping,
More informationREFERENCES. A Sharpened Dynamic Range of a Generalized Chinese Remainder Theorem for Multiple Integers
428 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 1, JANUARY 2007 ACKNOWLEDGMENT The authors wish to thank the reviewers for their helpful suggestions. REFERENCES [1] J. Proakis, Digital Communications.
More informationConstruction of Frequency Hopping Sequence Set Based upon. Generalized Cyclotomy
1 Construction of Frequency Hopping Sequence Set Based upon Generalized Cyclotomy Fang Liu, Daiyuan Peng, Zhengchun Zhou, and Xiaohu Tang Abstract: Frequency hopping (FH) sequences play a key role in frequency
More informationInteger Maxima in Power Envelopes of Golay Codewords
1 Integer Maxima in Power Envelopes of Golay Codewords Michael W. Cammarano and Meredith L. Walker April 6, 1999 Abstract This paper examines the distribution of integer peaks amoung Golay cosets in Z
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More informationConstruction of Barnes-Wall Lattices from Linear Codes over Rings
01 IEEE International Symposium on Information Theory Proceedings Construction of Barnes-Wall Lattices from Linear Codes over Rings J Harshan Dept of ECSE, Monh University Clayton, Australia Email:harshanjagadeesh@monhedu
More informationDesign of Pseudo-Random Spreading Sequences for CDMA Systems
Design of Pseudo-Random Spreading Sequences for CDMA Systems Jian Ren and Tongtong Li Department of Electrical and Computer Engineering Michigan State University, 2120 Engineering Building East Lansing,
More informationOn the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels
On the Performance of 1 Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels arxiv:0711.1295v1 [cs.it] 8 Nov 2007 Emanuele Viterbo and Yi Hong Abstract The Golden space-time trellis
More informationFast Algebraic Immunity of 2 m + 2 & 2 m + 3 variables Majority Function
Fast Algebraic Immunity of 2 m + 2 & 2 m + 3 variables Majority Function Yindong Chen a,, Fei Guo a, Liu Zhang a a College of Engineering, Shantou University, Shantou 515063, China Abstract Boolean functions
More informationSome results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences
Some results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences A joint work with Chunlei Li, Xiangyong Zeng, and Tor Helleseth Selmer Center, University of Bergen
More informationIN THIS PAPER, we consider a class of continuous-time recurrent
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 51, NO. 4, APRIL 2004 161 Global Output Convergence of a Class of Continuous-Time Recurrent Neural Networks With Time-Varying Thresholds
More informationA High-Speed Realization of Chinese Remainder Theorem
Proceedings of the 2007 WSEAS Int. Conference on Circuits, Systems, Signal and Telecommunications, Gold Coast, Australia, January 17-19, 2007 97 A High-Speed Realization of Chinese Remainder Theorem Shuangching
More informationA Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing
IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 12, NO. 5, SEPTEMBER 2001 1215 A Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing Da-Zheng Feng, Zheng Bao, Xian-Da Zhang
More informationOnamethodtoimprove correlation properties of orthogonal polyphase spreading sequences
Regular paper Onamethodtoimprove correlation properties of orthogonal polyphase spreading sequences Beata J. Wysocki and Tadeusz A. Wysocki Abstract In this paper, we propose a simple but efficient method
More informationPERIODIC TIME SPREAD PULSE SIGNALS WITH PERFECT AUTOCORRELATION
PERIODIC TIME SPREAD PULSE SIGNALS WITH PERFECT AUTOCORRELATION A. V. Titov 1 and G. J. Kazmierczak 2 1 Electro Technical University LETI in St. Petersburg, Russia 2 Cybersecurity Consultant, Princeton,
More informationDIFFERENTIAL cryptanalysis is the first statistical attack
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 12, DECEMBER 2011 8127 Differential Properties of x x 2t 1 Céline Blondeau, Anne Canteaut, Pascale Charpin Abstract We provide an extensive study of
More informationComputational Complexity of Decoding Orthogonal Space-Time Block Codes
936 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 4, APRIL 2011 Computational Complexity of Decoding Orthogonal Space-Time Block Codes Ender Ayanoglu, Fellow, IEEE, Erik G. Larsson, Senior Member,
More informationA construction of optimal sets of FH sequences
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 50 2011, Pages 37 44 A construction of optimal sets of FH sequences Bin Wen Department of Mathematics Changshu Institute of Technology Changshu 215500, Jiangsu
More informationNOMA: Principles and Recent Results
NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve
More informationComplete characterization of generalized bent and 2 k -bent Boolean functions
Complete characterization of generalized bent and k -bent Boolean functions Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng 1 Abstract In this paper we investigate properties of generalized bent Boolean
More informationIN this paper, we consider the capacity of sticky channels, a
72 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 1, JANUARY 2008 Capacity Bounds for Sticky Channels Michael Mitzenmacher, Member, IEEE Abstract The capacity of sticky channels, a subclass of insertion
More informationOn non-antipodal binary completely regular codes
On non-antipodal binary completely regular codes J. Borges, J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Bellaterra, Spain. V.A. Zinoviev Institute
More informationConstruction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor
Construction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor Pravin Salunkhe, Prof D.P Rathod Department of Electrical Engineering, Veermata Jijabai
More informationConstructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,
More informationA Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
2558 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 48, NO 9, SEPTEMBER 2002 A Generalized Uncertainty Principle Sparse Representation in Pairs of Bases Michael Elad Alfred M Bruckstein Abstract An elementary
More informationThere are no Barker arrays having more than two dimensions
There are no Barker arrays having more than two dimensions Jonathan Jedwab Matthew G. Parker 5 June 2006 (revised 7 December 2006) Abstract Davis, Jedwab and Smith recently proved that there are no 2-dimensional
More informationBinary Convolutional Codes of High Rate Øyvind Ytrehus
Binary Convolutional Codes of High Rate Øyvind Ytrehus Abstract The function N(r; ; d free ), defined as the maximum n such that there exists a binary convolutional code of block length n, dimension n
More informationNew binary self-dual codes of lengths 50 to 60
Designs, Codes and Cryptography manuscript No. (will be inserted by the editor) New binary self-dual codes of lengths 50 to 60 Nikolay Yankov Moon Ho Lee Received: date / Accepted: date Abstract Using
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Finite nilpotent metacyclic groups never violate the Ingleton inequality Author(s) Stancu, Radu; Oggier,
More informationConstructing c-ary Perfect Factors
Constructing c-ary Perfect Factors Chris J. Mitchell Computer Science Department Royal Holloway University of London Egham Hill Egham Surrey TW20 0EX England. Tel.: +44 784 443423 Fax: +44 784 443420 Email:
More informationDigital Communications: A Discrete-Time Approach M. Rice. Errata. Page xiii, first paragraph, bare witness should be bear witness
Digital Communications: A Discrete-Time Approach M. Rice Errata Foreword Page xiii, first paragraph, bare witness should be bear witness Page xxi, last paragraph, You know who you. should be You know who
More informationNew Ternary and Quaternary Sequences with Two-Level Autocorrelation
New Ternary and Quaternary Sequences with Two-Level Autocorrelation Honggang Hu Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1, Canada Email. h7hu@uwaterloo.ca
More informationOn the Construction and Decoding of Cyclic LDPC Codes
On the Construction and Decoding of Cyclic LDPC Codes Chao Chen Joint work with Prof. Baoming Bai from Xidian University April 30, 2014 Outline 1. Introduction 2. Construction based on Idempotents and
More informationChapter 7 Reed Solomon Codes and Binary Transmission
Chapter 7 Reed Solomon Codes and Binary Transmission 7.1 Introduction Reed Solomon codes named after Reed and Solomon [9] following their publication in 1960 have been used together with hard decision
More informationTomáš Madaras Congruence classes
Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition
More informationA Class of Pseudonoise Sequences over GF Correlation Zone
1644 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY 2001 b 1. The index set I must be of the form I A [ B [ C where A f1g B fz 1j z 2 C 0; z 12 C 0g and C f0z j z 2 C 1; z 12 C 1g: Observe
More informationII. THE TWO-WAY TWO-RELAY CHANNEL
An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable
More informationTiming errors in distributed space-time communications
Timing errors in distributed space-time communications Emanuele Viterbo Dipartimento di Elettronica Politecnico di Torino Torino, Italy viterbo@polito.it Yi Hong Institute for Telecom. Research University
More informationEdge-pancyclicity of Möbius cubes
Information Processing Letters 96 (25) 136 14 www.elsevier.com/locate/ipl Edge-pancyclicity of Möbius cubes Min Xu a,b, Jun-Ming Xu b, a Institute of Applied Mathematics, Academy of Mathematics and Systems
More informationAlmost Difference Sets and Their Sequences With Optimal Autocorrelation
2934 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 7, NOVEMBER 2001 Almost Difference Sets Their Sequences With Optimal Autocorrelation K. T. Arasu, Cunsheng Ding, Member, IEEE, Tor Helleseth,
More informationDesign of Stable IIR filters with prescribed flatness and approximately linear phase
Design of Stable IIR filters with prescribed flatness and approximately linear phase YASUNORI SUGITA Nagaoka University of Technology Dept. of Electrical Engineering Nagaoka city, Niigata-pref., JAPAN
More informationNew Polyphase Sequence Families with Low Correlation Derived from the Weil Bound of Exponential Sums
New Polyphase Sequence Families with Low Correlation Derived from the Weil Bound of Exponential Sums Zilong Wang 1, Guang Gong 1 and Nam Yul Yu 1 Department of Electrical and Computer Engineering, University
More informationMulti-colouring the Mycielskian of Graphs
Multi-colouring the Mycielskian of Graphs Wensong Lin Daphne Der-Fen Liu Xuding Zhu December 1, 016 Abstract A k-fold colouring of a graph is a function that assigns to each vertex a set of k colours,
More informationPAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
359 PAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes Ching-Lung CHR a),szu-linsu, Members, and Shao-Wei WU, Nonmember SUMMARY A low-complexity step-by-step decoding algorithm
More informationComputation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems
Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Department of Electrical Engineering, College of Engineering, Basrah University Basrah Iraq,
More information1 Introduction A one-dimensional burst error of length t is a set of errors that are conned to t consecutive locations [14]. In this paper, we general
Interleaving Schemes for Multidimensional Cluster Errors Mario Blaum IBM Research Division 650 Harry Road San Jose, CA 9510, USA blaum@almaden.ibm.com Jehoshua Bruck California Institute of Technology
More informationDirect Matrix Synthesis for In-Line Diplexers with Transmission Zeros Generated by Frequency Variant Couplings
Progress In Electromagnetics Research Letters, Vol. 78, 45 52, 2018 Direct Matrix Synthesis for In-Line Diplexers with Transmission Zeros Generated by Frequency Variant Couplings Yong-Liang Zhang1, 2,
More informationIntercarrier and Intersymbol Interference Analysis of OFDM Systems on Time-Varying channels
Intercarrier and Intersymbol Interference Analysis of OFDM Systems on Time-Varying channels Van Duc Nguyen, Hans-Peter Kuchenbecker University of Hannover, Institut für Allgemeine Nachrichtentechnik Appelstr.
More informationFast Near-Optimal Energy Allocation for Multimedia Loading on Multicarrier Systems
Fast Near-Optimal Energy Allocation for Multimedia Loading on Multicarrier Systems Michael A. Enright and C.-C. Jay Kuo Department of Electrical Engineering and Signal and Image Processing Institute University
More informationCharacter Sums and Polyphase Sequence Families with Low Correlation, DFT and Ambiguity
Character Sums and Polyphase Sequence Families with Low Correlation, DFT and Ambiguity Guang Gong Department of Electrical and Computer Engineering University of Waterloo, Waterloo, Ontario, Canada Email:
More informationClosed-Form Design of Maximally Flat IIR Half-Band Filters
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL. 49, NO. 6, JUNE 2002 409 Closed-Form Design of Maximally Flat IIR Half-B Filters Xi Zhang, Senior Member, IEEE,
More informationAn Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission
An Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission P.Mozhiarasi, C.Gayathri, V.Deepan Master of Engineering, VLSI design, Sri Eshwar College of Engineering, Coimbatore- 641 202,
More informationPolynomial Residue Systems via Unitary Transforms Matthew G. Parker
Polynomial Residue Systems via Unitary Transforms Matthew G. Parker Selmer Centre, Inst. for Informatikk, Høyteknologisenteret i Bergen, University of Bergen, Bergen 500, Norway Email: matthew@ii.uib.no
More informationNew chaotic binary sequences with good correlation property using logistic maps
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735. Volume 5, Issue 3 (Mar. - Apr. 013), PP 59-64 New chaotic binary with good correlation property using
More informationOn Boolean functions which are bent and negabent
On Boolean functions which are bent and negabent Matthew G. Parker 1 and Alexander Pott 2 1 The Selmer Center, Department of Informatics, University of Bergen, N-5020 Bergen, Norway 2 Institute for Algebra
More informationOptimal Decentralized Control of Coupled Subsystems With Control Sharing
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 58, NO. 9, SEPTEMBER 2013 2377 Optimal Decentralized Control of Coupled Subsystems With Control Sharing Aditya Mahajan, Member, IEEE Abstract Subsystems that
More informationA UNIFIED APPROACH TO FOURIER-CLIFFORD-PROMETHEUS SEQUENCES, TRANSFORMS AND FILTER BANKS
A UNIFIED APPROACH TO FOURIER-CLIFFORD-PROMETHEUS SEQUENCES, TRANSFORMS AND FILTER BANKS Ekaterina L.-Rundblad, Valeriy Labunets, and Ilya Nikitin Ural State Technical University Ekaterinburg, Russia lab@rtf.ustu.ru
More informationOn the Concentration of the Crest Factor for OFDM Signals
On the Concentration of the Crest Factor for OFDM Signals Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology, Haifa 3, Israel E-mail: sason@eetechnionacil Abstract
More informationCome on Down! An Invitation to Barker Polynomials
Come on Down! An Invitation to Barker Polynomials 5.0 4.5 4.0 3.5 I c e r m 3.0 2.5 0.0 0.1 0.2 0.3 0.4 0.5 Michael Mossinghoff Davidson College Introduction to Topics Summer@ICERM 2014 Brown University
More informationUpper Bounds on the Capacity of Binary Intermittent Communication
Upper Bounds on the Capacity of Binary Intermittent Communication Mostafa Khoshnevisan and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame, Indiana 46556 Email:{mhoshne,
More informationOn the Amicability of Orthogonal Designs
On the Amicability of Orthogonal Designs W. H. Holzmann and H. Kharaghani Department of Mathematics & Computer Science University of Lethbridge Lethbridge, Alberta, T1K 3M4 Canada email: holzmann@uleth.ca,
More informationA Comparison of Two Achievable Rate Regions for the Interference Channel
A Comparison of Two Achievable Rate Regions for the Interference Channel Hon-Fah Chong, Mehul Motani, and Hari Krishna Garg Electrical & Computer Engineering National University of Singapore Email: {g030596,motani,eleghk}@nus.edu.sg
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA September 2008 Outline of this talk Difference sets and almost difference sets Cyclotomic classes Introduction of binary sequences with optimal autocorrelation
More informationn WEAK AMENABILITY FOR LAU PRODUCT OF BANACH ALGEBRAS
U.P.B. Sci. Bull., Series A, Vol. 77, Iss. 4, 2015 ISSN 1223-7027 n WEAK AMENABILITY FOR LAU PRODUCT OF BANACH ALGEBRAS H. R. Ebrahimi Vishki 1 and A. R. Khoddami 2 Given Banach algebras A and B, let θ
More informationNFA and regex. the Boolean algebra of languages. regular expressions. Informatics 1 School of Informatics, University of Edinburgh
NFA and regex cl the Boolean algebra of languages regular expressions Informatics The intersection of two regular languages is regular L = even numbers L = odd numbers L = mod L = mod Informatics The intersection
More informationAn Application of Coding Theory into Experimental Design Construction Methods for Unequal Orthogonal Arrays
The 2006 International Seminar of E-commerce Academic and Application Research Tainan, Taiwan, R.O.C, March 1-2, 2006 An Application of Coding Theory into Experimental Design Construction Methods for Unequal
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationOptical time-domain differentiation based on intensive differential group delay
Optical time-domain differentiation based on intensive differential group delay Li Zheng-Yong( ), Yu Xiang-Zhi( ), and Wu Chong-Qing( ) Key Laboratory of Luminescence and Optical Information of the Ministry
More informationTernary Zero Correlation Zone Sequence Sets for Asynchronous DS-CDMA
Communications and Network, 4, 6, 9-7 Published Online November 4 in SciRes. http://www.scirp.org/ournal/cn http://dx.doi.org/.436/cn.4.643 ernary Zero Correlation Zone Sequence Sets for Asynchronous DS-CDMA
More informationSome New Optimal Ternary Linear Codes
Designs, Codes and Cryptography, 12, 5 11 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Some New Optimal Ternary Linear Codes ILIYA BOUKLIEV* Institute of Mathematics,
More informationRadio Number for Square of Cycles
Radio Number for Square of Cycles Daphne Der-Fen Liu Melanie Xie Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003, USA August 30, 00 Abstract Let G be a connected
More informationThese outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n
Binary Codes for synchronous DS-CDMA Stefan Bruck, Ulrich Sorger Institute for Network- and Signal Theory Darmstadt University of Technology Merckstr. 25, 6428 Darmstadt, Germany Tel.: 49 65 629, Fax:
More informationTrace Representation of Legendre Sequences
C Designs, Codes and Cryptography, 24, 343 348, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Trace Representation of Legendre Sequences JEONG-HEON KIM School of Electrical and
More information