JP2003046557A - Transport channel list selection method and device therefor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a transport channel list selection method and its device, that can reduce a memory resource, attain high-speed processing and prevent transmission efficiency deterioration. SOLUTION: A plurality of list selection arithmetic data are generated, on the basis of the combinations of the information types of a plurality of lists and the priority, logic selection arithmetic data are generated from the information types of a transmission request, on the basis of the combination of the information types and the priority, a plurality of list selection data are generated by calculating a plurality of list selection arithmetic data and logic selection arithmetic data, a plurality of the list selection data are mutually compared to select a list maximizing the information quantity, so as to eliminate the need for storage of data to a table of the retrieval result and reduce the memory resource. Thus, a list which maximizes the information quantity can be selected with a less arithmetic amount, high-speed processing is attained, and abort of transmission information can be prevented.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a transport channel list selection method and apparatus, and more particularly to a transport channel list selection method and apparatus in a mobile communication system.

[0002]

2. Description of the Related Art Recently, various multimedia information has been transferred to A
TM (Asynchronous Transfer)
Mode cells are being transmitted.
In the transmission by the ATM cell, it is required to fit within a predetermined constant band (data transmission rate per hour) by a wireless or wired transmission path. Similarly, the delay time also needs to be kept within a certain range, and the delay time differs depending on the device that is required to process in real time. In addition, when it is necessary for one device to handle information via a plurality of transmission paths (channels), or when it is required to transmit a priority cell, A
Bandwidth control of TM cells is required.

In a conventional ATM device, when performing band control in wired communication, control is performed with the band being the upper limit due to the limit of processing or transmission in each device (exchange device, transmission device, transmission line), or for each channel. If a band is allocated to, a certain time division is set and the number of cells to be transmitted during that time is calculated and a fixed amount (corresponding to the band) is calculated.
The following cell method is used. Also,
Conventionally, when a plurality of channels such as a wireless band is used, control such that the number of channels is below a certain level has not been performed.

Regarding mobile communication, ITU (Inter
national Telecommunication
n Union) IMT-2000 (Inter
national Mobile Telecommu
Nation System-2000), and W-CDMA (W
side-band Code Division Mu
A multiple access method has been proposed.

FIG. 1 is a block diagram of a W-CDMA system. In the figure, reference numeral 80 is a wireless base station (called a node B) that wirelessly communicates with a mobile device, and 81 is a wireless network device (R).
NS: displayed in Radio Network System), 82 is a radio network controller (RNC: Ra)
Reference numeral 83 denotes a multimedia signal processor), and 83 denotes a multimedia signal processing apparatus (MPE: Multimedi) for performing protocol conversion control of user signals between the fixed network side and the wireless network side.
a Processing Equipment), 84 is a mobile multimedia switching system (MMS: Mob) for switching between mobile units or with a fixed network.
ile Multimedia Switching
System display), 85 is an operation system (OPS: Operat) for monitoring and controlling the system.
Ion System).

The radio base station 80 communicates with a mobile device (not shown) by radio, and the plurality of radio base stations 80 form a radio network device (RNS) 81.
C) Controlled by 82. Radio controller (RNC) 8
Reference numeral 2 designates outgoing / incoming call connection control, call termination control, diversity handover control for a mobile device via a plurality of radio base stations 80 (selection / combination processing of a signal transmitted from the same mobile device via a plurality of radio base stations and a plurality of signals). Copy distribution processing to the wireless base station). The radio controller (RNC) 82 is connected to the MPE 83 and the MMS 84 to perform signal processing and switching.

FIG. 2 shows a protocol structure of the W-CDMA system. The protocol configuration of the wireless interface is
It consists of layer 1 (physical layer), layer 2 (data link layer), and layer 3 (network layer), and between each layer, the services provided from the lower layer to the upper layer, and for providing it Service access point (Servi
ce Access Point: SAP) is defined, and a logical channel (Logical Channel) is used in the SAP between the layer 3 and the layer 2 and a transport channel (Trans) is used in the layer 2 and the layer 1.
sport Channel) is defined. Further, a physical channel (Physical Channel) is used as a channel for communication between layer 1 and the node.
Is defined.

Layer 2 is a radio link control (RLC: Radio Link Controller) for controlling a radio link.
media access control (MAC: Medium Access) for controlling allocation of wireless resources
Control layer), and layer 3 is divided into call control (CC: Call Control) for call setup and transmission of user information, and transmission control of user information further controls layer 2 directly. (RR
C: Radio Resource Control)
And mobility management that performs high-level control (MM: Mobility)
Management).

The logical channels are MAC and RL.
Used between C and transport channel is MAC
And between layers 1. The connection (correspondence) between the logical channel and the transport channel is predetermined. For example, BCC of logical channel
H (Broadcast Control Channel)
el) is connected to FACH1 or FACH2 or FACH3 of the transport channel, and PCCH (Paging Control Channel) of the logical channel is connected.
el) is connected to the transport channel PCH,
CCCH (Common Controller) of logical channel
ol Channel) is connected to the transport channel FACH1 or FACH2 or FACH3, and the logical channel DCCH (Dedicated)
Control Channel) as a transport channel FACH1 or FACH2 or FACH
Connect with 3.

FIG. 3 shows a radio controller (RNC 82 in FIG. 1).
The block configuration of is shown. 3, the same parts as those in FIG. 1 are designated by the same reference numerals. 8 in radio controller (RNC) 82
20 is a plurality of radio base stations 80, MPE83, MMS8
The ATM switch (8
21) An interface circuit for interfacing with each highway, 821 is an ATM switch (SW) for switching ATM cells between the highways, and 822 is clock control for generating reference timing in the device, cell duplication, fault control, etc. 823 is a circuit for performing diversity handover (DHT), and MAC (Medium A) for performing MAC layer demultiplexing processing of wireless lines.
access control demultiplexing circuit (M-MU)
A circuit provided with X), 824 is an MS (mobile device: Mo)
a signal terminating circuit (indicated by SU) for terminating a control signal for call processing and the like for an external device, an operation system, and the like, and a control circuit 825 including a memory and a processor (indicated by CONT).

