JP2002198933A - Transmitting channel assignment method and its device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a PDMA channel assignment method which can set a channel to a user who requests a connection using either a receiving signal coefficient vector, a weight vector, or an arriving direction. SOLUTION: According to this method, a channel of i-th time-slot which is not used by other users is assigned to a new connection-requesting user, and the receiving signal coefficient vector at the time is measured and is memorized in a memory; if a user's channel already connected is interfered by the new user's channel comparing the receiving signal coefficient vector of the user's channel already connected and the one of the new user's channel, the other channel is assigned to the new user.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and apparatus for allocating a transmission channel, and more particularly to a PDMA (Path Div.).
In a communication system of the ision Multiple Access system, when a plurality of users transmit and receive data such as voice and video using the same frequency and the same time channel, a user requesting a connection is given a channel to be used for transmission. The present invention relates to a transmission channel allocating method for allocating and a device thereof.

[0002]

2. Description of the Related Art In a mobile communication system such as a portable telephone, which has been rapidly developing in recent years, various transmission channel allocation methods have been proposed for effective use of frequency. Has been FIG. 38 shows frequency division multiple access (Frequency Division Multiple Acce
ss: FDMA), Time Division Multiple Access
FIG. 3 is a layout diagram of channels in various communication systems of iple Access (TDMA) and PDMA. First, FIG.
8, FDMA, TDMA and PDMA will be briefly described. FIG. 38 (a) is a diagram showing FDMA, in which radio waves of different frequencies f1 to f4 are used for users 1 to 3.
The four analog signals are frequency-divided and transmitted, and the signals of the users 1 to 4 are separated by a frequency filter.

[0003] In the TDMA shown in FIG.
Each user's digitized signal has a different frequency f1
The signals of each user are separated by a frequency filter and a time synchronization between the base station and each user mobile terminal device by radio waves of .about.f4 and transmitted in a time-division manner for each fixed time (time slot). On the other hand, recently, in order to increase the frequency use efficiency of radio waves due to the spread of mobile phones,
A DMA method has been proposed. In the PDMA method, as shown in FIG. 38C, one time slot at the same frequency is spatially divided to transmit data of a plurality of users. In this PDMA, the signal of each user is separated by using a frequency filter, time synchronization between a base station and each user mobile terminal, and a mutual interference canceling device such as an adaptive array.

FIG. 39 is a diagram showing a conventional receiving system of a PDMA base station. In this example, four antennas 3 to 6 are provided in order to identify the users 1 and 2, and the outputs of the respective antennas are output from the frequency conversion circuits 7-1.
The signal is supplied to a local oscillation signal Lo, is subjected to frequency conversion, is converted into a digital signal by an A / D converter 11, and is supplied to a DSP (Digital Signal Processor) 12.

The DSP 12 has a channel assignment reference computer 1
21, the channel allocation device 122, and the adaptive array 1
31 and 132 are provided. The channel allocation reference computer 121 calculates in advance whether or not the two user signals can be separated by the adaptive array, and in accordance with the calculation result, the channel allocation device 122 generates channel allocation information including user information for selecting frequency and time. Is given to each of the adaptive arrays 131 and 132. Each of the adaptive arrays 131 and 132 is composed of a signal synthesizing circuit as shown in FIG. 40, for example, and separates signals for each user by selecting only signals of a specific user.

FIG. 40 is a block diagram of a conventional adaptive array. In this example, in order to extract a desired user signal from an input signal including a plurality of user signals, four input ports 14 to 17 are provided, and signals input to each of the input ports 14 to 17 are weight vectors. It is provided to the computer 18 and the multipliers 20 to 23. The weight vector calculator 18 calculates the weight vectors w1 to w4 using the input signal and the training signal corresponding to the specific user signal stored in the memory 19 in advance or the output of the adder 24. Multipliers 20 to 23 are provided with input signals of input ports 14 to 17 and weight vectors w1 to w1.
w4 are multiplied, and sent to the adder 24. Adder 2
4 adds the output signals of the multipliers 20 to 23 and sends the output signal to the output port 25 and / or the weight vector calculator 18.

[0007]

Here, the received signal vector in the PDMA communication will be briefly described. 2
When signals As ₁ (t) and Bs ₁ (t) are received from the user 1 at each of the two antennas, the received signals x ₁ (t) and x ₂ (t) of the respective antennas are represented by the following equations. .

X ₁ (t) = As ₁ (t) + n ₁ (t) x ₂ (t) = Bs ₁ (t) + n ₂ (t) In the above equation, A and B are transmitted from the user 1 and Are the coefficients of the signal received by the antenna, n ₁ (t), n
₂ (t) is a noise component. Here, the received signal vector U1 of the user 1 is represented by the following equation.

[0009]

(Equation 1)

On the other hand, when signals Cs ₂ (t) and Ds ₂ (t) from user 2 are received by the above two antennas, the received signals x ₁ (t) and x ₂ (t) of each antenna are received. Is represented by the following equation. _{x 1 (t) = As 1} (t) + Cs 2 (t) + n 1 (t) x 2 (t) = Bs 1 (t) + Ds 2 (t) + n 2 (t) Here, the reception signal of the user 2 The vector U2 is represented by the following equation.

[0011]

(Equation 2)

When there is one user, the received signal vector U
Although 1 can be easily obtained, when two users are used, signals are mixed, and it becomes difficult to separate the respective signals. Also, even if there is only one user, a plurality of received signals may arrive. If the correlation values of the received signal vectors U1 and U2 are small, signals from the two users can be separated by the adaptive array shown in FIG. 40, so that channels belonging to the same frequency and the same time (time slot) Can be used for communication. However, if the correlation values of the received signal vectors U1 and U2 are large, it is difficult to separate the signals by the adaptive array, and it is impossible to perform communication using channels belonging to the same frequency and the same time (time slot). .

Next, the weight vector will be described. When the two signals s ₁ of the user 1 to the antenna (t) and user 2 of the signal s ₂ (t) is received, the following equation is obtained. _{x 1 (t) = As 1} (t) + Cs 2 (t) + n 1 (t) x 2 (t) = Bs 1 (t) + Ds 2 (t) + n 2 (t) , where the adaptive array in FIG. 47 When the signal 131 extracts the signal of the user 1 according to the information from the channel assignment device 122, that is, in the adaptive array shown in FIG.
_{When 1} (t) and x ₂ (t) are input and the weight vector calculator 18 calculates ideal weights w ₁₁ and w ₁₂ to extract the signal of the user 1, the output signal y ₁ (t)
Is represented by the following equation.

Y ₁ (t) = w ₁₁ (t) x ₁ (t) + w ₁₂
(T) x ₂ (t) = s ₁ (t) + n (t) Here, the weight vector W ₁ of the user ₁ is represented by the following equation. W ₁ = [w ₁₁ , w ₁₂ ] T On the other hand, similarly, when the adaptive array 132 in FIG. 47 extracts the signal of the user 2 according to the information from the channel assignment device 122, the output signal y ₂ (t) is expressed by Is represented.

Y ₂ (t) = w ₂₁ (t) x ₁ (t) + w ₂₂
(T) x ₂ (t) = s ₂ (t) + n (t) Here, the weight vector W ₂ of the user ₂ is represented by the following equation. W ₂ = [w ₂₁ , w ₂₂ ] T If the correlation values of the weight vectors of the two users are large, it is difficult to separate the two users even if the adaptive arrays 131 and 132 are used. Communication cannot be performed using channels belonging to the same time and frequency.

