WO2010007674A1 - 通信システム、送信装置、受信装置、ならびに、情報記録媒体 - Google Patents
通信システム、送信装置、受信装置、ならびに、情報記録媒体 Download PDFInfo
- Publication number
- WO2010007674A1 WO2010007674A1 PCT/JP2008/062865 JP2008062865W WO2010007674A1 WO 2010007674 A1 WO2010007674 A1 WO 2010007674A1 JP 2008062865 W JP2008062865 W JP 2008062865W WO 2010007674 A1 WO2010007674 A1 WO 2010007674A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- communication system
- exp
- primitive
- inner product
- signal
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0007—Code type
- H04J13/0018—Chaotic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2602—Signal structure
- H04L27/2605—Symbol extensions, e.g. Zero Tail, Unique Word [UW]
Definitions
- the present invention naturally uses CDMA (Code Division Multiple Access) and OFDM (Orthogonary Frequency Division Multiplex) by using a code having perfect orthogonality and good autocorrelation characteristics.
- the present invention relates to a communication system, a transmission device, a reception device, and a computer readable / writable information recording medium in which a program for realizing these on a computer is recorded.
- Patent Document 1 proposes a technique for generating an optimal chaotic spreading code sequence with a simple electronic circuit.
- the present invention solves the problems as described above, and uses a code having perfect orthogonality and good autocorrelation characteristics, so that CDMA and OFDM are naturally fused to improve communication performance. It is an object of the present invention to provide a computer-readable / writable information recording medium in which a communication system, a transmitting device, a receiving device, and a program for realizing these on a computer are recorded.
- the transmission device includes a serial-parallel conversion unit, a transmission-side inner product unit, an insertion unit, and a transmission unit.
- the receiving device has a receiving unit, a synchronizing unit, a receiving side inner product unit, and a parallel-serial conversion unit.
- Inner product w [i] ⁇ s, b [i] ⁇
- the insertion unit of the transmission device inserts a guard interval between the calculated inner products w [0], w [1], w [2],. Signal.
- the transmission unit of the transmission device transmits a signal with the guard interval inserted.
- the receiving unit of the receiving device receives a signal transmitted from the transmitting device.
- the synchronization unit of the receiving device refers to the guard interval inserted in the received signal, and the inner product w [0], calculated for each of the signals divided for each predetermined time length T in the transmitting device, w [1], w [2], ..., w [p-1] Received values synchronized with u [0], u [1], u [2], ..., u [p-1] Get.
- the parallel-to-serial converter of the receiving device then calculates a signal obtained by dividing the calculated inner product v [0], v [1], v [2],..., V [p-1] for each predetermined time length T. As a result, the transmitted signal is obtained.
- exp (i ⁇ ) is changed to 1 of the vectors b [0], b [1], b [2],.
- Configure exp (-i ⁇ ) as the first element instead of 1 as the first element of the vector c [0], c [1], c [2], ..., c [p-1] be able to.
- (p-1) / 2 can be configured to be a prime number.
- each of the different primitive roots for the prime number p is assigned to a plurality of users, and the transmitting device and the receiving device associated with each of the plurality of users are assigned to the primitive roots.
- the receiving device assumes that each of the primitive roots that are not assigned to an existing user among the different primitive roots for the prime number p is the primitive root q, and the inner product v [0], Find v [1], v [2], ..., v [p-1], and minimize the power of the inner product v [0], v [1], v [2], ..., v [p-1] Can be configured to acquire a primitive root q to be assigned to a new user.
- the communication system of the present invention can be configured as follows.
- each of the different primitive roots for the prime number p is assigned to a plurality of users, and the transmitting apparatus associated with each of the plurality of users sets the primitive root assigned to the user as the primitive root q.
- the receiving device obtains inner products v [0], v [1], v [2],..., V [p-1], assuming that each of the different primitive roots is the primitive root q, A primitive root having the maximum power of the inner product v [0], v [1], v [2], ..., v [p-1] is acquired, and the acquired primitive root is defined as a primitive root q.
- a transmission device is a transmission device of the communication system.
- a receiving device is a receiving device of the communication system.
- a computer-readable information recording medium is configured to record a program that causes a computer having a communication function to function as the transmission device.
- the computer-readable information recording medium is configured to record a program that causes a computer having a communication function to function as the receiving device.
- the computer-readable information recording medium uses, for example, the same type as a compact disk, the same type as a flexible disk, a hard disk, a magneto-optical disk, the same type as a digital video disk, a magnetic tape, or a semiconductor memory can do.
- the information recording medium can be distributed and sold independently of the computer, and the program itself can be distributed and sold via a computer communication network such as the Internet.
- the present invention is the result of research and development under the theme “Research and development of ICA communication chip” adopted by the New Energy and Industrial Technology Development Organization (NEDO) 2005 Second Industrial Technology Research Grant Program. It is such a thing.
- a communication system, a transmission device, and a reception suitable for improving communication performance by naturally merging CDMA and OFDM by using a code having perfect orthogonality and good autocorrelation characteristics It is possible to provide an apparatus and a computer-readable information recording medium in which a program for realizing these on a computer is recorded.
- a chaos code that takes a value on a unit circle of the complex plane is used as the orthogonal code.
- the method of generating the chaos code was devised by the inventor of the present application. Details will be described below.
- a set for some integer q ⁇ q 0 mod p, q 1 mod p, q 2 mod p, ..., q p-2 mod p ⁇ Is a set of (p-1) natural numbers ⁇ 1, 2, 3, ..., p-1 ⁇ , That is, the domain is ⁇ 1, 2, 3, ..., p-1 ⁇
- the map f p, q (k) q k-1 mod p
- the range of is also ⁇ 1, 2, 3, ..., p-1 ⁇ If the map f p, q ( ⁇ ) is bijective, the integer q is called the primitive root of the prime number p.
- the natural numbers from 1 to 60 are rearranged.
- the number of primitive roots q of prime number p is given by ⁇ (p ⁇ 1) by Euler's tortient function ⁇ (•).
- the pair (p, ⁇ (p-1)) of the prime number p and the number of primitive roots q (p-1) is as follows.
- the pair with * is considered to be an “excellent” pair in which the number of primitive roots q with respect to the prime number p is relatively large (p ⁇ 1).
- each component takes a value on a unit circle on the complex plane, so that it is clearly a code with constant power.
- b [k] and c [k] are complex conjugate vectors in which each element is in a complex conjugate relationship with each other.
- ⁇ B [k], c [k]> p Is established.
- p data is converted into b [0], b [1], ..., b [p-1] (Or a corresponding unitary matrix) and c [0], c [1], ..., c [p-1]
- the original p pieces of data can be obtained by converting with (or converting with the corresponding unitary matrix).
- the inventor succeeded in creating p complex vectors that are completely orthogonal to each other in the p dimension from the prime number p and its primitive root q.
- the number of orthogonal vector systems is given by the number of primitive roots q. Therefore, the larger the number of primitive roots q, the greater the number of channels used simultaneously during communication. From this point of view, what is more suitable as the prime number p is considered to be an “excellent” pair with the above * added.
- Orthogonal vectors are also obtained for the discrete Fourier transform used in OFDM, and a similar figure can be drawn, but the figure in that case is a figure with extremely high rotational symmetry. That is, when the figure is rotated, the rotation angle that overlaps the original shape is small, and when the figure is rotated 360 degrees, the figure is almost overlapped many times.
- the fact that conventional orthogonal codes generally have poor autocorrelation characteristics is due to the high rotational symmetry of the code state transition diagram.
- the transition destination points are uniformly distributed on the circumference of the unit circle, but are asymmetric with respect to rotation. That is, the rotational symmetry is much lower than the transition diagram of orthogonal codes used in OFDM. That is, in the process of rotating the figure 360 degrees, the number of times of overlapping with the original figure is extremely small, from 1 to several times.
- the maximum peak and the second peak can be sufficiently separated if a sufficiently large value is adopted as the prime number p.
- FIG. 5 is an explanatory diagram showing a schematic configuration of a communication system according to one embodiment of the present invention.
- a description will be given with reference to FIG.
- the communication system 101 shown in the figure includes a transmission device 111 and a reception device 131.
- the communication system 101 uses a primitive root q having a certain prime number p.
- the p and q can be appropriately selected as described above.
- c [p-1] (1,1,1,1, ..., 1) P p-dimensional vectors c [0], c [1], c [2],..., C [p-2], c [p-1] defined by the above are used.
- each vector element may be multiplied by an appropriate non-zero constant. To multiply by a constant is simply to change the scale of the numerical value.
- the transmission device 111 includes a serial-parallel conversion unit 112, a transmission-side inner product unit 113, an insertion unit 114, and a transmission unit 115.
- the reception device 131 includes a reception unit 132, a synchronization unit 133, a reception-side inner product unit 134, and a parallel-serial conversion unit 135.
- FIG. 6 is an explanatory diagram showing a process of signal conversion.
- a description will be given with reference to FIG.
- the signal 601 to be transmitted includes p signal values per predetermined time length T.
- the signal 601 to be transmitted is a binary signal consisting of +1 and -1 as values, or a binary signal consisting of +1 and 0 as values, as well as a variety of 16QAM using a combination of amplitude and phase.
- Various signals can be used such as a signal converted by a value signal.
- This signal value is converted into a signal vector 602 composed of p signal values s [0], s [1], s [2], s [3],..., S [p ⁇ 1] having a predetermined time length T. Will do.
- the insertion unit 114 of the transmission device 111 inserts a guard interval between the calculated inner products w [0], w [1], w [2],. A long T signal is assumed.
- the insertion unit 114 performs a kind of parallel-serial conversion function, and converts p inner product value vectors 603 into signal values of one transmission signal 604. However, a guard interval is inserted as appropriate so that the receiver 131 can be synchronized.
- each guard interval 651 is inserted at the end of the predetermined time length T, but each inner product w [0], w [1], w [2], ..., w [p-1 You may employ
- the transmission part 115 of the transmitter 111 transmits the transmission signal 604 in which the guard interval was inserted.
- the reception unit 132 of the reception device 131 receives the reception signal 605 in which the transmission signal 604 transmitted from the transmission device 111 has changed due to the influence of the radio wave propagation path.
- the synchronization unit 133 of the reception device 131 refers to the guard interval 652 that is a result of the influence of the radio wave propagation path on the guard interval 651 in the transmission signal 604 from the received signal 605.
- W [0], w [1], w [2], ..., w [p-1] calculated for each of the signals divided for each predetermined time length T
- the guard interval is inserted with the period T, it is possible to achieve synchronization by correlating the time lapse of the received signal with the time distribution of the guard interval.
- the received values u [0], u [1], u [2],..., U [p-1] are p signals 606 (received value vector u) having a predetermined time length T.
- This inner product calculation is performed every predetermined time length T as in the transmission-side inner product unit 113, and p signals v [0], v [1], v [2],. 607 (inner product value vector v) is obtained.
- the receiving-side inner product unit 134 of the receiving device 131 divides the calculated inner products v [0], v [1], v [2],..., V [p ⁇ 1] for each predetermined time length T.
- the signal is parallel-to-serial converted as a signal to obtain a transmitted signal 608.
- the signal 608 is equivalent to a binary signal or a multi-level signal, and is generally shifted in phase and amplitude due to the influence of the radio wave propagation path, but when compensating for these shifts, Various known techniques can be applied.
- the communication system 101 performs an operation of taking an inner product with a vector consisting of a value representing a unit circle point as described above, instead of the Fourier transform in OFDM. You can think of it as a natural fusion.
- a predetermined program (corresponding to a design drawing of the electronic circuit) is read into an electronic circuit such as an FPGA (Field Programmable Gate Array) or an ASIC (Application Specific Integrate Circuit). It can be implemented by applying software radio technology or the like.
- FPGA Field Programmable Gate Array
- ASIC Application Specific Integrate Circuit
- the serial-parallel conversion unit 112 the transmission side inner product unit 113, and the insertion unit 114 of the transmission device 111 are calculated, or the synchronization unit 133 of the reception device 131, the reception side inner product Unit 134 and parallel-serial converter 135 can be calculated.
- the transmission unit 115 and the reception unit 132 are realized by a wireless communication module connected to the computer.
- leading elements of the vectors b [0], b [1],..., B [p-1] and the vectors c [0], c [1], It was one.
- this leading element is arbitrary, and it is sufficient if it is arranged on the unit circumference of the complex plane.
- the vectors b [0], b [1],..., B [p ⁇ 1] and the vectors c [0], c [1],. p-1] may be defined.
- a pair of the transmission device 111 and the reception device 131 in which the primitive root q with respect to the prime number p is fixed is considered, but multi-user communication can be handled using the same prime number.
- This can be considered to correspond to OFDMA (Orthogonal Frequency Division Multiple Access).
- the number of primitive roots with respect to the prime number p is ⁇ (p ⁇ 1), and it is possible to select a prime number p having a large number of primitive roots as described above.
- Transmission is performed using the primitive root q i assigned to itself as the primitive root q in the above embodiment.
- the reception device 131 performs reception using each of the primitive roots assigned to each user among q 1 , q 2 ,..., Q ⁇ (p ⁇ 1) as the primitive root q in the above embodiment. Do.
- a function corresponding to OFDMA can be realized in transmission from a large number of mobile terminals (corresponding to the transmitting device 111) to the base station (corresponding to the receiving device 131). .
- the reverse process to the above may be performed.
- the number of users may change dynamically.
- the following is performed.
- the power is typically the sum of the squares of v [0], v [1], v [2], ..., v [p-1], or the sum of the squares of their absolute values. Yes, corresponding to the correlation value in the current communication situation.
- this primitive root with the minimum power is obtained. Since this primitive root has the smallest correlation in the current radio wave propagation path state, it can be considered that interference and the like are least likely to occur.
- the acquired primitive root is set as a primitive root q to be assigned to a new user.
- the transmission root 111 and the reception apparatus 131 for the user define the primitive root defined as the primitive root q, and the vectors b [0] and b [ Communication can be performed by initializing 1], ..., b [p-1] and vectors c [0], c [1], ..., c [p-1].
- the base station which is the receiving device 131 is connected to any one of the plurality of transmitting devices 111 associated with each of the primitive roots q 1 , q 2 ,..., Q ⁇ (p ⁇ 1).
- each of q 1 , q 2 ,..., Q ⁇ (p ⁇ 1) is received as the primitive root q of the above embodiment, and then the inner product v [0] as in the above embodiment. , V [1], v [2], ..., v [p-1].
- the primitive root having the maximum power may be estimated as the primitive root q used by the transmitting apparatus 111 that is currently communicating, and the shift reception process and the communication process may be performed.
- communication suitable for improving communication performance by naturally merging CDMA and OFDM by using a code having perfect orthogonality and good autocorrelation characteristics It is possible to provide a system, a transmission device, a reception device, and a computer-readable information recording medium in which a program that realizes these on a computer is recorded.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
素数pの原始根qと、
整数k = 0,1,2,…,(p-2)のそれぞれについて
b[k] = (1, exp(2πi×q0+k/p), exp(2πi×q1+k/p), exp(2πi×q2+k/p),…, exp(2πi×q(p-2)+k/p))
ならびに、
b[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルb[0],b[1],b[2],…,b[p-2],b[p-1]と、
整数k = 0,1,2,…,(p-2)のそれぞれについて
c[k] = (1, exp(-2πi×q0+k/p), exp(-2πi×q1+k/p), exp(-2πi×q2+k/p),…, exp(-2πi×q(p-2)+k/p))
ならびに、
c[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルc[0],c[1],c[2],…,c[p-2],c[p-1]と、
を用い、送信装置と受信装置とを有し、以下のように構成する。
s = (s[0],s[1],s[2],s[3],…,s[p-1])
を得る。
w[i] = 〈s,b[i]〉
を計算する。
w[0],w[1],w[2],…,w[p-1]
に同期する受信値
u[0],u[1],u[2],…,u[p-1]
を得る。
v[i] = 〈u[i],c[i]〉
を計算する。
b[k] = (exp(iθ), exp(2πi×q0+k/p), exp(2πi×q1+k/p), exp(2πi×q2+k/p),…, exp(2πi×q(p-2)+k/p))
ならびに、
b[p-1] = (exp(iθ),1,1,1,…,1)
により定められる。
c[k] = (exp(-iθ), exp(-2πi×q0+k/p), exp(-2πi×q1+k/p), exp(-2πi×q2+k/p),…, exp(-2πi×q(p-2)+k/p))
ならびに、
c[p-1] = (exp(-iθ),1,1,1,…,1)
により定められる。
111 送信装置
112 直並列変換部
113 送信側内積部
114 挿入部
115 送信部
131 受信装置
132 受信部
133 同期部
134 受信側内積部
135 並直列変換部
601 伝送すべき信号
602 信号ベクトル
603 内積値ベクトル
604 送信信号
605 受信信号
606 受信値ベクトル
607 内積値ベクトル
608 伝送された信号
651 ガードインターバル
652 受信されたガードインターバル
{q0 mod p,q1 mod p,q2 mod p,…,qp-2 mod p}
が、(p-1)個の自然数の集合
{1,2,3,…,p-1}
と一致する場合、すなわち、定義域を
{1,2,3,…,p-1}
とする写像
fp,q(k) = qk-1 mod p
の値域もまた
{1,2,3,…,p-1}
であり、写像fp,q(・)が全単射である場合、当該整数qを、素数pの原始根と呼ぶ。
1,2,4,8,16,32,3,6,12,24,48,35,9,
18,36,11,22,44,27,54,47,33,5,10,
20,40,19,38,15,30,60,59,57,53,45,
29,58,55,49,37,13,26,52,43,25,50,
39,17,34,7,14,28,56,51,41,21,42,
23,46,31
となり、1から60までの自然数を並び替えたものとなっている。
(2,1),(3,1),(5,2)*,(7,2)*,(11,4)*,
(13,4),(17,8)*,(19,6),(23,10)*,(29,12),
(31,8),(37,12),(41,16),(43,12),(47,22)*,
(53,24),(59,28)*,(61,16),(67,20),(71,24),
(73,24),(79,24),(83,40)*,(89,40),(97,32),
(101,40),(103,32),(107,52)*,(109,36),(113,48),
(127,36),(131,48),(137,64),(139,44),(149,72)*,
(151,40),(157,48),(163,54),(167,82)*,(173,84),
(179,88)*,(181,48),(191,72),(193,64),(197,84),
(199,60),(211,48),(223,72),(227,112)*,(229,72),
(233,112),(239,96),(241,64),(251,100),(257,128)*,
(263,130)*,(269,132),(271,72),(277,88),(281,96),
(283,92),(293,144),(307,96),(311,120),(313,96),
(317,156),(331,80),(337,96),(347,172)*,(349,112),
(353,160),(359,178)*,(367,120),(373,120),(379,108),
(383,190)*,(389,192),(397,120),(401,160),(409,128),
(419,180),(421,96),(431,168),(433,144),(439,144),
(443,192),(449,192),(457,144),(461,176),(463,120),
(467,232)*,(479,238)*,(487,162),(491,168),(499,164),
(503,250)*,(509,252),(521,192),(523,168),(541,144),
(547,144),(557,276),(563,280)*,(569,280),(571,144),
(577,192),(587,292)*,(593,288),(599,264),(601,160),
(607,200),(613,192),(617,240),(619,204),(631,144),
(641,256),(643,212),(647,288),(653,324),(659,276),
(661,160),(673,192),(677,312),(683,300),(691,176),
(701,240),(709,232),(719,358)*,(727,220),(733,240),
(739,240),(743,312),(751,200),(757,216),(761,288),
(769,256),(773,384),(787,260),(797,396),(809,400),
(811,216),(821,320),(823,272),(827,348),(829,264),
(839,418),(853,280),(857,424),(859,240),(863,430),
(877,288),(881,320),(883,252),(887,442)*,(907,300),
(911,288),(919,288),(929,448),(937,288),(941,368),
(947,420),(953,384),(967,264),(971,384),(977,480),
(983,490),(991,240),(997,328),(1009,288),(1013,440),
(1019,508)*,(1021,256),(1031,408),(1033,336),(1039,344),
(1049,520),(1051,240),(1061,416),(1063,348),(1069,352),
(1087,360),(1091,432),(1093,288),(1097,544),(1103,504),
(1109,552),(1117,360),(1123,320),(1129,368),(1151,440),
(1153,384),(1163,492),(1171,288),(1181,464),(1187,592)*,
(1193,592),(1201,320),(1213,400),(1217,576),(1223,552)
b[k] = (1, exp(2πi×q0+k/p), exp(2πi×q1+k/p), exp(2πi×q2+k/p),…, exp(2πi×q(p-2)+k/p))
ならびに、
b[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルb[0],b[1],b[2],…,b[p-2],b[p-1]と、
整数k = 0,1,2,…,(p-2)のそれぞれについて
c[k] = (1, exp(-2πi×q0+k/p), exp(-2πi×q1+k/p), exp(-2πi×q2+k/p),…, exp(-2πi×q(p-2)+k/p))
ならびに、
c[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルc[0],c[1],c[2],…,c[p-2],c[p-1]と、
を考える。
〈b[k],c[k]〉 = p
が成立する。
〈b[i],c[j]〉 = 0
が成立する。したがって、
b[0],b[1],…,b[p-1]
を並べて各要素に1/p1/2を乗じた複素正方行列や、
c[0],c[1],…,c[p-1]
を並べて各要素に1/p1/2を乗じた複素正方行列は、複素直交行列であるユニタリ行列となる。
b[0],b[1],…,b[p-1]
で変換(あるいは、これに対応するユニタリ行列で変換)し、受信側で
c[0],c[1],…,c[p-1]
で変換(あるいは、これに対応するユニタリ行列で変換)すれば、元のp本のデータが得られるのである。
ep,q,k(n) = exp(2πi×qn+k-1/p)
によって計算可能であるが、kが(p-1)以下であり、かつ、nが2以上である場合、原始根qを次数とするチェビシェフ多項式Tq(・)により、
Re(e(n+1)) = Tq(Re(e(n))
という関係が成立する。
b[k] = (1, exp(2πi×q0+k/p), exp(2πi×q1+k/p), exp(2πi×q2+k/p),…, exp(2πi×q(p-2)+k/p))
ならびに、
b[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルb[0],b[1],b[2],…,b[p-2],b[p-1]を用いる。
c[k] = (1, exp(-2πi×q0+k/p), exp(-2πi×q1+k/p), exp(-2πi×q2+k/p),…, exp(-2πi×q(p-2)+k/p))
ならびに、
c[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルc[0],c[1],c[2],…,c[p-2],c[p-1]と、を用いる。
s = (s[0],s[1],s[2],s[3],…,s[p-1])
を得る。
w[i] = 〈s,b[i]〉
を計算する。この計算は、当該所定時間長Tおきに行えば良い。送信側内積部113からは、所定時間長Tのp本の内積値w[0],w[1],w[2],w[3],…,w[p-1]からなる内積値ベクトル603が出力される。
w[0],w[1],w[2],…,w[p-1]
に同期する受信値
u[0],u[1],u[2],…,u[p-1]
を得る。
v[i] = 〈u[i],c[i]〉
を計算する。
b[k] = (exp(iθ), exp(2πi×q0+k/p), exp(2πi×q1+k/p), exp(2πi×q2+k/p),…, exp(2πi×q(p-2)+k/p))
ならびに、
b[p-1] = (exp(iθ),1,1,1,…,1)
により定められる。
c[k] = (exp(-iθ), exp(-2πi×q0+k/p), exp(-2πi×q1+k/p), exp(-2πi×q2+k/p),…, exp(-2πi×q(p-2)+k/p))
ならびに、
c[p-1] = (exp(-iθ),1,1,1,…,1)
により定められる。
q1,q2,…,qφ(p-1)
のいずれかを、互いに重複しないように、異なるユーザに割り当てる。
Claims (11)
- 素数pの原始根qと、
整数k = 0,1,2,…,(p-2)のそれぞれについて
b[k] = (1, exp(2πi×q0+k/p), exp(2πi×q1+k/p), exp(2πi×q2+k/p),…, exp(2πi×q(p-2)+k/p))
ならびに、
b[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルb[0],b[1],b[2],…,b[p-2],b[p-1]と、
整数k = 0,1,2,…,(p-2)のそれぞれについて
c[k] = (1, exp(-2πi×q0+k/p), exp(-2πi×q1+k/p), exp(-2πi×q2+k/p),…, exp(-2πi×q(p-2)+k/p))
ならびに、
c[p-1] = (1,1,1,1,…,1)
により定められるp個のp次元ベクトルc[0],c[1],c[2],…,c[p-2],c[p-1]と、
を用い、
送信装置(111)と受信装置(131)とを有する通信システム(101)であって、
(a)前記送信装置(111)は、
伝送すべき信号を所定時間長Tごとに区切り、当該区切られた信号のそれぞれを、直並列変換してp次元の信号ベクトル
s = (s[0],s[1],s[2],s[3],…,s[p-1])
を得る直並列変換部(112)、
整数i = 0,1,2,…,(p-1)のそれぞれについて、前記得られた信号ベクトルsと、前記定められたベクトルb[i]と、から、内積
w[i] = 〈s,b[i]〉
を計算する送信側内積部(113)、
前記計算された内積w[0],w[1],w[2],…,w[p-1]の間にガードインターバルを挿入して当該所定時間長Tの信号とする挿入部(114)、
前記ガードインターバルが挿入された信号を送信する送信部(115)
を備え、
(b)前記受信装置(131)は、
前記送信装置(111)から送信された信号を受信する受信部(132)、
前記受信された信号に挿入されたガードインターバルを参照して、前記送信装置(111)において当該所定時間長Tごとに区切られた信号のそれぞれについて計算された内積
w[0],w[1],w[2],…,w[p-1]
に同期する受信値
u[0],u[1],u[2],…,u[p-1]
を得る同期部(133)、
整数i = 0,1,2,…,(p-1)のそれぞれについて、前記得られた受信値u[i]と、前記定められたp次元ベクトルc[i]と、から、内積
v[i] = 〈u[i],c[i]〉
を計算する受信側内積部(134)、
前記計算された内積v[0],v[1],v[2],…,v[p-1]を当該所定時間長Tごとに区切られた信号として並直列変換して、伝送された信号を得る並直列変換部(135)
を備える
ことを特徴とする通信システム(101)。 - 請求項1に記載の通信システム(101)であって、
所定の角度θにより、
1にかえてexp(iθ)を当該ベクトルb[0],b[1],b[2],…,b[p-1]の先頭の要素とし、
1にかえてexp(-iθ)を当該ベクトルc[0],c[1],c[2],…,c[p-1]の先頭の要素とする
ことを特徴とする通信システム(101)。 - 請求項1または2に記載の通信システム(101)であって、
(p-1)/2は素数である
ことを特徴とする通信システム(101)。 - 請求項1または2に記載の通信システム(101)であって、
pは2の羃乗に1を足した値の素数である
ことを特徴とする通信システム(101)。 - 請求項1または2に記載の通信システム(101)において、
素数pに対する互いに異なる原始根のそれぞれを、複数のユーザに割り当て、当該複数のユーザのそれぞれに対応付けられる送信装置(111)と受信装置(131)は、当該ユーザに割り当てられる原始根を、当該原始根qとする
ことを特徴とする通信システム(101)。 - 請求項5に記載の通信システム(101)において、
前記受信装置(131)は、素数pに対する互いに異なる原始根のうち、既存のユーザに割り当てられていない原始根のそれぞれを当該原始根qであるとして、内積v[0],v[1],v[2],…,v[p-1]を求め、当該内積v[0],v[1],v[2],…,v[p-1]のパワーが最小の原始根を取得し、
当該取得された原始根を、新たなユーザに割り当てるべき原始根qとする
ことを特徴とする通信システム。 - 請求項1または2に記載の通信システム(101)において、
素数pに対する互いに異なる原始根のそれぞれを、複数のユーザに割り当て、当該複数のユーザのそれぞれに対応付けられる送信装置(111)は、当該ユーザに割り当てられる原始根を、当該原始根qとし、
前記受信装置(131)は、当該互いに異なる原始根のそれぞれを当該原始根qであるとして、内積v[0],v[1],v[2],…,v[p-1]を求め、当該内積v[0],v[1],v[2],…,v[p-1]のパワーが最大の原始根を取得し、当該取得された原始根を原始根qとする
ことを特徴とする通信システム。 - 請求項1または2に記載の通信システム(101)における送信装置(111)。
- 請求項1または2に記載の通信システム(101)における受信装置(131)。
- コンピュータを、請求項1または2に記載の通信システム(101)における送信装置(111)として機能させることを特徴とするプログラムを記録したコンピュータ読取可能な情報記録媒体。
- コンピュータを、請求項1または2に記載の通信システム(101)における受信装置(131)として機能させることを特徴とするプログラムを記録したコンピュータ読取可能な情報記録媒体。
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP08778216A EP2302825A4 (en) | 2008-07-16 | 2008-07-16 | COMMUNICATION SYSTEM, TRANSMITTER, RECEIVER AND INFORMATION RECORDING MEDIUM |
PCT/JP2008/062865 WO2010007674A1 (ja) | 2008-07-16 | 2008-07-16 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
US12/306,438 US20100232523A1 (en) | 2008-07-16 | 2008-07-16 | Communication system, transmitting device, receiving device, and information recording medium |
CN2008800003553A CN102037695A (zh) | 2008-07-16 | 2008-07-16 | 通信系统、发送装置、接收装置以及信息记录介质 |
JP2008554359A JP4276294B1 (ja) | 2008-07-16 | 2008-07-16 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
JP2008554559A JP4313434B1 (ja) | 2008-07-16 | 2008-11-21 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
PCT/JP2008/071251 WO2010007698A1 (ja) | 2008-07-16 | 2008-11-21 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2008/062865 WO2010007674A1 (ja) | 2008-07-16 | 2008-07-16 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2010007674A1 true WO2010007674A1 (ja) | 2010-01-21 |
Family
ID=40821554
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2008/062865 WO2010007674A1 (ja) | 2008-07-16 | 2008-07-16 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
PCT/JP2008/071251 WO2010007698A1 (ja) | 2008-07-16 | 2008-11-21 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2008/071251 WO2010007698A1 (ja) | 2008-07-16 | 2008-11-21 | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 |
Country Status (5)
Country | Link |
---|---|
US (1) | US20100232523A1 (ja) |
EP (1) | EP2302825A4 (ja) |
JP (1) | JP4276294B1 (ja) |
CN (1) | CN102037695A (ja) |
WO (2) | WO2010007674A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010028668A (ja) * | 2008-07-23 | 2010-02-04 | Chaosware Inc | 拡散符号計算装置、通信システム、送信装置、受信装置、ならびに、プログラム |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000338869A (ja) * | 1999-05-31 | 2000-12-08 | Communication Research Laboratory Mpt | 擬似雑音系列の出力システム、出力装置、出力方法、および、情報記録媒体 |
JP2001292129A (ja) * | 2000-04-07 | 2001-10-19 | Communication Research Laboratory | 擬似乱数列の出力装置、送信装置、受信装置、通信システム、フィルタ装置、擬似乱数列の出力方法、送信方法、受信方法、フィルタ方法、ならびに、情報記録媒体 |
JP2004147126A (ja) * | 2002-10-24 | 2004-05-20 | Osaka Industrial Promotion Organization | マルチキャリア通信方法及びマルチキャリア通信装置 |
JP2005203929A (ja) * | 2004-01-14 | 2005-07-28 | Japan Science & Technology Agency | 通信システム、送信装置、受信装置、位相拡散符号生成装置、送信方法、受信方法、位相拡散符号生成方法、ならびに、プログラム |
JP2005204267A (ja) * | 2004-01-13 | 2005-07-28 | Chaosware Inc | 複素擬似雑音系列の出力装置、スペクトル拡散装置、スペクトル逆拡散装置、送信装置、受信装置、通信システム、複素擬似雑音系列の出力方法、スペクトル拡散方法、スペクトル逆拡散方法、送信方法、受信方法、ならびに、プログラム |
JP2005210664A (ja) * | 2004-01-26 | 2005-08-04 | Chaosware Inc | 複素擬似雑音系列の出力装置、スペクトル拡散装置、スペクトル逆拡散装置、送信装置、受信装置、通信システム、複素擬似雑音系列の出力方法、スペクトル拡散方法、スペクトル逆拡散方法、送信方法、受信方法、ならびに、プログラム |
JP2007202091A (ja) * | 2006-01-23 | 2007-08-09 | Chaosware Inc | 複素擬似雑音系列の出力装置、スペクトル拡散装置、スペクトル逆拡散装置、送信装置、受信装置、通信システム、複素擬似雑音系列の出力方法、スペクトル拡散方法、スペクトル逆拡散方法、送信方法、受信方法、ならびに、プログラム |
WO2008081871A1 (ja) * | 2006-12-28 | 2008-07-10 | Ken Umeno | 通信システム、通信方法、ならびに、情報記録媒体 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
IL99660A0 (en) * | 1991-10-07 | 1992-08-18 | Ibm Israel | Random number generator |
JP3624874B2 (ja) * | 2001-11-19 | 2005-03-02 | 日本電気株式会社 | インターリービング順序発生器、インターリーバ、ターボエンコーダ、及びターボデコーダ |
US7068703B2 (en) * | 2003-02-18 | 2006-06-27 | Qualcomm, Incorporated | Frequency hop sequences for multi-band communication systems |
US7583747B1 (en) * | 2004-03-31 | 2009-09-01 | University Of Alberta | Method of systematic construction of space-time constellations, system and method of transmitting space-time constellations |
JP4429795B2 (ja) * | 2004-05-06 | 2010-03-10 | 株式会社エヌ・ティ・ティ・ドコモ | 無線通信システム、無線送信機及び無線受信機 |
EP1843485B1 (en) * | 2006-03-30 | 2016-06-08 | Sony Deutschland Gmbh | Multiple-input multiple-output (MIMO) spatial multiplexing system with dynamic antenna beam combination selection capability |
JP4261578B2 (ja) * | 2006-12-27 | 2009-04-30 | 株式会社東芝 | 無線通信装置及び受信方法 |
US8811535B2 (en) * | 2009-07-17 | 2014-08-19 | Mitre Corporation | Time-frequency space constructions of families of signals |
-
2008
- 2008-07-16 JP JP2008554359A patent/JP4276294B1/ja not_active Expired - Fee Related
- 2008-07-16 WO PCT/JP2008/062865 patent/WO2010007674A1/ja active Application Filing
- 2008-07-16 EP EP08778216A patent/EP2302825A4/en not_active Withdrawn
- 2008-07-16 US US12/306,438 patent/US20100232523A1/en not_active Abandoned
- 2008-07-16 CN CN2008800003553A patent/CN102037695A/zh active Pending
- 2008-11-21 WO PCT/JP2008/071251 patent/WO2010007698A1/ja active Application Filing
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000338869A (ja) * | 1999-05-31 | 2000-12-08 | Communication Research Laboratory Mpt | 擬似雑音系列の出力システム、出力装置、出力方法、および、情報記録媒体 |
JP2001292129A (ja) * | 2000-04-07 | 2001-10-19 | Communication Research Laboratory | 擬似乱数列の出力装置、送信装置、受信装置、通信システム、フィルタ装置、擬似乱数列の出力方法、送信方法、受信方法、フィルタ方法、ならびに、情報記録媒体 |
JP2004147126A (ja) * | 2002-10-24 | 2004-05-20 | Osaka Industrial Promotion Organization | マルチキャリア通信方法及びマルチキャリア通信装置 |
JP2005204267A (ja) * | 2004-01-13 | 2005-07-28 | Chaosware Inc | 複素擬似雑音系列の出力装置、スペクトル拡散装置、スペクトル逆拡散装置、送信装置、受信装置、通信システム、複素擬似雑音系列の出力方法、スペクトル拡散方法、スペクトル逆拡散方法、送信方法、受信方法、ならびに、プログラム |
JP2005203929A (ja) * | 2004-01-14 | 2005-07-28 | Japan Science & Technology Agency | 通信システム、送信装置、受信装置、位相拡散符号生成装置、送信方法、受信方法、位相拡散符号生成方法、ならびに、プログラム |
JP2005210664A (ja) * | 2004-01-26 | 2005-08-04 | Chaosware Inc | 複素擬似雑音系列の出力装置、スペクトル拡散装置、スペクトル逆拡散装置、送信装置、受信装置、通信システム、複素擬似雑音系列の出力方法、スペクトル拡散方法、スペクトル逆拡散方法、送信方法、受信方法、ならびに、プログラム |
JP2007202091A (ja) * | 2006-01-23 | 2007-08-09 | Chaosware Inc | 複素擬似雑音系列の出力装置、スペクトル拡散装置、スペクトル逆拡散装置、送信装置、受信装置、通信システム、複素擬似雑音系列の出力方法、スペクトル拡散方法、スペクトル逆拡散方法、送信方法、受信方法、ならびに、プログラム |
WO2008081871A1 (ja) * | 2006-12-28 | 2008-07-10 | Ken Umeno | 通信システム、通信方法、ならびに、情報記録媒体 |
Non-Patent Citations (2)
Title |
---|
EIJI OKAMOTO ET AL.: "Chaos Fugoka Hencho Hoshiki no Fukugo Tokusei Kaiseki ni Kansuru Ichikento", IEICE TECHNICAL REPORT, vol. 107, no. 518, 27 February 2008 (2008-02-27), pages 199 - 204 * |
See also references of EP2302825A4 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010028668A (ja) * | 2008-07-23 | 2010-02-04 | Chaosware Inc | 拡散符号計算装置、通信システム、送信装置、受信装置、ならびに、プログラム |
Also Published As
Publication number | Publication date |
---|---|
JPWO2010007674A1 (ja) | 2012-01-05 |
JP4276294B1 (ja) | 2009-06-10 |
CN102037695A (zh) | 2011-04-27 |
EP2302825A1 (en) | 2011-03-30 |
EP2302825A4 (en) | 2012-01-18 |
WO2010007698A1 (ja) | 2010-01-21 |
US20100232523A1 (en) | 2010-09-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR102432449B1 (ko) | 코드분할 다중접속의 다중 사용자 통신 방법 및 장치 | |
AU2019200710B2 (en) | Multi-user code division multiple access communication method, and corresponding transmitter and receiver | |
EP0952678A1 (en) | Digital modulation system using modified orthogonal codes to reduce autocorrelation sidelobes | |
JP2007243277A (ja) | 受信装置、受信方法、ならびに、プログラム | |
de Oliveira et al. | Orthogonal multilevel spreading sequence design | |
WO2016150241A1 (zh) | 一种数据传输方法及装置 | |
KR101568714B1 (ko) | 광대역 무선통신 시스템에서 고속 피드백 채널을 이용한 정보 송수신 장치 및 방법 | |
JP7489431B2 (ja) | マルチキャリアオンオフキーイング信号の提供のための方法、送信機、構造、トランシーバおよびアクセスポイント | |
JP3878175B2 (ja) | Ofdm通信システムにおける最小のpaprを有する数列検索方法 | |
JP4313434B1 (ja) | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 | |
JP4276294B1 (ja) | 通信システム、送信装置、受信装置、ならびに、情報記録媒体 | |
JP5131550B2 (ja) | 拡散符号計算装置、通信システム、送信装置、受信装置、ならびに、プログラム | |
CN108964828B (zh) | 信号发送方法和信号接收方法 | |
JP4327842B2 (ja) | 通信システム、通信方法、ならびに、プログラム | |
WO2019128678A1 (zh) | 一种数据处理方法及装置 | |
CN107979553B (zh) | 载波同步方法及装置 | |
Song | Design of Almost Perfect Complementary Sequence Pairs | |
JP4272593B2 (ja) | 自己相関が低減されるように変形された直交コードを用いるデジタル変調システム | |
KR20220113499A (ko) | 낮은 피크 평균 전력 비율을 위한 넌제로 삽입 기반의 변조 스킴 | |
CN113632557A (zh) | 生成用于参考信号的序列 | |
JP2010130623A (ja) | 拡散符号生成装置、通信システム、送信装置、受信装置、ならびに、プログラム | |
JP2016201676A (ja) | 通信システム、通信局及び通信方法 | |
JP2010268081A (ja) | データ圧縮・復元方法およびデータ圧縮・復元装置 | |
KR20120068999A (ko) | 통신 시스템의 채널 확산을 위한 수열 족의 생성 장치 및 방법 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200880000355.3 Country of ref document: CN |
|
ENP | Entry into the national phase |
Ref document number: 2008554359 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008778216 Country of ref document: EP |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 08778216 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |