JP2010109648A - Data transmission apparatus - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a data transmission apparatus for suppressing the degradation in communication quality by suppressing the occurrence of burst which cannot be properly weighted. <P>SOLUTION: A radio base station allocates a plurality of bursts to a frame having a prescribed width in a time axis direction and a frequency axis direction to transmit data. A MAC layer 20 of the radio base station includes: a transmission scheduling part 203 for allocating transmission data to a frame; and a radio resource arrangement part 204 for arranging bursts in the corresponding frame on the basis of the allocated transmission data. The radio resource arrangement part 204 arranges the bursts to the frame so that the larger a data size of the transmission data may be, the earlier position on the time axis they are positioned at. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a data transmission apparatus that performs data transmission using an adaptive array, and more particularly to a data transmission apparatus that performs data transmission by assigning a plurality of transmission data to a frame having a predetermined width in a time axis direction and a frequency axis direction.

  In recent years, a wireless base station (WiMAX wireless base station) that employs WiMAX (Worldwide Interoperability for Microwave Access) as a communication method with a terminal such as a mobile phone has been developed (for example, Patent Document 1).

  In such a radio base station, OFDMA (Orthogonal Frequency Division Multiple Access) is used in the physical layer. OFDMA is a multiple access scheme based on OFDM (Orthogonal Frequency Division Multiplexing). In OFDMA, high-speed transmission data is divided into low-speed transmission data, and the divided transmission data is superimposed on a plurality of subcarriers (subcarriers) and transmitted in parallel. OFDMA is a method for realizing efficient communication by assigning a plurality of subcarriers to each user.

  FIG. 16 is a diagram for explaining an OFDMA frame configuration. FIG. 4A is a diagram showing a configuration of one frame, and FIG. 4B is a diagram for explaining a frame dividing method in the frequency axis direction. Note that the frame configuration in the figure is a case where TDD (Time Division Duplexing) is used as a method for simultaneous transmission and reception.

  Referring to FIG. 2A, one frame is composed of a downlink subframe, an uplink subframe, a TTG (Transmit Transition Gap), and an RTG (Receive Transition Gap). The downlink subframe is a frame for transmitting from the radio base station to the terminal, and the uplink subframe is a frame for transmitting from the terminal to the radio base station. TTG is a guard time when the radio base station switches from transmission to reception, and RTG is a guard time when the base station switches from reception to transmission.

  In the downlink subframe and the uplink subframe, radio resources are allocated by two-dimensional division of the time axis and the frequency axis.

  In the downlink subframe, a preamble and DL / UL-MAP are first arranged, and a plurality of bursts are arranged in the remaining rear region.

  The preamble provides a signal for establishing frame synchronization to the terminal. DL / UL-MAP provides downlink subframe burst allocation information, uplink subframe burst allocation information, and the like to the terminal.

  The burst is a block for data transmission assigned to each user in order to transmit transmission data for each user (terminal). The burst size is set according to the data size of the transmission data.

  In the case of PUSC (Partial Usage of Subchannels), the downlink subframe is divided into six major groups in the frequency axis direction, as shown in FIG. The downlink subframe can be divided into a plurality of regions in the frequency axis direction in units of major groups. Hereinafter, this divided area is referred to as a “divided area”. For example, in FIG. 5A, the downlink subframe is divided into three divided regions (divided regions A, B, and C) having the same width, and bursts A to I corresponding to transmission data of users A to I are The state allocated to these divided areas A, B, and C is illustrated.

  In the uplink subframe, a sounding area is arranged in addition to a plurality of bursts (not shown). The sounding area provides the radio base station with a sounding signal used for weight calculation in adaptive array processing (described later).

  By the way, in the radio base station, an adaptive array technique can be employed in order to further improve the communication quality with the terminal.

