Method for balancing the ratio Eb/l in a service multiplexing CDMA system and telecommunication system using this method

The present invention<u style="single">Communication equipment and rate matching processing that performs rate matching processing that converts input blocks of data transported by multiple transport channels into output blocks.</u>About the method<u style="single">。</u>

The 3GPP (3rd Generation Partnership Project) group was originally several, including ETSI (European Telecommunication Standardization Institute) and ARIB (Association of Radio Industries and Businesses). An association established by a regional standardization body with the purpose of standardizing third-generation remote communication systems for mobile use. One basic aspect that distinguishes 3rd generation systems from 2nd generation systems is that they are highly flexible services, apart from the fact that 3rd generation systems use the radio spectrum more efficiently. Is to provide. Second generation systems provide optimized wireless interfaces for limited services. For example, GSM (Global System for) Mobiles, a global mobile system) is optimized for voice transmission (telephone technology). Third generation systems will provide wireless interfaces that are compatible with all types of services and combinations of services.

One of the concerns in third-generation mobile wireless systems is the efficient multiplexing of services with different quality of service (QoS) requirements on the wireless interface. The quality of service has traditionally been defined according to at least one criterion, such as processing delay, bit error rate, and / or error rate per block transmitted. Different qualities of these services require different channel coding and channel interleaving for the corresponding transport channels. In addition, the maximum bit error rate (BER) they require is also different. For any channel coding, the requirement for BER is met if the coded bits have at least some coding-dependent ratio Eb / I. This ratio Eb / I represents the ratio of the average energy of each coded bit to the average energy of interference.

In short, different quality of service does not have the same requirements for ratio Eb / I. Now, in a CDMA (Code Division Multiple Access) system, the capacity of the system is limited by the level of interference. Therefore, for each service, the ratio Eb / I should be set as correctly as possible. Therefore, a rate matching operation is required among various services in order to balance the ratio Eb / I. Without this operation, the ratio Eb / I would be set by the service with the highest demands, resulting in "too good" quality for other services, which in turn directly affects the capacity of the system. May be given.