A demultiplexing circuit within circuit 823 controls the flow of data through each Node B and ultimately wirelessly to and from the mobile unit. The amount (band) of data transmitted at that time is controlled so as to be within a predetermined band for wireless transmission. Specifically, assuming that the determined band is a pipe, there are a plurality of control signals that must be sent, and a paging (call) signal (PCCH of logical channel) that must be sent immediately, Broadcast signal (BCC)
H) and signals for individual common control (CCCH of logical channel), etc., and a user (individual) control signal (logical channel DCCH) with less time restrictions using the extra band of the pipe, An individual traffic signal (logical channel DTCH) or the like is transmitted. The demultiplexing circuit M-MUX performs control to multiplex these various signals with respect to each node B in the downlink direction and separate the signal from each node B with respect to the uplink direction.

FIG. 4A shows the configuration of the demultiplexing circuit.
In the figure, 90 is an ATM cell from the B node or MPE or MMS [logical channel D for individual traffic.
TCH (Dedicated Traffic Cha)
nnel), CTCH (Common Traffic)
Channel) signal] is input. Reference numeral 91 denotes a control ATM cell [control logic channel BCCH (Broadcast Control C) according to a command from the control circuits 822 and 823.
channel), PCCH (Paging Controller)
ol Channel), DCCH (Dedicate)
d Control Channel) etc.] is generated. Reference numeral 92 is a buffer for storing the ATM cells from the receiving section 90 and the control ATM cell generating section 91, and 93 is a combination of a control channel and a traffic channel within a preset band from a plurality of types of signals for output. A transport channel list in which various combinations of a plurality of types of channel signals are described, 94 is a priority list, 95 is a selection control unit, and 96 is a transmission unit.

A plurality of various A stored in the buffer 92
The TM cells are selected and controlled by the selection control unit 95 so that they are entirely within a predetermined band. In that case, the transport channel list 93 and the priority list 94 are referred to. Transport channel list 93
Has a configuration as shown in FIG. 4 (B), and has a plurality of types of logical channels PCCH, BCCH, CCCH, DC.
Various lists showing which ATM cells in each information type of CH and DTCH are combined and transmitted are set. In FIG. 4B, one row is one list, and the numbers in the list represent the number of multiplexed logical channels transmitted at the same timing.

The selection control unit 95 refers to the type and number of ATM cells stored in the buffer 92 and the transport channel list 93 to detect a list that fits within a limited band, and to select a plurality of types of information. The priority list 94 is selected to select which one of the buffers has priority from the buffer 92. The selected ATM cell is transmitted from the transmitting unit 96 to the B node (or MPE or MMS in the reverse direction).

[0015]

In the demultiplexing circuit M-MUX in the above radio controller (RNC), ATM cells of a plurality of types of logical channels stored in the buffer are stored in a predetermined transport channel list. It is necessary to discriminate which list of (1), (4), and (3) to allocate a band for a mandatory channel and a band for an individual user channel in a predetermined band (radio).
A transport channel list consisting of a large number of patterns is searched in a predetermined frame period (10 ms) based on the state of the combination of ATM cells stored in the buffer.

The structure of a conventional transport channel list search is shown in FIG. Conventionally, for any combination of information types for which transmission was requested, each list in the transport channel list is compared, and first, it is judged whether transmission violation occurs in that list, and the most efficient type of information is obtained. Find a good list of and store the results in a table. Similarly, a list that improves the transfer efficiency is searched for for all combinations of the information types for which transmission has been requested, and the list is similarly stored.

The table is created because it is necessary to compare two data in order to continue searching for an efficient list, and simultaneous comparison cannot be performed unless it is dedicated hardware. The best pattern can be selected. However, in order to create a table, it is necessary to find a position on the memory, search for the next position, and transfer the data at that position, and read / write of the entire table is required. .
Such access is frequently performed even with the processing of a combination of only one information type, and the number thereof also increases in proportion to the square of the number of patterns in the transport channel list to be compared. Therefore, the processing time becomes enormous, and real-time processing becomes difficult. In that case, there is a problem that the transmission information is discarded and the transmission efficiency is reduced.

The present invention has been made in view of the above points, and provides a transport channel list selection method and apparatus capable of reducing memory resources, capable of high-speed processing, and preventing deterioration of transmission efficiency. The purpose is to

[0019]

The invention according to claim 1 or 2 generates a plurality of list selection operation value data for each of a plurality of lists based on a combination of information types and a priority, and requests transmission. The logical channel of the information type is generated based on the combination of the information types and the priority order, and the logical selection operation value data is generated, and each of the plurality of list selection operation value data and the logical selection operation value data is operated to select the plurality of lists. Memory is generated as compared with the conventional memory because it is not necessary to store it in the search result table by generating the data for selection and comparing the plurality of data for selecting the list with each other to select the list with the maximum amount of information. It is possible to reduce resources and select a list that maximizes the amount of information with a small amount of calculation, which enables high-speed processing and prevents the transmission information from being discarded. Can, it is possible to prevent deterioration of transmission efficiency.

According to a third aspect of the present invention, list-violation operation value data for generating list-violation operation value data representing the number of multiplexes for each type of transport channel based on a combination of information types in a plurality of lists and a priority order. Generating means and logic violation calculation value data generating logical violation calculation value data representing the multiplexing number for each type of transport channel based on the combination of information types and priority of the logical channels of the information type having the transmission request. Means, and a non-selectable list for judging a non-selectable list based on a deviation between the list violating operation value data and the logical violating operation value data and excluding it from a plurality of list selecting data generated by the list selecting data generating means. By including the excluding means, the number of data for list selection can be reduced and further high speed processing can be performed.

According to the invention described in claim 4, since the number of transmission requests is limited to a predetermined number for each information type, it is possible to prevent the number of bits of the logical selection operation value data from being unnecessarily increased.

In the invention described in appendix 6, each of the plurality of list selection operation value data and the logic selection operation value data is
By arranging the information type having a higher priority in the higher block, the list selection data can be generated by one operation of the list selection operation value data and the logic selection operation value data.

In the invention described in appendix 7, the plurality of list selection operation value data are calculated by the operation of the list selection operation value data and the logic selection operation value data by providing the overflow prevention bit at the top of each block. Sometimes, overflow of each block can be prevented from affecting adjacent blocks.

In the invention described in appendix 8, the list selection data generating means obtains the difference between each of the plurality of list selection operation value data and the logical selection operation value data to generate the plurality of list selection data. As a result, the list selection data can be generated by a single operation.

In the invention described in appendix 9, the comparing means selects the list selection data having the maximum value among the plurality of list selection data as the list having the maximum information amount, so that the information amount is increased. You can easily select the largest list.

[0026]

