JPH07143110A - Communication system using pseudo period series - Google Patents

Communication system using pseudo period series

Info

Publication number
JPH07143110A
JPH07143110A JP14403393A JP14403393A JPH07143110A JP H07143110 A JPH07143110 A JP H07143110A JP 14403393 A JP14403393 A JP 14403393A JP 14403393 A JP14403393 A JP 14403393A JP H07143110 A JPH07143110 A JP H07143110A
Authority
JP
Japan
Prior art keywords
length
signal
periodic
sequence
communication system
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
JP14403393A
Other languages
Japanese (ja)
Other versions
JP3111411B2 (en
Inventor
Naoki Suehiro
直樹 末広
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
DAIEI ELECTRON KK
Original Assignee
DAIEI ELECTRON KK
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=15352766&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=JPH07143110(A) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by DAIEI ELECTRON KK filed Critical DAIEI ELECTRON KK
Priority to JP14403393A priority Critical patent/JP3111411B2/en
Publication of JPH07143110A publication Critical patent/JPH07143110A/en
Application granted granted Critical
Publication of JP3111411B2 publication Critical patent/JP3111411B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Abstract

PURPOSE:To provide a communication system using a pseudo period series in which the reception signal similar to the input of an infinite length period series is obtained from the input signal of the period series of a finite length. CONSTITUTION:Let information to be transmitted be (b), then the information (b) is received through a matching filter with respect to a signal (a0, a1,..., aN-1) whose length is N which receives a transmission signal (an-L, aN-1, a0,..., aL-1) whose length is N+2L.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は、移動体通信方式等に適
合する通信方式にかかり、特に周期系列として設計され
ている信号を近似同期状態で使用できるようにした擬周
期系列を用いた通信方式に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a communication system suitable for a mobile communication system and the like, and particularly, a communication using a pseudo-periodic sequence which enables a signal designed as a periodic sequence to be used in an approximately synchronized state. Regarding the scheme.

【0002】[0002]

【従来の技術】セルラー無線通信システムとして知られ
ている移動体通信などのように、端局に対する距離が変
化する移動局の間で通信を行うシステムにおいては、周
期系列の信号を用いている。なお、現在は上記の通信シ
ステムは、アナログの周波数多重あるいは時分割多重変
調方式を使用しているが、将来的にはデジタルの符号分
割多元接続方式などのデジタル符号分割通信方式が採用
されることが確実視されている。
2. Description of the Related Art Periodic signals are used in a system for communicating between mobile stations whose distance to a terminal station changes, such as mobile communication known as a cellular radio communication system. At present, the above communication system uses an analog frequency division multiplexing or time division multiplexing modulation method, but in the future a digital code division communication method such as a digital code division multiple access method will be adopted. Is certainly seen.

【0003】この種の符号分割多重通信のための信号設
計は、周期系列の方が設計し易いことが知られており、
例えば1985年、Computer Science
Press社発行、M.K.Simon,J.K.O
mura,R.A.Scholtz,B.K.Levi
tt 著、”Spread Spectrum Com
munications”に解説されている。
It is known that a periodic sequence is easier to design in signal design for this kind of code division multiplex communication.
For example, 1985, Computer Science
Published by Press, M.I. K. Simon, J .; K. O
mura, R.M. A. Scholtz, B .; K. Levi
tt, "Spread Spectrum Com"
"Munications".

【0004】[0004]

【発明が解決しようとする課題】この種のスペクトラム
拡散通信方式には、常識的には、自己相関にサイドロー
ブのない周期系列を用いる。例えば、周期系列・・・・
・1,1,1,−1,1,1,1,−1,1,1,1,
−1,・・・・、(1,1,1,−1は1周期)を、そ
の整合フィルタに入力すると、・・・・・0,4,0,
0,0,4,0,0,0,4,0,・・・・・という綺
麗な出力が得られる。
Commonly used for this type of spread spectrum communication system is a periodic sequence with no side lobes in the autocorrelation. For example, a periodic series ...
・ 1,1,1, -1,1,1,1, -1,1,1,1,
When -1, ..., (1, 1, 1, -1 is 1 cycle) is input to the matched filter, ..., 0, 4, 0,
A beautiful output of 0,0,4,0,0,0,4,0, ... Is obtained.

【0005】ところが、この周期系列の1周期(1,
1,1,−1)を上記の整合フィルタに入力すると、
(−1,0,1,4,1,0,−1)というきたない出
力になってしまう。すなわち、無限長周期系列の入力に
対しては所望の受信出力が得られるが、有限長の入力に
対しては所望の出力とは異なる出力が得られる。
However, one cycle (1,
1,1, -1) is input to the above matched filter,
The output becomes (-1, 0, 1, 4, 1, 0, -1), which is messy. That is, a desired reception output is obtained for an input of an infinite length period sequence, but an output different from the desired output is obtained for an input of finite length.

【0006】本発明の目的は、有限長の周期系列の入力
信号に対しても無限長周期系列の入力と同様な受信信号
を得ることのできる信号方式とした擬周期系列を用いた
通信方式を提供することにある。
An object of the present invention is to provide a communication system using a quasi-periodic sequence which is a signal system capable of obtaining a received signal similar to the input of an infinite-length periodic sequence even for an input signal of a finite-length periodic sequence. To provide.

【0007】[0007]

【課題を解決するための手段】上記目的を達成するため
に、本発明は、伝送すべき情報をbとしたとき、b(a
N-L ,・・・,aN-1 ,a0 ,・・・,aN-1 ,a0
・・・,aL-1 )という長さN+2Lの信号を送信信号
とし、(a0 ,a1 ,・・・・,aN-1 )という長さN
の信号に対する整合フィルタを通して前記情報bを受信
することを特徴とする。
In order to achieve the above object, the present invention is such that when the information to be transmitted is b, b (a
NL , ..., a N-1 , a 0 , ..., a N-1 , a 0 ,
, A L-1 ) having a length N + 2L as a transmission signal, and having a length N (a 0 , a 1 , ..., A N-1 )
The information b is received through a matched filter for the signal of.

【0008】すなわち、前記周期系列の1周期(1,
1,1,−1)の前後に例えば長さ2の繰り返し部分を
付加した(1,−1,1,1,1,−1,1,1)を作
成する。付加する長さ2の繰り返し部分は、1周期の
(・・1,−1)の部分で、これを当該1周期の前に付
加し、1周期の(1,1・・・)の部分を当該1周期の
後に付加する。なお、この付加部分は最低1の長さであ
る。
That is, one period (1,
For example, (1, -1,1,1,1, -1, -1,1,1) in which a repeating portion having a length of 2 is added before and after (1,1, -1) is created. The repetitive part of the length 2 to be added is a part of one cycle (···· −1), which is added before the one cycle, and a part of one cycle (1,1 ···) is added. It is added after the one cycle. Note that this additional portion has a length of at least 1.

【0009】これを整合フィルタに入力すると、(−
1,2,−1,0,0,4,0,0,1,2,1)とい
う出力がえられ、中央の長さ5の部分(・・・0,0,
4,0,0・・・)は周期系列を入力したときと同じも
のとなる。この性質は、同期がある程度はとれるが完全
ではない符号分割多重通信システム(近似同期セルラー
CDMA等)に適合する。
When this is input to the matched filter, (-
The output of 1, 2, -1, 0, 0, 4, 0, 0, 1, 2, 1) is obtained, and the central portion of length 5 (... 0, 0,
4, 0, 0 ...) is the same as when the periodic sequence is input. This property is suitable for a code division multiplex communication system (such as an approximate synchronous cellular CDMA) that can be synchronized to some extent but is not perfect.

【0010】本発明は、さらに、次のように構成するこ
とができる。 (1)長さNの有限長系列をAとし、周期系列(・・・
・・A,A,A・・・・・)の一部分で、長さがNより
長くAをその中に含む系列をA’とし、A’に送信すべ
き情報を乗じた信号を送信信号として送信し、受信側で
Aの整合フィルタを備え、この整合フィルタに受信した
A’を通すことにより情報を得る。
The present invention can be further configured as follows. (1) Let A be a finite length sequence of length N, and let the periodic sequence (...
.. A, A, A, ...), which is a part of A, A, A ...), has a length longer than N and includes A in it is A ', and a signal obtained by multiplying A'by information to be transmitted is used as a transmission signal. Information is obtained by transmitting and providing a matched filter of A on the receiving side and passing the received A ′ through this matched filter.

【0011】 ・・・・・・,───A───,───A───,・・・・・・ │←─── A’───→│ (2)相互相関のないn個の周期系列 ・・・・A1 ,A1 ,A1 ,A1 ・・・・・ ・・・・A2 ,A2 ,A2 ,A2 ・・・・・ ・ ・ ・・・・Ai ,Ai ,Ai ,Ai ・・・・・ ・ ・ ・・・・An ,An ,An ,An ・・・・・ があるとき、送信局−受信局のi番目の組がAi ’を送
信すべき情報で変調した送信信号とし、受信側に設けた
i の整合フィルタで復調することで情報を得る。 (3)上記(1)(2)において、変調情報をa,bと
したとき、aA’とbA’を時間をずらして加算した信
号を送信信号とする。
・ ・ ・ ・, ───A───, ───A───, ・ ・ ・ ・ ・ │ ← ───A'─── → │ (2) Cross correlation There are no n periodic sequences ・ ・ ・ ・ A 1 , A 1 , A 1 , A 1・ ・ ・ ・ ・ ・ ・ A 2 , A 2 , A 2 , A 2・ ・ ・ ・ ・ ・··· A i , A i , A i , A i ········· A n , A n , A n , A n . The i-th set is a transmission signal obtained by modulating A i ′ with information to be transmitted, and information is obtained by demodulating with a matched filter of A i provided on the receiving side. (3) In the above (1) and (2), when the modulation information is a and b, a signal obtained by adding aA ′ and bA ′ with a time shift is used as a transmission signal.

【0012】[0012]

【作用】上記本発明の構成において、周期系列・・・・
・・,───A───,───A───,・・・・・・
として、その自己相関関数が特別の性質を持つように設
計された有限長系列Aを送信信号として、Aの整合フィ
ルタを受信器とすると、有限長系列Aの自己相関関数が
出力される。これは、周期系列・・・・A,A,A,・
・・・・の自己相関関数とは異なる性質を持つので、設
計どうりの効果がないという従来の問題点が次のように
して解決される。
In the above-mentioned configuration of the present invention, the periodic sequence ...
・ ・ 、 ───A─── 、 ───A─── 、 ・ ・ ・ ・ ・ ・
Assuming that the finite length sequence A designed so that its autocorrelation function has a special property is the transmission signal and the matched filter of A is the receiver, the autocorrelation function of the finite length sequence A is output. This is a periodic sequence ... A, A, A ,.
.. has a property different from that of the autocorrelation function, the conventional problem that there is no design-dependent effect is solved as follows.

【0013】 A=(a0,1,・・・・・aN-1 )、(長さN) A’=(aN-L,N-L+1,・・・・aN-1,0,1 ・・・
・aN-1,0,1 ・・・・aL-1 )、(長さN+2L) とすると、A’はAの後にAの前からL成分をつなぎ、
Aの前にAの後からL成分をつないだものになる。
A = (a 0, a 1, ... a N-1 ), (length N) A ′ = (a NL, a N-L + 1, ... A N-1 , a 0, a 1 ...
-A N-1, a 0, a 1 ... a L-1 ), (length N + 2L), A'connects the L component from before A after A,
The result is that the L component is connected before A and after A.

【0014】A’の整合フィルタにAを入力すると、出
力信号の長さは(2N+2L−1)となり、中央の長さ
(2L+1)の部分は、周期系列・・・・・・,───
A───,───A───,・・・・・・の自己相関関
数の性質を示す。同様のことが相互相関関数にも言え
る。相互相関のない周期系列は、次のようにして作るこ
とができる。
When A is input to the matched filter of A ', the length of the output signal becomes (2N + 2L-1), and the central portion (2L + 1) has a periodic sequence ...
The characteristics of the autocorrelation function of A───, ───A───, ... The same applies to the cross-correlation function. A periodic sequence with no cross correlation can be created as follows.

【0015】すなわち、周期系列・・・・a1 ・・・・
N 1 ・・・・aN ・・・・を、 のように、巡回行列として表記する。
That is, the periodic sequence ... A 1 ...
a a N a 1 ···· a N ···· , , It is written as a cyclic matrix.

【0016】周期系列は、その1周期を巡回して正方行
列の各行とし、そのノルムを正規化することにより巡回
正規行列として表記することができる。この表記法によ
って、直交系列はユニタリ行列として、また多相周期系
列は多相行列として表記される。ところで、周知のよう
に、巡回たたみ込みは巡回行列で表されるが、また、フ
ーリエ変換された領域での乗算とも考えることができ
る。したがって、いま、ある巡回行列をAとし、Aのあ
る1行をフーリエ変換して得られる系列を対角成分とす
る対角行列をBとすると、 A=F-1BF ・・・・(1) となる。ただし、FはDFT行列である。
A periodic sequence can be expressed as a cyclic normal matrix by cyclically cycling through one period to form each row of a square matrix and normalizing the norm. By this notation, orthogonal sequences are represented as unitary matrices, and polyphase periodic sequences are represented as polyphase matrices. By the way, as is well known, the cyclic convolution is expressed by a cyclic matrix, but it can also be considered as multiplication in a Fourier transformed region. Therefore, assuming that a certain cyclic matrix is A and a diagonal matrix having a sequence obtained by Fourier transforming one row of A as a diagonal component is B, A = F −1 BF (...) ). However, F is a DFT matrix.