<p> This is a problem. This is because the rate matching ratio must somehow be similarly defined at both ends of the wireless link.</p><p> The present invention relates to a configuration method for similarly defining rate matching ratios at both ends of a CDMA radio link.</p><p> In the OSI (Open Systems Interconnection) model proposed by the ISO (International Organization for Standardization), telecommunications equipment is modeled by a layered model consisting of a stack of protocols. Each level is a protocol that services the levels above it. Level 1 is specifically responsible for performing channel coding and channel interleaving. The services provided by Level 1 are referred to as "transport channels". Transport channels allow higher levels of quality of service to carry data. The quality of service is characterized by delay and BER in particular.</p><p> Level 1 uses some encoding and suitable channel interleaving so that the demand for quality of service can be met.</p><p> Known solutions, especially those proposed by the 3GPP group, are described with reference to FIGS. 1 and 2.</p><p> Figure 1 and Figure 2 are block diagrams for interleaving and multiplexing defined by the current proposals of the 3GPP group. However, this proposal has not yet been finally approved.</p><p> In FIGS. 1 and 2, similar blocks have the same reference numbers. In both cases, the uplink (from the mobile station to the network) can be distinguished from the downlink (from the network to the mobile station), and only the transmitting part is shown.</p><p> Each transport channel numbered 100 periodically receives a set of transport blocks from a higher level numbered 102. The number of transport blocks 100 in this set and their size depends on the transport channel. The minimum period during which a set of transport blocks is supplied corresponds to the interleaving time span of the transport channel. Transport channels with one and the same quality of service (QoS) are processed by one and the same processing chains 103A, 103B.</p><p> In each of the processing chains 103A, 103B, the transport channels are multiplexed with each other by concatenation in step 104, especially after channel coding and channel interleaving. This multiplexing is performed for each multiplexing frame. A multiplexing frame is the smallest unit of data that can be demultiplexed at least partially. Multiplexed frames typically correspond to wireless frames. The radio frames form a continuous time interval that is synchronized with the network and timed by the network. In the proposal by the 3GPP group, the radio frame corresponds to a time period of 10 ms.</p><p> The 3GPP proposal includes service-specific coding and interleaving options, outlined in 103C. The possibility of such an option is being considered at this time. This is because it has not yet been determined whether it is essential.</p><p> In the general case, the processing chain 100A first includes step 106. In this step 106, a bit word called FCS (frame check sequence) is given to each transport block. This bit FCS is typically calculated by the so-called CRC technique (Cyclic Redundancy Check). This cyclic redundancy check considers the bits of the transport block to be the coefficients of the polynomial P, and calculates the CRC from the remainder of the polynomial (P + P0) divided by the so-called generated polynomial G. Here, P0 is a predetermined polynomial for any degree P. Granting the bit FCS is optional, and some transport channels do not include this step. The technique for calculating the bit language FCS also depends strictly on the transport channel, especially on the maximum size of the transport block. The bit FCS is useful in that it can determine whether the received transport block is valid or corrupted.</p><p> In the next step 108, transport channels (TrCH) of the same quality of service (QoS) are multiplexed with each other. This is because those transport channels with the same quality of service can use the same channel coding. Typically, the multiplexing in step 108 is done by concatenating a set of transport blocks with their FCS for each transport channel.</p><p> The next step, numbered 110, is the step of coding the channel. At the exit of the channel encoder 110, there is a set of coded blocks. Typically, in the case of convolutional code, there is a zero or single variable length coded block. Its length is N_output= N_input/ (Coding rate) + N_tail(Coded block length) Given by the formula. During the ceremony N_outputIs the number of bits in the output (the length of the coded block), N_inputIs the number of bits in the input, -The coding rate is a constant ratio and N_tailIs N_inputIt is a fixed amount of information independent of, and serves to cleanly empty the channel decoder when it receives the coded block.</p><p> From this step 110 onwards, the uplink is distinguished from the downlink. In each transport channel, both uplink (FIG. 1) and downlink (FIG. 2), a rate matching step is performed after the channel coding step 110. This step is labeled 112 for uplinks and 114 for downlinks. Rate matching is not always done immediately after channel coding 110.</p><p> The purpose of rate matching step 112 or 114 is to balance the ratio Eb / I between transport channels of different quality of service. This ratio Eb / I represents the average energy of 1 bit with respect to the average energy of interference. In systems using multiple access CDMA technology, the higher this ratio, the higher the quality that can be obtained. Therefore, the requirements for Eb / I of transport channels with different quality of service are not the same, and if rates are not matched, the quality of service will be determined according to the channel that requires the highest quality of service. It can happen that the quality of service is "too good" for those demands for a transport channel. In this case, such transport channels can unnecessarily cause interference. Therefore, rate matching has the role of matching the Eb / I ratio. Rate matching is such that the X bits at the input result in the Y bits at the output, so Eb / I is multiplied by the ratio Y / X and thus by the matching ability. This ratio Y / X is also known as a rate matching ratio, and in the following description, this ratio Y / X is referred to as a rate matching ratio.</p><p> Rate matching is done differently for uplink and downlink. This is because in the uplink, discontinuous transmission is determined to transmit continuously because it degrades the peak / average ratio of radio frequency power at the output of the mobile station. The closer this ratio is to 1, the better. This is because if this ratio deteriorates (ie increases), it means that the power amplifier requires a larger linear margin (backoff) with respect to the average operating point. With such a large margin, the power amplifier becomes less efficient and therefore consumes more for the same average power diverged, thereby accepting the battery-powered endurance of the mobile station in particular. It will be reduced to the extent that it cannot be done. The rate matching ratio Y / X cannot be constant because it is necessary to transmit continuously in the uplink. Because the total number of bits after matching Y₁+ Y₂+ ... Y_kIs because it must be equal to the total number of bits in the radio frame for that data. This number is some predetermined value N₁, N₂, ..., N_pCan only take. Therefore, k unknowns Y₁, ..., Y_kIt is appropriate to solve the system shown below. In the system, X_iAnd Eb_i/ I and P_iIs the characteristic constant of each transport channel, and in this system, p possible values N₁, N₂, ..., N_PInside, N_jA solution is found that minimizes (Note: P_iIs the maximum acceptable puncture rate for a coded transport channel).</p><p><maths num="1"><img file="JP4592811B2_D0001.tif" /></maths></p><p> Therefore, in the uplink, the rate matching ratio Y / X for each transport channel is not constant for each multiplexing frame, but is defined within a multiplicative constant and therefore a pair between these ratios. The ratio of each is kept constant.</p><p> In downlink, the peak / average ratio of radio frequency power is very poor in all cases. This is because the network sends to a plurality of users at the same time. The signals directed to these users, combined constructively or destructively, cause large variations in the radio frequency power emitted by the network, thus degrading the peak / average ratio. Therefore, for downlinks, Eb / I between the various transport channels is determined to be balanced by rate matching with a constant rate matching ratio Y / X, and dummy bits in the multiplexing frame. That is, it was decided to replenish the bits that were not transmitted, and therefore to make discontinuous transmissions.</p><p> Therefore, the difference between uplinks and downlinks is that in the uplink the rate matching 112 is dynamic to replenish the multiplexed frames, whereas in the downlink the rate matching 114 is static. The point is that the multiplexed frame is replenished by inserting a dummy bit in step 124 that immediately follows.</p><p> Rate matching, dynamic or static, was proposed to ETSI by Siemens company® in a technical document numbered SMG2 / UMTS-L1 / Tdoc428 / 98. It is done by iteration or puncture according to the algorithm. This algorithm makes it possible to obtain non-integer puncture / iteration ratios. Information on this is shown in Table 1.</p><p><tables num="1"><img file="JP4592811B2_D0002.tif" /></tables></p><p> A specific feature of this algorithm is that when it operates in puncture mode, it maximizes the gap between two punctured bits without puncturing consecutive bits. For iterations, the bits that are repeated follow the bits that they repeat. Under these conditions, it should be understood that rate matching is beneficial to be performed prior to interleaving. This is because for iterations, interleaving is performed after rate matching, which allows the repeated bits to be spaced apart. For punctures, the interleaver is placed before the rate matching, which can cause rate matching to puncture consecutive bits at the exit of the channel encoder.</p><p> Therefore, rate matching should be done as high as possible, i.e. as close as possible to the channel encoder.</p><p> In addition, each processing chain 103A, 103B also includes a first interleaver after the channel coding step 110, which is 116-coded for uplinks and 118-coded for downlinks, followed by , 120 for uplinks and 122 for downlinks, a step of segmenting at each multiplexing frame. The first interleaver 118 does not necessarily have to be placed immediately after the channel coding 110.</p><p> For the downlink, the rate matching ratio is constant, so it is possible to position the rate matching 114 just at the output of the channel coding 110. Therefore, a priori requires only a single interleaver 118.</p><p> However, a second interleaver because the multiplexing of transport channels with different quality of service QoS is done by simple concatenation, and such a method actually limits the time span of each multiplexing block. 136 is also needed.</p><p> For uplinks, the rate matching ratio can change from time to time multiplexed frame. Therefore, in order to distribute the bits of the coding block across multiple multiplexing frames, at least the first interleaver 116 is required before the rate matching 112, and the bits repeated by the rate matching 112 are added. In order to separate, it is necessary to place a second interleaver 128 after rate matching.</p><p> Therefore, in the block diagrams of FIGS. 1 and 2, a state in which two interleavers called a first interleaver and a second interleaver are arranged is shown. The first interleavers 116, 118 are interleavers whose time span is equal to the interleaved time span for the corresponding transport channel. This span may be longer than the time period of the multiplexed frame and is typically multiplied by a constant ratio. For this reason, the first inter-frames 116, 118 are sometimes also referred to as inter-frame inter-frame interleavers.</p><p> The second interleavers 126, 128 are also referred to as intra-frame interleavers because their timespan is the timespan of the multiplexed frame.</p><p> Therefore, the segmentation steps for each multiplexing frame, coded 120, 122, are with the first interleavers 116, 118 and the second interleavers 128, 126 (if there is a second interleaver). Positioned in between. This step involves segmenting the coded and interleaved block by the first interleaver into as many segments as possible, equal to the ratio of the first interleaver's time span to the time period of the multiplexed frame. This segmentation is typically done in such a way that the concatenation of the segments again produces an interleaved coded block.</p><p> Note that in the uplink, this segmentation step 120 must precede the rate matching 112. This is because the rate matching 112 is performed according to the ratio dynamically constructed for each multiplexing frame, and therefore cannot be performed in units of data that can extend over multiple multiplexing frames.</p><p> On the uplink and downlink, step 130 of segmentation into physical channels is performed before the second interleavers 126, 128, respectively. Similarly, after the second interleavers 126, 128, step 132 of mapping physical channels for proper transmission is performed.</p><p> At this time, only multiplexing, channel coding, interleaving and rate matching algorithms have been defined and considered. When a block of size X is input to the bitrate matcher, there is no rule that allows us to fix the way we get a block of size Y in the output accordingly. Assuming that all (X, Y) pair combinations are stored in memory in a predetermined and fixed form, only one of the following two methods is possible. That is: The-(X, Y) pair pair remains fixed, and there is no flexibility in defining this (X, Y) pair pair for the service in question. This goes against the desired effect. Or -A pair of (X, Y) pairs must be negotiated between the associated telecommunications network and the mobile station, and a large number of signaling bits, and thus the immobilization of additional resources, must be foreseen. It doesn't become.</p><p> A rule is needed, at least in the uplink, to determine the size Y of a rate-matched block whose rate is matched to another block, based on the size X of that block before rate matching. This is because the service has a variable bit rate, so the number of transport blocks provided for each transport channel is variable. A list of block sizes whose rates should be matched (X)₁, X₂, ..., X_k) Can therefore be different for each multiplexing frame. The number k of elements in this list is also not always constant.</p><p> Size X_iRelated to size Y_iX for dynamic matching_iNot just the entire list (X₁, X₂, ..., X_k), So each list (X)₁, X₂, ..., X_k) Against the list (Y₁, Y₂, ..., Y_k) Will exist. The number of lists can therefore be very large, at least as many as the number of transport format combinations. The combination of transport formats defines a method of demultiplexing multiplexed frames.</p><p> Therefore, the sending and receiving entities have the same related list (X).₁, X₂, ..., X_k) (Y₁, Y₂, ..., Y_k) Must be used. Signaling this association list between these two entities at the time of connecting a composite of coded transport channels means that there is a non-negligible cost for the signaling bits. A composite of coded transport channels includes at least two groups of coded transport channels. In addition, for each addition or removal within the complex of coded transport channels, a new list of associations (X).₁, X₂, ..., X_k) (Y₁, Y₂, ..., Y_k) Would have to be exchangeable.</p><p> Furthermore, the exact matching of the ratio Eb / I depends on the channel decoder technology for quality of service QoS of each service. The performance of such devices can vary from manufacturer to manufacturer depending on the respective know-how of the manufacturer. In fact, this rate matching is not due to the absolute performance of each decoder, but to their performance against each other and therefore can vary accordingly if there are differences in their performance from manufacturer to manufacturer.</p><p> For this reason, it is not possible for the sending and receiving entities used to be able to "negotiate" ratio (Eb / I) matching through proper exchange of signalized messages.</p><p> To illustrate this, assume two quality of service A and B, and two manufacturers M and N. M and N have the same channel decoder for A, but M has a much more efficient decoder for B than N. In this case, it is clear that manufacturer M can benefit from a smaller ratio Eb / I for B. This reduces the total amount of power required and thus provides a capacity gain, which allows M to claim it to be more portable to network operators. This is because it becomes possible to sell telecommunications equipment.</p><p> Therefore, it is very useful to be able to notify the parameters that allow us to specify the rule X Y for determining the size Y of the block after rate matching from the size X of the block before matching. Let's go. This will allow the ratio of Eb / I to be negotiated or re-negotiated. However, this notice should be as low cost as possible.</p><p> This adjustment during a ratio Eb / I connection made by a higher level is therefore if the two telecommunications stations A and B want to build or modify a connection over which service multiplexing takes place. , Means they follow the steps below. That is: 1. B notifies A of the maximum load N of the multiplexed frames that B can send.</p><p> 2.A determines the ideal ratio of ratio Eb / I to A from the following points: -The value of N received from B, -Maximum puncture rate allowed by A for quality of service QoS, -Relative requirements for quality of service QoS for Eb / I, and -Minimum performance requirement specified for A.</p><p> 3. A tells B the ratio of Eb / I that A expects. Step 1 above does not necessarily exist. For some systems, the maximum load is known in advance, and it may be possible to consider a system in which it forms part of the characteristics of the system. However, such systems are unlikely to exist due to their inflexibility.</p><p> In some cases, the ratio of Eb / I as determined by A may not be optimal for the required goal that no transport channel should have more than it deserves. This is a compromise situation, in which case it is desirable to reduce the capacity of the network if a combined service connection can be built.</p><p> Such compromises are acceptable if the degradation is within the limits set by the minimum performance requirements specified in the system specifications.</p><p> It is also possible that some of the actual permissible limits are left to the network. This makes it possible to specify a level of service that is not guaranteed, in which case the service will be provided if traffic conditions permit, otherwise the service will be re-negotiated downwards.</p><p> Specifications for possible service combinations will certainly exist. In this specification, a set of transport format combinations will be associated with each service combination. This would clearly apply to traditional telephone services and basic services such as all related services such as telephone ringing and standby.</p><p> However, the number of possible combinations will increase in the future, and in that case higher levels will be able to see what combinations are possible, how to negotiate them and / or they. Clear rules will be needed to determine whether to re-negotiate and to determine which set of transport format combinations they have for any combination.</p><p> Therefore, such higher levels must be able to determine what transport format combinations are possible with the help of simple arithmetic algorithms. For this, there are at least three rules of operation that those higher levels should apply: The first rule is about channel coding, which translates the number of elements in a set of transport blocks and their respective sizes into the number of elements in a set of encoded blocks and their respective sizes. , Allows conversion. For example, this rule Y = X / (coding rate) + N_tailOf the type, "coding rate" and "N" in the formula_tailIs the characteristic constant of the code.</p><p> The second rule is about segmentation, which translates the size of the coded block into the size of the segment obtained by segmentation per multiplexing frame. In general, this rule is a simple division by F if the transmission interval of the associated transport channel corresponds to F multiplexed frames. However, it is not yet clear whether the segmentations are equal or unequal. For equal segmentation, the coded block has a size that is a multiple of F. In this case, all segments are the same size. This is because there is no rounding error when divided by F. In the case of unequal segmentation, the size of the segment is specified within 1 bit due to rounding errors in rounding up or down, and it becomes necessary to know the serial number to reduce the ambiguity of the segment. For example, if 80 bits are segmented into an F = 8 frame, then every segment contains 10 bits and you do not need to know the sequence number (or segment position) of the relevant segment to determine its size. On the other hand, when segmenting 78 bits into an F = 8 frame, 6 segments contain 10 bits and the other 2 segments contain 9 bits, which is a segment to determine the size. You need to know the serial number of.</p><p> -The third rule is a rule that makes it possible to derive the size Y of the block whose rate is matched from the size X of the block whose rate should be matched.</p><p> This third rule has not been specified and the present invention solves this problem of deriving the corresponding size for blocks to be matched.</p>