FIG. 6 shows the principle of the transport channel list selection method of the present invention. Based on the given transport channel list, given logical channel priority, and information type of the logical channel sent by the given type of transport channel as the basic data, the logic of the transmission request to be actually transmitted Generates numerical data that can be numerically calculated by combining channels. With the generated numerical data, it is possible to detect one list data without combination selection as one operation. The optimum list is selected by this numerical calculation, and this selection can be made by confirming the magnitude relationship of the calculation result.

FIG. 7 is an explanatory diagram showing the principle of improving the efficiency of calculation by the bit width limiting calculation. If the transmission request is used as it is when assembling the calculation data, the calculation data length becomes large and the calculation efficiency is reduced. Here, as the value required for calculation, no matter how large the transmission request is, it is not possible to transmit more than the value in the list, so the maximum value listed in the list can be used as numerical data for calculation. By incorporating it, the number of bits incorporated in one data can be reduced, and an efficient operation can be performed even in the case of multiple values. In addition, it is possible to increase the transmission information incorporated in the 1-word numerical value data for calculation, and it is possible to calculate a small amount of data, and it is possible to achieve higher speed.

First, numerical data for calculation (calculated value data)
The assembling method of will be described. FIG. 8 is an explanatory diagram of a method of assembling numerical data for calculation. When converting transmission requests and transport channel lists into calculation data,
After being restricted as described in FIG. 7, it is constructed as one data. For the information type of each transmission request and each transport channel list data, a plurality of blocks are incorporated into one-word arithmetic numerical data, with the number of bits required according to the data size being one block.

Information having a higher priority during calculation is arranged on the upper side (left side in the figure) so that the calculation result becomes larger, and when it is necessary to influence the higher order during calculation, the information is sent to the same block. Incorporate. As a result, it is possible to flexibly cope with which transmission request information type is incorporated in the transport channel. By using this numerical value data for calculation, it is possible to perform a simple calculation.

FIG. 9 is an explanatory view of a method of processing numerical data for calculation. The embedded information of the numerical data differs depending on the bit, but in the calculation, it is treated as one piece of information in total. Since the data is created in consideration of the meaning of the bit position of the block in the calculation (information type, etc.), the whole numerical value data for calculation can be treated as one numerical value, and the result can be obtained by a simple calculation. The value obtained as a result of the calculation has a meaning for each block as it is, and can be used for the next calculation, or the whole can be treated as a numerical value and used for the calculation of magnitude comparison or the presence / absence of correlation.

FIG. 10 is an explanatory diagram of a method of adding overflow prevention information to numerical data for calculation. In the method that divides the numerical data for calculation into blocks, when used for calculation, the calculation may be performed beyond the block depending on the calculation within the block, that is, the content of the adjacent block may change due to underflow or overflow overflow. There is a case. To prevent this, a propagation prevention bit is provided at the beginning of the block. Significantly, it is used for difference calculation as a form having a negative value. In the addition operation, conversely, the upper limit of the number of additions is taken into consideration to narrow the bit use range in the block. For example, when addition is performed up to 4 times, the most significant bit in the block is for sign,
The next 2 bits are reserved for carry. As a result, it becomes possible to perform the calculation within one block without affecting the adjacent blocks.

FIG. 11 is an explanatory view of a transport channel list selection method by calculation. When the calculation numerical data calculated for each block is viewed as one data (1 word), the larger the position of the block is on the upper side (left side) of the calculation numerical data, the larger the value. That is, when calculating the correlation or the magnitude relationship, it is possible to prioritize the magnitude relationship according to the position of the block.

In the present invention, the priority is given according to the information type of the transmission request, that is, the type of the logical channel, and when there are many transmission requests of the highest logical channel, other logical channels cannot be transmitted. is there. In order to realize this, by processing the arithmetic numerical data in units of words, it becomes possible to obtain the logical channel to be transmitted in one arithmetic operation while maintaining the priority order. In selecting the transport channel list, the optimum transport channel list can be uniquely determined by detecting the magnitude relation of the numerical data of the blocks of the list and selecting the maximum data. It should be noted that the optimum transport channel list can be uniquely determined by selecting the minimum data depending on the way the data is assembled. This technique is simply
1 for the number of blocks because it is the maximum (minimum) selection
The result can be obtained by processing each time, and the calculation time can be shortened.

FIG. 12 is an explanatory diagram of an efficiency improving method by parallel calculation. When the transport channel list is selected, there is a condition that a logical channel designated by the given transport channel list must be selected so that the designated number of logical channels can be transmitted. Also, in order to process the transmission requests efficiently, there is a condition that the one that can send the most transmission requests is selected. The two conditions are not calculated or searched at the same time but separately, and the two calculation results are calculated and combined to improve the efficiency of the calculation.

In the first calculation, a subtraction is performed from the plurality of transport channel lists in order to exclude a transport channel whose logical channel and its number are small in transmission request amount. For example, a value of all "0" (or all "1") is given so that the value is not brought into the calculation of.

In the second calculation, in order to make the transmission efficient, the transport channel list is subtracted from the transmission request, and the one with the smallest remainder is selected. By finally multiplying or adding these two calculation results, the violation list is converted into a specific value and excluded from the selection targets.

FIG. 13 shows a flowchart of an embodiment of the transport channel list selection method of the present invention.
This processing is executed by the selection control unit 95 shown in FIG. By the way, the host device performs a process of generating a selection calculation value from the transport channel list, and calculates a value used in the numerical calculation on the logical channel side (logic selection calculation value). As a result, the logical selection calculation value is calculated by the number of TFI lists. Further, the higher-level device performs a process of generating a violation calculation value from the transport channel list, and calculates a value (logic violation calculation value) used for a numerical calculation for eliminating the unauthorized TFI list on the logical channel side. There is. As a result, the logic violation calculation value is calculated by the number of TFI lists.

In the present embodiment, PCH and FACH are used as transport channels (actually transmitted channels).
1, FACH2, FACH3 are defined, and BCCH, PCCH, CCCH, DCC are defined as the logical channels of the transmission request.
The channels H and DTCH are defined, and a list (transport channel list) to be incorporated in the transport channel is called "TFI".

Here, as shown in the combination table of FIG. 14A, the transport channel and the logical channel TFI are the logical channel P in the transport channel PCH.
CCH assigned, transport channel FACH1
Is assigned to any of the logical channels BCCH, CCCH, and DCCH, the transport channel FACH2 is assigned to the logical channel DTCH, and the transport channel FACH3 is not assigned to any logical channel.