【0017】もし、Aがユニタリ行列であれば、式
(1)より対角行列Bもユニタリ行列でなければならな
い。すなわち、Bの対角成分の絶対値は1でなければな
らない。したがって、直交系列をフーリエ変換すると多
相周期系列となる。また、Bの対角成分の絶対値が1な
らば、Aはユニタリ行列となるから、多相周期系列を逆
フーリエ変換すると、直交系列となる。
If A is a unitary matrix, the diagonal matrix B must also be a unitary matrix according to equation (1). That is, the absolute value of the diagonal component of B must be 1. Therefore, Fourier transform of the orthogonal sequence results in a polyphase periodic sequence. Further, if the absolute value of the diagonal component of B is 1, A becomes a unitary matrix, so if the inverse Fourier transform of the polyphase periodic series is performed, it becomes an orthogonal series.

【0018】時間軸を逆転して考えれば、多相周期系列
をフーリエ変換すれば多相周期系列となる。次に、相互
相関のない多相周期系列について説明する。いま、2個
の周期系列があって、それぞれ巡回行列A,Cによって
表されているとき、 A=F-1BF C=F-1DF という関係にある対角行列B,Dが存在する。
When the time axis is reversed and considered, the polyphase periodic series is Fourier transformed to form a polyphase periodic series. Next, a polyphase periodic sequence having no cross correlation will be described. Now, when there are two periodic sequences and they are represented by cyclic matrices A and C, respectively, there are diagonal matrices B and D having a relationship of A = F −1 BF C = F −1 DF.