In the adaptive array, a plurality of antennas are installed, and the directivity of the antenna at the time of transmission is generated by weighting (weighting) the amplitude and phase of the output signal from each antenna. The weighting is determined based on a received signal from the terminal as needed based on a control algorithm, so that directivity is optimally controlled while being applied to changes in the communication environment (for example, Patent Document 2). ).
JP 2008-109618 A JP 2002-76744 A

  FIG. 17 is a diagram for explaining a problem that occurs when an adaptive array is employed in the OFDMA scheme.

  In adaptive array processing, a weight calculation for a downstream subframe is normally performed for each burst based on a sounding signal included in the upstream subframe. The weight calculation is sequentially performed from bursts with a fast alignment on the time axis.

  At this time, before applying a weight to each burst (transmission data), the calculation of the weight for the burst needs to be completed.

  However, in order to perform weight calculation with high accuracy, a large calculation load is applied, so that it takes a relatively long time to calculate and generate the weight. For this reason, depending on the arrangement state of each burst, there is a possibility that the weight generation may not be in time before the weight is applied to the burst as in the burst H shown in FIG. In this case, the generated weight cannot be applied (multiplied) to the burst, and there is a possibility that highly accurate communication cannot be performed.

  The present invention has been made in order to solve such a problem, and provides a data transmission apparatus capable of suppressing deterioration in communication quality by suppressing the occurrence of bursts that cannot be appropriately weighted. With the goal.

  Here, the subject of the present invention is extracted from the relationship with the weight generation. However, in order to improve the communication quality, each burst is other than the weight generation in addition to the weight generation or separately from the weight generation. Application of processing results from other processes may also be necessary. In this case as well, as in the case of the weight generation described above, there is a possibility that the generation of the processing result may not be in time before the processing result is applied to each burst due to the relationship with the time required for processing for each burst.

  In this way, the broadest problem of the present invention is to suppress the occurrence of bursts to which this processing result cannot be applied when it is necessary to apply some processing result to each burst in order to improve communication quality. It is in a place to be able to suppress the deterioration of quality.

  In the first aspect of the present invention, data transmission is performed by allocating a plurality of bursts, each of which is subject to weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in the time axis direction and the frequency axis direction. The present invention relates to a data transmission apparatus. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst in the corresponding frame based on the allocated transmission data. Here, the burst placement unit places the burst in the frame so that the transmission data having a larger data size is positioned at an earlier position on the time axis.

  According to the data transmitting apparatus according to the first aspect, since transmission data having a larger data size is positioned at an earlier position on the time axis, the start timing of the subsequent burst in the time axis direction can be delayed. For this reason, the allowable time of the weighting calculation for the subsequent burst can be increased, and the generation of the weight for the subsequent burst can be easily made in time for transmission of the burst. Therefore, it is possible to suppress the occurrence of bursts that cannot be properly weighted.

  In the data transmission device according to the first aspect, the burst placement unit divides the frame in the direction of the frequency axis to set a plurality of frequency regions, and the bursts in order from the frequency region having a large remaining capacity. Can be arranged in the frequency domain.

  In this case, it may happen that transmission data having the largest data size among the transmission data not arranged in the frame cannot be arranged in the frequency region having the largest remaining capacity. In such a case, it is desirable to configure the burst placement unit so that bursts for transmission data having the largest data size below the remaining capacity are placed in the frequency region with the largest remaining capacity. In this way, the start timing of each burst can be delayed while arranging as many bursts as possible in the frame.

  According to the second aspect of the present invention, data transmission is performed by assigning a plurality of bursts, each of which is subject to weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in the time axis direction and the frequency axis direction. The present invention relates to a data transmission apparatus. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst in the corresponding frame based on the allocated transmission data. Here, the burst placement unit sets a predetermined placement order for the plurality of transmission data to be placed in the frame, and places the burst corresponding to the transmission data in the frame according to the placement order. A time position of the burst on the time axis and a time required until the calculation of the weighting for the burst is completed are obtained, and when the time position of the burst is after the time required, the burst is determined according to the arrangement order. Place on the frame.

  According to the data transmitting apparatus which concerns on a 2nd aspect, it can suppress that the burst which cannot be weighted appropriately arises. In addition, bursts can be arranged in a frame according to a desired arrangement order, and the degree of freedom of burst arrangement can be increased.

  In the data transmission device according to the second aspect, the burst placement unit rearranges the burst and the already-arranged burst on the time axis when the time position is earlier on the time axis than the required time. It can be set as the structure which processes.

  With such a configuration, the generation of weights for each burst can be made in time for the transmission timing of each burst by rearranging the bursts. Therefore, although a partial change may occur in the order of arrangement of transmission data due to rearrangement, occurrence of bursts that are not appropriately weighted can be suppressed, and good data transmission can be realized.

  In addition to the method of performing sorting in order of the data size including the already arranged burst and the newly arranged burst, the rearrangement is the most of the already arranged bursts having a smaller data size than the newly arranged burst. A method can be used in which a burst located rearward in the time axis direction is replaced with a newly arranged burst. When the latter method is used, it is possible to suppress a significant change in the arrangement order of transmission data set before rearrangement.

  Alternatively, it is also possible to use a method in which a burst having the smallest data size among the already arranged bursts having a data size smaller than the newly arranged burst is replaced with a burst to be newly arranged. In this way, it is possible to easily generate the weighting for each burst in time for the transmission timing of each burst while suppressing the change in the arrangement order of the transmission data set before rearrangement as much as possible.

  Furthermore, in the data transmitting apparatus according to the second aspect, the burst placement unit divides the frame in the direction of the frequency axis to set a plurality of frequency regions, and sequentially transmits the transmission data from the frequency region having the largest remaining capacity. In the frequency domain, and when the transmission data is arranged in the corresponding frequency domain, the time position of the burst corresponding to the transmission data is after the required time for the burst, according to the arrangement order The burst can be arranged in the corresponding frequency domain.

  In this case, when the burst is arranged in the corresponding frequency domain, the time position of the burst may be earlier on the time axis than the required time for the burst. In such a case, it is desirable to configure the burst arrangement unit so as to perform processing for rearranging the burst and the burst already arranged in the frequency domain on the time axis. In this way, the generation of weights for each burst can be in time for the transmission timing of each burst by rearranging the bursts. In this case as well, as described above, the rearrangement is performed by sorting data in order of increasing data size including the already-arranged burst and the newly-arranged burst, as well as the newly-arranged burst and the already-arranged burst. A method of replacing the burst can be taken.

  In the third aspect of the present invention, data transmission is performed by allocating a plurality of bursts, each of which is subject to weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in the time axis direction and the frequency axis direction. The present invention relates to a data transmission apparatus. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst based on the allocated transmission data in the corresponding frame. Here, the burst placement unit positions the burst start position at an earlier position on the time axis as the burst having a larger width in the time axis direction among the bursts arranged in the frame.

  According to the data transmitting apparatus according to the third aspect, since the burst start position is positioned at an earlier position on the time axis as the burst has a larger width in the time axis direction, the start of the subsequent burst in the time axis direction Timing can be delayed. For this reason, the allowable time of the weighting calculation for the subsequent burst can be increased, and the generation of the weight for the subsequent burst can be easily made in time for transmission of the burst. Therefore, it is possible to suppress the occurrence of bursts that cannot be properly weighted.

  According to a fourth aspect of the present invention, data transmission is performed by assigning a plurality of bursts, each of which is subject to weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in the time axis direction and the frequency axis direction. The present invention relates to a data transmission apparatus. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst based on the allocated transmission data in the corresponding frame. Here, the burst placement unit gives priority to a burst having a large width in the time axis direction among the bursts arranged in the frame, and positions the start position of the burst at an earlier position on the time axis.

  According to the data transmission device according to the fourth aspect, the burst having a large width in the time axis direction is given priority, and the start position of the burst is positioned at an earlier position on the time axis, so that it follows in the time axis direction. The start timing of the burst can be delayed. For this reason, the allowable time of the weighting calculation for the subsequent burst can be increased, and the generation of the weight for the subsequent burst can be easily made in time for transmission of the burst. Therefore, it is possible to suppress the occurrence of bursts that cannot be properly weighted.

  A fifth aspect of the present invention relates to a data transmission apparatus that performs data transmission by allocating a plurality of bursts to a frame having a predetermined width in the time axis direction and the frequency axis direction. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst in the corresponding frame based on the allocated transmission data. Here, the burst placement unit places the burst in the frame so that the transmission data having a larger data size is positioned at an earlier position on the time axis.

  A sixth aspect of the present invention relates to a data transmission apparatus that performs data transmission by assigning a plurality of bursts to frames having a predetermined width in the time axis direction and the frequency axis direction. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst in the corresponding frame based on the allocated transmission data. Here, the burst placement unit sets a predetermined placement order for the plurality of transmission data to be placed in the frame, and places the burst corresponding to the transmission data in the frame according to the placement order. A time position of the burst on the time axis and a time required until the calculation of the weighting for the burst is completed are obtained, and when the time position of the burst is after the time required, the burst is determined according to the arrangement order. Place on the frame.

  A seventh aspect of the present invention relates to a data transmission apparatus that performs data transmission by assigning a plurality of bursts to frames having a predetermined width in the time axis direction and the frequency axis direction. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst based on the allocated transmission data in the corresponding frame. Here, the burst placement unit positions the burst start position at an earlier position on the time axis as the burst having a larger width in the time axis direction among the bursts arranged in the frame.

  An eighth aspect of the present invention relates to a data transmission apparatus that performs data transmission by allocating a plurality of bursts to a frame having a predetermined width in the time axis direction and the frequency axis direction. The data transmission apparatus according to this aspect includes a data distribution unit that allocates transmission data to the frame, and a burst arrangement unit that arranges the burst based on the allocated transmission data in the corresponding frame. Here, the burst placement unit gives priority to a burst having a large width in the time axis direction among the bursts arranged in the frame, and positions the start position of the burst at an earlier position on the time axis.

  According to the fifth to eighth aspects of the present invention, it is possible to delay the start timing of the subsequent burst in the time axis direction. For this reason, it is possible to increase the processing allowable time for the subsequent burst, and it is easy to generate the processing result for the subsequent burst in time for transmission of the burst. Therefore, when it is necessary to apply some processing result to each burst in order to improve communication quality, it is possible to suppress the occurrence of bursts to which this processing result cannot be applied. As a result, it is possible to suppress a decrease in communication quality.

  As described above, according to the present invention, it is possible to effectively suppress the occurrence of bursts in which processing results for improving communication quality such as weighting by an adaptive array cannot be properly applied. Therefore, it is possible to provide a data transmission device that can suppress a decrease in communication quality.