The TFI has a structure as shown in FIG. 14B, and one line is one list. In each TFI, the number of multiplexed transport channels that can be multiplexed at the same timing (same frame) and the type of logical channel assigned to the transport channel are set. Strictly speaking, FIG. 14B shows a combination of transport channels that can be simultaneously transmitted and a large number of TFIs each including one set of the number thereof. As a result, it is possible to describe in the TFI how many logical channels can be transmitted. However, when a plurality of logical channels BCCH, CCCH, DCCH are assigned to one transport channel FACH1, a logical channel with a high priority is assigned. Will be selected and transmitted.

In FIG. 13, first, in step S10, the transmission request value limiting process is performed to limit the transmission request value for each logical channel at the upper limit of the list. In this embodiment, the list upper limit is set to 7 and the transmission request value is represented by 3 bits for each logical channel. Next, in step S12, a selection calculation value is generated from the transmission request value. This calculates a value (TFI selection calculation value) used for the numerical calculation on the TFI list side.

Next, in step S16, a violation calculation value is generated from the transmission request value. This calculates a value (TFI violation calculation value) used for a numerical calculation for excluding an unauthorized TFI list on the TFI list side. Step S above
The operations of 10 to S16 may be performed in any order and may be performed in parallel.

Next, in step S20, data calculation for list selection is performed. This calculation is performed for the number of TFI lists, and TF
If the I list is 9 types, 9 times, if 15 types, 15 times,
If it is 1024 kinds, it is repeated 1024 times, and in the case of FIG. 14, since the TFI list is 7, it is executed 7 times, and a numerical value is generated one-to-one with each TFI list.

In step S22, it is determined whether or not the data calculation of all TFI lists is completed. If not completed, in step S24, the selected calculation value is generated from the transmission request value and updated as in step S12. In step S26, as in step S16, a violation calculation value is generated and updated from the transmission request value.

When the data calculation of all TFI lists is completed in step S22, the process proceeds to step S28 and all TFI lists are processed.
The maximum data is calculated from the list selection data of the list, and the list is selected.

FIG. 15 is a flow chart of the list selection data calculation executed in step S20. In step S30, the logic violation calculation value shown in FIG.
The difference from the TFI violation calculation value shown in FIG.
It is calculated as a variable viodec shown in (C). next,
In step S32, the result of the AND operation of the variable viodec and the value in which only the polarity code position of each block is set to "1" is put into the variable viodec. Next, step S3
At 4, it is determined whether the variable viodec is 0 or not. If the polarity of each block does not change and no overflow occurs, the variable viodec is "0", so that the mask variable viotfide is displayed in step S36 as shown in FIG.
"0x00000001" is set in c to prevent masking. If there is a change in the polarity of each block and overflow occurs, the variable viodec is "1". Therefore, in step S38, the mask variable viotfidec is set to "0x00000000" as shown in FIG.
Set as a list that cannot be used for sending.
Note that "0x" represents hexadecimal display.

Next, in step S40, the transmission request and TFI are sent.
In order to calculate the size relationship with the list, the logic selection calculation value shown in FIG. 17A and the TFI shown in FIG.
The difference between the selected calculation value and the variable tfic shown in FIG.
Calculate as orsize. The obtained value is the rest of the transmission request, and the smaller this value, the higher the transmission efficiency. However, in this calculation, in order to make the calculation in the latter half more efficient, the calculation is performed so as to have a negative value.

18 (A) is a result of the AND operation of the variable tficorsize shown in FIG. 18A and a value in which only the polar code position of each block shown in FIG. 18B is set to "1" in step S42. The polarity data A shown in C) is put in the variable tficalpole. In addition, FIG.
18A and the polarity data B shown in FIG. 18F by performing an exclusive OR operation between the polarity data A shown in FIG.
(Polarity data A) is obtained.

Next, in step S44, the polarity correction value is calculated. Here, as shown in FIG. 19, by adding the 1-bit shift data to the 5-bit shift data of the polarity data A and the polarity data B, the polarity data A becomes "1", that is, "100000" in the positive block, The polarity data A is “0”, that is, “01111” in the negative block.
A polarity correction value of 1 ″ is obtained.

Next, in step S46, polarity correction is performed for each block. Actually, the variable tfi shown in FIG.
corsize and FIG. 2 calculated by the calculation shown in FIG.
The polarity correction value shown in 0 (B) is ANDed to obtain the variable t.
By storing the data in the filtersize, the corrected list selection data shown in FIG. 20C is obtained. At this time, in a block with a negative polarity code, the polarity code is "0" and the numerical portion is left unchanged, and the smaller the negative value before correction, the larger the positive value after correction. On the other hand, in a block with a positive polarity sign, the numerical value part is set to "00000". Here, "00000" is given to the numerical part in order to remove the block that should not be selected.

Next, in step S48, the variable tficor is set.
The corrected list selection data stored in size and the mask variable biotfidec are multiplied (AND) and stored in the variable tficorsize. As a result, as shown in FIG. 21, the mask variable biotfid
If ec is “0x00000001”, the list selection data after correction is stored in the variable tficorsize, and if it is “0x00000000”, the variable tfico is stored.
All “0” s are stored in rsize. This variable tfic
Maximum value selection is performed using a plurality of list selection data stored in the orsize.

FIG. 22 shows a flowchart of the maximum value selection calculation executed in step S28. In FIG. 22,
Initially, the variables w and tfimax are initialized (w = 1, tfimax
max = 0) and the variable tfi is set in step S50.
max is compared with the wth list selection data, and only when the wth list selection data is large, step S
In step S54, the w-th list selection data is stored in the variable tfimax. Next, in step S56, it is determined whether or not the calculation of all the list selection data has been completed, and if not completed, step S56
At 58, the variable w is incremented by 1, and step S5 is performed.
Go to 0.

In this way, the selection is performed by sequentially comparing the list-selecting data strings and leaving the large value data, and the largest of the plurality of list-selecting data calculated in FIG. 15 is selected. Select one. With this method, the maximum value can be selected with a simple process.

FIG. 23 shows a flowchart of a process for generating a selection calculation value (logic selection calculation value) from the transport channel list. In step S60 (corresponding to step S10), the transmission request value is limited to the list upper limit (= 7) for each logical channel. Next, in step S62, an influence coefficient calculation based on the priority order is performed in accordance with the transport channel combination lists (hereinafter referred to as "combination list") 11 to be assigned to each logical channel, and this influence coefficient is multiplied in step S64. The combination lists 11 to 15 are preset by the higher-level device. Then, after performing a predetermined data shift in step S66, setting is made for each block in step S68, whereby the logic selection calculation value data is generated.

