Wireless base station using weighting elements of an array antenna

To provide a wireless base station comprising an array antenna which transmits packets to terminals, a packet scheduler which determines transmission sequence of the packets, a modulator which generates modulated signals based on the packets, and a beam former for transmission signal which multiplies the packets with array weights for transmission signal and outputs the transmission signal to the array antenna the beam former for transmission signal comprises a memory which stores the array weights for transmission signal associated with the terminals' IDs. The beam former for transmission signal receives the IDs of selected terminals from the packet scheduler, refers to the memory, and selects the array weights for transmission signal by the IDs of the terminals.

CLAIM OF PRIORITY

The present application claims priority from Japanese application P2004-193330 filed on Jun. 30, 2004, the content of which is hereby incorporated by reference into this application.

BACKGROUND OF THE INVENTION

This invention relates to a wireless base station with an array antenna and, more particularly, to such a base station that executes weighting the elements of the array antenna at a high speed.

Spatial domain multiplexing (SDM) is a technique by which a base station transmits signals to multiple terminals concurrently at a same frequency. In the space domain multiplexing, three prior art techniques are known as methods of scheduling without decreasing throughputs.

A first related art technique is a scheduling method described in Ohfuji et al. “Examining a Scheduling Method for Transmitting Multi-Directional Beams for Downlink High-Speed Packet Transmission” presented on Sep. 13, 2002 at the 2002 IEICE (the Institute of Electronics, Information and Communication Engineers) Society Conference B-5-88.

The base station predicts channel throughputs, using channel state information received from terminals, and sets a terminal having the greatest throughput as a first terminal. The base station calculates an antenna pattern for the first terminal.

Then, the base station selects any other terminal and calculates an antenna pattern for that terminal. The base station sets a terminal for which the array gain in the direction of the selected terminal in the antenna pattern for the first terminal is under threshold and the array gain in the direction of the first terminal in the antenna pattern for the selected terminal is under threshold as a second terminal candidate. The base station repeats this operation for all terminals and determines second terminal candidates.

The base station predicts channel throughputs from the channel state information from the terminals taken as the second terminal candidates and sets a terminal with the greatest predicted throughput as a second terminal. The technique in which the base station schedules transmissions at the same frequency to a plurality of terminals in this way is known.

A second related art technique is a scheduling method described in JP 2003-110485A.

The base station divides terminals with which it communicates into groups. The groups are set up so that the terminals in a group are less interfering with each other. The base station calculates the sum of channel throughputs for the terminals per group and schedules transmissions to the terminals in the group having the greatest sum of the channel throughputs. Such scheduling technique is known.

A third related art technique is a scheduling method described in JP 2003-110486A.

The base station sets a terminal having the greatest channel throughput as a first terminal, as in the first related art technique described above. The base station sets a terminal whose estimated bearing is more than a given angle from the first station as a second terminal. Such scheduling technique is known.

SUMMARY OF THE INVENTION

In an FDD system (e.g., cdma2000 1xEV-DO system), a base station receives channel state information from terminals at a frequency of 600 times a second. Thus, because the base station performs scheduling at this frequency, there is little time before transmitting packets after the scheduling. The above related art techniques did not provide for a weighting method in which the base station determines array weights for transmission signal at a high speed. Consequently, it would take to long if the base station performed weighting after the scheduling.

The base station executes calculation to determine an antenna pattern for scheduling. However, because the amount of the calculation to determine an antenna pattern is considerably large, the base station is unable to determine terminals to which it can transmit packets concurrently in a short time.

An object of this invention is that the base station determines array weights for transmission signal in a short time. Another object of this invention is that the base station determines terminals to which it can transmit packets concurrently in a short time by decreasing the amount of calculation for scheduling.