On the other hand, with the recent rapid spread of portable telephones, channel utilization efficiency is approaching its limit, and it is expected that the number of available transmission channels will exceed the number of allocation requests from users in the future. If such a situation is not desired with some reasonable agreement, there is a risk that the operation itself of the mobile communication system will be greatly disrupted.

It is another object of the present invention to provide a transmission channel allocating method and apparatus capable of rationally allocating a transmission channel when channel utilization efficiency reaches a limit.

[0018]

According to the first aspect of the present invention,
A plurality of time slots are provided in the time axis direction, each time slot has a plurality of channels in the path multiplexing direction, and when a user issues a channel assignment request, a channel of an empty slot in the time axis direction is assigned. When there are no more empty slots, the channels of the empty slots in the path multiplexing direction are allocated.

According to the second aspect of the present invention, channel assignment in the path multiplexing direction is performed while shifting the timing in the time axis direction. In the invention according to claim 3, when a user issues a channel allocation request, a channel of an empty slot in the path multiplexing method is allocated, and when there are no more empty slots, a channel of an empty slot in the time axis direction is allocated.

According to the fourth aspect of the present invention, when data is transmitted / received using a multiple access compatible terminal device and a non-compliant terminal device, a specific time slot is set for the non-compliant terminal device. , A channel of a specific time slot is allocated according to a request from a non-compatible terminal device, and a channel of another time slot is allocated according to a request from a corresponding terminal device.

In the invention according to claim 5, a channel of a specific time slot is allocated in response to a request from a non-compatible terminal device, and an empty slot in the time axis direction is allocated in response to a request from a corresponding terminal device. When there are no free slots, a channel of a free slot in the path multiplexing direction is allocated. In the invention according to claim 6, the priority of the connection is pre-assigned to the user on the transmitting side, and when there is no available channel to be allocated, the channel of the existing user having a low priority is substantially interfered with. Forcibly assign to a new user with high priority as far as it can be removed.

According to a seventh aspect of the present invention, in a digital radio communication system for performing communication using a receiver having a plurality of antennas and a plurality of receiving circuits, a plurality of time slots are provided in a time axis direction, and each time slot is provided. Is a device for multiplexing by providing a plurality of channels in the path multiplexing direction and allocating a channel to be used by a user requesting the connection. A means is provided for allocating a channel of a slot and allocating a channel of an empty slot in the time axis direction when an empty slot runs out.

In the digital radio communication system for performing communication using a receiver having a plurality of antennas and a plurality of receiving circuits, a plurality of time slots are provided in a time axis direction, and each time slot is provided. Is a device for multiplexing by providing a plurality of channels in the path multiplexing direction and allocating a channel to be used by a user requesting the connection. A means is provided for allocating a channel of a slot and allocating a channel of an empty slot in the time axis direction when an empty slot runs out.

According to a ninth aspect of the present invention, in a digital radio communication system for performing communication using a receiver having a plurality of antennas and a plurality of receiving circuits, a plurality of time slots are provided in a time axis direction, and each time slot is provided. Is used by a user who requests connection when a plurality of channels are provided in the direction of path multiplexing and multiple access is performed, and when the user transmits or receives data using a terminal device that supports multiple connection and a terminal device that does not support multiple connection. A device for allocating a channel, a specific time slot is set for the non-compliant terminal device, and in response to a request from the non-compliant terminal device, a channel of the specific time slot is allocated, Means for allocating another time slot channel in response to a request from the corresponding terminal device.

According to a tenth aspect of the present invention, in a digital radio communication system for performing communication using a receiver having a plurality of antennas and a plurality of receiving circuits, a plurality of time slots are provided in a time axis direction, and each time slot is provided. Is used by a user who requests connection when a plurality of channels are provided in the direction of path multiplexing and multiple access is performed, and when the user transmits or receives data using a terminal device that supports multiple connection and a terminal device that does not support multiple connection. A device for allocating a channel, wherein a channel of the specific time slot is allocated in response to a request from the non-corresponding terminal device, and an empty slot in the time axis direction is allocated in response to a request from the corresponding terminal device. And a means for allocating a channel of a vacant slot in the multiplex direction when there are no more vacant slots.

[0026]

FIG. 1 is a diagram for explaining a channel assignment procedure according to a first embodiment of the present invention. In the present invention, a plurality of channels belonging to the same time and the same frequency are collectively referred to as time slots. In the example of FIG. 1, three time slots 1 to 3 are shown. Further, when a plurality of users who can be separated for each direction of arrival are communicating within the same time slot, an area used by each user is called a channel, and in the example of FIG. 1, a total of nine channels are shown. . In the first embodiment of the present invention, channels are sequentially allocated to new users in the i direction (time direction) to fill empty time slots.
Allocate a channel in the j direction (or change the channel in the j direction) and start path multiplexing.

FIG. 2 is a diagram for explaining a channel assignment procedure according to the second embodiment of the present invention. In this embodiment, the first time slot 1 is filled with path multiplexing by sequentially allocating channels in the j direction, and when the path multiplexing cannot be performed, the channel is sequentially allocated in the next time slot 2 in the j direction. FIG. 3 is a diagram for explaining a channel assignment procedure according to the third embodiment of the present invention. In this embodiment, a specific time slot (for example, time slot 1) is reserved in advance exclusively for a terminal device that does not support the PDMA protocol. Since this time slot does not support the PDMA protocol, only one user can be connected to one time slot.

If the connection requesting terminal device is compatible with PDMA, channels are sequentially allocated in the i direction to fill empty time slots for PDMA, and when there are no more empty PDMA slots, channels are allocated in the j direction and path multiplexing is started. I do. If the connection requesting terminal device does not support PDMA, a slot dedicated to a terminal not supporting PDMA is allocated. FIG.
FIG. 10 is a diagram for explaining a channel assignment procedure according to a fourth embodiment of the present invention. In the embodiment shown in FIG. 4, channels are sequentially allocated in the i direction (time direction) to new users in the same manner as in FIG.
When there are no more empty slots, the channel is allocated in the j direction, but the time slot connection timing is shifted in the i direction when allocating in the j direction (T (1) → T (2) →
T (3)). By shifting the time slots in time in this manner, it becomes easier to identify each time slot, and it becomes easier to separate paths.

FIG. 5 is a diagram for explaining a channel assignment procedure according to the fifth embodiment of the present invention. In the embodiment shown in FIG. 5, similarly to FIG. 3, a specific time slot (for example, time slot 1) is reserved in advance for a terminal device that does not support the PDMA protocol. Therefore, since this time slot is not compatible with the PDMA protocol, only one user can be connected to one time slot. Then, when the connection request terminal device is PD
If MA is supported, channels are sequentially allocated in the j direction, and the first time slot 2 is filled with path multiplexing. If path multiplexing cannot be performed, a channel is allocated in the i direction, that is, the next time slot 3. The connection request terminal is PD
If MA is not supported, it is allocated to a time slot dedicated to a PDMA-incompatible terminal.

FIG. 6 is a diagram for explaining a channel assignment procedure according to a sixth embodiment of the present invention. Figure 3 above
In the embodiment of FIG. 5 and the embodiment of FIG. 5, a dedicated time slot (time slot 1) is assigned to a terminal device that does not support PDMA. However, in the embodiment shown in FIG. On the other hand, a time slot is appropriately determined. That is, when there is a connection request, it is checked whether or not the terminal device is compatible with PDMA.
It is determined to be an unsupported terminal channel for A. On the other hand, if the terminal device that has made the connection request is PDMA-compatible, it connects if it can connect to the already allocated PDMA time slot, and if it cannot connect, it allocates another free time slot to the PDM.
Allocate and connect for A terminal.