FIG. 24 shows a block diagram of an embodiment of a logic selection calculation value data generation circuit by the transmission request number assembling method for weighting calculation, and FIG. 25 is a block diagram of an embodiment of a priority CH influence coefficient calculation device. Indicates. In these embodiments, the priority order is BCCH, PCCH, CCCH,
The order is DCCH and DTCH, and the higher priority is assigned to the allocation. Furthermore, if it is assigned to the same transport channel, the effect will be given to other digits.

In FIG. 24, the number of BCCH transmission requests is limited by the limit upper limit of 7 by the limiter 16 and supplied to the shift register 17 as 3-bit data, shifted by 24 bits and supplied to the multiplier 18, and 12 bits are shifted and supplied to the multiplier 19, 6 bits are shifted and supplied to the multiplier 20, and are supplied to the multiplier 21 without shifting. The multiplier 18 multiplies the supplied number of BCCH transmission requests by a coefficient having a value of 1, and supplies the result to the adder 22. Each of the multipliers 19, 20, 21 is supplied with BC
The number of CH transmission requests, priority CH influence coefficient from BCCH to CCCH, priority CH influence coefficient from BCCH to DCCH,
The priority CH influence coefficients from BCCH to DTCH are multiplied and supplied to adders 24, 25 and 26. PCCH
The number of transmission requests is limited by the list upper limit of 7 by the limiter 30 and is supplied to the shift register 31 as 3-bit data.
8 bits are shifted and supplied to the multiplier 32, and the multiplier 3
It is multiplied by a coefficient of value 1 by 2 and supplied to the adder 23.

The number of CCCH transmission requests is limited by the list upper limit of 7 by the limiting unit 33, supplied to the shift register 34 as 3-bit data, and shifted by 12 bits to be multiplied by the multiplier 35.
To the multiplier 36 after being shifted by 6 bits, and to the multiplier 37 without shifting. The multiplier 35 gives a value of 1 to the supplied number of CCCH transmission requests.
The coefficient is multiplied and supplied to the adder 24. Multiplier 36,
37 CCCs for the number of CCCH transmission requests supplied
Priority CH influence coefficient from H to DCCH, CCCH to D
The TCH priority CH influence coefficients are multiplied and supplied to the adders 25 and 26.

The number of DCCH transmission requests is limited by the list upper limit of 7 in the limiting unit 40, supplied to the shift register 41 with 3-bit data, shifted by 6 bits, supplied to the multiplier 42, and multiplied without shifting. Is supplied to the container 43. The multiplier 42 gives a value 1 to the number of DCCH transmission requests supplied.
The coefficient is multiplied and supplied to the adder 25. The multiplier 43 determines the number of DCCH transmission requests supplied from DCCH to DTCH.
To the adder 26. The number of DTCH transmission requests is limited to 7 by the limit unit 44.
Is supplied to the shift register 45 as 3-bit data, and is supplied to the multiplier 46 without shifting. The multiplier 46 multiplies the supplied number of DCCH transmission requests by a coefficient having a value of 1, and supplies the result to the adder 26.

Each of the adders 22 to 26 adds the supplied values and outputs each 5-bit value for 5 blocks. The values of these five blocks are arranged in the order of the adders 23, 24, 25, and 26 with the adder 22 as the highest level, and a bit "0" indicating the block delimiter is inserted at the beginning of each block, and "00" is added to 2 bits to generate 32-bit logic selection operation value data.

In FIG. 25, from the combination list 11 to B
When CCH is assigned to FACH1, the FACH1 terminal outputs valid (value = "1" for valid, value = "0" for invalid) and supplies it to the AND circuits 51, 54, 60.
When allocating to CH2, the FACH2 terminal outputs a valid signal and supplies it to the AND circuits 52, 55, 61, and FA
When allocating to CH3, the valid is output from the FACH3 terminal and supplied to the AND circuits 53, 56 and 62. P
CCH is fixedly assigned to PCH, so priority CH
There is no generation of influence coefficient. CCCH from combination list 13
Is assigned to FACH1, the valid is output from the FACH1 terminal and supplied to the logical product circuits 51, 57 and 63, and when assigned to FACH2, the valid is output from the FACH2 terminal and supplied to the logical product circuits 52, 58 and 64. , FACH3, the valid is output from the FACH3 terminal and supplied to the AND circuits 53 and 59.

FACH from DCCH from combination list 14
When assigned to 1, the FACH1 terminal outputs a valid signal and supplies it to the AND circuits 54, 57 and 66.
When assigned to 2, the FACH2 terminal outputs a valid signal and supplies it to the AND circuits 55, 58 and 67,
When assigned to 3, the FACH3 terminal outputs a valid signal and supplies it to the AND circuits 56, 59 and 68. When DTCH is assigned to FACH1 from the combination list 14, the FACH1 terminal outputs "valid" and the AND circuit 6
0, 63, 66, and when assigned to FACH2, the valid is output from the FACH2 terminal and the AND circuit 6
1, 64, 67, and when assigned to FACH3, the valid is output from the FACH3 terminal and the AND circuit 6
2,65,68.

Each of the logical product circuits 51 to 68 performs a logical product operation of two inputs. The outputs of the AND circuits 51 to 53 are added by the adder circuit 70 and output as the priority CH influence coefficient from BCCH to CCCH.
The output of 56 is added by the adder circuit 71 and is added from BCCH to D
It is output as the priority CH influence coefficient to CCH, and the outputs of the AND circuits 57 to 59 are added by the adder circuit 72 to obtain the BCC.
It is output as a priority CH influence coefficient from H to DTCH. The outputs of the AND circuits 60 to 62 are added by the adder circuit 73.
Is added as the priority CH influence coefficient from CCCH to DCCH, and the outputs of the AND circuits 63 to 65 are added by the addition circuit 74 to obtain the priority C from CCCH to DTCH.
It is output as the H influence coefficient, and the outputs of the AND circuits 66 to 68 are added by the adding circuit 75 and output as the priority CH influence coefficient from DCCH to DTCH.