This embodiment of this invention provides a wireless base station comprising an array antenna which transmits packets to terminals, a packet scheduler which determines transmission sequence of the packets, a modulator which generates modulated signals based on the packets, and a beam former for transmission signal which multiplies the packets with array weights for transmission signal and outputs them to the array antenna. In the wireless base station which transmits the packets to a plurality of terminals, the beam former for transmission signal includes a memory to store the array weights for transmission signal associated with the terminals' IDs. The beam former for transmission signal receives the IDs of selected terminals from the packet scheduler, looks in the memory, and selects the array weights for transmission signal by the IDs of the terminals.

According to this invention, the base station can determine the array weights for transmission signal in a short time.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Embodiments of this invention will be described hereinafter with reference to the drawings.

First Embodiment

First, a first embodiment where the base station does not apply null steering is discussed. The null steering mentioned herein means placing nulls in a direction; thereby, the base station removes signals in the direction from a particular terminal or does not transmit radio waves in that direction to reduce interference to communication with other terminals.

FIG. 1shows a system topology of a base station and terminals communicating with the base station, according to the first embodiment of this invention.

A wireless communication system of the first embodiment comprises a base station1and terminals2A,2B,2C,2D,2E, and2F. All terminals2are within an area where they can communicate with the base station1.

The base station transmits pilot signals at predetermined time intervals throughout its coverage area. Each terminal2receives a pilot signal and estimates the state of its downlink channel (from the base station to the terminal) from the received pilot signal. Each terminal2transmits the result of the channel state estimation (channel state information) to the base station1. The frequency of this transmission varies depending on the applied wireless communication scheme; for example 600 times per second for cdma2000 1xEV-DO and 500 times per second for W-CDMA HSDPA.

In the FDD system, uplink (from a terminal to the base station) and downlink transmissions use different frequencies. Consequently, the base station1cannot estimate a downlink channel state from a received uplink signal. For this reason, each terminal2estimates the downlink channel state from the pilot signal from the base station1and transmits the channel state information to the base station1.

The base station1performs scheduling to determine terminals2to which should transmit packets from the received channel state information. Specifically, the base station1compares the channel state parameters received from all terminals2. And then, the base station1schedules transmission to a terminal with the best channel state preferentially. Moreover, during a time zone when the channel state for a terminal2becomes bad, the base station1schedules transmission to another terminal2with a better channel state. In this way, the scheduling helps minimize fading effects and increase frequency use efficiency.

The base station1transmits a packet to a terminal2in accordance with the scheduling. The base station1transmits the packet, playing an antenna beam3toward the terminal2. By orienting antenna beams3, the base station1is able to transmit packets to multiple terminals2concurrently at the same frequency. This technique of transmitting packets to multiple terminals2concurrently at the same frequency is called spatial domain multiplexing (SDM).

At this time, as will be described later, according to a predetermined value indicating an allowable level to which the states of the channels may deteriorate by mutual interference to communication on the channels, the base station1determines whether such deterioration is not more than the predetermined value. If so, the base station1transmits packets to terminals2A and2C, as described withFIG. 1, concurrently at the same frequency.

FIG. 2is a bock diagram of the base station1for the first embodiment of this invention, where the base station has the uplink based on CDMA and the downlink based on TDMA using shared channels. This base station will be described below.

First, the configuration of the base station1is described, according to uplink signal flow.

Antennas101receive or transmit signals from/to the terminals2. A duplexer102transfers received signals to a path detector103and fingers and transmits transmission signals from the antennas101to the terminals2.

The path detector103performs synchronization processing to detect a code phase through the use of a matched filter or a sliding correlator and inputs the detected code phase to the fingers. If using, for example, the matched filter, the path detector103calculates correlation between a received signal and a pilot signal having a particular code phase and determines whether the correlation is equal to or greater than a predetermined threshold against the sum of noise and an interference level. The path detector103detects a path in time with a code phase when that correlation is obtained and verifies synchronization established.