【0019】AとCの相互相関関数は A・C* =F-1BD*F として表されるから、対角行列BD*のすべての対角成
分が0であれば、AとCで表される2個の周期系列の相
互相関関数は、すべてのシフトで0となる。この条件
は、AとCで表される2個の周期系列のスペクトルが重
なり合わない、と言い換えることができる。ただし、C
* はCの随伴行列(成分を転置して複素共役にした行
列)である。
Since the cross-correlation function of A and C is expressed as A * C * = F -1 BD * F, if all the diagonal elements of the diagonal matrix BD * are 0, then they are expressed by A and C. The cross-correlation function of the two periodic sequences is 0 at all shifts. This condition can be restated as that the spectra of the two periodic sequences represented by A and C do not overlap. However, C
* Is an adjoint matrix of C (a matrix in which the components are transposed into a complex conjugate).

【0020】例えば、(1,0,1,0,1,0,−
1,0)と(0,1,0,1,0,1,0,−1)のよ
うに各成分の積が0となるような複数の直交系列を周波
数領域に設定し、これらを逆フーリエ変換すると、時間
領域に成分の絶対値が一定で相互相関関数があらゆるシ
フトで0となる複数の周期系列が得られる。
For example, (1,0,1,0,1,0,-
1,0) and (0,1,0,1,0,1,0, -1) such that multiple orthogonal sequences such that the product of each component is 0 are set in the frequency domain and these are inverted. The Fourier transform yields a plurality of periodic sequences in which the absolute value of the component is constant in the time domain and the cross-correlation function is 0 at every shift.