FIG. 26 shows a flow chart of the processing for generating a selection calculation value (TFI selection calculation value) from the transmission request value executed in step S12. Steps S70 to S7
In step 8, the output values of the respective logical channel allocation transport channel combination lists 11 to 15 are added as they are, after predetermined data shift in step S80, setting is made for each block in step S82, and at the beginning of each block in step S84. The digit overflow prevention bit is set to generate TFI selection operation value data.

FIG. 27 is a block diagram showing an embodiment of the TFI selection calculation value data generation circuit by the TFI list assembling method for weighting calculation. FAC of combination list 11
"1" when BCCH output from H1 terminal is assigned to FACH1, BCC output from FACH2 terminal
A signal which becomes “1” when H is assigned to FACH2 and which is “1” when BCCH output from the FACH3 terminal is assigned to FACH3 is added and output by the adder circuit 100, and is output at the highest block of the weighting calculation TFI list ( 6 bits). Further, a signal which becomes “1” when the PCCH output from the PCH terminal of the combination list 12 is assigned to the PCH is output through the adder circuit 101 and set in the second block (6 bits) of the weighting calculation TFI list. .

When the CCCH output from the FACH1 terminal of the combination list 13 is assigned to FACH1, it is "1", and the CCCH output from the FACH2 terminal is FA.
"1" when allocating to CH2, "1" when allocating CCCH output from FACH3 terminal to FACH3
The signal to be added is added by the adding circuit 102 and output, and is set in the third block (6 bits) of the TFI list for weighting calculation. When the DCCH output from the FACH1 terminal of the combination list 14 is assigned to FACH1, it is "1", and the DCCH output from the FACH2 terminal is FA.
"1" when allocating to CH2, "1" when allocating DCCH output from FACH3 terminal to FACH3
The signal to be added is output by the addition circuit 103 and is set in the fourth block (6 bits) of the TFI list for weighting calculation.

When the DTCH output from the FACH1 terminal of the combination list 15 is assigned to FACH1, it is "1", and the DTCH output from the FACH2 terminal is FA.
"1" when allocating to CH2, "1" when DTCH output from FACH3 terminal is allocated to FACH3
Are added and output by the adder circuit 104 and set in the lowest block (6 bits) of the TFI list for weighting calculation. A 1-bit overflow prevention bit “1” is placed at the beginning of each block in the weighting calculation TFI list.
Is provided to generate 32-bit TFI selection operation value data.

FIG. 28 shows a flowchart of the process for generating a violation calculation value (logic violation calculation value) from the transport channel list. In step S90 (corresponding to step S10), the transmission request value is limited to the list upper limit (= 7) for each logical channel. Next, in step S92, an effective transport channel is selected according to each combination list 11 to 15, and in step S94 addition is performed for each transport. Next, after a predetermined data shift is performed in step S96, setting is made for each block in step S68, and a overflow prevention bit is provided at the beginning of each block (8 bits) in step S99, whereby 32-bit l
The logic violation calculation value data is generated.

Regarding the logic violation operation value data, the digit in which each block is arranged has no meaning.
The blocks may be exchanged as long as they match the arrangement of the blocks in the F violation calculation value.

FIG. 29 is a block diagram showing an embodiment of a logic violation operation value data generation circuit by the method of assembling the transmission request value for violation judgment operation. In the logic violation calculation value data, PCH, FACH1, FAC
It is assumed that H2 and FACH3 are arranged in this order.

In FIG. 29, the number of BCCH transmission requests is limited by the list upper limit of 7 in the limiting unit 116, supplied to the shift register 117 with 3-bit data, shifted by 16 bits and supplied to the multiplier 119, and It is shifted by 6 bits and supplied to the multiplier 120, and is supplied to the multiplier 121 without shifting. Each of the multipliers 119 to 121 is “1” when allocating the BCCH output from the combination list 11 to FACH1 to the supplied number of BCCH transmission requests, “1” when allocating BCCH to FACH2, and “1” when allocating BCCH to FACH3. ”
And the signals are multiplied and supplied to the adders 123, 124, and 125. The number of PCCH transmission requests is limited by the list upper limit of 7 by the limiting unit 130, and is supplied to the shift register 131 as 3-bit data.
32, and the multiplier 32 adds the PCCH output from the combination list 12 to the supplied PCCH transmission request count by P.
A signal that becomes “1” when assigned to CH is multiplied and supplied to the adder 122.

The number of CCCH transmission requests is limited by the list upper limit of 7 by the limiter 133, supplied to the shift register 134 with 3 bits of data, 16 bits shifted and supplied to the multiplier 135, and 8 bits shifted. Is supplied to the multiplier 136, and is supplied to the multiplier 137 without shifting. Each of the multipliers 135 to 137 is "1" when assigning the CCCH output from the combination list 13 to the FACH1 to the supplied CCCH transmission request number, "1", CC
A signal that becomes “1” when allocating CH to FACH2 and “1” when allocating CCCH to FACH3 is multiplied and supplied to the adders 122, 123, 124, and 125.

The number of DCCH transmission requests is limited by the list upper limit of 7 by the limiting unit 140, supplied to the shift register 141 with 3-bit data, shifted by 16 bits, supplied to the multiplier 151, and shifted by 8 bits. Are supplied to the multiplier 142 and are supplied to the multiplier 143 without shifting. Each of the multipliers 151, 142, 143 is "1" when allocating the DCCH output from the combination list 14 to FACH1 to the supplied number of DCCH transmission requests, "1" when allocating the DCCH to FACH2, and when allocating the DCCH to FACH3. "1"
And the signals are multiplied and supplied to the adders 123, 124, and 125. The number of DTCH transmission requests is limited by the limit upper limit of 7 by the limiter 144, and is supplied to the shift register 145 as 3-bit data.
52 and is shifted by 8 bits to be multiplied by 1
53 and to the multiplier 146 without shifting. Each of the multipliers 152, 153, 146 is "1" when DTCH output from the combination list 15 is assigned to FACH1 in the supplied DTCH transmission request number, "1" when DTCH is assigned to FACH2, and when DTCH is assigned to FACH3. "1"
And the signals are multiplied and supplied to the adders 123, 124, and 125.

Each of the adders 122 to 125 adds the supplied values and outputs each 5-bit value for 4 blocks. The values for these four blocks are arranged in the order of the adders 123, 124, and 125 with the adder 122 as the highest rank, and the carry bit 2 "00" and the block delimiter "1" are placed at the beginning of each block. Is added to generate 32-bit logic violation operation value data.