The effects and significance of the present invention will become more apparent from the following description of embodiments. However, the following embodiment is merely an example when the present invention is put into practice, and the present invention is not limited to what is described in the following embodiment.

  Embodiments of the present invention will be described below with reference to the drawings.

<First Embodiment>
First, the radio base station according to the first embodiment will be described. This embodiment is an embodiment according to the first aspect of the present invention.

  FIG. 1 is a diagram illustrating functional blocks of a radio base station. The radio base station includes a network layer 10, a MAC layer 20, and a physical layer 30.

  The network layer 10 receives IP packets (transmission data) from the network in accordance with TCP (Transmission Control Protocol) and UDP (User Datagram Protocol).

  The MAC layer 20 includes a buffer unit 201, a packet encoding unit 202, a transmission scheduling unit 203, and a radio resource arrangement unit 204.

  FIG. 2 is a diagram for explaining functions of the buffer unit 201, the packet encoding unit 202, the transmission scheduling unit 203, and the radio resource arrangement unit 204.

  In the buffer unit 201, a plurality of queues divided for each connection are prepared for each user (terminal) connected to the radio base station. The buffer unit 201 distributes the IP packet transmitted from the network layer 10 for each user, and then temporarily stores the IP packet in each queue according to the type of application included in the IP packet.

  The packet encoding unit 202 creates a PDU (Protocol Data Unit) by adding a header or the like to the IP packet taken out from the queue.

  The transmission scheduling unit 203 changes the transmission time of PDU (transmission data) for each user according to various conditions such as urgency (high real-time property), maximum transfer rate, minimum guaranteed rate, and data amount in the queue. Allocate to downlink subframes. For example, since voice data has a high real-time property, it is placed in a downlink subframe with a fast transmission time. Further, the transmission scheduling unit 203 determines the transmission data amount for each user to be transmitted in one subframe according to the various conditions.

  Radio resource arrangement section 204 arranges a burst corresponding to each transmission data in each downlink subframe in order to place the transmission data distributed by transmission scheduling section 203 in each downlink subframe. The burst allocation algorithm by the radio resource allocation unit 204 will be described in detail later.

  FIG. 3 is a diagram illustrating functional blocks of the physical layer 30.

  The transmission data transmitted from the MAC layer 20 is randomized by the randomizer 301 and then error-coded by the error correction code encoder 302. The transmission data after error coding is rearranged (interleaved) by the bit interleaver 303.

  Next, after the transmission data is divided into subcarriers in subcarrier modulation section 304, signal point mapping on the I / Q plane, that is, subcarrier modulation is performed for each subcarrier. For example, QPSK, 16QAM, etc. can be used as the subcarrier modulation method.

  Transmission data subjected to subcarrier modulation and placed on each subcarrier is transmitted through a plurality of paths, for example, four paths. A weight multiplication unit 305, a multiplexing unit 306, and a wireless transmission unit 307 are arranged on each path.

  The transmission data transmitted through each path is weighted by the weight multiplier 305 multiplying the weight according to each path. The weight is calculated by the weight calculation unit 308 for each transmission data to each user (each terminal), that is, for each burst. Therefore, for each burst, a weight corresponding to the burst is multiplied.

  The weighted transmission data is converted from a frequency domain signal to a time domain signal by being subjected to inverse Fourier transform in the multiplexing unit 306 and then synthesized. Further, in the radio transmission unit 307, the baseband frequency is changed to the carrier frequency. After being up-converted, it is amplified and transmitted from the antenna 309.

  On the other hand, received data transmitted from each user's terminal and received by antenna 309 is amplified by radio receiving section 310 and then down-converted from a carrier frequency to a baseband frequency. The received data is further subjected to Fourier transform in the dividing unit 311 to be converted from a time domain signal to a frequency domain signal.

  As with the multiplexing unit 306 and the wireless transmission unit 307, four wireless transmission units 310 and division units 311 are arranged. The reception data output from the four division units 311 are combined after predetermined weighting is performed in the combining unit 312 and transmitted to the subcarrier demodulation unit 313.

  The received data is demodulated by the subcarrier demodulating unit 313 and further subjected to parallel-serial conversion, and the data divided into the subcarriers are connected in a line.

  Thereafter, the received data is rearranged (deinterleaved) in the bit deinterleaver 314 in the reverse direction to that of the bit interleaver 303, and is further subjected to error correction decoding by the error correction code decoder 315. The randomizer 316 performs processing opposite to randomization and transmits the result to the MAC layer 20.

  Of the transmission data synthesized by the synthesis unit 312, the sounding signal described with reference to FIG. 12 is input to the weight calculation unit 308. The weight calculation unit 308 performs calculation based on a sounding signal based on a predetermined control algorithm, and generates a weight for each burst (transmission data). As a control algorithm, a minimum mean square error (MMSE) method or the like can be used.

  In this way, in this embodiment, by multiplying transmission data by weight, that is, by applying an adaptive array, it is possible to optimally control the antenna directivity in response to changes in the communication environment with the terminal. It is possible to ensure high communication quality.

  Next, a burst allocation algorithm in a downlink subframe performed by the radio resource allocation unit 204 (hereinafter abbreviated as “allocation unit”) performed in the MAC layer 20 will be described. Note that the frame configuration is the same as the configuration described with reference to FIG. 12, but as described with reference to FIG. 12B, the downlink subframe can be divided in the frequency axis direction. Here, a burst allocation algorithm when the downlink subframe is not divided in the frequency axis direction and a case where the downlink subframe is divided into a plurality of divided regions (for example, three divided regions A, B, and C) in the frequency axis direction The burst placement algorithm will be described.

  FIG. 4 is a diagram showing a processing flow by the burst allocation algorithm in a configuration in which the downlink subframe is not divided in the frequency axis direction. FIG. 5 is a diagram showing an example of a frame configuration when burst placement is performed using the algorithm of FIG. In the figure, the relationship between the weight application position and the weight generation completion position for each burst is shown.

  With reference to FIGS. 4 and 5, first, arrangement section 204 sorts the plurality of transmission data sent from transmission scheduling section 203 in descending order of data size (S101). The arrangement unit 204 arranges the data in the downlink subframes in order from the burst corresponding to the transmission data having a large data size according to the sort order.

  That is, the arrangement unit 204 determines whether there is an unallocated burst in the downlink subframe (S102). It should be noted that the non-arrangement at this time indicates that the arrangement has never been attempted, and the arrangements that have been attempted but cannot be arranged and are suspended are excluded. The meaning of this unallocation is the same in the processing flows (FIGS. 6, 8, and 10) of other burst allocation algorithms described below.

  When determining that there is an unallocated burst (S102: YES), the allocation unit 204 determines whether or not the burst with the highest sort order and the largest data size can be allocated in the remaining area of the downlink subframe. (S103: YES), if the arrangement is possible (S103: YES), the burst is arranged from the position with the earlier time in the remaining area (S104). For example, when the time advances from the left to the right in the downlink subframe, it is arranged from the left end of the remaining area.

  Thereafter, the placement unit 204 repeats the processing from step S102 to S105, and when there are no more bursts to be placed (excluding pending ones) (S102: NO), the burst placement is terminated.

  Thus, for example, as shown in FIG. 5, when bursts A to I corresponding to received data of users A to I are arranged in the downlink subframe, these bursts have a data size from an early position on the time axis. Are arranged in descending order. In this figure, for convenience, bursts are arranged without leaving an area, but in reality, there are cases where an area is left even if all bursts are arranged. This also applies to the other burst allocation algorithm embodiments (FIGS. 7, 9, and 11 to 15) described below.

  As described above, the transmission schedule unit 203 determines transmission data to be transmitted in one downlink subframe. At this time, the transmission schedule unit 203 does not precisely calculate whether or not all transmission data can be arranged in the downlink subframe. Therefore, when burst placement is actually performed, there may be a case where not all bursts can be placed. In such a case, a situation occurs in which a burst having a low sort order that the placement unit 204 tries to place in the final stage cannot be placed in the remaining area.

  If the placement unit 204 determines that the burst to be placed cannot be placed in the remaining area (S103: NO), the placement unit 204 places the burst on hold without placing it (S105), and returns to the process of step S102. If an unallocated burst remains (S102: YES) and the next burst to be allocated can be allocated in the remaining area (S103: YES), the burst is allocated in the remaining area. Note that the transmission data corresponding to the burst that has been put on hold is arranged in the subsequent downlink subframes.

  As described above, the weight for the adaptive array is applied to each burst (transmission data) at the transmission timing. After the sounding signal arrives, the weight calculation unit 308 performs the weight calculation in order from the earlier bursts arranged on the time axis, and generates weights.

  When burst placement is performed according to the burst placement algorithm shown in FIG. 4, a burst having a large data size is positioned at an early position on the time axis as shown in FIG. As a result, the start timing (weight application timing) of the subsequent burst in the time axis direction can be delayed, so that the allowable time for the weight calculation for the subsequent burst can be increased. Therefore, it becomes easy to generate a weight for the subsequent burst in time for transmission of the burst (transmission data).

  FIG. 6 is a diagram showing a processing flow by the burst allocation algorithm in a configuration in which the downlink subframe is divided into three divided regions in the frequency axis direction. FIG. 7 is a diagram showing an example of a frame configuration when burst placement is performed using the algorithm of FIG. In the figure, the relationship between the weight application position and the weight generation completion position for each burst is shown.

  In the following, the divided areas formed by dividing the downlink subframe into three in the frequency axis direction are referred to as “divided areas A, B, and C”, respectively, and these divided areas A, B, and C are respectively illustrated in FIG. Assume that they are assigned as shown in

  With reference to FIGS. 6 and 7, first, arrangement section 204 sorts the plurality of transmission data sent from transmission scheduling section 203 in descending order of data size (S201). The arrangement unit 204 arranges the data in the downlink subframes in order from the burst corresponding to the transmission data having a large data size according to the sort order.

  That is, the arrangement unit 204 determines whether there is an unallocated burst in the downlink subframe (S202). When it is determined that there is an unallocated burst (S202: YES), it is determined whether the remaining area of the divided area A is the maximum (S203).

  When the placement unit 204 determines that the remaining area of the divided area A is the maximum (S203: YES), the placement unit 204 determines whether the placement target burst can be placed in the remaining area of the divided area A (S204). . If placement is possible (S204: YES), the burst is placed from the earlier time in the remaining area of the divided area A (S205). Thereafter, the placement unit 202 returns to the process of step S202.

  If the remaining area of the divided area A becomes smaller than the remaining area of the divided area B due to the burst being arranged in the divided area A, the arrangement unit 204 determines that the remaining area of the divided area A is not the maximum in step S203. (S203: NO). Next, the arrangement unit 204 determines whether or not the remaining area of the divided area B is the maximum (S207). If it is the maximum (S207: YES), the arrangement target burst is the remaining area of the divided area B. It is determined whether or not it is possible to arrange in (S208). If placement is possible (S208: YES), the burst is placed from the position with the earlier time in the remaining area of the divided area B (S209). Thereafter, the placement unit 204 returns to the process of step S202.

  If the remaining areas of the divided areas A and B become smaller than the remaining area of the divided area C by arranging bursts in the divided area B following the divided area A, the arrangement unit 204 in steps S203 and S207, the divided area A , B is determined not to be the maximum (S203: NO, S207: NO). Next, the placement unit 204 determines whether the placement target burst can be placed in the remaining region of the divided region C (S211). If placement is possible (S211: YES), the burst is placed from the earlier time in the remaining area of the divided area C (S212). Thereafter, the placement unit 204 returns to the process of step S202.

  Thereafter, the placement unit 204 repeats the above processing, and when there are no more bursts to be placed (except for those on hold) (S202: NO), the burst placement is terminated.

  Thus, for example, as shown in FIG. 7, when bursts A to I corresponding to received data of users A to I are arranged in the downlink subframe, these bursts are divided into divided areas A, B, and C. Are arranged in descending order of data size from an earlier position on the time axis.

  Now, for the same reason as described in the description of the algorithm in FIGS. 4 and 5, there are cases where all bursts cannot be arranged in the divided areas A, B, and C. In this case, even if the remaining area of any one of the divided areas A, B, and C is maximum, there may be a case where the allocation target burst having the maximum data size cannot be allocated to the remaining area.

  If the placement unit 204 determines that the remaining area of the divided area A is the maximum (S203: YES), but cannot place the burst to be placed in the remaining area of the divided area A (S204: NO), the burst is placed. Without putting on hold (S206), it returns to the process of step S102. If an unallocated burst remains (S202: YES) and a burst of the next sort order can be allocated in the remaining area of the divided area A (S204: YES), the burst is allocated in the remaining area of the divided area A. (S205).

  Similarly, if the placement unit 204 determines in S208 that the placement target burst cannot be placed in the remaining area of the divided region B (S208: NO), the placement unit 204 places the burst on hold without placing it (S210). If the next sort order burst can be arranged in the remaining area of the divided area B (S202 → S203 → S207 → S208 / S208: YES), the burst is arranged in the remaining area of the divided area B (S209).

  Similarly, when the placement unit 204 determines in S211 that the burst to be placed cannot be placed in the remaining area of the divided area C (S211: NO), the placement unit 204 places the burst on hold without placing it (S213). If the burst of the sort order can be arranged in the remaining area of the divided area C (S202 → S203 → S207 → S211 / S211: YES), the burst is arranged in the remaining area of the divided area C (S212).

  Even when burst placement is performed according to this burst placement algorithm, as in the burst placement algorithm shown in FIG. 4, as shown in FIG. Positioned early on the axis. As a result, the start timing (weight application timing) of the subsequent burst in the time axis direction can be delayed, so that the allowable time for the weight calculation for the subsequent burst can be increased. Therefore, it becomes easy to generate a weight for the subsequent burst in time for transmission of the burst (transmission data).

  As described above, according to the present embodiment, since the generation of the weight for the subsequent burst is likely to be in time for the transmission of the burst (transmission data), it is possible to suppress the occurrence of the burst to which the weight cannot be properly applied. A decrease in communication quality can be prevented.

  Further, according to the present embodiment, when the burst having the largest data size cannot be arranged in the remaining area, the burst having the next largest data size is arranged in the remaining area. The start timing of each burst can be delayed while arranging the bursts.

  Note that if there is data that needs to be transmitted preferentially at an early timing among the multiple transmission data, the burst corresponding to the transmission data is arranged first, and the remaining transmissions Data can be sorted in descending order of data size.