The path detector103has a function equivalent to a beam former for received signal105internally and performs the synchronization processing on received signals multiplied and weighted with predetermined array weights for received signal; thereby, it can enhance the sensitivity of path detection.

Using the code phase input from the path detector103, the fingers104despread the signals from the terminals2. The fingers104feed the despread signals to the beam former for received signal105and a beam forming control unit109. In this relation, a spreading factor used when despreading the signals is denoted by G.

The beam forming control unit109obtains array weights for received signal WRXand array weights for transmission signal WTXfrom the despread signals.

First, the beam forming control unit109obtains the array weights for received signal WRXby a subspace method. The fingers104input signals (rK(N) or rL(N)) corresponding to the antennas and the path phases to the beam forming control unit109. Then, the beam forming control unit109obtains correlation values from the input signals and obtains a correlation matrix from the correlation values.

rKL=∑n⁢⁢rK⁡(n)⁢rL*⁡(n)
rK(N) presents despread signals of signals received by K antennas at time n.
rKL=rLK*

Considering a particular path phase, the beam forming control unit109, takes the inputs of as many signals as the number of antennas and, therefore, the correlation matrix (R in equation 1) comprises as many rows and columns as the number of antennas. Because this correlation matrix (R in equation 1) is obtained from the despread signals, a desired signal subspace (RSSin equation 1) is a dominant term and the signal subspace can be extracted by a relatively small number of additions.

However, the signals involve an interference subspace RNNas well and it is needed to remove the interference subspace. For this reason, the outputs R′ of the fingers104from which path phase G was removed on purpose are obtained, using equation 2.
R′=RNN+RSS[Equation 2]

To remove the interference subspace RNN, then, calculation is executed by equation 3.

By executing eigen value decomposition of the desired signal subspace RSSthus obtained, the array weights for received signal WRXare obtained as in equation 4. Here, max{eig(X)} denotes calculation to obtain an eigen vector with a maximum eigen value.

While the array weights for received signal WRXare obtained by the subspace method in this embodiment, they may be obtained by MMSE/LMS, MMSE/RLS, etc. for adaptive control.

Next, the beam forming control unit109obtains the array weights for transmission signal WTX. This embodiment is based on the FDD system and uplink and downlink transmissions use different frequencies. Accordingly, the array weights for received signal WRXand the array weights for transmission signal WTXdiffer.

However difference between the uplink and downlink transmission frequencies is within a few percent and antenna intervals are no more than a half wavelength, difference between the array weights for received signal WRXand the array weights for transmission signal WTXis small. Therefore, the array weights for received signal WRXcan be used as the array weights for transmission signal WTX.

The array weights for transmission signal WTXmay be generated by using another known method.

For example, the base station may be equipped with two antenna arrays for transmission and reception, both of which are equivalent in electrical length, and a technique of assigning equal values to the array weights for received signal WRXand the array weights for transmission signal WTXmay be applied.

Alternatively, the array weights for transmission signal WTXmay be obtained by giving an offset that is calculated from the difference between the uplink and downlink transmission frequencies to the array weights for received signal WRX.

The beam forming control unit109inputs the array weights for received signal WRXto the beam former for received signal105and the array weights for transmission signal WTXto a beam former for transmission signal113and a correlator110.

The beam former for received signal105form receive beams by multiplying the despread signals with the array weights for received signal WRX, thus weighting the signals. Then, the beam former for received signal105combines the beams per path (RAKE combining) and transfers a combined signal to a demodulator106.

The demodulator deinterleaves the combined signal and demodulates channel coded data or the like into user data. The demodulator106sends the demodulated signal to a network115via a network interface107. Then, uplink communication processing is complete.

Next, the configuration of the base station1is described, according to downlink signal flow.

A queue for transmission data108stores user data received from the network115via the network interface107. The queue for transmission data108notifies, to a packet scheduler111, ID of a terminal which stores user data, when the user data is stored into it. User data stored in the queue for transmission data108is fed to a modulator112, according to scheduling of the packet scheduler111.