【0021】N次離散フーリエ変換行列を FN =[fN (i,j)],0≦i≦N−1, 0≦j≦N−1, fN ((i,j)=(1/√N)exp{(−2π√−1)・ij/N)} とすると、 となるが、上例の2個の直交系列と8次離散逆フーリエ
変換により、 ただし、 WN =exp{(2π√−1)/N} とする。
The Nth-order discrete Fourier transform matrix is F N = [f N (i, j)], 0 ≦ i ≦ N−1, 0 ≦ j ≦ N−1, f N ((i, j) = (1 / √N) exp {(-2π√-1) · ij / N)} However, by the two orthogonal sequences in the above example and the 8th order discrete inverse Fourier transform, However, W N = exp {(2π√-1) / N}.

【0022】先に述べたように、式(2)の右辺の2列
のそれぞれを繰り返して得られる2個の周期系列の相互
相関関数は、あらゆるシフトで0となるはずである。一
方、この2個の周期系列の自己相関関数は、それぞれ0
シフト成分を1に正規化すると (1,0,0,0,1,0,0,0) および (1,0,0,0,−1,0,0,0) である。
As described above, the cross-correlation function of two periodic sequences obtained by repeating each of the two columns on the right side of the equation (2) should be 0 at every shift. On the other hand, the autocorrelation functions of these two periodic sequences are 0
When the shift component is normalized to 1, it is (1,0,0,0,1,0,0,0) and (1,0,0,0, -1,0,0,0).

【0023】これは、F6 -1のjが偶数なる成分(j=
0,2,4,6)は周期4の繰り返しとなっているのに
対し、jが奇数なる成分は、 0≦i≦3 なる成分に
−1を乗じると、 4≦i≦7 なる成分が得られるた
めである。同様に、一般に周期MNのM個の直交系列が
あって、これらのM個の直交系列から適当な1周期を取
り出してM個の有限長系列とし、これらM個の有限長系
列のうちの任意の2個の有限長系列の対応する成分の積
を0にできるとき、これらのM個の有限長系列をMN次
逆フーリエ変換することにより、M個の多相有限長系列
が得られ、これらM個の有限長系列をそれぞれ繰り返し
て得られるM個の多相周期系列は、任意の2個の相互相
関関数があらゆるシフトで0となる。
This is because the component of j of F 6 -1 is an even number (j =
0,2,4,6) is a repetition of the cycle 4, while a component with an odd j has the following relationship: if a component satisfying 0 ≦ i ≦ 3 is multiplied by −1, a component satisfying 4 ≦ i ≦ 7 is obtained. This is because it can be obtained. Similarly, in general, there are M orthogonal sequences with a period MN, and an appropriate one period is extracted from these M orthogonal sequences as M finite length sequences, and any of these M finite length sequences is selected. When the product of the corresponding components of the two finite-length sequences of M can be made 0, the M finite-length Fourier transform of these M finite-length sequences yields M polyphase finite-length sequences. In the M polyphase periodic sequences obtained by repeating the M finite length sequences, any two cross-correlation functions become 0 at any shift.