<Second Embodiment>
Next, a radio base station according to the second embodiment will be described. This embodiment is an embodiment according to the second aspect of the present invention.

  In the radio base station according to this embodiment, the configuration other than the burst allocation algorithm is the same as that of the first embodiment.

  The burst allocation algorithm according to this embodiment will be described below. Also in the present embodiment, as in the first embodiment, a burst allocation algorithm in the case where the downlink subframe is not divided in the frequency axis direction and a plurality of divided regions (for example, divided regions A, B, and C). The burst allocation algorithm in the case of being divided into three) will be described.

  FIG. 8 is a diagram showing a processing flow by the burst allocation algorithm in a configuration in which the downlink subframe is not divided in the frequency axis direction. FIG. 9 is a diagram showing an example of a frame configuration when burst placement is performed using the algorithm of FIG. In the figure, the relationship between the weight application position and the weight generation completion position for each burst is shown.

  Referring to FIGS. 8 and 9, arrangement section 204 arranges bursts corresponding to a plurality of transmission data transmitted from transmission scheduling section 203 in a frame according to a predetermined arrangement order.

  As the arrangement order, for example, the order of transmission data having a high degree of urgency (high real-time property) can be used. Also, the order of transmission data that requires higher communication quality can be used. The order in which high communication quality is required is because the communication environment with the terminal changes every moment, so the transmission quality of the transmission data is higher when the adaptive array is applied earlier after the sounding signal arrives. Because.

  When burst allocation starts, the allocation unit 204 first sets a predetermined allocation order for a plurality of transmission data transmitted from the transmission scheduling unit 203 as described above (S300). Then, the arranging unit 204 determines whether or not there is an unallocated burst in the downlink subframe (S301). If there is an unallocated burst (S301: YES), it is determined whether or not the burst with the highest allocation order (allocation target burst) can be allocated in the remaining area of the downlink subframe (S302). If placement is possible (S302: YES), the placement target burst is placed in the remaining area from a position with an earlier time (S303).

  Next, the placement unit 204 obtains a required time until the weight calculation for the placement target burst is completed. That is, if another burst has already been allocated in the downlink subframe before the allocation target burst is allocated, the time required for completion of the weight calculation for the allocation target burst is as shown in FIG. The weight calculation time for the already-arranged burst is accumulated, and the weight calculation time for the allocation target burst is added to the accumulated time.

  The placement unit 204 compares the required time obtained for the placement target burst with the time position of the placement target burst, that is, the transmission timing of the burst (transmission data). It is determined whether it exists (S304).

  Note that the weight calculation time for one burst can be regarded as almost the same for any burst. In this embodiment, a fixed time (hereinafter referred to as “unit calculation time”) is set as the weight calculation time for one burst, and this unit calculation time is multiplied by the arrangement order in the downlink subframe of the arrangement target burst. Thus, the required time for the placement target burst is obtained. That is, the arrangement unit 204 has a value measured by a test or the like as the unit calculation time, and uses this value to calculate the required time for each burst.

  In S304, when the arrangement unit 204 determines that the time position of the burst is after the required time and the application of the weight is in time (S304: YES), the arrangement unit 204 returns to the process of step S301, and regarding the unarranged burst in the next arrangement order. These steps S301 to S304 are repeated. Then, if it is not determined in step S304 that the application of the weight is not in time, there is no burst to be placed (except for the suspended one) (S301: NO), and the burst placement is terminated.

  Thus, in the downlink subframe, bursts (transmission data) are arranged in the downlink subframe in the arrangement order set in S300 in a state where weights can be applied to all bursts.

  By the way, as shown in the left subframe of FIG. 9, when many bursts having a small data size are located at early positions on the time axis when arranged in the arrangement order set in S300, The start timing of the subsequent burst is advanced, and the allowable time for the weight calculation for the subsequent burst is shortened. In this case, as shown in the figure, a situation may occur in which the weight calculation is not in time for the latter half burst. In the downstream subframe on the left side of FIG.

  Therefore, when determining that the time position of the burst is earlier than the required time and the application of the weight is not in time (S304: NO), the placement unit 204 places the burst to be placed placed in the downstream subframe at that time in step S304 of FIG. And the already arranged bursts arranged in the downlink subframe before that are sorted so as to be arranged in the position with the earlier time from the largest data size (S305).

  As a result, as shown in the downstream subframe on the right side of FIG. 9, the start timing of the subsequent burst is delayed, so the arrangement order of bursts (transmission data) is changed from the arrangement order set in S300. Can occur, but weights can be applied to each burst in time.

  In the present embodiment, as in the first embodiment, there may occur a case where all bursts cannot be arranged. In this case, if the placement unit 204 determines in step S302 that the burst at that time cannot be placed in the remaining area (S302: NO), the placement unit 204 holds the burst without placing it as in the first embodiment (S306). .

  FIG. 10 is a diagram illustrating a processing flow according to the burst allocation algorithm in a configuration in which the downlink subframe is divided into three divided regions (divided regions A, B, and C) in the frequency axis direction. FIG. 11 is a diagram illustrating an example of a frame configuration when burst placement is performed using the algorithm of FIG. In the figure, the relationship between the weight application position and the weight generation completion position for each burst is shown.

  Referring to FIGS. 10 and 11, arrangement section 204 arranges bursts corresponding to a plurality of transmission data sent from transmission scheduling section 203 in a frame according to a predetermined arrangement order. As described above, the arrangement order is set depending on the degree of urgency, the required communication quality, and the like.

  When burst arrangement is started, the arrangement unit 204 first sets a predetermined arrangement order for a plurality of transmission data transmitted from the transmission scheduling unit 203 (S400). Then, the arrangement unit 204 determines whether or not there is an unallocated burst in the downlink subframe (S401). If it is determined that there is an unallocated burst (S401: YES), the allocation unit 204 determines whether the remaining area of the divided area A is the maximum (S402).

  When determining that the remaining area of the divided area A is the maximum (S402: YES), the arrangement unit 204 determines whether the arrangement target burst can be arranged in the remaining area of the divided area A (S403). . If placement is possible (S403: YES), the placement target burst is placed from an earlier time in the remaining area of the divided area A (S404).

  Next, the placement unit 204 obtains a required time until the weight calculation for the placement target burst is completed, and determines whether the time position of the placement target burst is after the required time (S405). If the placement unit 204 determines that the time position of the placement target burst is after the required time and the application of the weight is in time (S405: YES), the placement unit 204 returns to the process of step S401.

  If the remaining area of the divided area A becomes smaller than the remaining area of the divided area B due to the burst being arranged in the divided area A, the arrangement unit 204 determines that the remaining area of the divided area A is not the maximum in step S402. (S402: NO). Next, the arrangement unit 204 determines whether or not the remaining area of the divided area B is the maximum (S408). If it is the maximum (S408: YES), the next arrangement target burst is the remaining area of the divided area B. It is determined whether or not the area can be arranged (S409). If placement is possible (S409: YES), the placement target burst is placed from an earlier position in the remaining area of the divided area B (S410).

  Next, the arrangement unit 204 obtains a required time until the weight calculation for the allocation target burst is completed, and determines that the time position of the allocation target burst is after the required time (S411: YES), the process of step S401 Return to.

  If the remaining area of the divided areas A and B becomes smaller than the remaining area of the divided area C by arranging bursts in the divided area B following the divided area A, the arrangement unit 204 in steps S402 and S408, the divided area A , B is determined not to be the maximum remaining area (S402: NO, S408: NO). Next, the placement unit 204 determines whether or not the next placement target burst can be placed in the remaining area of the divided area C (S414). If placement is possible (S414: YES), the placement target burst is placed from an earlier time in the remaining area of the divided area C (S415).

  Next, the arrangement unit 204 obtains the required time until the weight calculation for the allocation target burst is completed, and determines that the time position of the allocation target burst is after the required time (S416: YES), the process of step S401 Return to.

  Thereafter, the placement unit 204 repeats the above processing, and when there are no more bursts to be placed (excluding pending ones) (S401: NO), the burst placement is terminated.

  Thus, in the divided areas A, B, and C, bursts (transmission data) are arranged in the downlink subframe in the arrangement order set in S400 in a state where weights can be applied to all bursts.

  Also in this example, as shown in the downstream subframe on the left side of FIG. 11, when many bursts with small data sizes are located at early positions on the time axis, there is a situation in which the weight calculation is not in time for the latter burst. Can occur. In the downstream subframe on the left side of FIG. 11, the weight calculation is not in time for the burst H arranged in the divided area A.

  Therefore, in the divided area A, if the situation is not in time for the divided area A (S405: NO), the arrangement unit 204 has a large data size between the arrangement target burst and the already arranged burst in the divided area A. Sorting is performed from the first to the earlier time (S406).

  As a result, as shown in the right sub-frame in FIG. 11, the start timing of the subsequent burst in the divided area A is delayed, so the order of the burst (transmission data) in the divided area A is partially changed. May occur, but weights can be applied in time. In this case, since only the change in the arrangement order in the divided area A is performed, no great change in the arrangement order occurs.

  Similarly, in the divided areas B and C, the placement unit 204, when the situation is not in time (S411: NO, S416: NO), in the divided areas B and C, the placement target burst arranged at that time Sorting is performed with the bursts that have already been placed, so that the data is placed in the position with the earlier time starting with the largest data size (S412 and S417).

  Even in this example, there may be a case where all bursts cannot be arranged. In this case, if the placement unit 204 determines that the placement target burst at that time cannot be placed in the remaining area (S403: NO, S409: NO, S414: NO), the placement unit 204 does not place the placement target burst and holds it (S407, S413). , S418).

  As described above, according to the present embodiment, it is possible to suppress the occurrence of bursts in which weights cannot be applied properly, and thus it is possible to prevent deterioration in communication quality. In addition, since bursts can be arranged in a frame according to a desired arrangement order, the degree of freedom of burst arrangement can be increased.

  In addition, according to the present embodiment, when a burst that does not meet the weight calculation occurs, the bursts are sorted in descending order of the data size so that the weight generation for each burst is in time for the transmission timing of each burst. Can be. Therefore, although a partial change may occur in the order of arrangement of bursts (transmission data) due to sorting, occurrence of bursts to which no weight is applied can be suppressed, and good data transmission can be realized.

  In this embodiment, when the application of the weight is not in time, the processing in steps S305, S406, S412 and S417 is performed in order of increasing data size. May be replaced with any of the already-arranged bursts. In this case, in these steps, for example, the following processing may be performed.