The demodulator106inputs channel state information or a data transfer rate to the packet scheduler111. Specifically, in the case of, for example cdma2000 1xEV-DO, each terminal2observes a pilot signal transmitted from the base station1and transmits the result of the channel state estimated from the pilot signal (channel state information) or the data transfer rate on the channel to the base station1. When having demodulated the signal from the terminal, from the demodulated signal, the demodulator106extracts the channel state information or data transfer rate from the demodulated signal and inputs it to the packet scheduler111.

The correlator110calculates correlations between the array weights for transmission signal WTX(array correlations) and inputs the calculated array correlations to the packet scheduler111.

From all information input thereto, the packet scheduler111performs packet scheduling, according to a method which will be described later. When the packet scheduler111determines terminals2to which to transmit packets, it directs the queue for transmission data108to feed the user data addressed to the determined terminals2to the modulator112. Then, the packet scheduler111notifies the modulator112of the applied modulation scheme and spreading factor. A modulation scheme, for example turbo coding can be used.

The modulator112modulates the user data by the notified modulation scheme and inputs the modulated data to the beam former for transmission signal113. Although only a single. modulator112is shown inFIG. 2, it should be noted that as many modulators as the maximum number of terminals to which the base station will transmit signals concurrently are installed in practical application.

The beam former for transmission signal113, which has a configuration as will be described later, forms transmit beams by multiplying input signals with the array weights for transmission signal WTX, thus weighting the signals. However, the beam former for transmission signal113must compensate difference in electrical length due to difference in cable length or the like to the respective antennas to weight the signals properly.

The transmit beams are supplied via the duplexer102to the antennas101and transmitted as radio waves to the terminals2.

A calibration means114monitors the signals at the ends of the antennas101and checks to see whether the signals with a phase and amplitude as expected are being transmitted. Unless the signals as expected are transmitted, the calibration means114notifies the beam former for transmission signal113that expected signals failed to be transmitted.

Having received this notification, the beam former for transmission signal113adjusts the amplitude and phase rotation angle by modifying the array weights for transmission signal WTX.

FIG. 3Ais a block diagram of the beam former for transmission signal113for the first embodiment of this invention, where the base station does not apply null steering.

The beam former for transmission signal113comprises a memory201, a latch circuit204, a divider203, and multipliers202.

The memory201stores a table containing the array weights for transmission signal WTXassociated with the IDs of the terminals2, as illustrated inFIG. 3B. The beam forming control unit109updates the array weights for transmission signal WTXat relatively long intervals on the order of 0.1 to 0.5 seconds.

The memory201receives the IDs of terminals to which the base station will transmit packets from the packet scheduler111. The memory201looks in the table, retrieves the array weights for transmission signal WTXfor the received IDs, and inputs the array weights to the latch circuit204.

The latch circuit204holds the input array weights for transmission signal WTXuntil packet transmissions to the terminals2finish and inputs the array weights for transmission signal WTXto the multipliers202at timing to transmit packets.

The divider203divides a signal input from the modulator112into signals as many as the number of antennas and inputs the divided signals to the multipliers202. The multipliers202multiply the divided signals with the array weights for transmission signal WTX, thus weighting the signals, and form the beams.

Although algorithm techniques for the packet scheduler111exist heretofore, there have been no techniques for determining the array weights and weighting transmit signals at a high speed by the beam former for transmission signal113.

The beam former for transmission signal113for this embodiment receives the IDs of the terminals2to which the base station will transmit packets, looks up the IDs in the table, simply selects the array weights for transmission signal WTXfor the IDs, calculated beforehand, and weights the transmit signals; thus, it is possible to update the array weights for transmission signal WTXat a high speed.

FIG. 4is a flowchart of operation of the packet scheduler111for the first embodiment of this invention.

