JP3531869B2 - Receiving device, receiving method, program, and information recording medium - Google Patents

Description

Detailed Description of the Invention

[0001]

TECHNICAL FIELD The present invention relates to a receiving device, a receiving method, a program, and an information recording medium.

[0002]

2. Description of the Related Art Conventionally, orthogonal code sequences (M sequence, Go sequence)
ld code, orthogonal code sequence obtained from Walsh function,
It includes orthogonal code sequences, Baker sequences, and Manchester coded orthogonal sequences obtained from Chebyshev polynomials. same as below. ) Has been proposed as a spread code.

For example, IMT 2000 W-CDM
A system, lCDMA2000 system, wireless LAN
In the wireless communication technology based on the system such as IEEE 802.11b, since the same frequency band is used for a plurality of communication connections, CDMA (Code Division Multiple Acces) is used.
s) is used.

In CDMA, a complex number in which elements of an orthogonal code sequence are arranged in a real part and an imaginary part is used as a spreading code, and communication information is spread-modulated by using different spreading codes.
Multiple communication connections can be plugged into the same frequency band and desired communication connections can be separated from the same frequency band.

In such wireless communication technology, communication is often performed between a base station and a mobile terminal.
Generally, first, a signal is transmitted from a mobile terminal to a base station (Up Link communication), the base station receives the signal and synchronizes, and then communication is performed between the two.

Therefore, when the communication between the two is started, the receiving side at that time (generally a base station, but it may be a mobile terminal) is correlated to establish synchronization. It will be.

On the other hand, communication after synchronization (Down Link
(Communication) is synchronized in advance, so only synchronous detection is required.

[0008]

In such wireless communication technology, there is always a demand for a communication technology having a better separation performance and a low BER (Bit Error Rate) even if the number of users increases. There is.

The present invention provides a receiving apparatus, a receiving method, a program for realizing these by a computer, and a computer-readable information recording medium recording the program, which is suitable for performing such spread modulation. With the goal.

[0010]

In order to achieve the above object, the following invention is disclosed according to the principle of the present invention.

A receiving apparatus according to a first aspect of the present invention comprises a signal receiving section, a receiving side filter section, a code generating section, a code side filter section, and a correlation detecting section. Constitute.

That is, the signal receiving section receives a signal.

On the other hand, the reception side filter section receives the received signal as an input sequence, filters this and outputs it.

Furthermore, the code generator generates a spread code.

Then, the code-side filter section receives the generated spread code as an input sequence, filters it, and outputs it.

On the other hand, the correlation detection section performs correlation detection on the result of the filter processing of the reception side filter section with respect to the result of the filter processing of the code side filter section to obtain a transmission signal.

Further, the receiving side filter section and the code side filter section are each provided with a predetermined actual impulse constant r (-
1 ≦ r ≦ 1), a predetermined real number constant x (x ≠ 0), and a predetermined delay time constant D are used to filter the input sequence, and a delay unit, an amplification unit, and an addition unit are provided. To configure.

Here, the delay unit delays the received input sequence by 0, D, 2D, 3D, ..., (N-1) D (N is a predetermined positive integer), and a plurality of delayed sequences. Is output.

On the other hand, the amplifying unit multiplies each of the plurality of delayed sequences delayed and output by the delaying unit by x (-r) ^{NT / D} times and amplifying when the delay time is T. Output the amplified series of. As mentioned above, the delay unit accepts
The input sequence of digits is 0 , D , 2D , 3D , ..., (N-1) D, respectively.
(N is a predetermined positive integer) only a plurality of delay already series delayed
Since it is output, the delay time T is 0 , D , 2D , 3 respectively.
D ,…, (N-1) D , for the multiple delayed sequences
The amplification factor is x (-r) ^{N-0 / D} = x (-r) ^N , x (-r) ^{ND / D} = x (-r) ^N-1 , x (-r) ^{N-2D / D} = x (-r) ^N-2 , x (-r) ^{N-3D / D} = x (-r) ^N-3 , …, x (-r) ^{N- (N-1) D / D} = x ( -r) ^1, to become. This is the geometric progression of the common ratio (-1 / r) . here
Then, if the predetermined real constant x is changed from the current x to -x / r ,
These amplification factors are x (-r) ^N-1 , x (-r) ^N-2 , ..., x (-r) ² ,
It can be rewritten as x (-r) , x .

Further, the adding section calculates the total sum of the plurality of amplified sequences amplified and output by the amplifying section, and outputs this as the result of the filtering process.

Further, the receiving apparatus of the present invention can be configured as follows in the receiving side filter section and the code side filter section.

That is, the delay unit is "0, D, 2 respectively.
Instead of "delaying by D, 3D, ..., (N-1) D", "delaying by D, 2D, 3D, ..., (N-1) D, ND respectively" is performed.

On the other hand, if the amplifying unit, "when the delay time is ^{T, x (-r) NT /} D times to amplify" instead to "the delay time is T, x (- r) Amplify by multiplying ^{(TD) / D.} As described above, the delay unit processes the received input sequence.
Multiples delayed by D , 2D , 3D ,…, (N-1) D , ND respectively
Since the delayed series of is output, the delay time T is
, D , 2D , 3D , ..., (N-1) D , ND ,
The amplification rate for the completed series is x (-r) ^{N- (DD) / D} = x (-r) ^N , x (-r) ^{N- (2D-D) / D} = x (-r) ^N-1 , X (-r) ^{N- (3D-D) / D} = x (-r) ^N-2 , x (-r) ^{N- (4D-D) / D} = x (-r) ^N-3 , … , X (-r) ^{N- (ND-D) / D} = x (-r) ¹ . This is the geometric progression of the common ratio (-1 / r) . here
Then, if the predetermined real constant x is changed from the current x to -x / r ,
These amplification factors are x (-r) ^N-1 , x (-r) ^N-2 , ..., x (-r) ² ,
It can be rewritten as x (-r) , x .

Further, the receiving apparatus of the present invention can be configured as follows in the receiving side filter section and the code side filter section.

On the other hand, the amplifying section performs "x (-r) ^{NT / D} times multiplication when the delay time is T" and amplifies "x (-r) when the delay time is T". r) Amplify by multiplying ^{1 + T / D.} As described above, the delay unit receives the input sequence
Multiple delays of 0 , D , 2D , 3D , ..., (N-1) D respectively
When outputting a delayed series, the delay time T is
Is 0, D, 2D, 3D, ..., (N-1) D , and the said plurality of delay already
The amplification rate for the series is x (-r) ^{1 + 0 / D} = x (-r) x (-r) ^{1 + D / D} = x (-r) ² , x (-r) ^{1 + 2D / D} = x (-r) ³ , x (-r) ^{1 + 3D / D} = x (-r) ⁴ , …, x (-r) ^{1+ (N-1) D / D} = x (-r) ^N Becomes This is the geometric progression of the common ratio (-r) . here,
If you change the given real constant x from the current x to -x / r , this
These amplification factors are x , x (-r) , x (-r) ² , x (-r) ^N-2 ,…, x (-
r) Can be rewritten as ^N-1 .

Further, the receiving apparatus of the present invention can be configured as follows in the receiving side filter section and the code side filter section.

That is, the delay unit is "0, D, 2 respectively.
Instead of "delaying by D, 3D, ..., (N-1) D", "delaying by D, 2D, 3D, ..., (N-1) D, ND respectively" is performed.

On the other hand, the amplifying section, instead of performing "amplify by multiplying x (-r) ^{NT / D} when the delay time is T", "amplifies x (-r) when the delay time is T". r) ^{T / D} multiplication and amplification ”.
As described above, the delay unit outputs each received input sequence.
Re D, 2D, 3D, ..., (N-1) D, a plurality of slow obtained by delayed ND
Since the delayed sequence is output, the delay time T is D ,
2D , 3D , ..., (N-1) D , ND , and the multiple delayed series
The amplification factor for x (-r) ^{ND / D} = x (-r) ^N-1 , x (-r) ^{N-2D / D} = x (-r) ^N-2 , x (-r) ^{N- 3D / D} = x (-r) ^N-3 , x (-r) ^{N-4D / D} = x (-r) ^N-4 , …, x (-r) ^{N-ND / D} = x (-r ) ⁰ = x, to become.

Further, in the receiving apparatus of the present invention, the code generation section uses an orthogonal code sequence (M sequence, Go sequence) as the spreading code.
ld code, orthogonal code sequence obtained from Walsh function,
It includes orthogonal code sequences, Baker sequences, and Manchester coded orthogonal sequences obtained from Chebyshev polynomials. same as below. ), Or a complex orthogonal code sequence composed of orthogonal code sequences each having a different real part and imaginary part.

A receiving method according to another aspect of the present invention is a signal receiving step, a receiving filter step, a code generating step,
A code-side filter process and a correlation detection process are provided and configured as follows.

That is, in the signal receiving step, a signal is received.

On the other hand, in the filter process on the receiving side, the received signal is accepted as an input sequence, and this is filtered and output.

Further, in the code generating step, a spread code is generated.

Then, in the code side filtering step, the generated spreading code is received as an input sequence, and this is filtered and output.

On the other hand, in the correlation detection step, the result of the filter processing in the receiving side filter step is subjected to correlation detection with respect to the result of the filter processing in the code side filter step to obtain a transmission signal.

Further, the receiving side filtering step and the code side filtering step are both performed by a predetermined actual impulse constant.
Using r (-1 ≤ r ≤ 1) and a predetermined real number constant x (x ≠ 0) and a predetermined delay time constant D, the input sequence is filtered, and a delay step, an amplification step, and an addition step are performed. , And are configured as follows.

That is, in the delaying step, the received input sequence is delayed by 0, D, 2D, 3D, ..., (N-1) D (N is a predetermined positive integer) to obtain a plurality of delayed sequences. Output.

On the other hand, in the amplification step, each of the plurality of delayed series output after being delayed in the delay step is multiplied by x (-r) ^{NT / D} and amplified when the delay time is T. Output multiple amplified sequences. As mentioned above, in the delay step
Accepts the received input sequence as 0 , D , 2D , 3D ,
…, Multiple delays delayed by (N-1) D (N is a given positive integer )
Since the delayed sequence is output, the delay time T is 0 ,
D , 2D , 3D , ..., (N-1) D , and the multiple delayed sequences
The amplification factors for x (-r) ^{N-0 / D} = x (-r) ^N , x (-r) ^{ND / D} = x (-r) ^N-1 , x (-r) ^{N-2D / D} = x (-r) ^N-2 , x (-r) ^{N-3D / D} = x (-r) ^N-3 , …, x (-r) ^{N- (N-1) D / D} = x (-r) ^1, to become. Here, the predetermined real constant x, from the current x to -x / r
Once again, these gains are x (-r) ^N-1 , x (-r) ^N-2 ,
…, X (-r) ² , x (-r) , x can be rewritten.

Further, in the adding step, the total sum of the plurality of amplified series amplified and output in the amplifying step is calculated,
This is output as the result of the filtering process.

Further, the receiving method of the present invention can be configured as follows in the receiving side filter step and the code side filter step.

That is, in the delay step, "0, respectively,
Instead of delaying by D, 2D, 3D, ..., (N-1) D,
"Delay by D, 2D, 3D, ..., (N-1) D, ND respectively".

On the other hand, in the amplification step, "the delay time is T
If it is, x (-r) is multiplied by ^{NT / D} and amplified. Instead of that, if the delay time is T, it is multiplied by x (-r) ^{(TD) / D} and amplified. As mentioned above, in the delay process,
Delay the force sequence by D , 2D , 3D , ..., (N-1) D , ND respectively
Since multiple delayed series are output,
T is D , 2D , 3D ,…, (N-1) D , ND , respectively.
The amplification factor for a number of delayed sequences is x (-r) ^{N- (DD) / D} = x (-r) ^N , x (-r) ^{N- (2D-D) / D} = x (-r) ^N-1 , x (-r) ^{N- (3D-D) / D} = x (-r) ^N-2 , x (-r) ^{N- (4D-D) / D} = x (-r) ^{N- 3} , …, x (-r) ^{N- (ND-D) / D} = x (-r) ¹ . Here, the predetermined real constant x, from the current x to -x / r
Once again, these gains are x (-r) ^N-1 , x (-r) ^N-2 ,
…, X (-r) ² , x (-r) , x can be rewritten.

Further, the receiving method of the present invention can be configured as follows in the receiving side filter step and the code side filter step.

On the other hand, in the amplification process, "the delay time is T
If it is, x (-r) is multiplied by ^{NT / D} and amplified ", instead of" if the delay time is T, amplified by x (-r) ^{1 + T / D.} " As mentioned above, in the delay process,
The force sequences are delayed by 0 , D , 2D , 3D , ..., (N-1) D respectively.
If multiple delayed series are output, the delay time
T is 0 , D , 2D , 3D , ..., (N-1) D , respectively,
The amplification factor for the number of delayed sequences is x (-r) ^{1 + 0 / D} = x (-r) x (-r) ^{1 + D / D} = x (-r) ² , x (-r) ^{1 + 2D / D} = x (-r) ³ , x (-r) ^{1 + 3D / D} = x (-r) ⁴ , …, x (-r) ^{1+ (N-1) D / D} = x ( the -r) ^N. Here, the predetermined real constant x, from the current x to -x / r
Once again, these gains are x , x (-r) , x (-r) ² ,
…, X (-r) ^N-2 , x (-r) ^N-1 can be rewritten
It

Further, the receiving method of the present invention can be configured as follows in the receiving side filter step and the code side filter step.

That is, in the delay step, "0, respectively,
Instead of delaying by D, 2D, 3D, ..., (N-1) D,
"Delay by D, 2D, 3D, ..., (N-1) D, ND respectively".

On the other hand, in the amplification step, "the delay time is T
If it is, x (-r) is multiplied by ^{NT / D} and amplified, instead of "if the delay time is T, multiplied by x (-r) ^{T / D} and amplified."
To do. As described above, in the delay step, the input system accepted
Delay the columns by D , 2D , 3D ,…, (N-1) D , ND respectively
Since multiple delayed series are output, the delay time T is
D respectively, 2D, 3D, ..., ( N-1) D, N , and the of the plurality
The amplification factor for the delayed sequence is x (-r) ^{ND / D} = x (-r) ^N-1 , x (-r) ^{N-2D / D} = x (-r) ^N-2 , x (-r ) ^{N-3D / D} = x (-r) ^N-3 , x (-r) ^{N-4D / D} = x (-r) ^N-4 , …, x (-r) ^{N-ND / D} = x (-r) ⁰ = x, to become.

In the receiving method of the present invention, in the code generating step, an orthogonal code sequence (M sequence,
It includes a Gold code, an orthogonal code sequence obtained from a Walsh function, an orthogonal code sequence obtained from a Chebyshev polynomial, a Baker sequence, and a Manchester encoded orthogonal sequence. same as below. ), Or a complex orthogonal code sequence composed of orthogonal code sequences each having a different real part and imaginary part.

A program according to another aspect of the present invention is a computer (ASIC (Application Specific Integrator).
ted Circuit), DSP (Digital Signal Processo)
r) and FPGA (Field Programmable Gate Array). ) Is configured to function as each unit of the above receiving device.

A computer-readable information recording medium (including a compact disc, a flexible disc, a hard disc, a magneto-optical disc, a digital video disc, a magnetic tape, or a semiconductor memory) according to another aspect of the present invention is as described above. Configure to record the program.

The program of the present invention is stored in a general-purpose computer including a storage device, a computing device, an output device, a communication device, a mobile phone, and a PHS (Personal Handyphone Syste).
m) The above receiving device and receiving method can be realized by being executed by a device, a mobile terminal such as a game device, an information processing device such as a parallel computer, an ASIC, a DSP, an FPGA, and the like.

Further, independently of these devices, the information recording medium of the present invention can be distributed and sold in stores or the program itself of the present invention can be distributed and sold via a computer communication network. it can.

[0053]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below. It should be noted that the embodiments described below are for the purpose of explanation, and do not limit the scope of the present invention. Therefore, a person skilled in the art can adopt an embodiment in which each of these elements or all the elements are replaced by equivalents thereof, but these embodiments are also included in the scope of the present invention. .

(Embodiment) FIG. 1 is a schematic diagram showing a schematic configuration of a receiving apparatus according to an embodiment of the present invention. Hereinafter, description will be given with reference to this figure.

The receiver 101 receives a signal via the antenna 102. The received signal is processed by the band pass filter (BPF) 103 to convert the RF frequency band to the base band frequency band, and is sent to the reception side filter 104.

On the other hand, the code generator 111 generates the code included in the orthogonal code sequence. The orthogonal code sequences include the following, for example. -M sequence-Gold code-Orthogonal code sequence obtained from Walsh function (Walsh = Hadamard sequence) -Orthogonal code sequence obtained from Chebyshev polynomial-Baker sequence-Manchester coded orthogonal sequence