(1) Change process 1
If there is an already-arranged burst having a data size smaller than that of the allocation-target burst, the already-arranged burst that is the rearmost in the time axis direction is replaced with the allocation-target burst. FIG. 12 is a diagram showing a rearrangement state when this processing is applied to S305 in FIG. 8, and FIG. 13 shows a rearrangement state when this processing is applied to S406, S412, and S417 in FIG. FIG. FIG. 12 shows an example in which the weight calculation is not in time for burst H, as in FIG. FIG. 13 shows an example in which the weight calculation is not in time for the burst G arranged in the divided region B, unlike FIG.

  In the example of FIG. 12, the burst H and the burst G that is smaller in data size than the burst H and the rearmost burst G in the already-arranged bursts are switched. Further, in the example of FIG. 13, the burst G and the burst E which is smaller in data size than the burst G in the already arranged bursts of the divided areas B are exchanged. In these examples, by replacing the bursts in this way, the weight calculation can be made in time for any burst.

  As described above, when this change process is used, it becomes easy to make a weight calculation in time for each burst. In addition, when this processing step is used, the arrangement order of the transmission data set before the rearrangement greatly changes because the existing arrangement burst that is most backward in the time axis direction is only replaced with the arrangement target burst. Can be suppressed.

(2) Change process 2
If there is an already allocated burst having a data size smaller than the allocation target burst, the allocated burst having the smallest data size is replaced with the allocation target burst. FIG. 14 is a diagram showing a rearrangement state when this processing is applied to S305 in FIG. 8, and FIG. 15 shows a rearrangement state when this processing is applied to S406, S412, and S417 in FIG. FIG. FIG. 14 shows an example in which the weight calculation is not in time for burst H, as in FIG. Further, FIG. 15 shows an example in which the weight calculation is not in time for the burst G arranged in the divided region B, as in FIG.

  In the example of FIG. 14, the burst H and the burst A having the smallest data size among the already-arranged bursts are interchanged. In the example of FIG. 15, the burst G and the burst B having the smallest data size among the already-arranged bursts of the divided areas B are interchanged. In these examples, by replacing the bursts in this way, the weight calculation can be made in time for any burst.

  As described above, when this change process is used, it becomes easy to make a weight calculation in time for each burst. In addition, when this processing step is used, it is only necessary to replace the already-arranged burst having the smallest data size with the burst to be allocated, and therefore, it is possible to suppress the change in the arrangement order of the transmission data set before the rearrangement as much as possible. Can do.

  Although the present embodiment has been described above, the present invention is not limited to the above-described embodiment, and the above-described embodiment is also within the scope of the technical idea shown in the claims. Various modifications can be made as appropriate.