<p> [Outline of Invention] An object of the present invention is a mobile remote communication network.<u style="single">For each transport channel, the block size Y obtained at the output of the rate matching means can be calculated by a simple method from the block size X input to the rate matching means. Is to do.</u></p><p><u style="single">A communication device according to an embodiment is a communication device that performs rate matching processing that converts an input block of data conveyed by a plurality of transport channels into an output block.</u><u style="single">A first calculation method for calculating the intermediate size of the output block for multiple transport channels, based on the rate matching parameters for the initial size of the data input block and the rate matching ratio of the transport channel.</u><u style="single">A means for determining the maximum payload that can be used from a plurality of maximum payload candidates of a multiplexed frame based on the sum of the size of the maximum payload candidate and the intermediate size of the output block for a plurality of transport channels.</u><u style="single">A second calculation means that calculates the final size of the output block with the intermediate size modified based on the maximum payload determined by the maximum payload determining means and the intermediate size of the output blocks of the plurality of transport channels.</u><u style="single">Convert an input block to a final size output block by puncturing or iterating at least one bit of the input block based on the final size of the output block calculated by the second computing means for multiple transport channels. It has a rate matching means to be performed.</u></p><p><u style="single">Preferably, the communication device has a multiplexing means that multiplexes the output blocks of the plurality of transport channels obtained by the rate matching means into a multiplexing frame having the maximum payload determined by the maximum payload determining means. Send a multiplexed frame.</u><u style="single">Preferably, the maximum payload determining means determines the minimum maximum payload when there are a plurality of available maximum payloads.</u><u style="single">Preferably, the second calculation means modifies the intermediate size of the final size of the output block so that the sum of the final sizes of the output blocks of the plurality of transport channels is equal to the maximum payload determined by the maximum payload determining means. To calculate.</u><u style="single">Preferably, the second computational means is an intermediate size Y'of the output block, with the maximum payload determined by the maximum payload determining means and k (k is a positive integer) as the number of transport channels.</u>_{<u style="single">i</u>}<u style="single">Total total of Σ</u>^{<u style="single">j = k</u>}_{<u style="single">j = 1</u>}<u style="single">Y'</u>_{<u style="single">j</u>}<u style="single">Partial sum of the intermediate size Y'i of the output block for Σ</u>^{<u style="single">j = i</u>}_{<u style="single">j = 1</u>}<u style="single">Y'</u>_{<u style="single">j</u>}<u style="single">Calculate the final size of the output block for the transport channel i (i is a positive integer from 1 to k) based on the ratio of.</u><u style="single">Preferably, the rate matching parameter is an integer value associated with the rate matching ratio.</u></p><p><u style="single">A method according to one embodiment is a method of performing rate matching processing for converting an input block of data carried by a plurality of transport channels into an output block.</u><u style="single">For multiple transport channels, the first calculation step to calculate the intermediate size of the output block based on the initial size of the data input block and the rate matching parameters for the transport channel rate matching ratio.</u><u style="single">A maximum payload determination step that determines the maximum payload available from multiple maximum payload candidates for a multiplexed frame based on the sum of the size of the maximum payload candidate and the intermediate size of the output block for the multiple transport channels. ,</u><u style="single">A second calculation step that calculates the final size of the output block with the intermediate size modified based on the maximum payload determined by the maximum payload determination step and the intermediate size of the output blocks of multiple transport channels.</u><u style="single">Convert an input block to a final size output block by puncturing or iterating at least one bit of the input block based on the final size of the output block calculated by the second calculation step for multiple transport channels. Rate matching steps and</u><u style="single">Have.</u></p><p><u style="single">The rate matching processing device according to one embodiment is a rate matching processing device that converts an input block of data carried by a plurality of transport channels into an output block.</u><u style="single">A first calculation method for calculating the intermediate size of the output block for multiple transport channels, based on the rate matching parameters for the initial size of the data input block and the rate matching ratio of the transport channel.</u><u style="single">A means for determining the maximum payload that can be used from a plurality of maximum payload candidates of a multiplexed frame based on the sum of the size of the maximum payload candidate and the intermediate size of the output block for a plurality of transport channels. ,</u><u style="single">A second calculation means that calculates the final size of the output block with the intermediate size modified based on the maximum payload determined by the maximum payload determining means and the intermediate size of the output blocks of the plurality of transport channels.</u><u style="single">Convert an input block to a final size output block by puncturing or iterating at least one bit of the input block based on the final size of the output block calculated by the second computational instrument for multiple transport channels. Rate matching means and</u><u style="single">Have.</u></p>