Furthermore, in the CDMA communication technique, signal processing of spreading / despreading is performed using a complex spreading code. Therefore, in this case, a complex number in which the codes included in these orthogonal code sequences are assigned to the real part and the imaginary part is generated as a code.

The generated code is code-side filter 112.
Sent to.

FIG. 2 shows FIR (Finit Impulse Re) used in the filter 104 on the receiving side and the filter 112 on the code side.
It is a schematic diagram which shows the schematic structure of a sponse) filter. Hereinafter, description will be given with reference to this figure.

The FIR filter 201 includes a plurality of delay units 2
02, a plurality of amplification units 203, and an addition unit 204.

Each of the plurality of delay sections 202 delays the input sequence by a predetermined delay time D and outputs the delayed sequence. Therefore, in the present embodiment, a sequence delayed by 0, D, 2D, 3D, ..., (N-1) D is input to each of the plurality of amplification units 203. Here, N is the delay unit 20.
It is a number of two.

It should be noted that another delay device may be arranged before the plurality of delay units 202. In this case, the delay time of the delayed sequence given to the plurality of amplification units 203 is
The respective delay times of different delay devices are added. In particular, when the delay time of this other delay device is also D, the sequence delayed by D, 2D, 3D, 4D, ..., (N-1) D is input to each of the plurality of amplification units.

On the other hand, the amplification factors of the plurality of amplifying sections 203 are x, x (-r), x (-r) ² , x (-r) ³ , ..., X (-r) ^N , respectively. There is. Where x (x ≠ 0) is a predetermined real constant, -r (-1 ≤ r
≦ 1) is a predetermined impulse constant, and it is desirable that r = 2−3 ^1/2 .

The adder 204 adds the outputs of the plurality of amplifiers 203.

Therefore, the input sequences are sequentially ...
When s _-2 , s _-1 , s ₀ , s ₁ , s ₂ , ..., the output of the FIR filter 201 is as follows. For easy understanding, the delay time of the output with respect to the input is ignored, and it is assumed that the input has an infinite length.

..., x (s _-N-1 (-r) ^N-1 + ... + s _-4 (-r) ² + s _-3 (-r) ¹ + s _-2 ), x (s _-N (-r) ^N-1 +… + s _-3 (-r) ² + s _-2 (-r) ¹ + s _-1 ), x (s _{-N + 1} (-r) ^N-1 +… + s _-2 (-r) ² + s _-1 (-r) ¹ + s ₀ ), x (s _{-N + 2} (-r) ^N-1 +… + s _-1 (-r) ² + s ₀ (-r) ¹ + s ₁ ), x (s _{-N + 3} (-r) ^N-1 +… + s ₀ (-r) ² + s ₁ (-r) ¹ + s ₂ ),…

The amplification factors of the plurality of amplification units 203 are x (-r) ^N-1 , x (-r) ^N-2 , ..., X (-r) ² , x (-r) ¹ ，
…, X may be used.

With this configuration, the delay times of the plurality of delay sequences output from the plurality of delay units 202 form an arithmetic progression of the tolerance D, and the amplification factor for each of these is the common ratio (- r) or the geometric ratio sequence of the common ratio (-1 / r).

In this embodiment, two FIR filters 201 having the same structure are used as the filter 104 on the receiving side and the filter 112 on the code side for filtering.

The delay section 202 and the amplification section 20 are provided.
3 and the addition unit 204 can be configured by simple arithmetic circuits. Therefore, a computer may be used to perform the operation based on software, and
The dedicated hardware may be configured using C, DSP, FPGA, etc. to perform the calculation.

Now, in this way, the FIR filter 20
1 to use the receiving side filter 104 and the transmitting side filter 11
The signal processed by 2 and 2 is subjected to correlation detection in the correlation detection unit 108. The correlation between complex numbers can be obtained by taking the conjugate of one of the complex numbers and calculating the product with the other complex number.

Then, a transmission signal is obtained by appropriately despreading the result of this correlation detection with the spreading code of the mobile station and the despreading code of the base station being the same.

At the base station in mobile communication, a signal is asynchronously transmitted from the mobile terminal to start communication between the two. Therefore, this correlation detection is BE.
It is extremely important to reduce R. On the other hand, in the case of communication from a base station to a mobile station (Down Link communication), the present technology is not always necessary because synchronization has been established beforehand.

This embodiment is sufficient for improving the BER if it is applied only to the base station side (reception side), while the mobile terminals that have already been popularized and used can continue to use as they are. It has the feature.

FIG. 3 shows a W-CD to which the present technique is applied.
7 is a graph of simulation results showing the relationship between the number of users and BER in the MA system and the conventional W-CDMA system. Hereinafter, description will be given with reference to this figure.

In FIG. 3, the horizontal axis represents the number of users and the vertical axis represents BER.
When this technology is applied (LSF (B
S)) and the result of the conventional technique (W / O LSF in the figure).

For example, when the number of users is 20, the BER is about 0.005 in the conventional technique, while the BER is about 0.003 in the present technique, which shows that the BER is considerably improved. In the case of the same BER, the present technology only needs to perform the filtering process of the present technology on the base station side,
The number of users can be increased by about 10 to 20% as compared with the related art.

In particular, W having the same user capacity
-The facility cost of the base station for CDMA is
Since only 10% to 20% can be reduced only by using the IR filter, this embodiment is extremely effective especially when promoting the spread of the W-CDMA system.

[0079]

As described above, according to the present invention,
It is possible to provide a receiving device capable of low-BER communication, a receiving method, a program for realizing these by a computer, and a computer-readable information recording medium recording the program.

[Brief description of drawings]

FIG. 1 is a schematic diagram showing a schematic configuration of a receiving device according to an embodiment of the present invention.

FIG. 2 is a schematic diagram showing a schematic configuration of a FIR filter used in the reception side filter and the code side filter according to the embodiment of the present invention.

FIG. 3 is a graph showing simulation results of the relationship between the number of users and BER in the present method and the conventional method.

[Explanation of symbols]

101 receiver 102 antenna 103 bandpass filter 104 Receiver filter 108 Correlation detector 111 code generator 112 Code side filter 201 FIR filter 202 Delay unit 203 amplifier 204 adder

─────────────────────────────────────────────────── --Continued front page (56) References JP 2001-60937 (JP, A) Chi-Chung Chen Yao, K. et al. Umeno, K .; Biglieri, E .; , Optimal chaotic spreads spectrum sequences for uplink CDMA systems, AS-SPCC. The IEEE Adaptive Systems for Signal Processing, Communications, and Cont, October 2000, p. 135-140 (58) Fields investigated (Int.Cl. ⁷ , DB name) H04B 1/707 H03H 17/02 601 H03H 17/06 633

Claims (12)