<Modification 1>
For example, in the first embodiment, all the bursts arranged in the corresponding downlink subframe are arranged from the position with the fastest time in order of the data size. Of all the arranged bursts, bursts having a large data size to a predetermined order may be arranged from the position with the earliest time in descending order of the data size.

  In this case, for example, in the process of step S101 of FIG. 4, instead of the process of sorting all the transmission data, the transmission data from the largest data size to the predetermined order is sorted in the order of the largest data size, and the remaining For example, the transmission data is arranged in the order of urgency. In this case, the transmission data having the largest data size may be placed at the top, and the rest may be arranged in order of urgency, for example, without sorting in the data size order.

  Also, in the process of step S201 in FIG. 6, instead of the process in which all the transmission data is sorted, the transmission data from the largest data size to the predetermined order is sorted in the order of the largest data size, and the remaining transmission data For example, a process of arranging in descending order of urgency is performed. In this case, the three bursts having the largest data size to the third burst may be sorted in descending order, and these bursts may be arranged at the earliest position.

  Even with such a configuration, although it is inferior to the first embodiment, it is possible to delay the start timing of the subsequent burst (weight application timing) in the time axis direction, so that the generation of the weight for the subsequent burst is prevented. It becomes easy to be in time for transmission of the burst (transmission data), and it is possible to suppress the occurrence of a burst in which the weight cannot be properly applied.