First, the packet scheduler111initializes the number of terminals K to communicate with the base station1to1(601). The packet scheduler111gets correlations between the array weights for transmission signal WTX(correlations between the array weights ρ) from the correlator110(602).

Then, the packet scheduler111gets the IDs of the terminals, the destinations of user data stored from the queue for transmission data108(603). Here, the terminal IDs should be uniquely recognized by at least the entities on the base station1.

The packet scheduler gets channel state information from the demodulator106(604).

The packet scheduler111determines the K-th terminal, using proportional fairness (605). The proportional fairness is a calculation method for calculating evaluation functions of the terminals, transmissions to which are to be scheduled, and selecting a terminal with a highest evaluation function value.

Specifically, the packet scheduler111calculates the evaluation function for each terminal as in equation 5.
Φ=DRC/Rave[Equation 5]

DRC is a data transfer rate based on the channel state information received from the terminal. Raveis an average data transfer rate for the terminal for which the evaluation function is calculated by averaging its statistical rates with a forgetting factor. Averaging with the forgetting factor is adding past rates recorded, multiplied with the forgetting factor less than 1, and averaging. This is the same operation as an IIR filter. This evaluation function evaluates whether the current data transfer rate for the terminal is higher or lower than the past average data transfer rate averaged with the forgetting factor.

The packet scheduler111selects the terminal with the highest evaluation function value and, thereby, preferentially schedules transmission to the terminal whose channel state is better than the past average data transfer rate. By thus using the proportional fairness, the packet scheduler111can perform scheduling, while maintaining the fairness among the terminals.

After determining the K-th terminal, the packet scheduler111notifies the queue for transmission data108of the number of terminals K to communicate with the base station, the ID of the K-th terminal, and the applied modulation and coding scheme (MCS) and spreading factor (606).

Having received the notification, the queue for transmission data108determines the user data and its amount to be transmitted to the K-th terminal. The packet scheduler111notifies the modulator112of the MCS and the number of terminals K to communicate with the base station (607). Having received the notification, the modulator112determines the modulation scheme of the K-th modulator112. By the determined modulation scheme, the K-th modulator112modulates the user data fed from the queue for transmission data108and transfers the modulated data to the beam former for transmission signal113.

The packet scheduler111notifies the beam former for transmission signal113of the ID of the K-th terminal and the number of terminals K to communicate with the base station (608). Having received the notification, the beam former for transmission signal113selects the array weights for transmission signal WTXto weight the data received from the K-th modulator112.

Then, the packet scheduler111calculates channel state (S/I) deterioration which will be induced by an increment of K by one. The packet scheduler111determines that the (K+1)th terminal can be added if the deterioration is not more than a threshold and determines that the (K+1)th terminal cannot be added if the deterioration is more than the threshold (609).

If another terminal cannot be added, the packet scheduler111terminates the processing at this slot. If another terminal can be added, it increments K by one (610).

The packet scheduler111selects possible additional terminal candidates, using the correlations between the array weights r, as will be described later (611). After selecting the candidates, the packet scheduler111returns to step605to determine the (K+1)th terminal.

Selecting possible additional terminal candidates in step611are performed by the method below.

When, for instance, the packet scheduler111selects second terminal candidates, if the correlations between the array weights ρ12and ρ21corresponding to the first terminal and a terminal are not more than a predetermined value, it selects that terminal as a second terminal candidate. Here, the correlations between the array weights ρXYrepresent the effect of the communication between the base station1and the Y-th terminal on the array weights for transmission signal WTXfor the X-th terminal.

After selecting the candidates, the packet scheduler111returns to step605and determines the second terminal with the greatest evaluation function value, calculated by the proportional fairness, from among the selected candidate terminates.

When selecting third terminal candidates, likewise, the packet scheduler111uses the correlations between the array weights ρ. Specifically, if the sum of the correlations between the array weights ρ12for the first terminal and those ρ13for a terminal and the sum of the correlations between the array weights ρ21for the second terminal and those ρ23for the terminal are not more than a predetermined value, the packet scheduler selects that terminal as a candidate. Then, the packet scheduler111returns to step605and determines the third terminal.