【0024】特に、周期MNの直交系列が、0≦k≦M
−1なるkに対して、第k(Mod M)成分以外は0で、
第k(Mod M)成分を抜き出すと、周期Nの直交系列に
なっているとき、この周期Nの直交系列をMN次逆フー
リエ変換して得られる多相周期系列の自己相関関数は、
Nの倍数以外のすべてのシフトで0となり、0≦t≦M
−1として、tNシフトでは exp{(2π√−1)kt/M} となる。
In particular, the orthogonal sequence of the period MN is 0 ≦ k ≦ M.
For k of −1, 0 except for the k-th (Mod M) component,
When the k-th (Mod M) component is extracted and becomes an orthogonal sequence of period N, the autocorrelation function of the multi-phase periodic sequence obtained by MN-order inverse Fourier transform of the orthogonal sequence of period N is
It becomes 0 at all shifts other than a multiple of N, and 0 ≦ t ≦ M
−1, the tN shift becomes exp {(2π√−1) kt / M}.

【0025】例えば、 の右辺の4列のそれぞれを繰り返して得られる4個の多
相周期系列の自己相関関数はそれぞれ、(1,0,0,
1,0,0,1,0,0,1,0,0),(1,0,
0,√-1,0,0,-1,0,0,-√-1,0,0),
(1,0,0,−1,0,0,1,0,0,-1,0,
0),(1,0,0,-√-1,0,0,-1,0,0,√-
1,0,0) となる。
For example, The autocorrelation functions of the four polyphase periodic sequences obtained by repeating each of the four columns on the right side of are (1, 0, 0,
1,0,0,1,0,0,1,0,0), (1,0,
0, √-1, 0, 0, -1, 0, 0, -√-1, 0, 0),
(1,0,0, -1,0,0,1,0,0, -1,0,
0), (1, 0, 0, -√-1, 0, 0, -1, 0, 0, √-
It becomes 1,0,0).

【0026】上記(3)式の4つの列は、それぞれ長さ
12の系列である(N=12)。ここで、L=2とする
と、2以内のずれに対しては自己相関のサイドローブも
相互相関も、共に0の弱同期符号分割多重通信が実現で
きる。
The four columns in the above equation (3) are sequences of length 12 (N = 12). Here, when L = 2, weak synchronization code division multiplex communication in which both the side lobe of autocorrelation and the cross-correlation are 0 for deviations within 2 can be realized.

【0027】[0027]

【実施例】以下、本発明の実施例につき、図面を参照し
て詳細に説明する。図1は本発明の擬周期系列を用いた
通信方式を適用する送信機の要部構成の1実施例を説明
する概略ブロック図であって、1は送信すべき情報を格
納するデータバッファ、2は変調単位にデータの組を生
成するデータ組生成手段、3〜6は符号変調データを格
納するメモリ#1〜メモリ#4、7〜10はデータ組生
成手段2からのデータ組にその情報1,−1に対応し
て”1”または”−1”を乗算する乗算器、11は加算
器、12は送信手段である。
Embodiments of the present invention will now be described in detail with reference to the drawings. FIG. 1 is a schematic block diagram for explaining an embodiment of a main part configuration of a transmitter to which a communication system using a pseudo-periodic sequence of the present invention is applied. 1 is a data buffer for storing information to be transmitted, 2 Is a data set generating means for generating a data set for each modulation unit, 3 to 6 are memories # 1 to # 4 for storing code modulated data, and 7 to 10 are information 1 in the data set from the data set generating means 2. , -1 corresponds to a multiplier for multiplying by "1" or "-1", 11 is an adder, and 12 is a transmitting means.

【0028】なお、図中、メモリ#1〜#4は乗算器7
〜10に変調データBを送出するタイミングに応じた分
をずらして示してある。同図において、送信情報のデー
タはデータバッファ1に一旦格納された後、データ組生
成手段2で変調単位の組として乗算器7〜10に順次所
定のタイミングで供給される。
In the figure, memories # 1 to # 4 are multipliers 7
10 to 10 are shown by being shifted by the amount corresponding to the timing of transmitting the modulated data B. In the figure, the data of the transmission information is once stored in the data buffer 1, and then is sequentially supplied to the multipliers 7 to 10 as a set of modulation units by the data set generation means 2 at a predetermined timing.

【0029】#1メモリ3〜#4メモリ6からは、上記
タイミングに同期して変調信号Bのパス列が乗算器7〜
10に与えられ、データ組生成手段2からのデータの”
1”、”−1”に応じて”1”または”−1”が乗算さ
れる。乗算器7〜10の出力は加算器11において加算
され、時系列信号として送信手段12に与えられる。送
信手段12はこの時系列信号を適宜の搬送信号に乗せて
送信する。
From the # 1 memory 3 to # 4 memory 6, the path train of the modulated signal B is output from the multipliers 7 to 7 in synchronization with the above timing.
10 of the data from the data set generation means 2
1 "or" -1 "is multiplied by" 1 "or" -1 ". The outputs of the multipliers 7 to 10 are added in the adder 11 and given to the transmitting means 12 as a time series signal. The means 12 transmits this time-series signal by carrying it on an appropriate carrier signal.