<Modification 2>
In the first embodiment, the arrangement of bursts corresponding to each transmission data is determined based on the data size. Instead of this, as the burst having a larger width in the time axis direction, the downlink subframe becomes smaller. It is good also as a structure arrange | positioned in the position where time of this is early.

  In this case, in the configuration in which the downlink subframe is not divided in the frequency axis direction as shown in FIG. 5, the width in the time axis direction of each burst is uniquely determined according to the data size of each transmission data. Even in the configuration in which the downlink subframe is equally divided in the frequency axis direction as in FIG. 7, the width in the time axis direction of each burst is uniquely determined according to the data size of each transmission data.

  Therefore, in these cases, the processing in step S101 in FIG. 4 and the processing in step S201 in FIG. 6 are sorted in the descending order of the width of the burst in the time axis direction instead of the processing in which the data size is sorted in descending order. Processing is performed. Thus, if the burst placement is performed according to the processing flow of FIGS. 4 and 6 in which the processing of S101 and S102 is replaced, the larger the burst in the time axis direction, the faster the time is placed. Effects similar to those of the form can be achieved.

  Note that when the downlink subframe is divided unevenly in the frequency axis direction, the width of the burst in the time axis direction varies depending on which divided region is allocated even if the data size is the same.

  Therefore, in such a case, for example, without performing the sort as in the process of step S201, all bursts are downloaded in the sub-process by the processes in and after S202 according to a predetermined arrangement order (for example, in order of urgency). After placing in the frame, for each divided area, place a burst with a larger width in the time axis direction at a position where the time is earlier, or a burst other than the first in the time axis direction is smaller in the time axis direction than the first burst. If so, it is possible to adopt a configuration in which the bursts are rearranged so that the smallest one is replaced with the first burst.

  Even with such a configuration, it is possible to delay the start timing (weight application timing) of the subsequent burst in the time axis direction, and therefore it is easy to generate the weight for the subsequent burst in time for transmission of the burst (transmission data). Thus, it is possible to suppress the occurrence of bursts in which weights cannot be properly applied.

<Others>
In the first embodiment and the second embodiment, the burst placement algorithm described above is used to appropriately apply the weight (weighting) for adaptive array to each burst. However, the present invention is not limited to this, and in order to improve the communication quality, when the predetermined calculation is performed in processing other than the adaptive array and the calculation result is applied to each burst, the burst placement algorithm is used. May be.