FIG. 7 is a flowchart for explaining a specific operation of channel assignment according to the first embodiment shown in FIG. The program based on this flowchart is executed by the channel assignment reference computer 121 shown in FIG. In FIG. 7, when there is a new channel assignment request from the user, in step (abbreviated as SP in the drawing) SP1, i = 1 is set in the i direction (time direction) shown in FIG. 1, and in step SP2,
The number M of users connected to the first time slot 1 is checked. Then, in step SP3, it is determined whether or not the number of connected users M is 0.

If the number of users M in the time slot 1 is 0, it is known that the channel (1, 1) shown in FIG. 1 is an empty channel. This user is assigned. Thereafter, the user performs communication using the channel (1, 1) as a transmission channel. In step SP5, a received signal vector of a received signal from the user in the channel (1, 1) is measured and stored in a memory (not shown) as user information. The method of measuring the received signal vector will be described later.

On the other hand, if it is determined in step SP3 that the number M of users connected to the time slot 1 is not 0, it is determined that at least the channel (1, 1) has been allocated to transmission with an existing user. Therefore, it is necessary to examine the possibility of assignment in the next time slot 2 channel (2, 1). Therefore, in step SP6, it is determined whether or not i = 1 set in step SP1 is larger than the predetermined number N of time slots for one frequency. N is, for example, P
In the HS, it is normally set to 3, and it is assumed that N = 3 in each embodiment of the present invention as described above.

Since i (= 1) is smaller than N (= 3), i is incremented by 1 in step SP7 and set to i = 2, and 2 (step SP2).
The number M of users connected to the second time slot 2 is checked. Then, it is determined whether or not the number of users M is 0 in step SP3. If the number M of users in the time slot 2 is 0, it is known that the channel (2, 1) shown in FIG. 1 is an empty channel. Is assigned. Thereafter, the user performs communication using the channel (2, 1) as a transmission channel. Step S
At P5, the received signal vector from the user in the channel (2, 1) is measured and stored in the memory as user information.

On the other hand, if it is determined in step SP3 that the number M of users connected to the time slot 2 is not 0, it is determined that at least the channel (2, 1) has been allocated to transmission with an existing user. Since it is known, it is necessary to examine the possibility of the allocation of the next time slot 3 to the channel (3, 1). Hereinafter, steps SP2 to SP7 are repeated to obtain the number M of users in the i-th time slot i in the i direction.
Is 0, the user is assigned to the channel (i, 1) of the time slot (SP4), and the received signal vector of the user is measured and stored in the memory (step SP5).

On the other hand, the N (= 3) th time slot N
Is reached, i.e., when the channel (N, 1) of the time slot N is not an empty channel, i = N is determined in step SP6,
Proceed to step SP8. In step SP8, it is determined whether the received signal vector of the user who is currently making an allocation request is known or unknown. That is, if it is specified that the user making the assignment request is a user who has already been assigned to the channel in the past, the received signal vector is already measured and stored when connecting to the preceding channel. Therefore, the received signal vector is known. On the other hand, if it is specified that the user making the assignment request is the user requesting the first assignment to the channel, the received signal vector is unknown, and the received signal vector is determined in step SP9. Is measured.

The known received signal vector of the user who is making a new allocation request or the received signal vector newly measured in step SP9 is temporarily stored in the memory in step SP10 for the processing described below. Is stored. In the first embodiment, step SP
If it is determined in step 6 that there is no vacant time slot in the i direction, channel allocation is performed in the j direction, so-called path multiplexing in the same time slot is started.

For this purpose, it is determined whether or not a signal of an existing user already connected to the channel and a signal of a new user who requests allocation by path multiplexing interfere in the same time slot. There is a need to. First, in step SP11, i = 1 is set in the i direction,
In step SP12, the first time slot 1
The number M of users currently connected to is checked. Then, in step SP13, j = 1 is set in the j direction (path multiplexing direction).

Then, in SP14, of the reception signal vectors measured in step SP4 and stored in the memory in step SP5, the reception signal vector of the channel (i = 1, j = 1)
At step P10, the received signal vector of the user who is requesting the assignment, which is temporarily stored in the memory, is read, and the cross-correlation value C between them is calculated.

Next, in step SP15, the cross-correlation value C calculated in step SP14 is more than a certain reference value S (S is larger than 0 and smaller than 1) as a criterion for determining the occurrence of interference between signals. Is also determined. If it is determined that the cross-correlation value C is smaller than the reference value S, the already connected channel (1,
It is determined that there is substantially no interference between the signal of the existing user 1) and the signal of the new user requesting the allocation.

In this case, in step SP16, j = 1 set in step SP13 is replaced by step S
It is determined whether or not the number of users examined in P12 is equal to or greater than M. If only the channel (1, 1) is connected to the existing user in the time slot 1, j = M = 1, so the process proceeds to step SP18, and the channel of the time slot 1 (i = 1, M + 1 = 2) , A transmission channel of a new user is allocated, and path multiplexing in time slot 1 is performed. Then, in step SP19, the received signal vector from the user in this channel (1, 2) is measured and stored in a memory (not shown) as user information.

On the other hand, if path multiplexing has already been performed in time slot 1 and two or more users are connected, it is determined in step SP16 that j is not greater than M, and in step SP17, j is incremented by one. Increment is returned to step SP14, and the cross-correlation value C between the received signal vector of the channel (1, 2) stored in the memory and the received signal vector of the new user is calculated. Then, it is determined in step SP15 that the cross-correlation value C is smaller than the reference value S, and if it is determined in step SP16 that j is not less than M, the new user is assigned to the channel (1, M + 1) in step SP18. Are assigned.

On the other hand, if it is determined in step SP15 that the cross-correlation value C is not smaller than the reference value S, an allocation request is made to a signal of an existing user of a channel already connected in time slot 1. It is determined that there is substantial interference with the signal of the new user. In this case, it is necessary to check the possibility of path multiplexing in the next time slot 2.

Therefore, in step SP20, i = 1 set in step SP11 is equal to the number of time slots N
(= 3) or not, and i (= 1) is set to N (=
Since i is smaller than 3), i is incremented by 1 and set to i = 2 in step SP21. Then, the processing of steps SP12 to SP15 is repeated, and if the cross-correlation value C is not smaller than the reference value S,
Until i = N (= 3) is determined in step SP20,
Steps SP12 to SP12 while incrementing i by one
The process of step SP15 is repeated. If a time slot in which the cross-correlation value C is smaller than the reference value S is found, in steps SP16 to SP18, the channel (i, M
A new user is assigned to +1). On the other hand, step S
Until a time slot in which the cross-correlation value C is smaller than the reference value S is not found until i = N (= 3) is determined in P20, it is determined that path multiplexing cannot be performed in any of the time slots, and the relevant step is determined in step SP22. New user connections are not allowed.

As described above, according to the first embodiment of the present invention, as long as there is no interference with a signal of a connected existing user in the same time slot, j
Path multiplexing in the direction is performed to fill time slots. In the above-described embodiment, the received signal vector is used for the calculation of the channel assignment criterion. However, the present invention is not limited to this, and the channel assignment criterion is calculated using the weight vector or the arrival direction vector in parallel. Is also good.

FIG. 8 is a flowchart showing a modification of the first embodiment shown in FIG. In this example, the operations of steps SP8 to SP10 shown in FIG. 7 are performed immediately upon a user's channel assignment request. Other steps SP1 to SP6, SP11 to S
The operation of P22 is the same as that of FIG.