【0030】図2は変調信号の1構成例を説明する模式
図であって、Bは長さNの変調信号で、この変調信号B
に、長さL分の後端信号BR を前部に、長さL分の前端
信号BF を付加したものを送信信号1単位(長さN+2
L)とし、これを図1の#1メモリ3〜#4メモリ6に
それぞれ格納しておく。なお実際に回路を設計する場合
は、このメモリを1つのみとし、その信号出力タイミン
グを別途設けた制御手段で制御して順次出力させるよう
にするのがよい。
FIG. 2 is a schematic diagram for explaining an example of the structure of the modulated signal, where B is a modulated signal of length N, and this modulated signal B
In addition, one unit of the transmission signal (length N + 2) is obtained by adding the rear end signal B R for the length L to the front part and adding the front end signal B F for the length L.
L) and store them in the # 1 memory 3 to # 4 memory 6 of FIG. 1, respectively. When actually designing the circuit, it is preferable that only one memory is provided and the signal output timing thereof is controlled by a separately provided control means to sequentially output.

【0031】図3は図1の送信手段に供給される送信信
号の1例を説明する模式図であって、ここではデータ
(1,1,−1,1)に対応した送信信号を示す。図4
は本発明の擬周期系列を用いた通信方式を適用する受信
機の要部構成の1実施例を説明する概略ブロック図であ
って、21は受信手段、22は図2に示した変調信号B
の整合フィルタ、23は時間軸調整手段である。
FIG. 3 is a schematic diagram for explaining an example of the transmission signal supplied to the transmission means of FIG. 1, and here shows the transmission signal corresponding to the data (1, 1, -1, 1). Figure 4
2 is a schematic block diagram for explaining an embodiment of the main configuration of a receiver to which the communication system using the pseudo-periodic sequence of the present invention is applied, in which 21 is receiving means and 22 is the modulated signal B shown in FIG.
The matched filter 23 is a time axis adjusting means.

【0032】同図において、受信手段21で受信した前
記図3に示したような送信信号は、Bの整合フィルタ2
2に通される。Bの整合フィルタ22を通った復調信号
は下記のように再現される。図5は受信機の信号処理の
説明図であって、(a)はBの整合フィルタを通ったデ
ータ”1”の信号、(b)はデータ”−1”の信号、
(c)は(a)と(b)の加算信号、(d)は時間軸調
整手段23でパルス列の時間軸を送信情報データと同じ
に調整した後成形処理した再現情報データを示す。
In the figure, the transmission signal received by the receiving means 21 as shown in FIG.
Passed through 2. The demodulated signal passed through the B matched filter 22 is reproduced as follows. 5A and 5B are explanatory diagrams of the signal processing of the receiver. FIG. 5A is a data “1” signal that has passed through the matched filter B, and FIG. 5B is a data “−1” signal.
(C) shows the addition signal of (a) and (b), and (d) shows the reproduction information data which was subjected to the shaping process after the time axis adjusting means 23 adjusted the time axis of the pulse train to the same as the transmission information data.

【0033】このように、本実施例によれば、有限長の
周期系列の信号を用いて無限長周期系列の入力と同様に
同期の取れた受信信号を得ることができる。
As described above, according to the present embodiment, it is possible to obtain a reception signal which is synchronized with the input of the infinite length cyclic sequence by using the signal of the cyclic sequence of finite length.

【0034】[0034]

【発明の効果】以上説明したように、本発明によれば、
有限長の周期系列の入力信号に対しても無限長周期系列
の入力と同様に綺麗に設計された受信信号を得ることが
でき、周期系列として設計されている信号を近似同期状
態で使用できる信号方式とした擬周期系列を用いて優れ
た機能をもつ通信方式を提供することができる。
As described above, according to the present invention,
A signal that can be beautifully designed for an input signal of a finite-length periodic sequence as well as an input of an infinite-length periodic sequence, and a signal that is designed as a periodic sequence can be used in an approximate synchronization state. It is possible to provide a communication method having an excellent function by using the pseudo-periodic sequence as the method.

【図面の簡単な説明】[Brief description of drawings]

【図1】本発明の擬周期系列を用いた通信方式を適用す
る送信機の要部構成の1実施例を説明する概略ブロック
図である。
FIG. 1 is a schematic block diagram illustrating an example of a main configuration of a transmitter to which a communication method using a pseudo-periodic sequence of the present invention is applied.

【図2】本発明の擬周期系列を用いた通信方式の1実施
例に用いる変調信号の1構成例を説明する模式図であ
る。
FIG. 2 is a schematic diagram illustrating one configuration example of a modulation signal used in one embodiment of a communication system using a pseudo periodical sequence of the present invention.

【図3】図1の送信手段に供給される送信信号の1例を
説明する模式図である。
FIG. 3 is a schematic diagram illustrating an example of a transmission signal supplied to the transmission unit of FIG.

【図4】本発明の擬周期系列を用いた通信方式を適用す
る受信機の要部構成の1実施例を説明する概略ブロック
図である。
FIG. 4 is a schematic block diagram illustrating an example of a main configuration of a receiver to which a communication method using a pseudo-periodic sequence of the present invention is applied.

【図5】受信機の信号処理の説明図である。FIG. 5 is an explanatory diagram of signal processing of a receiver.

【符号の説明】[Explanation of symbols]