(57) [Claims] 1. A signal receiving section for receiving a signal, a receiving side filter section for receiving the received signal as an input sequence, filtering and outputting this, and a code generating section for generating a spread code. Accepting the generated spreading code as an input sequence,
A code-side filter section that filters and outputs this, and a correlation detection section that obtains a transmission signal by performing correlation detection on the result of the filter processing of the receiving-side filter section with respect to the result of the filter processing of the code-side filter section. And, the receiving side filter section, the code side filter section,
In each case, the input sequence is filtered using the predetermined real impulse constant r (-1 ≤ r ≤ 1), the predetermined real number constant x (x ≠ 0), and the predetermined delay time constant D, and the acceptance Input sequence is 0, D, 2D, 3D, ..., (N
-1) A delay unit that outputs a plurality of delayed sequences delayed by D (N is a predetermined positive integer) and each of the plurality of delayed sequences that are delayed by the delay unit and output, Is T, then x (-r)
An amplification unit that outputs a plurality of amplified sequences that have been amplified by ^{NT / D,} and the sum of the plurality of amplified sequences that have been amplified and output by the amplification unit is calculated, and this is output as the result of filtering. A receiving device, comprising: 2. The receiving device according to claim 1, wherein in the receiving-side filter section and the code-side filter section, the delay section is “0, D, 2D, 3D, ... Instead of "delaying by (N-1) D", "each D, 2D, 3D,
..., (N-1) D, ND delay ", and the amplification unit" x (-r) when the delay time is T ".
^{When the} delay time is T instead of " ^{NT / D} times amplification", x (-r) ^{N- (TD) / D} times amplification is performed. 3. The receiving device according to claim 1, wherein, in the receiving-side filter section and the code-side filter section, the amplifying section is configured so that “when the delay time is T, x ( -r)
Instead of performing " ^{NT / D} multiplication and amplification", "when the delay time is T, multiply by x (-r) ^{1 + T / D} multiplication and amplification". 4. The receiving device according to claim 1, wherein in the receiving-side filter section and the code-side filter section, the delay section is “0, D, 2D, 3D, ... Instead of "delaying by (N-1) D", "each D, 2D, 3D,
..., (N-1) D, ND delay ", and the amplification unit" x (-r) when the delay time is T ".
^{When the} delay time is T instead of " ^{NT / D} times amplification", x (-r) ^{T / D} times amplification is performed. 5. The receiving device according to claim 1, wherein the code generation unit uses an orthogonal code sequence (M sequence, Gold code, Walsh function as an orthogonal code sequence as a spreading code. Code sequence, orthogonal code sequence obtained from Chebyshev polynomial, Baker sequence, Manchester coded orthogonal sequence, and so on.) Characterized by generating. 6. A signal receiving step of receiving a signal, a receiving side filter step of receiving the received signal as an input sequence, filtering and outputting this, and a code generating step of generating a spread code. Accepting the generated spreading code as an input sequence,
A code-side filter step of filtering and outputting this, and a correlation detection step of obtaining a transmission signal by performing a correlation detection on the result of the filter processing of the receiving-side filter step with respect to the result of the filter processing of the code-side filter step. The receiving-side filtering step and the code-side filtering step are each performed by a predetermined actual impulse constant r (-1 ≦ r ≦
1), a predetermined real number constant x (x ≠ 0), and a predetermined delay time constant D are used to filter the input sequence, and the received input sequence is 0, D, 2D, 3D, ..., ( N
-1) Delay step of outputting a plurality of delayed sequences delayed by D (N is a predetermined positive integer) and each of the plurality of delayed sequences delayed and output in the delay step If time is T, then x (-r)
An amplification step of outputting a plurality of amplified series amplified by ^{NT / D,} and calculating the sum of the plurality of amplified series amplified and output in the amplification step, and using this as the result of the filtering process. A receiving method comprising: an addition step of outputting. 7. The receiving method according to claim 6, wherein in the receiving-side filtering step and the code-side filtering step, in the delaying step, “0, D, 2D, 3D, ... (N-
1) Delayed by "D" instead of "D, 2D, 3 respectively"
Delayed by D, ..., (N-1) D, ND ", and in the amplification step," when the delay time is T, x (-
r) ^{NT / D} multiplication and amplification ”, when the delay time is T, x (-r) ^{N- (TD) / D} multiplication is performed . 8. The receiving method according to claim 6, wherein in the receiving-side filtering step and the code-side filtering step, in the amplification step, “when the delay time is T, x ( -
r) Instead of multiplying by ^{NT / D} and amplifying, "the delay time is T
Then, x (−r) ^{1 + T / D} times and then amplifying ”. 9. The receiving method according to claim 6, wherein in the receiving-side filtering step and the code-side filtering step, in the delaying step, “0, D, 2D, 3D, ... (N-
1) Delayed by "D" instead of "D, 2D, 3 respectively"
Delayed by D, ..., (N-1) D, ND ", and in the amplification step," when the delay time is T, x (-
r) ^{NT / D} multiplication and amplification ”, but when the delay time is T, x (-r) ^{T / D} multiplication and amplification are performed. 10. The receiving method according to claim 6, wherein in the code generating step, an orthogonal code sequence (M sequence, Gold code, orthogonal obtained from Walsh function) is used as a spreading code. Code sequence, orthogonal code sequence obtained from Chebyshev polynomial, Baker sequence, Manchester coded orthogonal sequence, and so on.) A method characterized by generating. 11. A computer (ASIC (Application
Specific Integrated Circuit), DSP (Digital Sig)
nal Processor), FPGA (Field Programmable Gate)
Array) is included. ) Is caused to function as the receiving device according to any one of claims 1 to 5. 12. A computer-readable information recording medium (compact disk, flexible disk, hard disk, magneto-optical disk, digital video disk, magnetic tape, or semiconductor) on which the program according to claim 11 is recorded. Including memory.).