FIG. 30 shows a flowchart of the processing for generating a violation calculation value (TFI violation calculation value) from the transmission request value executed in step S16. In step S100, the PCH multiplex number (maximum value) designated by the TFI shown in FIG. 14B is data-shifted according to the PCH priority order designation, and in step S102, the FACH1 multiplex number designated by the TFI. The (maximum value) is data-shifted according to the priority designation of FACH1. Also, step S1
In 04, the number of multiplexed FACH2 (maximum value) designated by TFI is data-shifted in accordance with the designated priority of FACH2, and in step S106, the number of multiplexed FACH3 (maximum value) designated by TFI is prioritized over FACH3. Data is shifted according to the order specified. After this, step S
By setting each block at 108 as shown in FIG. 31, 32-bit TFI violation operation value data is generated.

(Supplementary Note 1) When a plurality of types of transport channels are loaded with logical channels of a plurality of information types and transmitted, combinations and priorities of the information types are determined in advance as a plurality of lists. In a transport channel list selection method for selecting a list having the maximum amount of information of a logical channel to be transmitted for a logical channel of a certain information type, a plurality of lists are selected for each of the plurality of lists based on a combination of information types and a priority. Computation value data is generated, logical channels of the information type having the transmission request are generated based on a combination of the information types and priority, and the plurality of list selection calculation value data and the logic selection are generated. The plurality of list selection data are generated by calculating the calculated value data and the plurality of list selection data. A method for selecting a transport channel list, characterized in that the list having the maximum amount of information is selected by comparing the selection data with each other.

(Supplementary Note 2) When a plurality of types of transport channels are loaded with logical channels of a plurality of information types for transmission, the combinations and priorities of the information types are determined in advance as a plurality of lists. In a transport channel list selection device that selects a list that maximizes the information amount of a logical channel to be transmitted for a logical channel of a certain information type, a plurality of lists are selected for each of the plurality of lists based on a combination of information types and priority. List selection calculation value data generation means for generating calculation value data, and logical selection calculation value data generation for generating logical selection calculation value data based on a combination of information types and priority of logical channels of the information type having the transmission request Means, each of the plurality of list selection operation value data, and the logic selection operation value List selection data generating means for calculating data and a plurality of list selection data,
A transport channel list selection device, comprising: a comparison unit that compares the plurality of list selection data with each other to select a list having the maximum information amount.

(Supplementary note 3) In the transport channel list selection apparatus according to supplementary note 2, list violation operation value data representing the number of multiplexes for each type of transport channel based on the combination of information types and the priority in the plurality of lists. And a logical violation calculation value data representing a multiplexing number for each type of transport channel based on a combination of the information types and the priority of the logical channels of the information type having the transmission request. A logic violation operation value data generation unit for generating, and a plurality of list selections generated by the list selection data generation unit by determining an unselectable list based on the deviation between the list violation calculation value data and the logic violation calculation value data And a non-selectable list excluding means for excluding it from the use data. Channel list selection device.

(Supplementary Note 4) In the transport channel list selecting apparatus according to Supplementary Note 2 or 3, the transport channel list selecting apparatus is provided with a limiting means for limiting the number of transmission requests to a predetermined number for each information type. .

(Supplementary Note 5) In the transport channel list selecting apparatus according to Supplementary Note 2, each of the plurality of list selection operation value data and the logic selection operation value data is
A transport channel list selection device characterized in that a block is divided for each information type and a numerical value of the information type corresponding to each block is set.

(Supplementary Note 6) In the transport channel list selecting apparatus according to Supplementary Note 5, each of the plurality of list selection operation value data and the logic selection operation value data is
A transport channel list selection device characterized in that information types having higher priority are arranged in higher blocks.

(Supplementary Note 7) In the transport channel list selection apparatus according to Supplementary Note 5, the plurality of list selection operation value data are provided with a overflow prevention bit at the uppermost position of each block. List selection device.

(Supplementary Note 8) In the transport channel list selecting apparatus according to Supplementary Note 7, the list selecting data generating means obtains a difference between each of the plurality of list selecting operation value data and the logical selecting operation value data. A transport channel list selection device characterized by generating a plurality of list selection data.

(Supplementary Note 9) In the transport channel list selecting apparatus according to supplementary note 8, the comparing means selects the list selecting data having the maximum value from the plurality of list selecting data, and the list having the maximum information amount. A transport channel list selection device characterized by selecting as. Note that FIG. 23 corresponds to the list selection operation value data generating means described in the claims, step S12 corresponds to the logic selection operation value data generating means, step S20 corresponds to the list selection data generating means, and step S28 is Step S16 corresponds to the list violation operation value data generation means, step S16 corresponds to the logic violation operation value data generation means, and steps S30 to S38 and S48 correspond to the unselectable list elimination means.

[0084]

As described above, the invention according to claim 1 or 2 generates a plurality of list selection operation value data for each of a plurality of lists based on a combination of information types and a priority order, and requests transmission. Logical selection calculation value data is generated for the logical channels of the information type based on the combination of the information types and the priority order, and each of the plurality of list selection calculation value data and the logical selection calculation value data is calculated to obtain a plurality of list selection data. By creating a list and comparing multiple list selection data with each other and selecting the list with the maximum amount of information, it is not necessary to store it in the search result table, so memory resources can be reduced compared to the past. In addition, it is possible to select the list that maximizes the amount of information with a small amount of calculation, which enables high-speed processing, prevents the transmission information from being discarded, and reduces transmission efficiency. It can be prevented.

The invention according to claim 3 is a list violation operation value data for generating list violation operation value data representing a multiplexing number for each type of transport channel based on a combination of information types in a plurality of lists and a priority order. Generating means, and logical violation operation value data generating means for generating logic violation operation value data representing the number of multiplexes for each type of transport channel based on the combination of information types and the priority of the logical channels of the information type requested to be transmitted. And a non-selectable list elimination means for judging the non-selectable list based on the deviation between the list violation calculated value data and the logical violation calculated value data and excluding it from the plurality of list selecting data generated by the list selecting data generating means. With the above, the number of data for list selection can be reduced, and further high speed processing can be performed.

According to the fourth aspect of the present invention, since the number of transmission requests is limited to a predetermined number for each information type, it is possible to prevent the number of bits of the logical selection operation value data from unnecessarily increasing.

In the invention described in appendix 6, each of the plurality of list selection operation value data and the logic selection operation value data is
By arranging the information type having a higher priority in the higher block, the list selection data can be generated by one operation of the list selection operation value data and the logic selection operation value data.