1 送信すべき情報を格納するデータバッファ 2 変調単位にデータの組を生成するデータ組生成手段 3〜6 符号変調データを格納するメモリ#1〜メモリ
#4 7〜10 データ組生成手段2からのデータ組にその情
報1,−1に対応して”1”または”−1”を乗算する
乗算器 11 加算器 12 送信手段 21 受信手段 22 変調信号Bの整合フィルタ 23 時間軸調整手段。
1 data buffer for storing information to be transmitted 2 data set generating means for generating a data set for each modulation unit 3 to 6 memory # 1 to memory # 4 for storing code modulated data 7 to 10 from data set generating means 2 A multiplier for multiplying a data set by "1" or "-1" corresponding to the information 1 or -1. 11 adder 12 transmitting means 21 receiving means 22 matched filter of modulated signal B 23 time axis adjusting means.

【手続補正書】[Procedure amendment]

【提出日】平成5年6月23日[Submission date] June 23, 1993

【手続補正1】[Procedure Amendment 1]

【補正対象書類名】明細書[Document name to be amended] Statement

【補正対象項目名】特許請求の範囲[Name of item to be amended] Claims

【補正方法】変更[Correction method] Change

【補正内容】[Correction content]

【特許請求の範囲】[Claims]

【手続補正2】[Procedure Amendment 2]

【補正対象書類名】明細書[Document name to be amended] Statement

【補正対象項目名】0026[Correction target item name] 0026

【補正方法】変更[Correction method] Change

【補正内容】[Correction content]