<figref num="1">It is a schematic diagram which shows the multiplexing of the transport channel on the uplink in the present 3GPP proposal.</figref><figref num="2">It is a schematic diagram which shows the multiplexing of the transport channel on the downlink in the present 3GPP proposal.</figref><figref num="3">It is a flowchart explaining the realization of the algorithm for downlink according to this invention.</figref><figref num="4">It is a flowchart explaining the realization of the algorithm for uplink according to this invention.</figref>

The present invention will be better understood by reading the following description, provided for illustrative purposes only, with reference to the accompanying drawings.

In general, in the present invention, the quality of each service is characterized by two integers E and P. E corresponds to the ratio Eb / I, that is, if there are multiple quality of service with 1, 2, ..., p, each coefficient E is E₁, E₂, ..., E_pThe ratio Eb / I of the quality of each service is expressed by the coefficient E._iIt becomes the same ratio as.

The coefficient P corresponds to the maximum puncture rate that can be perceived for any quality of service. Therefore, for each service quality 1, 2, ..., p, the maximum puncture rate P₁, P₂, ..., P_pIs associated. The maximum puncture rate is imposed by the channel coding performed within the processing chain specific to the quality of service in question. Puncture involves deleting the coded bits. This removal is acceptable only if the channel coding provides redundancy. However, the number of punctured bits should not be too large for the total number of encoded bits, so there is a maximum puncture rate that depends on the coding of the channel and on the decoder used. ..