In the invention described in appendix 7, the plurality of list selection operation value data are calculated by the operation of the list selection operation value data and the logic selection operation value data by providing the overflow prevention bit at the top of each block. Sometimes, overflow of each block can be prevented from affecting adjacent blocks.

In the invention described in appendix 8, the list selection data generating means obtains a difference between each of the plurality of list selection calculation value data and the logical selection calculation value data to generate a plurality of list selection data. The data for list selection can be generated by one calculation.

In the invention described in appendix 9, the comparing means selects the list selection data having the maximum value among the plurality of list selection data as the list having the maximum information amount, and thus the maximum information amount is determined. You can easily select the list.

[Brief description of drawings]

FIG. 1 is a configuration diagram of a W-CDMA system.

FIG. 2 is a diagram showing a protocol configuration of a W-CDMA system.

FIG. 3 is a diagram showing a block configuration of a wireless control device.

FIG. 4 is a diagram showing a configuration of a demultiplexing circuit and a transport channel list.

FIG. 5 is a diagram showing a configuration of a conventional transport channel list search.

FIG. 6 is a diagram showing a principle diagram of a transport channel list selection method of the present invention.

FIG. 7 is an explanatory diagram of a calculation efficiency principle by a bit width limitation calculation.

FIG. 8 is an explanatory diagram of a method of assembling numerical data for calculation.

FIG. 9 is an explanatory diagram of a calculation numerical data processing method.

FIG. 10 is an explanatory diagram of a method for adding overflow prevention information to numerical data for calculation.

FIG. 11 is an explanatory diagram of a transport channel list selection method by calculation.

FIG. 12 is an explanatory diagram of an efficiency improving method by parallel calculation.

FIG. 13 is a flowchart of an embodiment of the transport channel list selection method of the present invention.

FIG. 14 is a configuration diagram of a transport channel list (TFI).

FIG. 15 is a flowchart of data calculation for list selection.

FIG. 16 is an explanatory diagram of list selection data generation.

FIG. 17 is an explanatory diagram of data generation for list selection.

FIG. 18 is an explanatory diagram of list selection data generation.

FIG. 19 is an explanatory diagram of list selection data generation.

FIG. 20 is an explanatory diagram of list selection data generation.

FIG. 21 is an explanatory diagram of list selection data generation.

FIG. 22 is a flowchart of maximum value selection calculation.

FIG. 23 is a flowchart of a process of generating a selection calculation value (logic selection calculation value) from a transport channel list.

FIG. 24 is a block diagram of an embodiment of a logic selection calculation value data generation circuit by the method of assembling the number of transmission requests for weighting calculation.

FIG. 25 is a block diagram of an embodiment of a priority CH influence coefficient calculation device.

FIG. 26 is a flowchart of a process of generating a selection calculation value (TFI selection calculation value) from a transmission request value.

FIG. 27 is a block diagram of an embodiment of a TFI selection calculation value data generation circuit by the weighting calculation TFI list assembling method.

FIG. 28 is a flowchart of a process of generating a violation calculation value (logic violation calculation value) from a transport channel list.

FIG. 29 is a block diagram of an embodiment of a TIF violation calculation value data generation circuit by a violation determination calculation transmission request value assembling method.

FIG. 30 is a flowchart of a process of generating a violation calculation value (TFI violation calculation value) from a transmission request value.

FIG. 31 is a diagram for explaining TFI violation operation value data generation.

[Explanation of symbols]

90 Receiver 91 control ATM cell generator 92 buffer 93 Transport Channel List 94 Priority list 95 Selection control unit 96 transmitter

   ─────────────────────────────────────────────────── ─── Continued front page    F term (reference) 5K030 GA01 HA10 HC01 HC09 JL01                       KX11 LC01                 5K067 AA13 AA21 BB04 BB21 CC08                       CC10 DD11 DD57 EE02 EE10                       EE16 HH22 HH24 JJ12 KK13                       KK15

Claims (5)

[Claims] 1. Information for which a combination of information types and priorities when transporting a plurality of types of transport channels with logical channels of a plurality of information types are determined in advance as a plurality of lists, and there is a request for transmission. In a transport channel list selection method for selecting a list having the maximum amount of information of the logical channel to be transmitted for each type of logical channel, a plurality of list selection calculation values are set for each of the plurality of lists based on a combination of information types and priority. Data is generated, the logical channel of the information type having the transmission request is generated based on the combination of the information types and the priority order, and the logical selection operation value data is generated. Data and a plurality of list selection data are generated to calculate the plurality of list selections. Transport channel list selection method, wherein the amount of information compared with each other data to select a list of the maximum. 2. A combination of the information types and a priority when transmitting the logical channels of the plurality of information types on the plurality of types of transport channels and transmitting the channels are determined in advance as a plurality of lists, and information requested to be transmitted. In a transport channel list selection device that selects a list that maximizes the information amount of the logical channel to be transmitted for each type of logical channel, a plurality of list selection calculation values for each of the plurality of lists based on the combination of information types and the priority order. List selection calculation value data generation means for generating data, and logic selection calculation value data generation means for generating logical selection calculation value data on the basis of the combination of information types and the priority of the logical channels of the information type having the transmission request , Each of the plurality of list selection operation value data and the logic selection operation value data And list selecting data generating means for calculating a plurality of list selecting data, and comparing means for comparing the plurality of list selecting data with each other to select a list having the maximum information amount. A transport channel list selection device characterized by the above. 3. The transport channel list selection device according to claim 2, wherein list violation calculation value data representing a multiplexing number for each type of transport channel based on a combination of information types in the plurality of lists and a priority order. List violation calculation value data generation means for generating, and logical violation calculation value data representing the number of multiplexes for each type of transport channel based on the combination of information types and the priority of the logical channels of the information type for which the transmission request is made. Logic violation operation value data generation means for selecting a plurality of lists generated by the list selection data generation means by determining an unselectable list based on the deviation between the list violation operation value data and the logic violation operation value data Transport box having a non-selectable list removing means for removing from the data Channel list selection device. 4. The transport channel list selection device according to claim 2, further comprising a limiting unit that limits the number of transmission requests to a predetermined number for each information type. 5. The transport channel list selection device according to claim 2, wherein each of the plurality of list selection calculation value data and logical selection calculation value data is divided into blocks for each information type, and an information type corresponding to each block. A transport channel list selection device characterized in that a numerical value of is set.