【0026】 上記(3)式の4つの列は、それぞれ長
さ12の系列である(N=12)。ここで、L=2とす
ると、2以内のずれに対しては自己相関のサイドローブ
も相互相関も、共に0の弱同期符号分割多重通信が実現
できる。なお、上記においては、Lは同一長さのLと
L’を用い、L=L’,即ちL=2Lとして説明した
が、L≠L’とすることも可能であり、送信信号の長さ
を一般式では{N+(L+L’)}と表すことができ
る。
The four columns of the above equation (3) are sequences of length 12 (N = 12). Here, when L = 2, weak synchronization code division multiplex communication in which both the side lobe of autocorrelation and the cross-correlation are 0 for deviations within 2 can be realized. In the above description, L is L and L ′ having the same length, and L = L ′, that is, L = 2L, but it is also possible to set L ≠ L ′ and the length of the transmission signal. Can be represented by {N + (L + L ')} in the general formula.

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】伝送すべき情報をbとしたとき、b(a
N-L ,・・・,aN-1 ,a0 ,・・・,aN-1 ,a0
・・・,aL-1 )という長さN+2Lの信号を送信信号
とし、(a0 ,a1 ,・・・・,aN-1 )という長さN
の信号に対する整合フィルタを通して前記情報bを受信
することを特徴とする擬周期系列を用いた通信方式。
1. When the information to be transmitted is b, b (a
NL , ..., a N-1 , a 0 , ..., a N-1 , a 0 ,
, A L-1 ) having a length N + 2L as a transmission signal, and having a length N (a 0 , a 1 , ..., A N-1 )
A communication system using a pseudo-periodic sequence, characterized in that the information b is received through a matched filter for the signal of.
JP14403393A 1993-06-15 1993-06-15 Communication system using pseudo-periodic sequence Expired - Lifetime JP3111411B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP14403393A JP3111411B2 (en) 1993-06-15 1993-06-15 Communication system using pseudo-periodic sequence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP14403393A JP3111411B2 (en) 1993-06-15 1993-06-15 Communication system using pseudo-periodic sequence

Publications (2)

Publication Number Publication Date
JPH07143110A true JPH07143110A (en) 1995-06-02
JP3111411B2 JP3111411B2 (en) 2000-11-20

Family

ID=15352766

Family Applications (1)

Application Number Title Priority Date Filing Date
JP14403393A Expired - Lifetime JP3111411B2 (en) 1993-06-15 1993-06-15 Communication system using pseudo-periodic sequence

Country Status (1)

Country Link
JP (1) JP3111411B2 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000065759A1 (en) * 1999-04-21 2000-11-02 Toyo Communication Equipment Co., Ltd. Cdma communication system having pilot-supporting interference separating function
WO2001022637A1 (en) * 1999-09-17 2001-03-29 Toyo Communication Equipment Co., Ltd. Cdma communication system employing code sequence set having non-cross correlation region
WO2002023782A1 (en) * 2000-09-12 2002-03-21 Toyo Communicatin Equipment Co., Ltd. Rotate shift code division multiplex communication system
JP2002217778A (en) * 2001-01-17 2002-08-02 Toyo Commun Equip Co Ltd Method and system for comb-line spectrum communication of direct spread type complementary sequence repetitive modulation type
WO2002073853A1 (en) * 2001-03-12 2002-09-19 Toyo Communication Equipment Co., Ltd. Cdma communication method using multi-type diffusion sequence
JP2007049688A (en) * 2005-07-13 2007-02-22 Yamaguchi Univ Approximate synchronizing cdma communication system
JP2018509084A (en) * 2015-02-13 2018-03-29 ゼットティーイー コーポレーションZte Corporation Data transmission method and apparatus

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS56158549A (en) * 1980-05-09 1981-12-07 Nec Corp Pusedo random noise pulse train synchronizing circuit
JPS6324732A (en) * 1986-07-17 1988-02-02 Toshiba Corp Spectrum diffusion communication equipment
JPH0372725A (en) * 1989-05-02 1991-03-27 Nec Corp Diversity receiving equipment
US5127025A (en) * 1989-05-02 1992-06-30 Nec Corporation Space diversity tdma receiver
JPH051796A (en) * 1991-06-24 1993-01-08 Tokushu Kogyo Kk Electrically fused joint and forming method thereof
JPH0522251A (en) * 1991-07-12 1993-01-29 Nippon Telegr & Teleph Corp <Ntt> Transmitter-receiver for spread spectrum communication

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS56158549A (en) * 1980-05-09 1981-12-07 Nec Corp Pusedo random noise pulse train synchronizing circuit
JPS6324732A (en) * 1986-07-17 1988-02-02 Toshiba Corp Spectrum diffusion communication equipment
JPH0372725A (en) * 1989-05-02 1991-03-27 Nec Corp Diversity receiving equipment
US5127025A (en) * 1989-05-02 1992-06-30 Nec Corporation Space diversity tdma receiver
JPH051796A (en) * 1991-06-24 1993-01-08 Tokushu Kogyo Kk Electrically fused joint and forming method thereof
JPH0522251A (en) * 1991-07-12 1993-01-29 Nippon Telegr & Teleph Corp <Ntt> Transmitter-receiver for spread spectrum communication

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000065759A1 (en) * 1999-04-21 2000-11-02 Toyo Communication Equipment Co., Ltd. Cdma communication system having pilot-supporting interference separating function
WO2001022637A1 (en) * 1999-09-17 2001-03-29 Toyo Communication Equipment Co., Ltd. Cdma communication system employing code sequence set having non-cross correlation region
WO2002023782A1 (en) * 2000-09-12 2002-03-21 Toyo Communicatin Equipment Co., Ltd. Rotate shift code division multiplex communication system
JP2002217778A (en) * 2001-01-17 2002-08-02 Toyo Commun Equip Co Ltd Method and system for comb-line spectrum communication of direct spread type complementary sequence repetitive modulation type
WO2002073853A1 (en) * 2001-03-12 2002-09-19 Toyo Communication Equipment Co., Ltd. Cdma communication method using multi-type diffusion sequence
US7245650B2 (en) 2001-03-12 2007-07-17 Naoki Suehiro CDMA communications system using multiple spreading sequences
JP2007049688A (en) * 2005-07-13 2007-02-22 Yamaguchi Univ Approximate synchronizing cdma communication system
JP2018509084A (en) * 2015-02-13 2018-03-29 ゼットティーイー コーポレーションZte Corporation Data transmission method and apparatus

Also Published As

Publication number Publication date
JP3111411B2 (en) 2000-11-20

Similar Documents

Publication Publication Date Title
US4460992A (en) Orthogonal CDMA system utilizing direct sequence pseudo noise codes
JP2726220B2 (en) Code division multiple access equipment
US7974413B2 (en) Spread spectrum communications system and method utilizing chaotic sequence
US6567483B1 (en) Matched filter using time-multiplexed precombinations
JP3399420B2 (en) Fixed pattern detector
CA2364349A1 (en) Method and apparatus for efficient synchronization in spread spectrum communications
JP2003528532A (en) High Efficiency Spread Spectrum Apparatus for Spread Spectrum Communication System
CA2277747A1 (en) A method and an arrangement for despreading a coded sequence in a communication system
JPH03238943A (en) Spread spectrum communication equipment
US7352796B1 (en) Multiple data rate complex Walsh codes for CDMA
JPH07143110A (en) Communication system using pseudo period series
JP2955576B1 (en) Digital communication system, transmitter and receiver thereof, and frame synchronization detection circuit
US20050128937A1 (en) Determination of correlation in the frequency domain
KR20010005860A (en) A code synchronization unit and method
JPWO2004021597A1 (en) Transmission signal forming method, communication method, and data structure of transmission signal
US5805485A (en) Arithmetic unit and method for fourier transform
JP3301724B2 (en) Toothed Spectrum Communication System with Complementary Sequence Repetitive Modulation Comb
JPH05130068A (en) Frequency spread modulator
US20020061057A1 (en) Digital filter
US20050144209A1 (en) Apparatus and method for selectively performing Fast Hadamard Transform or fast fourier transform
JPH0888587A (en) Spread spectrum communication equipment
US6788708B1 (en) Code synchronization unit and method
EP1222751B1 (en) Correlator
EP3800951A1 (en) Method, computer program and wireless communication device
KR950003473B1 (en) Code rate generating method for cdma

Legal Events

Date Code Title Description
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20000822

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20080922

Year of fee payment: 8

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090922

Year of fee payment: 9

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100922

Year of fee payment: 10

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100922

Year of fee payment: 10

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20110922

Year of fee payment: 11

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20110922

Year of fee payment: 11

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120922

Year of fee payment: 12

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20130922

Year of fee payment: 13

EXPY Cancellation because of completion of term