FIG. 9 is a flowchart showing another modification of the first embodiment shown in FIG. In this example, a weight vector is used as a channel assignment reference, and steps SP5, SP8, SP9, SP1 in FIG.
0, SP14, SP19,
It is replaced with a weight vector in steps SP31 to SP36. Other operations are the same as those in FIG.

FIG. 10 is a flowchart showing a further modification of the embodiment shown in FIG. This example is similar to the modification of FIG. 8 in that steps SP32 to SP32 shown in FIG.
The operation 34 is performed immediately upon receiving a user's channel assignment request. Other operations are the same as those in FIG. FIG. 11 is a flowchart showing still another modification of the first embodiment shown in FIG. In this example, the direction of arrival of the user signal is used as the channel assignment criterion, and the interference occurrence reference value between the signals is set to the angle difference S.
(S is from 0 degrees to 360 degrees), and steps SP5, SP8, SP9, SP10, SP14,
The received signal vector in SP19 is stored in step SP3.
7 to SP42, in the direction of arrival of the user signal, step SP
The cross-correlation value in 14 is replaced with the arrival angle difference in step SP41. Other operations are the same as those in FIG.

FIG. 12 is a flowchart showing a further modification of the embodiment shown in FIG. This example is also shown in FIG.
As in the case of the modified example of FIG.
The operation of “0” is performed immediately upon a user's channel allocation request. Other operations are the same as those in FIG. FIG. 13 is a flowchart for explaining a specific operation of channel assignment according to the second embodiment shown in FIG. In the flowchart of the first embodiment shown in FIG. 7, when there is a channel allocation request from the user, it is determined whether or not time slot 1 is empty in a loop of steps SP2 to SP7. Channel allocation is performed in the slot, and if there is no space, i is incremented by 1 in step SP7, and it is determined whether or not there is a space in the next time slot.

On the other hand, in the second embodiment shown in FIG. 13, if there is no user connected in time slot 1, channel allocation is performed to the empty channel in steps SP2 to SP5, and If there are any users, the received signal vectors of the users requesting new channel allocation are measured in steps SP8 to SP10.
In step SP14, a cross-correlation value C between the signal of the existing user and the signal of the new user in the time slot is calculated,
In step SP15, it is determined whether or not the existing user and the new user interfere. If there is no interference and there is a vacancy in the time slot, the channel (i, M +
Assign the channel of the new user to 1). In the case of interference, i is incremented by 1 in step SP21, and steps SP2 to SP20 are repeated. In the next time slot, channel allocation, that is, processing for performing path multiplexing is performed.

FIG. 14 is a flowchart showing a modification of the second embodiment shown in FIG. In this example, if there is a channel allocation request from the user, step S in FIG.
The operation of P8 to SP10 is immediately executed to measure the received signal vector of the user requesting the new channel assignment and store it in the memory. The other operations are the same as those in FIG.

FIG. 15 is a flowchart for explaining a specific operation of channel assignment according to the third embodiment shown in FIG. As described with reference to FIG. 3, in the third embodiment, for example, time slot 1 is reserved in advance as a dedicated time slot of a terminal device that does not support the PDMA protocol. Step SP5 in FIG.
1 to determine whether the terminal device of the user requesting the new channel assignment is PDMA-compatible,
If it is a compatible terminal device, i = k + 1 is set in step SP1, and channel assignment is performed in the same manner as in the first embodiment of FIG. Here, k is a slot number dedicated to a PDMA-incompatible terminal. In a PDMA-compatible terminal device, channel assignment is performed avoiding the k-th time slot.

In step SP51, the user terminal device receives the PD
If it is determined that it does not correspond to MA, step 5
In step 2, k = 1 is set in order to set time slot 1 exclusively for non-PDMA terminals. In step SP53, it is determined whether or not there is a user connected to the k-th time slot. If not, a new user is assigned to the k-th time slot in step SP54. However, if there is already a user, it is determined whether or not k ≧ L in step SP55. Here, L is a predetermined P
This is the number of time slots dedicated to terminals that do not support DMA. k
Is smaller than L, k is set to 1 in step SP56.
In step SP53, it is determined again whether or not there is a user in the next time slot dedicated to a PDMA-incompatible terminal. If not, a channel for a new user is allocated in step SP54. If step SP
If k ≧ L in 55, the connection of the new user is prohibited in step SP57.

FIG. 16 is a flowchart showing a modification of the third embodiment shown in FIG. In this variation,
After determining in step SP51 that the terminal device is compatible with PDMA, steps SP8 to SP10 are immediately executed to store the received signal vector of the user requesting the new channel assignment in the memory. Then, step S
The operations of P1 to SP7 and SP1 to SP22 are executed. The other operations are the same as those in FIG.

FIG. 17 is a flowchart for explaining a specific operation of channel assignment according to the fourth embodiment shown in FIG. As described with reference to FIG. 4, in the fourth embodiment, when a channel is allocated in the j direction, the channel connection timing is shifted in the i direction (T
(1) → T (2) → T (3)). Step SP in FIG.
At 43 (corresponding to step SP4 in FIG. 7), when a new user is assigned to the channel (i, 1), the connection timing T (1) of the channel is specified (for example, when the reference time T (1) = 0). It is specified).

Next, in step SP44 of FIG. 17 (corresponding to step SP18 of FIG. 7), the channel (i, M
When a new user is assigned to (+1), the channel connection timing (M + 1) is specified. Other operations are
The description is omitted because it is the same as FIG. FIG. 18 shows FIG.
21 is a flowchart for explaining a specific operation of channel assignment according to the fifth embodiment shown in FIG. As described with reference to FIG. 5, when time slot 1 is allocated as a dedicated time slot for a PDMA non-compatible terminal, and it is determined in step SP51 that the terminal device is a PDMA non-compatible terminal device, the third embodiment of FIG. As described in
Steps SP52 to SP57 are executed. But P
If the terminal device is compatible with DMA, the same operation as in the second embodiment in FIG. 13 is performed. That is, if the terminal device requesting connection is PDMA-compatible, a time slot other than the time slot dedicated to a PDMA-incompatible terminal is set to step SP
At 18, assignment is made by path multiplexing. When the path multiplexing cannot be performed, the vacant state of the next time slot is determined in steps SP2 and SP3, and the channel of the new user is allocated to the first channel of the time slot in step SP4.

FIG. 19 is a flowchart showing a modification of the fifth embodiment shown in FIG. 18, in which the processing of steps SP8 to SP10 of FIG. 18 is performed after step SP51. Subsequent steps SP1 to SP5, SP1
0, since the operations of SP13 to SP22 are the same as in FIG.
Description is omitted. FIG. 20 is a flowchart for explaining a specific operation of channel assignment according to the sixth embodiment shown in FIG. As described with reference to FIG.
In the embodiment, the time slot for the PDMA-incompatible terminal is determined appropriately without previously determining. For this reason, if there is a user's channel assignment request, step SP
At 51, it is determined whether or not the user terminal is a PDMA non-compliant terminal. If it is determined that the user terminal is not a PDMA non-compliant terminal, steps SP52 to SP57 are executed to appropriately allocate time slots.

On the other hand, in step SP51, the user terminal
If it is determined that the device is compatible with DMA, i = 1 is set in step SP1, and the number M of users connected to the i-th time slot is checked in step SP2. If the number of users M is not 0 in step SP3, step SP60
And the user terminal connected to the time slot is PDMA
It is determined whether or not the terminal is a compatible terminal. If it is determined that the user does not support PDMA, in step SP61, i is incremented by 1 to perform path multiplexing in another time slot.

FIG. 21 is a flowchart showing a modification of the sixth embodiment shown in FIG. In the example of FIG. 21, after it is determined in step SP51 that the user terminal is a PDMA-compatible user terminal, steps SP8 and SP9 shown in FIG.
Is performed. Subsequent step SP1
The following operation is the same as that of FIG. This concludes the description of the first to sixth basic transmission channel assignment methods, and various additional embodiments that accompany these embodiments will be described below.

FIG. 22 is a diagram for explaining a specific operation of channel assignment when a user who is talking moves according to the seventh embodiment of the present invention. According to the seventh embodiment, when the user who is communicating moves, interference between the signals of the two users substantially occurs, and the signals of the users cannot be separated using the active array. The user's transmission channel is moved to a time slot that does not substantially interfere with each other.

That is, during the user communication, a mutual interference monitoring command is issued. First, in step SP71, i = 1 is set in the i direction, and in step SP72, the number M of users connected to time slot 1 is increased. Can be examined. Then, when it is determined in step SP73 that two or more users are connected to the time slot 1, there is a possibility that signal interference between users may occur in the time slot 1, and such a case may occur. It is necessary to check for any interference.

First, j = 1 in the j direction at step SP76.
Is set and channel (1, j) of time slot 1 is set.
= (1, 1) is specified, and then j is determined in step SP77.
K = j + 1 = 2 is set in the direction and time slot 1
Channel (1, k) = (1, 2) is designated. Next, in order to determine the presence or absence of interference between the two channels (1, 1) and (1, 2) included in these same time slots, in step SP78, the user signals connected to both channels are determined. Is calculated.

Next, in step SP79, it is determined whether or not the cross-correlation value C calculated in step SP78 is smaller than a reference value S which is a reference for determining the occurrence of interference between signals. If the cross-correlation value C is larger than the reference value S, two user signals connected to two channels (1, 1) and (1, 2) of the same time slot substantially interfere with each other. Is determined, and step S
In P80, to allocate the user signal connected to the channel (1, 2) to another channel, the program proceeds to the routine of the channel allocation method according to any of the first to sixth embodiments.

If it is determined in step SP81 that k is not equal to or more than the number M of users in time slot 1, k is incremented by 1 in step SP82, and channel (1,
The cross-correlation value C of the weight vector of the user signal connected to (1), (1, 3) is calculated. Then, when it is determined that there is substantial interference between the two, channel reassignment is performed in step SP80 as described above.

When the processing in steps SP78 to SP82 described above is repeated and it is determined in step SP81 that k has reached the number M of users in time slot 1, it is determined in step SP83 whether j is greater than or equal to M-1. Is determined. j
Does not reach M-1, j is incremented by 1 in step SP84.
The channel (1, 2) and the channel (1,
k) is determined. Then, when it is determined that there is interference between the two, channel reassignment is performed in step SP80 as described above.

The processing in steps SP77 to SP84 described above is repeated, and if it is determined in step SP83 that j is equal to or greater than M-1, all pairs of channels of two or more users included in time slot 1 are checked. That is, it is determined whether there is substantial interference between the two. Then, it is necessary to examine the possibility of substantial interference in the next time slot 2.
Therefore, the program proceeds to step SP74.

On the other hand, if it is determined in step SP73 that two or more users are not connected to the time slot 1, it is known that there is no signal interference between users in the time slot 1. The possibility of substantial interference in time slot 2 needs to be investigated. And
In this case as well, the program proceeds to step SP74, where i = 1 set in step SP71 is the number of time slots M
It is determined whether or not this is the case. Here, i (= 1) is N (=
Since i is smaller than 3), i is incremented by 1 in step SP75 and set to i = 2, and the number M of users connected to the time slot 2 is checked in step SP72.

Hereinafter, the above-mentioned steps SP73 to SP84 will be described.
Is repeated, and in all N time slots,
It is determined whether or not there is substantial interference between users, and when the substantial interference is determined, movement (reassignment) of one user's transmission channel is performed. FIG. 23 is a flowchart showing a modification of the seventh embodiment shown in FIG. In the example shown in FIG. 22, after moving the user of the channel (1, k) of time slot 1 to another channel in step SP80, the process proceeds to steps SP81 and SP82, and the channel (1, j) is fixed. And the channel (1, k)
Is incremented in the j direction. In contrast, in the example shown in FIG. 23, after the user of channel (1, k) moves to another channel, steps SP83, SP
Proceeding to P84, the channel of time slot 1 (1,
j) and (1, k) are both incremented. Other operations are the same as those in FIG. 22, and the description is omitted.

FIG. 24 is a flowchart showing a modification of the seventh embodiment shown in FIG. In the example shown in FIG. 22, in order to determine the substantial interference between the user signal of the channel (1, j) of time slot 1 and the user signal of the channel (1, k) of time slot 1 in step 78, Although the correlation value C of the weight vector of both user signals is checked, in the example shown in FIG. 24, the correlation value C of the reception signal vector of both user signals is checked in step SP85. Other operations are the same as those in FIG. 22, and the description is omitted.

FIG. 25 is a modification of the embodiment shown in FIG. This example is similar to FIG.
At 85, the correlation value C of the received signal vector of both user signals
Is to be checked. FIG. 26 is a flowchart showing a modification of the seventh embodiment shown in FIG. In this example, the angle difference C between the directions of arrival of both user signals is obtained in step SP86.

FIG. 27 is a flowchart showing a modification of the embodiment shown in FIG. This example also uses step SP
At 86, the angle difference C between the directions of arrival of both user signals is obtained. FIG. 28 is a flowchart showing an operation of updating a received signal vector during communication. When the user is moving during communication, the received signal vector is measured at any time during communication to check the increase or decrease in the amount of signal interference between users.

FIG. 28 shows one person or two persons in one time slot.
The operation of updating the received signal vector when there are more than two users is shown. In step SP91 of FIG. 28,
The time slot 1 is selected by setting i = 1 in the i direction, and the number M of users connected to the time slot 1 is checked in step SP92. If it is determined in step SP93 that one or more users are connected to time slot 1, it is determined in step SP94 whether or not two or more users are connected. If it is determined in step SP94 that the number of users is less than 2, that is, the number of users is 1, in step SP99, the received signal vector of the user of the first channel (1, 1) in time slot 1 is calculated. And update the value stored in memory. Thus, the received signal vector when the number of users M is 1 is:
The calculation is accurately performed using the received signal vector calculation method applied when M = 1, which will be described later with reference to FIGS. 32 and 33.

On the other hand, if the number of users is two or more, j = 1 is set in step SP95 to set the channel (1, 1) of time slot 1. In step SP96, the received signal vector of the user of the channel (1, 1) in time slot 1 is calculated, and the stored value is updated. Thus, the received signal vector when the number of users M is 2 or more is M, which will be described later with reference to FIGS.
= 1 or M ≧ 2, it is accurately calculated using the received signal vector calculation method applied.

Then, in step SP97, it is determined whether or not the channel number j in the j direction has become equal to or more than the number M of users.
Is incremented by 1 to calculate the received signal vector of the next channel (1, j) and update the value stored in the memory. FIG. 29 is also a flowchart showing the operation of updating the received signal vector regardless of how many users are in one time slot. In FIG. 28 described above, a special calculation method is used only when the number of users is one, so that the processing of steps SP94 and SP99 was necessary,
In FIG. 29, in step SP96, FIGS.
, The calculation method applied when M = 1 or M ≧ 2 is used, and thus these processes are omitted.
Other operations are the same as those in FIG.

Next, a method of calculating a received signal vector of each user when two or more users are connected to one time slot will be described. When the number of antenna elements is two and the number of users connected to one time slot is two, the received signal is represented by the following equation. _{X (t) = [x 1} (t), x 2 (t)] T x 1 (t) = h 11 s 1 (t) + h 12 s 2 (t) + n 1 (t) x 2 (t) = h ₂₁ s ₁ (t) + h ₂₂ s ₂ (t) + n ₂ (t) Here, x _i (t) is a received signal of the i-th antenna, and _si (t) is a signal of the i-th user. And n
_i (t) is the thermal noise of the i-th antenna, _hij is i
Denote the coefficient of the jth user signal received by the th antenna, and [•] ^T represents the transpose of the matrix [•].

Here, the adaptive array operates well.
In this case, user signals are separated and extracted,
s_i(T) are all known. Therefore, the received signal is
Multiply by the user signal that became known,
When the average (time average) is calculated, it is expressed by the following equation. E [x₁(T) s₁(T)] = h₁₁E [s₁(T) s₁
(T)] + h₁₂E [s _Two(T) s₁(T)] + E [n₁
(T) s₁(T)] Here, if the averaging time is sufficiently long, the first term on the right side of the above equation
E [s₁(T) s₁(T)] = 1, and the second term is
Since there is no correlation between the signal of user 1 and the signal of user 2,
[S_Two(T) s₁(T)] = 0, and the third term is the user
1 and the noise signal have no correlation, so E [n₁(T)
s₁(T)] = 0, so that the first user
Vector value h received by the antenna₁₁Is calculated by the following formula
Wear.

When E [x ₁ (t) s ₁ (t)] = h ₁₁ or less, the vector value h is similarly changed by changing the antennas in order.
₂₁ can be calculated by the following equation. E [x ₂ (t) s ₁ (t)] = h ₂₁ As a result, the received signal vector R _{1 of} user ₁ =
[H ₁₁ , h ₂₁ ] ^T can also be calculated.

FIG. 30 shows the received signal vector of each user described above.
6 is a flowchart illustrating a file calculation method. FIG. 30
In step SP101, a parameter k indicating the time is set.
Parameter in step SP102.
Data m = 1, e_m= 0 is set. Note that e_mIs Ante
There are as many elements as there are. E in step SP103_m= E _m
+ X_m(K) s_j(K) is calculated. Where x
_m(K) is the received signal of the m-th antenna at time k.
S_j(K) is the modulated signal of the j-th user
And signals separated by the adaptive array.

In step SP104, it is determined whether or not m ≧ the number of antenna elements N. If m is smaller than N, the process proceeds to step S104.
In step P105, the parameter m is incremented by one, and steps SP103 and SP104 are repeated. Step SP
When the parameter m becomes equal to or larger than the number N of antenna elements in 104, it is determined in step SP106 whether the parameter k indicating time is equal to or larger than a predetermined number T of symbols for performing time averaging. If larger, step SP10
At 7, k is incremented by 1 and the processing of steps SP102 to SP106 at the next time is repeated. Then, at k = T, set to m = 1 in step SP108, by dividing the e _m at T an average value h _mj in step SP109. If it is determined in step SP110 that m ≧ N, the parameter m is set to 1 in step SP111.
Then, in step SP109, the average value of the next antenna element is obtained. If it is determined in step SP110 that the parameter m has become N, a received signal vector R _j = [h _ij ,..., H _Nj ] ^T is output.

FIG. 31 is a flowchart showing a modification of the embodiment shown in FIG. In the example shown in FIG. 30 described above, adds the received signals e _m for each antenna element in the loop of steps SP103～SP105, Step SP
Although the ensemble average value is obtained in step 109, in the example shown in FIG. 31, the addition and the ensemble average are obtained in step SP112, and the other operations are the same as those in FIG.

In the above description, the method of calculating the received signal vector of each user when one or more users are connected to one time slot is explained. Next, one user is assigned to one time slot. The method of calculating the received signal vector of the user when is connected will be described. When the number of antenna elements is two and the number of connected users is one, the received signal is represented by the following equation.

[0082] _{X (t) = [x 1} (t), x 2 (t)] T x 1 (t) = h 11 s 1 (t) + n 1 (t) x 2 (t) = h 21 s 1 (T) + n ₂ (t) where x _i (t) is the received signal of the i-th antenna, s _i (t) is the signal of the first user, and n
_i (t) is the thermal noise of the i-th antenna, _hij is i
The first user signal received by the second antenna is affected by fading or the like, and as a result, shows a phase and amplitude value that fluctuates. [•] ^T represents the transpose of matrix [•].

Here, the adaptive array operates well.
In this case, user signals are separated and extracted,
s_i(T) is known. Therefore, the received signal must be
User signal s₁Divide by (t) and average ensemble
Calculate (time average). E [x₁(T) ÷ s₁(T)] = h₁₁E [s₁(T) ÷
s₁(T)] + E [n ₁(T) ÷ s₁(T)] Here, if the average time is long enough, E [s₁(T) ÷ s₁
(T)] = 1, and E [n₁
(T) ÷ s₁(T)] = 0, the first user 1
Vector value h received by the antenna₁₁Can be calculated
You.

When E [x ₁ (t) ÷ s ₁ (t)] = h ₁₁ or less, the antennas are sequentially changed, and E [x ₂ (t) ÷ s ₁ (t)] = h ₂₁ . 1 received signal vector R ₁ = [h ₁₁ , h
₂₁ ] ^T can be calculated. FIG. 32 is a flowchart for executing the above-described received signal vector calculation method. Only step SP114 differs from SP103 in FIG. In other words, we are adding those reception signals x _m at time k for each antenna element a (k) divided by the j-th modulated signals s _j (k) in the received signal e _m at step SP114, step In SP109, h _mj
Is required.

FIG. 33 is a flowchart showing a modification of FIG. 32, and corresponds to the modification of FIG. That is, the division by T in step SP109 in FIG. 32 is performed in step SP115, and the other operations are the same as those in FIG. In the above description, a case has been described in which a plurality of users communicate using the configuration shown in FIG. 39. However, one user performs communication using a plurality of paths with reference to FIG. An embodiment for allocating a channel in a case will be described.

In FIG. 34, in FIG.
9, a channel assignment computer 121, a channel assignment device 122, adaptive arrays 131 and 132 are provided, and a data combiner 123 is provided. The signal of the channel (1, 1) transmitted from the user 1 of the adaptive array 131 is extracted, and the adaptive array 132 extracts the signal of the channel (1) transmitted from the same user 1 communicating using the channel (1, 2). , 1), a signal different from the signal transmitted in step 1) is extracted. In this example,
A signal of 32 Kbps is given to the data combiner 123 as a signal of the channel (1, 1), a signal of 32 Kbps is given to the data combiner 123 as a signal of the channel (1, 2), and a signal of 64 Kbps is sent from the data combiner 123. The data rearranged in the sequence is output.

By the way, due to the recent rapid spread of portable telephones, even if the above-mentioned PDMA system is adopted, it is expected that the frequency utilization efficiency will reach the limit in the near future. That is, even if there is a connection request from a new user, there is no available channel that can be connected to any of the time slots, and it is expected that connection will eventually be rejected. If such a situation is neglected, a significant trouble will occur in the operation of the mobile communication system.

As one countermeasure against such a situation, a reasonable connection priority is set between users according to a difference in subscription fee and the like. A method of forcibly disconnecting a low-user connection and assigning a high-priority user to the channel is conceivable.
FIG. 35 and FIG. 36 are flowcharts for explaining the operation of the embodiment for performing such channel assignment based on the user priority. The channel assignment operation shown in FIG. 35 is basically the same as the operation of the first embodiment shown in FIG. 7, except for the following points.

That is, in the first embodiment shown in FIG. 7, if it is determined in step SP20 that a connectable free channel does not exist in any of the N time slots, connection of a new user is determined in step SP22. Is disallowed. On the other hand, in the embodiment of FIG. 35, in step SP201, it is determined whether or not the predetermined connection priority of the user newly requesting channel assignment is the lowest.

If it is determined that the user is at the lowest order, the user is rejected in step SP202 because there is no room to allocate a channel until another user is excluded. On the other hand, if it is determined that it is not the lowest,
Since there is a possibility that the channel may be assigned while excluding other users with lower priorities, the process shifts to the priority user connection routine of FIG.