In remote communication systems, physical channels dedicated to the transmission of control data are provided between the various transmitting and / or receiving entities of the system. Specifically, such a channel exists between the fixed network of the mobile wireless communication system and the mobile station. This channel is commonly referred to as DPCCH (ie, Dedicated Physical Control Channel) in the 3GPP standard. It coexists along a physical data transmission channel called DPDCH (ie, Dedicated Physical Data Channel) in the same standard.

According to the present invention, each entity in the remote communication system has a rate-matched block size Y._iThe size of the block to be matched with_iA pair (E) of i [1, p] so that the pair of correspondence between and can be determined, and that it can be done for the quality of each service._i, P_iOnly) is transmitted over the logical control data transmission channel to all entities in the system that must communicate with each other. These pairs can be constructed by one of a plurality of entities or can be "negotiated" among a plurality of entities in the first embodiment. In the second embodiment, the parameter (E_i) Is negotiated and the parameter (P)_i) Is predetermined for arbitrary channel coding. In the third embodiment, the parameter (P)_i) Is negotiated and the parameter (E)_i) Sets are predetermined for any group of transport channels. The pair specified above (E_i, P_i) From block X_i, Y_iMethods for determining the correspondence between sizes of are described later in the specification.

Integers are used for E and P for the following reasons: That is: -Integer or fixed-point calculations are easy to implement, in other words they can be done faster and with less resources. Also, -The accuracy of integer calculations can be very easily quantified through the number of bits in the registers stored in them. Therefore, it is easy to be confident that the same rounding error will be generated in the network and mobile stations, and therefore the result of the calculation will be exactly the same on each side of the radio interface.

More precisely, the dynamics are defined as follows. That is: E is an integer from 1 to EMAX, -P is an integer from 0 to PMAX.

<maths num="2"><img file="JP4592811B2_D0003.tif" /></maths>

Therefore, the algorithm of the present invention is characterized by three integer constants EMAX, PMAX and PBASE.

In the following, the constant LBASE of the fourth integer, which is related to the accuracy of the calculation, is used.

The same codes EMAX, PMAX, PBASE and LBASE are used for uplinks, i.e. mobile station-to-network links, and downlinks, i.e. network-to-mobile station links, but not necessarily when the corresponding constants are both. Note that they do not have the same value.

Also, in the following, the same symbols X and Y are used with different meanings in the case of uplink and downlink.

In addition, for each link, a Q-signed mapping that gives a quality of service QoS value for any indicator of the block shall be specified for both uplink and downlink.

In the downlink, X₁, X₂, ..., X_kShows a list of possible pre-rate matching sizes for any block of quality of service (QoS), which is shown for all possible values of quality of service (QoS).

More precisely, if the quality of service QoS takes a value from 1 to p, X_{k (0) + 1}, ..., X_{k (1)}Is all possible block sizes for QoS 1 X_{k (1) +1}, ..., X_{k (2)}Is all possible block sizes for QoS 2 ... X_{k (p-1) +1}, ..., X_{k (p)}Is all possible block sizes for QoS p, Here, it is assumed that k (0) = 0, k (p) = k, and k (0) &lt;k (1) &lt;... &lt;k (p).