Here, the reason why the packet scheduler111can select additional terminal candidates, using the correlations between the array weights ρ, is described.

When the base station1starts to communicate with the second terminal, while communicating with the first terminal, the probability of interference to the communication with the first terminal increases. The communication between the base station1and the second terminal causes deterioration of the channel state for the first terminal, as expressed in equation 6.

Hence, from equation 6, the degree of deterioration of the channel state for the first terminal is expressed by the left side of equation 7. In equation 7, a threshold δ is set; this means that, if the degree of deterioration of the channel state for the first terminal is under the threshold δ, the effect of the interference causes no problem. The threshold δ is a real number greater than 1.

By transformation of equation 7, the correlations between the array weights r12are as expressed in equation 8.

If a second terminal is selected, so that the correlations between the array weights ρ12will be under a predetermined value (the value obtained by the right side of equation 7), the deterioration of the channel state for the first terminal will be under the threshold δ.

Thus, because the packet scheduler111can judge channel state deterioration, using only the correlations between the array weights ρ, it can select additional terminal candidates with less effect of interference.

Conversely, the communication with the first terminal causes deterioration of the channel state for the second terminal. Deterioration of the channel state for the second terminal can be expressed in equation 9 similarly to equation 7.

By transformation of equation 9, the correlations between the array weights ρ21are as expressed in equation 10.

If the packet scheduler111selects a terminal for which the correlations between the array weights ρ satisfy the constraints given by equations 8 and 10 as the second terminal, the degree of channel state deterioration by interference will be under the threshold δ, even if the base station communicates with two terminals concurrently at the same frequency.

By repeating the operation of selecting possible additional terminal candidates (611), the packet scheduler111can determine whether the (K+1)th terminal can be added (609) for all terminals.

If, for instance, the base station1transmits to all terminals with equal transmitting power, the packet scheduler111can determine whether another terminal can be added to the first terminal up to the n-th terminal.

To determine whether another terminal can be added (609), the packet scheduler111determines whether the (K+1)th terminal exists, keeping the constraint given by equation 11 satisfied if added to the K-th terminal that has already been allocated, where K increments by 1. Moreover, the packet scheduler111can execute the step611of selecting candidates for the (K+1)th terminal as well by making this decision.

In this embodiment, the packet scheduler111selects possible additional candidates by using only the correlations between the array weights ρ. Thus, the amount of calculation for this embodiment is smaller than that required by conventional techniques for selecting possible additional candidates by obtaining the angle of direction of each terminal. In general, the angle of direction must be obtained by a MUSIC method or the like requiring a great amount of calculation.

Second Embodiment

Now, a second embodiment where the base station1applies null steering is discussed.

The base station configuration is the same as that shown inFIG. 2and its explanation is not repeated.

First, considering uplink signal processing, the beam forming control unit109executes a different calculation to obtain the array weights for received signal WRX.

For array weights for received signal WNULLincluding null steering, it is needed to accurately obtain an interference subspace RNNwhen removing the interference subspace RNNand equation 12 is calculated.

Using the thus obtained interference subspace RNN, the array weights for received signal WNULLincluding null steering are obtained by equation 13.
WNull=RNN−1WRX[Equation 13]

Then, considering downlink signal processing, the beam former for transmission signal113uses a different table stored on its memory and receives different IDs of terminals from the packet scheduler111.

FIG. 5Ais a block diagram of the memory of the beam former for transmission signal113for the second embodiment of this invention, where the base station applies null steering. The memory301for this embodiment is installed instead of the memory201inFIG. 3.