In FIG. 36, i = 1 is set in the i direction in step SP203, and the number M of users connected to the time slot 1 is checked in step SP204 and stored in the memory. Next, in step SP205, k = 1 is set in the j direction, and in step SP206,
The priority of the user already connected to the channel (i, k) = (1, 1) is checked and stored in the memory. Step SP20
If it is determined in step 7 that k is not equal to or larger than the number of users M, k is incremented by 1 in step SP208, the priority of the user of the channel (1, 2) is checked and stored in the memory.

Steps SP206 to SP208 are repeated. When it is determined in step SP207 that k has reached the number of users M, in step SP209, all the users connected to time slot 1 are sorted in ascending order of priority. Sort. However, the sorting result is retained and valid only in this routine, and does not involve a change in the actual channel arrangement.

Next, in step SP210, k = 1 is set in the j direction, and
A parameter NG indicating the number of connected users whose correlation value with the new user exceeds the reference value is set to 0. Step SP2
At 11, the priority of the user newly requesting channel assignment is compared with the priority of the user connected to channel (i, k) = (1, 1). If it is determined that the priority of the new user is lower than the priority of the existing user of the channel (1, 1), the users of the time slots are already sorted in the order of lower priority in step SP209. The priority of the new user should be lower than the other connected users. Therefore, step SP2
Until it is determined at 12 that i has reached the number N of time slots, the comparison of the priority at step SP211 is repeated while incrementing i by 1 at step SP213.

On the other hand, if it is determined in step SP211 that the priority of the new user is higher than the priority of the existing user of channel (1, k), m = 1 is set in the j direction in step SP214. In step SP215, m =
k, it is determined in step SP216 that the received signal vector of the new user and the channel (1,
A cross-correlation value C with the received signal vector of the user m) is calculated.

In step SP217, step S
It is determined whether the cross-correlation value C calculated in P216 is smaller than a reference value S which is a reference for determining the occurrence of interference between signals. When it is determined that the cross-correlation value C is smaller than the reference value S, even if a new user is assigned to the channel (1, k) of the time slot 1, the channel (1, k) is assigned.
It is understood that there is substantially no interference with the user signal of m).

Until it is determined in step SP218 that m has reached the number of users M, in step SP219, while incrementing m by one, steps SP215 to SP215 are performed.
SP 218 is repeated to determine whether or not the signal of the new user does not cause substantial interference with all the channels (1, m) other than m = k in time slot 1.

If m reaches the number of users M in step SP218 and it is determined that there is no substantial interference in the time slot 1, in step SP220, the connection to the channel (1, k) is made. The connection of the user is forcibly disconnected, and a new user is allocated to the channel (1, k) in step SP221. Then, step SP222
And the received signal vector of the new user is assigned to the channel (1,
k) is stored in the memory as user information.

On the other hand, in step SP217, for any channel (1, m) in the time slot 1, the cross-correlation value C is not smaller than the reference value S, and substantial interference occurs in the time slot 1. Is determined, it is determined in step SP223 whether or not NG ≧ 1. NG = 0
NG is set to 1 in step SP224.
Is incremented by one, and k is set to m in step SP225, and the priority is determined in step SP211. That is, since one connected user whose correlation value with the new user exceeds the reference value in the same time slot is found, the new user can replace the channel only with the connected user. Therefore, the second priority determination is performed with k = m.

Thereafter, if C <S is determined again in step SP217, it is determined in step SP223 that NG ≧ 1. That is, it is determined that there are two or more connected users whose correlation value with the new user exceeds the reference value in the same time slot. In this case, even if the new user is replaced with either one of the connected users, the amount of mutual interference with the other user is substantial, and the call is eventually disabled. Therefore, in this case, the assignment to the new user in the time slot is abandoned, and the possibility of the assignment in the next time slot is checked.

Therefore, if it is determined in step SP212 that i has not reached the number of time slots N, i is incremented by 1 in step SP213, and steps SP204 to SP225 are performed for the next time slot.
Is performed. Then, it is determined in step SP211 that the priority of the new user is higher than the user connected to any channel in one time slot, and the user connected to another channel in the time slot. If it is confirmed in Steps SP214 to SP225 that there is no substantial interference between the user and the user, disconnection of the user with low priority of the channel is performed in Step SP22.
At step SP221, a new user is assigned to the channel.

As described above, by differentiating between users for a rational reason such as a difference in subscription fee, efficient operation of the system can be achieved even when the frequency utilization efficiency of the mobile communication system approaches the limit. Can be achieved. Next, FIG. 37 basically corresponds to the seventh embodiment of FIG. 22, and when a moving user moves and causes substantial interference between the user's signals, a predetermined value is determined. Attempts to determine which users should be moved to another channel based on priority.

The example of FIG. 37 is the same as that of FIG.
The second embodiment is the same as the seventh embodiment. That is, in the seventh embodiment of FIG. 22, when it is determined that user signal interference occurs between two channels belonging to the same time slot, in step SP80, channel (i, j) and channel (i) are determined. , K), the user connected to the channel (i, k) is moved to a channel of another time slot. In contrast,
In the embodiment of FIG. 37, two
If it is determined that substantial interference occurs between the two channels, the priorities of the users connected to these two channels are compared, and the user with the lower priority is assigned to another time slot channel. It is controlled to move. Therefore, since it is recognized that the user with the higher priority remains in the currently connected channel, there is no need to start the reassignment operation to another channel, and there is no possibility that the connection will not be permitted. Therefore, also in this case, a rational operation of the mobile communication system becomes possible.

[0103]

As described above, according to the present invention, a channel capable of eliminating interference by using an interference canceller by using any of the received signal vector, weight vector, or direction of arrival of each user is allocated to the user. be able to.
Further, when a user who is communicating is moving, the interference removal apparatus calculates the amount of interference between users in the same time slot using any one of the received signal vector, weight vector, and direction of arrival of each user. A new channel can be allocated that can be used to remove interference.

Further, a specific time slot is set in advance for a terminal device not supporting PDMA,
Even if there is a request from a terminal device that supports A
A specific time slot can be assigned to a terminal device not supporting MA. Furthermore, even when the channel use efficiency approaches the limit, rational channel assignment becomes possible.

[Brief description of the drawings]

FIG. 1 is a diagram for explaining a channel assignment procedure according to a first embodiment of the present invention.

FIG. 2 is a diagram for explaining a channel assignment procedure according to a second embodiment of the present invention.

FIG. 3 is a diagram illustrating a channel assignment procedure according to a third embodiment of the present invention.

FIG. 4 is a diagram for explaining a channel assignment procedure according to a fourth embodiment of the present invention.

FIG. 5 is a diagram for explaining a channel assignment procedure according to a fifth embodiment of the present invention.

FIG. 6 is a diagram illustrating a channel assignment procedure according to a sixth embodiment of the present invention.