Furthermore, consider the mapping Q from the block size index set {1, ..., k} for each service quality QoS to the service quality index set {1, ..., p}. Therefore, the following equation is obtained.

<maths num="3"><img file="JP4592811B2_D0004.tif" /></maths>

From the above definition, if the quality of service is not the same (Q (i) Q (j)), the same block size is applied twice (X)._i= X_jHowever, note that it is possible to have i j).

For uplinks, the blocks whose rates should be matched for any multiplexed frame are numbered 1, 2, ..., k, and their respective sizes are X.₁, X₂, ..., X_kWill be.

Therefore, the list (X)₁, X₂, ..., X_k) Changes for each multiplexing frame. The number k of the elements is not always constant.

Q is the mapping from {1, ..., k} to {1, ..., p}, which is related to the block's indicator i for the relevant multiplexing frame and of its service. The quality is Q (i).

With this specification, the same block size is applied twice (X) regardless of whether the quality of service is the same or not (Q (i) = Q (j) or Q (i) Q (j))._i= X_jHowever, it is possible to have i j).

In fact, for two blocks of similar quality of service to have the same size, it is sufficient for the channel encoder to output a set of coded blocks with at least two elements of the same size.

In summary, for downlinks, 1, 2, ..., k are indicators of all possible sizes of blocks whose rates should be matched, but in this case they correspond to different quality of service. The block size to be used is counted separately. For uplinks, 1, 2, ..., k are indicators of a list of blocks whose rates should be matched for any multiplexed frame.

Y₁, ..., Y_kIs X after rate matching₁, ..., X_kIt is the size of the block corresponding to each.

For the downlink, Figure 3 shows the value E related to the quality of service q._qAnd P_qFrom pair (X_i, Y_iOne algorithm for determining the set of) and the same processing chain (Q)_{d (i)}), And while negotiating the matching of the ratio of 1-bit average energy (Eb / I) to the average energy of interference (Eb / I), a pair of parameters {E_q, P_q} Is illustrated for one entity that receives. This entity may be a sender entity (including at least one base station) for the transport channel composite, or a receiver entity (including at least one mobile station) for this composite of transport channels. This depends on the entity that determines the outcome of the negotiation at this time. In most cases, it is the receiving entity for the group of transport channels that determines, and it is the transmitting entity that implements the method of configuration of the present invention.

For each service quality q in {1, ..., p}, i.e. for each processing chain, the two characteristic integers E defined above._qAnd P_qSuppose that exists. These are received in steps 300A and 300B performed by the already constructed transport channel. Furthermore, in step 300C, the value X_iIs available. X_iIs predetermined or negotiated for the quality of service q.

The first step 302 of this algorithm is the integer parameter L specified by Eq. (1) below for each q from 1 to p._qIs the step to calculate.

<maths num="4"><img file="JP4592811B2_D0005.tif" /></maths>

In general, any rounding operation can be applied in any step in which a rounding operation should be performed to determine a parameter. In addition, the two steps for determining the parameters can use two different, independent rounding operations.

<maths num="5"><img file="JP4592811B2_D0006.tif" /></maths>

The constitutional method of the present invention has the following advantages. That is, especially in the context of the addition and / or removal of at least one group of transport channels exhibiting the same quality of service within the current complex of transport channels, or for any quality of service. In the context of changing the ratio of 1-bit average energy to the average energy of interference (Eb / I), a pair of parameters for all of the quality of service used {E_q, P_qA pair of parameters related to the group of transport channels affected by the addition and / or modification of the desired ratio (Eb / I) rather than the set of} parameters {E_q, P_qHas the advantage that only} needs to be retransmitted.

The previous part of the algorithm also applies to uplinks. However, the end of the algorithm is downlink specific.

After completing step 306, X_i Y_iThe relationship is defined in step 308 by the following equation (5).

<maths num="6"><img file="JP4592811B2_D0007.tif" /></maths>

X_iAnd the corresponding Y_iBy knowing each value of, the size pair (X) in step 310_i, Y_i) Pairs are constructed.

In summary, in downlink, the algorithm essentially involves four steps:

<maths num="7"><img file="JP4592811B2_D0008.tif" /></maths>