The figure which shows the functional block of the wireless base station which concerns on 1st Embodiment. The figure for demonstrating the function of the buffer part which concerns on 1st Embodiment, a packet encoding part, a transmission scheduling part, and a radio | wireless resource arrangement | positioning part. The figure which shows the functional block of the physical layer which concerns on 1st Embodiment. The figure which shows the processing flow by the burst arrangement | sequence algorithm which concerns on 1st Embodiment (when the downlink sub-frame is not divided | segmented) The figure which shows an example of a frame structure when performing burst arrangement | positioning with the algorithm of FIG. The figure which shows the processing flow by the burst arrangement | sequence algorithm which concerns on 1st Embodiment (when a downlink sub-frame is divided | segmented into three division areas) The figure which shows an example of a frame structure when performing burst arrangement | positioning with the algorithm of FIG. The figure which shows the processing flow by the burst arrangement | sequence algorithm which concerns on 2nd Embodiment (when the downlink sub-frame is not divided | segmented) The figure which shows an example of a frame structure when performing burst arrangement | positioning with the algorithm of FIG. The figure which shows the processing flow by the burst arrangement | sequence algorithm which concerns on 2nd Embodiment (when a downlink sub-frame is divided | segmented into three division areas) The figure which shows an example of a frame structure when burst arrangement | positioning is performed with the algorithm of FIG. The figure which shows the rearrangement state at the time of applying the process which concerns on the change process 1 to S305 of FIG. The figure which shows the rearrangement state at the time of applying the process which concerns on the change process 1 to S406 of FIG. 19, S412, and S417. The figure which shows the rearrangement state at the time of applying the process which concerns on the change process 2 to S305 of FIG. The figure which shows the rearrangement state at the time of applying the process which concerns on the change process 2 to S406, S412, S417 of FIG. Diagram for explaining the frame structure of OFDMA The figure for demonstrating the subject which arises when an adaptive array is employ | adopted in an OFDMA system.

Explanation of symbols

203 Transmission scheduling unit (data distribution unit)
204 Radio resource allocation unit (burst allocation unit)

Claims (13)

In a data transmission apparatus that performs data transmission by assigning a plurality of bursts, each of which is a target of weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in a time axis direction and a frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit that places the burst in the corresponding frame based on the allocated transmission data, and
The burst arrangement unit arranges the burst in the frame so that the transmission data having a larger data size is positioned at an earlier position on the time axis.
A data transmitting apparatus characterized by that. In claim 1,
The burst placement unit divides the frame in the direction of the frequency axis and sets a plurality of frequency regions, and arranges the bursts in the frequency region in order from the frequency region having a large remaining capacity.
A data transmitting apparatus characterized by that. In claim 2,
When the burst arrangement unit cannot arrange the transmission data having the largest data size among the transmission data not arranged in the frame in the frequency region having the largest remaining capacity, the burst arrangement unit transmits the largest data size below the remaining capacity. A burst for data is arranged in the frequency region having the largest remaining capacity,
A data transmitting apparatus characterized by that. In a data transmission apparatus that performs data transmission by assigning a plurality of bursts, each of which is a target of weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in a time axis direction and a frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit that places the burst in the corresponding frame based on the allocated transmission data, and
The burst placement unit;
A predetermined arrangement order is set for the plurality of transmission data to be arranged in the frame;
Obtaining the time position of the burst on the time axis when arranging the burst corresponding to the transmission data in the frame according to the arrangement order and the time required until the calculation of the weighting for the burst is completed,
Placing the burst in the frame according to the placement order when the time position of the burst is after the required time;
A data transmitting apparatus characterized by that. In claim 4,
When the time position is earlier on the time axis than the required time, the burst arrangement unit performs a process of rearranging the burst and the already arranged burst on the time axis.
A data transmitting apparatus characterized by that. In claim 4,
The burst placement unit;
Dividing the frame in the direction of the frequency axis to set a plurality of frequency regions,
Arrange the transmission data in the frequency domain in order from the frequency domain with a large remaining capacity,
The frequency domain corresponding to the burst according to the arrangement order when the time position of the burst corresponding to the transmission data is after the required time for the burst when the transmission data is arranged in the corresponding frequency domain To place in the
A data transmitting apparatus characterized by that. In claim 6,
The burst placement unit is already placed in the burst and the frequency domain if the time position of the burst is earlier on the time axis than the required time for the burst when placing the burst in the corresponding frequency domain. Reordering the bursts on the time axis,
A data transmitting apparatus characterized by that. In a data transmission apparatus that performs data transmission by assigning a plurality of bursts, each of which is a target of weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in a time axis direction and a frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit for placing the burst based on the allocated transmission data in the corresponding frame, and
The burst placement unit positions the start position of the burst at an earlier position on the time axis as the burst having a larger width in the time axis direction among the bursts arranged in the frame,
A data transmitting apparatus characterized by that. In a data transmission apparatus that performs data transmission by assigning a plurality of bursts, each of which is a target of weighting calculation in data transmission by an adaptive array, to a frame having a predetermined width in a time axis direction and a frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit for placing the burst based on the allocated transmission data in the corresponding frame, and
The burst placement unit gives priority to a burst having a large width in the time axis direction among the bursts arranged in the frame, and positions the start position of the burst at an early position on the time axis.
A data transmitting apparatus characterized by that. In a data transmission device that performs data transmission by allocating a plurality of bursts to a frame having a predetermined width in the time axis direction and the frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit that places the burst in the corresponding frame based on the allocated transmission data, and
The burst arrangement unit arranges the burst in the frame so that the transmission data having a larger data size is positioned at an earlier position on the time axis.
A data transmitting apparatus characterized by that. In a data transmission device that performs data transmission by allocating a plurality of bursts to a frame having a predetermined width in the time axis direction and the frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit that places the burst in the corresponding frame based on the allocated transmission data, and
The burst placement unit;
A predetermined arrangement order is set for the plurality of transmission data to be arranged in the frame;
Obtaining the time position of the burst on the time axis when arranging the burst corresponding to the transmission data in the frame according to the arrangement order and the time required until the calculation of the weighting for the burst is completed,
Placing the burst in the frame according to the placement order when the time position of the burst is after the required time;
A data transmitting apparatus characterized by that. In a data transmission device that performs data transmission by allocating a plurality of bursts to a frame having a predetermined width in the time axis direction and the frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit for placing the burst based on the allocated transmission data in the corresponding frame, and
The burst placement unit positions the start position of the burst at an earlier position on the time axis as the burst having a larger width in the time axis direction among the bursts arranged in the frame,
A data transmitting apparatus characterized by that. In a data transmission device that performs data transmission by allocating a plurality of bursts to a frame having a predetermined width in the time axis direction and the frequency axis direction,
A data distribution unit that allocates transmission data to the frame;
A burst placement unit for placing the burst based on the allocated transmission data in the corresponding frame, and
The burst placement unit gives priority to a burst having a large width in the time axis direction among the bursts arranged in the frame, and positions the start position of the burst at an early position on the time axis.
A data transmitting apparatus characterized by that.

Images