FIG. 7 is a flowchart for explaining the operation of the first embodiment shown in FIG. 1;

FIG. 8 is a flowchart showing a modification of the first embodiment.

FIG. 9 is a flowchart illustrating a modification of the first embodiment.

FIG. 10 is a flowchart showing a modification of the embodiment shown in FIG. 9;

FIG. 11 is a flowchart showing a modification of the first embodiment.

FIG. 12 is a flowchart showing a modified example of the embodiment shown in FIG. 11;

FIG. 13 is a flowchart for explaining the operation of the second embodiment shown in FIG. 2;

FIG. 14 is a flowchart illustrating a modification of the second embodiment.

FIG. 15 is a flowchart for explaining the operation of the third embodiment shown in FIG. 3;

FIG. 16 is a flowchart illustrating a modification of the third embodiment.

FIG. 17 is a flowchart for explaining the operation of the fourth embodiment shown in FIG. 4;

FIG. 18 is a flowchart for explaining the operation of the fifth embodiment shown in FIG. 5;

FIG. 19 is a flowchart illustrating a modification of the fifth embodiment.

FIG. 20 is a flowchart for explaining the operation of the sixth embodiment shown in FIG. 6;

FIG. 21 is a flowchart illustrating a modification of the sixth embodiment.

FIG. 22 is a flowchart illustrating the operation of the seventh embodiment.

FIG. 23 is a flowchart showing a modification of the seventh embodiment.

FIG. 24 is a flowchart showing a modification of the seventh embodiment.

FIG. 25 is a flowchart showing a modification of the embodiment shown in FIG. 23;

FIG. 26 is a flowchart illustrating a modification of the seventh embodiment.

FIG. 27 is a flowchart showing a modification of the embodiment shown in FIG.

FIG. 28 is a flowchart showing an operation of updating a received signal vector during communication.

FIG. 29 is a flowchart illustrating an operation of updating a received signal vector during communication.

FIG. 30 is a flowchart showing an operation of updating a received signal vector when only one user is in one time slot.

FIG. 31 is a flowchart showing a modification of the embodiment shown in FIG. 30;

FIG. 32 is a flowchart showing a method of calculating a received signal vector of one user when one user is connected to one time slot.

FIG. 33 is a flowchart showing a modification of the embodiment shown in FIG. 31.

FIG. 34 is a diagram illustrating an embodiment in which one user performs communication using a plurality of path multiplex channels.

FIG. 35 is a flowchart illustrating an operation of an embodiment for performing channel assignment based on priority.

FIG. 36 is a flowchart illustrating the operation of an embodiment for performing channel assignment based on priority.

FIG. 37 is a flowchart illustrating the operation of an embodiment for performing channel reassignment based on priority.

FIG. 38 is an arrangement diagram of user signals in FDMA, TDMA, and PDMA.

FIG. 39 is a diagram showing a conventional PDMA base station receiving system.

FIG. 40 is a block diagram of a conventional adaptive array.

[Explanation of symbols]

 3 to 6 antenna 7 to 10 frequency conversion circuit 11 A / D converter 12 DSP 121 channel allocation reference computer 122 channel allocation device 123 data multiplexer 131, 132 adaptive array

Claims (10)

[Claims] 1. A method for allocating a channel used by a user who requests a connection when a user transmits or receives data at a terminal device using multiple access, comprising: a plurality of time slots in a time axis direction. Is provided, each time slot has a plurality of channels in the path multiplexing direction, and when the user issues a channel assignment request, a channel of an empty slot in the time axis direction is assigned, and A transmission channel allocating method characterized by allocating an empty slot channel in a path multiplexing direction. 2. The transmission channel allocating method according to claim 1, wherein the channel allocation in the path multiplexing direction is performed while shifting the timing in the time axis direction. 3. A method for allocating a channel used by a user requesting a connection when a user transmits or receives data at a terminal device using multiple access, comprising a plurality of time slots in a time axis direction. Is provided, each time slot has a plurality of channels in the path multiplexing direction, and when the user issues a channel assignment request, a channel of an empty slot in the path multiplexing direction is allocated, and A transmission channel allocating method characterized by allocating a channel of an empty slot in a time axis direction. 4. A method for allocating a channel used by a user who requests connection when a user transmits or receives data using a terminal device that supports multiple access and a terminal device that does not support multiple access, wherein: A specific time slot is set for a non-compliant terminal device, and in response to a request from the non-compliant terminal device, a channel of the specific time slot is assigned, and a request from the corresponding terminal device is A transmission channel allocating method characterized by allocating a channel of another time slot in response to the request. 5. A method for allocating a channel to be used by a user who requests connection when a user transmits or receives data using a terminal device that supports multiple access and a terminal device that does not support multiple access, the method comprising: A plurality of time slots are provided in the axial direction, each time slot has a plurality of channels in the path multiplexing direction, and a specific time slot is set for the unsupported terminal device, In response to a request from the terminal device, the channel of the specific time slot is allocated, and in response to a request from the corresponding terminal device, an empty slot channel in the time axis direction is allocated. Allocating a channel of an empty slot of the transmission channel. 6. The connection priority is pre-assigned to the transmitting user, and when there is no available channel to be allocated, as long as interference of the existing low-priority user channel can be substantially eliminated. The transmission channel allocation method according to any one of claims 1 to 5, wherein the transmission channel is forcibly allocated to a new user having a high priority. 7. A digital radio communication system for performing communication using a receiver having a plurality of antennas and a plurality of receiving circuits, wherein a plurality of time slots are provided in a time axis direction, and each time slot is provided in a path multiplexing direction. A device for allocating a channel to be used by a user requesting connection by providing multiple channels and allocating a channel of an empty slot in the path multiplexing direction when the user issues a channel allocation request. A transmission channel allocating device comprising means for allocating a channel of an empty slot in the time axis direction when an empty slot runs out. 8. A digital radio communication system in which communication is performed using a receiver having a plurality of antennas and a plurality of receiving circuits, a plurality of time slots are provided in a time axis direction, and each time slot is provided in a path multiplexing direction. A device for allocating a channel to be used by a user who requests connection, by multiplexing by providing a channel, and when the user issues a channel allocation request, allocates a channel of an empty slot in the path multiplexing direction. A transmission channel allocating device comprising means for allocating a channel of an empty slot in the time axis direction when an empty slot runs out. 9. A digital radio communication system for performing communication using a receiver having a plurality of antennas and a plurality of receiving circuits, wherein a plurality of time slots are provided in a time axis direction, and each time slot is provided in a path multiplexing direction. A device for allocating a channel to be used by a user who requests a connection when a user performs a multiple connection by providing a channel and transmits or receives data using a terminal device that supports the multiple connection and a terminal device that does not support the multiple connection. A specific time slot is set for the non-compliant terminal device, and a channel of the specific time slot is assigned according to a request from the non-compliant terminal device. A transmission channel allocating device comprising means for allocating a channel of another time slot in response to the request of (1). 10. A digital radio communication system in which communication is performed using a receiver having a plurality of antennas and a plurality of receiving circuits, a plurality of time slots are provided in a time axis direction, and each time slot is provided in a path multiplexing direction. A device for allocating a channel to be used by a user who requests a connection when a user performs a multiple connection by providing a channel and transmits or receives data using a terminal device that supports the multiple connection and a terminal device that does not support the multiple connection. In response to a request from the non-compliant terminal device, allocate a channel of the specific time slot, allocate a channel of a free slot in the time axis direction in response to a request from the corresponding terminal device, A transmission channel allocating device comprising means for allocating a channel of an empty slot in a multiplex direction when a slot runs out.