For the uplink, Figure 4 shows the value E related to the quality of service q._qAnd P_qFrom pair (X_i, Y_iThe algorithm for determining the set of) negotiates the equilibrium of the ratio of 1-bit average energy (Eb / I) to the average energy of interference, while pairing the parameters {E._q, P_qAn example is given for one entity and the same processing chain (Qm (i)) that receives a set of}. This entity may be the sending entity (including at least one base station) for the transport channel composite, or for this transport channel composite, depending on the entity that determines the outcome of the current negotiations. It may be a receiving entity (including at least one mobile station). In most cases, it is the receiving entity for the complex of transport channels that makes the decision, and it is the transmitting entity that implements the method of configuration of the present invention.

For uplinks, the rate matching ratio is calculated for each multiplexed frame. Therefore, this is X_i Y_iIt's not a matter of determining the mapping of, but rather (X₁, X₂, ..., X_k) (Y₁, Y₂, ..., Y_k) Is a mapping problem. In fact, Y_iFrom Y_kThe sum up to must be equal to the maximum payload of the multiplexed frame.

In addition, the (potential) maximum payload of a multiplexed frame depends on the physical resources used (all sizes of blocks transmitted X)._iFrom X_kIt can vary from frame to frame as a function of the amount of data to be transmitted (corresponding to the amount of input data for). So for a multiplexed frame, for example N₁ ... N_rThe maximum possible payload set {N₁, ..., N_r} Can be specified. More generally, N₁, N₂From N_rDegrees 1, 2, ..., r of the indicators of various maximum payloads {N₁, N₂, ..., N_r} Corresponds to the preference order of physical resources that enables transmission.

Therefore, one of the results of the algorithm for determining rate matching is from {1, 2, ..., r} to the maximum payload N._JSELSelect the set of physical resources identified by JSEL that enables the transmission of, and ensure the following equation (6).

<maths num="8"><img file="JP4592811B2_D0009.tif" /></maths>

Two consecutive phases are realized for this purpose. In the first phase, the block size Y'_iIs determined "statically" as in the case of downlink. The steps in this phase are represented by the same reference numbers as in Figure 3, plus 100, respectively. Therefore, this is X_i Y'_iMapping of.

In the second phase, N_JSELAnd Y'_iY corresponding to the value of_iThe value of is determined "dynamically" to satisfy equation (1). Therefore, this is (Y'₁, Y'₂, ..., Y'_k) (Y₁, Y₂, ..., Y_k) Mapping.

The first phase, which includes steps 400-408, is simply the equation: Y'_i= S_{Q (i)} X_iSpecified by.

Next, JSEL is defined by the following equation (7) in step 410.

<maths num="9"><img file="JP4592811B2_D0010.tif" /></maths>

In other words, if N₁ N₂... N_rIn the case of, the smallest and largest payload that allows transmission is selected.

Then, in step 412, the integer Z corresponding to the value of the final size aggregate is:₀, Z₁, ..., Z_kIs stipulated.

<maths num="10"><img file="JP4592811B2_D0011.tif" /></maths>

Finally, in step 414 Y_iBut, Y_i= Z_i-Z_i-1It is easily calculated by.

Thus, the final size (Y_iIt will be understood that the rounding errors in the calculation of) are not aggregated. Therefore, regardless of the number of blocks of data k, only the following two rounding operations are performed: Z_iThe first rounding operation on the size value of the aggregate marked with, and Z_i-1A second rounding operation on the size value of the destination aggregate marked with.

Required pair (X_i, Y_i) Is finally obtained in step 416. In summary, in the uplink, the algorithm substantially involves the following seven steps:

<maths num="11"><img file="JP4592811B2_D0012.tif" /></maths>

Finally, in the present specification, the concept of quality of service is defined as the quality of service of the transport channel, that is, the quality of service provided by levels 1 and higher. It should be understood that it would be more accurate to describe the quality of service provided to the channel encoder by the bottom of the interleaving and multiplexing chain, given that it is in determining rate matching.

The embodiments described above are not intended to limit the scope of the invention and therefore it is possible (in any case) to make various modifications to it without departing from the concept. In particular, the parameter pair {E_q, P_qIt should be understood that the step of determining} can be done not only for each quality of service, but also for each class of bits encoded for one and the same quality of service. In fact, it is recalled that some channel coding (especially turbo coding, etc.) gives different classes of coding bits that are somewhat puncture sensitive.

100 transport channels, 103A, 103B processing chain, 110 channel coding, 112 rate matching, 116 first interleaver, 128 second interleaver, 132 physical channel mapping, 302 integer parameter L_qSteps to calculate, 304 parameters LMAX, 306 integers Sq, 308 relations X_i Y_iSteps to specify, 310 size pairs (X)_i, Y_i) Steps to build a tuple.