In the case where the base station applies null steering, the memory301stores a table containing the array weights for transmission signal WNULLincluding null steering associated with the IDs of the terminals to which the base station may transmit packets and the IDs of the terminals onto which nulls are steered, as illustrated inFIG. 5B. Although nulls are steered onto a single terminal according toFIG. 5B, nulls can be steered onto any number of terminals by changing the table dimension.

The array weights for transmission signal WNULLincluding null steering are obtained by equation 14. Here, RSSis a signal subspace for a terminal onto which nulls are steered.
WNull=RSS−1WTX[Equation 14]

From the packet scheduler111, the memory301receives not only the IDs (ADDR01) of terminals to which the base station will transmit packets, but also the ID (ADDR02) of a terminal onto which nulls are steered Having received the IDs, the memory looks in the table and selects the array weights for transmission signal WNULLfor these IDs.

Subsequent processing is the same as in the first embodiment and this invention can be carried out even in the case where the base station applies null steering.

Third Embodiment

A third embodiment where the base station applies an OFDMA communication scheme is discussed.

FIG. 6is a block diagram of a base station1according to the third embodiment of this invention, where the base station applies OFDMA.

Processing flows for the embodiment applying OFDMA are the same as described in the foregoing first and second embodiments and, therefore, different sections of the base station configuration are described. The components corresponding to those shown inFIG. 2are assigned the same reference numbers and their explanation is not repeated.

In the base station configuration, a section for uplink signal processing differs from that for the first embodiment; that is, an FFT unit404is installed instead of the path detector103and the fingers104.

The FFT unit404executes Fourier transform calculation, separates an input signal into sub-carrier signals, and inputs the sub-carrier signals to the beam former for received signal105and the beam forming control unit109. The beam former for received signal105multiplies the input sub-carrier signals with the array weights for received signal WRX, thus weighting the signals, and forms transmit beams. Other uplink signal processing that the base station1performs is the same as described for the first embodiment in conjunction withFIG. 2.

In the base station configuration, a section for downlink signal processing differs from that for the first embodiment; that is, an IFFT unit416is installed.

The modulator112modulates user data into multiple sub-carriers (e.g., three sub-carries inFIG. 6) and inputs the sub-carrier signals to the beam former for transmission signal113. The beam former for transmission signal113multiplies all the sub-carrier signals with the array weights for transmission signal WTX, thus weighting the signals, and feeds them to the IFFT unit.

The IFFT unit416executes inverse Fourier transform calculation on the weighted signals and converts the transmit beams into broadband signals. After passing through the duplexer102, the broadband signals are transmitted from the antennas101. Other downlink signal processing that the base station1performs is the same as described for the first embodiment in conjunction withFIG. 2.

In this way, this invention is also applicable to OFDMA.

Fourth Embodiment

A fourth embodiment where the base station applies multiple slot allocation is discussed.

FIG. 7shows a scheduling table with time (slots numbered) on the abscissa and space on the ordinate in the forth embodiment of this invention, where the base station applies multiple slot allocation.

The multiple slot allocation is a method of transmitting information with multiple slots at a decreased data transfer rate and effective when channel conditions are degraded because of transmission to a terminal far away from the base station or some other reason.

In the multiple slot allocation, when the base station1transmits a packet501in a slot S1to a terminal, it is bound to transmit a packet502in a slot S5and a packet503in a slot S9to the same terminal.

In this case, the base station1is predetermined to transmit the packet502in the slot S5before scheduling. Therefore, the packet scheduler111regards the first terminal as having been allocated and starts the operation with the step of determining whether a second terminal can be added (609). Subsequent steps are the same as in the scheduling method explained in conjunction withFIG. 4.

In this way, this invention is applicable even in the case where the base station applies the multiple slot allocation.

This invention can be applied to determining an array antenna pattern in a wireless communication system and is suitable for application to a system that determines an array antenna pattern, based on the signals transmitted from terminals or the like. While the embodiments based on FDMA and OFDMA have been discussed above, the invention can also be applied for other multiplexing schemes.