CN1826743B - Method for determining useable combinations of variables for transmitting a subpacket of an encoder packet - Google Patents

Abstract

A method of determining useable combinations of variables for transmitting a subpacket of an encoder packet in a communication system is disclosed. First, an arbitrary combination from a plurality ofall combinations of transmission variables is selected based on a number of currently useable Walsh codes and channel environment. Next, an arbitrary modulation order product code rate (MPR) is determined based on a number of useable encoder packet bits, a number of useable slots, and the number of currently useable Walsh codes, all of which belong to the selected arbitrary combination transmission variables. Thereafter, a final MPR, which is the smallest one of MPR values of a MPR set that corresponds to the number of useable encoder packet bits and the number of useable slots, is determined,and a final number of Walsh codes is calculated based on the number of useable encoder packet bits, the number of useable slots, and the determined final MPR. Finally, one or more useable combinations of variables are determined based on the final number of Walsh codes.

Description

Method for determining available variable combinations for transmitting sub-packets of a coded packet

Technical Field

The present invention relates to a method of transmitting data in a communication system, and more particularly, to a method of determining available variable combinations for transmitting subpackets of an encoder packet in a communication system.

Background

The set of variables used for packet transmission in known CDMA mobile communication systems is:

k, an index representing a sub-packet of the encoded packet;

N_EPindicating the number of data bits contained in the encoded packet;

N_Walsh，kindicating the number of currently available walsh codes used to transmit the k-th subpacket;

m_kindicating a modulation order number of the kth sub-packet;

c_kindicating a code rate of the kth sub-packet;

N_slot，kindicating the number of available slots for transmitting the kth sub-packet; and

MPR_kthe modulation order product code rate (modulation order code rate) of the k-th sub-packet is shown.

In general, an encoded packet refers to a transmission unit composed of input bits of an error correction code during packet transmission, and the number of input bits is N_EP。

The encoded packet contains one or more sub-packets.

In the case where the encoded packet contains one or more subpackets, the first subpacket is always transmitted, and the next subpacket is transmitted only when a subpacket transmission request is issued by the receiving receiver without receiving the first subpacket. The subpackets of an encoded packet for transmission to a receiver are distinguished by their subpacket index k, and may have different c_k、N_slot，k、MPR_kThe value is obtained.

M for representing modulation order number of k-th sub-packet_kQPSK, 8-PSK, 16-QAM, and 32-QAM, 64-QAM are denoted by 2, 3, 4, 5, and 6, respectively. A slot represents a transmission unit of fixed duration, which is assumed to be 1.25 milliseconds in the following sections.

In addition, it is assumed that the above walsh code is composed of r identical chips, and the transmission rate of the chip is yHz, MPR_kCan be defined by the following equation.

<math><mrow><msub><mi>MPP</mi><mi>k</mi></msub><mo>=</mo><mfrac><msub><mi>N</mi><mi>EP</mi></msub><mrow><mrow><mo>(</mo><mi>y</mi><mo>&CenterDot;</mo><mn>1.25</mn><mo>&CenterDot;</mo><msup><mn>10</mn><mrow><mo>-</mo><mn>3</mn></mrow></msup><mo>/</mo><mi>r</mi><mo>)</mo></mrow><mo>&CenterDot;</mo><msub><mi>N</mi><mrow><mi>Walsh</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>&CenterDot;</mo><msub><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow></msub></mrow></mfrac></mrow></math> Equation 1

Alternatively, MPR_kAnd may also be defined by the following equation.

MPR_k＝m·c_kEquation 2

If y is 1,228,800Hz and r is 32 (chips), equation 1 can be simplified to equation 3 (hereinafter, it is assumed that y is 1,228,800Hz and r is 32, however, in the present invention, y and r are not limited to specific values).

<math><mrow><msub><mi>MPP</mi><mi>k</mi></msub><mo>=</mo><mfrac><msub><mi>N</mi><mi>EP</mi></msub><mrow><mn>48</mn><mo>&CenterDot;</mo><msub><mi>N</mi><mrow><mi>Walsh</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>&CenterDot;</mo><msub><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow></msub></mrow></mfrac></mrow></math> Equation 3

When transmitting sub-packets, the transmitter follows the value N_Walsh，k、N_slot，k、m_kAnd N_EPApply exceptions to some of the unsuitable combinations that the combinations contain, and therefore these combinations are excluded under the specified rules.

Equation 4

Equation 5

Fig. 2, 3 and 4 are examples showing variable combinations satisfying equations 4 and 5. MPR illustrated in the figures and examples_kThe values of (a) are approximate values, and the exact values thereof should be used in actual calculations. First, FIG. 2 shows that when N _EP3864 and N_slot，kWhen 4, the sender may use a possible combination of transmission variables in the packet transmission. Similarly, FIGS. 3 and 4 show the equation when N_EP＝3864，N _slot，k2 and N_EP＝3864，N_slot，kWhen 1, each of the possible variationsThe amount is combined.

Hereinafter, when a sub-packet is transmitted, ALL transmission variable combinations available to the sender will be denoted as "transmission _ method _ combination _ ALL". That is, the combination of transmission variables appearing in fig. 2, 3, and 4 shows some elements in "transmission _ method _ combination _ ALL".

In the prior art described above, since the variable N_Walsh，k、N_slot，k，、m_kAnd N_EPDifferent values can be taken and thus the number of transmission variable combinations is infinite. In this case, the following problems arise. First, the transmitting and receiving sides (e.g., base station and mobile station) must have memories to store ALL the variable combinations (i.e., "transmission _ method _ combination ALL"), which leads to a problem of unnecessary memory usage, i.e., the memories also store those variable combinations that have never been used, thus resulting in a huge waste of memory.

It is an object of the present invention to provide a method for determining a variable combination available for transmitting a sub-packet of an encoded packet in a communication system to improve packet transmission efficiency of a transmitting and receiving side.

It is another object of the present invention to provide a method of selecting a combination of available variables from the combinations of all transmission variables for transmitting a sub-packet of an encoded packet in a communication system.

In a first aspect of the present invention, a method of transmitting at least one subpacket of an encoder packet in a communication system, the method comprises: setting a plurality of transmission variable combinations for transmitting the sub-packets of the encoded packet; defining a plurality of predetermined modulation order product code rates (MPRs), each predetermined MPR corresponding to each combination of number of available coded packet bits and number of available slots; selecting an arbitrary transmission variable combination from a plurality of combinations of transmission variables according to the number of currently available walsh codes; determining an arbitrary MPR according to the number of available coded packet bits, the number of available slots, and the number of currently available walsh codes, wherein the arbitrary MPR corresponds to the selected arbitrary transmission variable combination; selecting one of a plurality of predetermined MPRs as a final MPR, which corresponds to the number of available coded packet bits and the number of available slots, the one of the plurality of predetermined MPRs being greater than or equal to the arbitrary MPR and having a smallest difference; calculating the final number of Walsh codes according to the number of available code packet bits, the number of available time slots and the selected final MPR; determining an available transmission variable combination from a plurality of transmission variable combinations based on the number of available code bin bits set, the number of available slots set, and the final number of walsh codes; and transmitting the sub-packet of the encoded packet using one of the determined transmission variable combinations.

In addition, the method according to the first aspect of the present invention may further comprise the step of assigning an index to each available transmission variable combination; storing the transmission variable combination assigned with the index in a memory; selecting one of the transmission variable combinations; and transmitting the final index corresponding to the selected combination to the receiving side through the physical channel.

In a second aspect of the invention, a method of determining a combination of available variables comprises the steps of: setting a plurality of all transmission variable combinations for transmitting the sub-packets of the encoded packet; defining a plurality of predetermined sets of modulation order product code rates (MPRs), each MPR predetermined set corresponding to a combination of each set of available coded packet bit numbers and a set of available slot numbers; and selecting any combination of transmission variables from the plurality of all combinations according to the number of currently available walsh codes and a channel environment.

The method further comprises the steps of: determining any MPR according to the number of available code packet bits, the number of available time slots and the number of currently available Walsh codes belonging to any selected transmission variable combination; if any MPR is smaller than the MPR threshold value, selecting one of the MPR preset sets corresponding to the number of the available code packet bits and the number of the available time slots, and selecting the selected one with the minimum MPR value in the MPR set larger than or equal to the any MPR as a final MPR; if any MPR is larger than or equal to the MPR threshold value, determining the any MPR as a final MPR; calculating the number of the final Walsh codes according to the number of the available code packet bits, the number of the available time slots and the determined final MPR; and determining an available transmission variable combination from the plurality of all transmission variable combinations according to the set of the number of available code packet bits, the set of the number of available slots, and the final number of Walsh codes.

In addition, the method according to the second aspect of the present invention may further comprise the steps of: assigning an index to each available combination of transmission variables; storing the available transmission variable combinations assigned with the indexes in a memory; selecting one of the available combinations of transmission variables; and transmitting the final index corresponding to the selected available combination to the receiving side through the physical channel.

Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to provide further explanation of the invention as claimed.

Disclosure of Invention

Reference will now be made in detail to the preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

First, to improve the efficiency of packet senders and receivers, N_EP，N_Walsh，kAnd N is_slot，kDefined by the following equation.

<math><mrow><msub><mi>N</mi><mi>EP</mi></msub><mo>&Element;</mo><mo>{</mo><msubsup><mi>N</mi><mi>EP</mi><mn>1</mn></msubsup><mo>,</mo><msubsup><mi>N</mi><mi>EP</mi><mn>2</mn></msubsup><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><msubsup><mi>N</mi><mi>EP</mi><mi>d</mi></msubsup><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><msubsup><mi>N</mi><mi>EP</mi><mi>D</mi></msubsup><mo>}</mo></mrow></math> Equation 6

<math><mrow><mn>0</mn><mo>&lt;</mo><msub><mi>N</mi><mrow><mi>Walsh</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>&le;</mo><msubsup><mi>N</mi><mrow><mi>Walsh</mi><mo>,</mo><mi>k</mi></mrow><mi>max</mi></msubsup></mrow></math> Equation 7

<math><mrow><msub><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>&Element;</mo><mo>{</mo><msubsup><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow><mn>1</mn></msubsup><mo>,</mo><msubsup><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow><mn>2</mn></msubsup><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><msubsup><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow><mi>g</mi></msubsup><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><msubsup><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow><mi>G</mi></msubsup><mo>}</mo></mrow></math> Equation 8

That is, N_EPIs of { N_EP ¹，N_EP ²，...N_EP ^d，...N_EP ^DAny one of D natural numbers of the set, and N_Walsh，kIs any one of values greater than zero and equal to or less than N_Walsh，k ^maxIs a natural number of (1). In addition, N_slot，kIs a value of Any one of G natural numbers G of the set.

If the number of currently available Walsh codes is N_Walsh，kAnd MPR_k，d，gRepresentation of belonging to

MPR of transmission variable combinations of_kValue, then MPR_k，d，gCan be defined as an equation derived from equation 3 as follows.

<math><mrow><msub><mi>MPP</mi><mrow><mi>k</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>g</mi></mrow></msub><mo>=</mo><mfrac><msubsup><mi>N</mi><mi>EP</mi><mi>d</mi></msubsup><mrow><mn>48</mn><mo>&CenterDot;</mo><msub><mi>N</mi><mrow><mi>Walsh</mi><mo>,</mo><mi>k</mi></mrow></msub><mo>&CenterDot;</mo><msubsup><mi>N</mi><mrow><mi>slot</mi><mo>,</mo><mi>k</mi></mrow><mi>g</mi></msubsup></mrow></mfrac></mrow></math> Equation 9

Thus, a new variable N 'representing the number of Walsh codes required to transmit the kth sub-code of the code packet'_Walsh，kAnd may be defined by any of the following equations.

Equation 10

Equation 11

Wherein,

represents the smallest integer value greater than or equal to a, and max (B, C) represents a value greater than or equal to the other of B and C. In addition, N in equation 11_{Walsh，k，d，g} ^minThe representation corresponds to

N of transmission variable combinations_Walsh，kThe minimum of the values. And MPR 'shown in equation 10'_k，d，gIs determined by the following definition 1 or 2.

[ definition 1]

MPR’_k，d，gThe expression is shown in equation 12, greater than or equal to MPR_k，d，gSet S of_d，gIs the minimum value of the element(s).

[ definition 2]

If it isThen MPR'_k，d，gMeans greater than or equal to MPR_k，d，gSet S of_d，gIs the minimum value of the element(s).

(2) If it isThen

In definition 2, MPR_k，d，g ^LimitThe expression represents a prescribed real number for selecting a specific transmission variable combination belonging to "transmission _ method _ combination _ ALL" in the present invention.

At the same time, set S appearing in the above definition_d，gDefined by equation 12 below.

$S_{d,g}=\{f_{d,\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">g</figure-callout>}}^1,f_{d,\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">g</figure-callout>}}^2,...f_{d,g}^h,...,f_{d,g}^{H_{d,g}}\}.$ Equation 12

In equation 12, set S_d，gThe number of elements is H_d，gAnd their values are defined by the following equation 13.

$f_{d,\mathrm{<figure-callout\; id="1"\; label="g"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">g</figure-callout>}}^1<f_{d,\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">g</figure-callout>}}^2<...<f_{d,g}^h<...<f_{d,g}^{H_{d,\mathrm{<figure-callout\; id="13"\; label="g\; Equation"\; filenames="H03809861XE00021.png,H03809861XE00051.png"\; state="\{\{state\}\}">g</figure-callout>}}}$ Equation 13

S_d，gOn a per N basis_EP ^dAnd N_slot，k ^gIs defined as a combination of N_EP ^dAnd N_slot，k ^gS in all or some combinations_d，gThe elements may be identical.

According to the above equation, only those using N 'are selected from the combination of all transmission variables'_Walsh，kA Walsh code, and corresponding toIn (1). Here, it is important that the available variable combinations selected by using the equations set forth in the present invention are only a partial set of "transmission _ method _ combination _ ALL". Hereinafter, those available transmission variable combinations selected by the above equations will be denoted as "transmission _ method _ combination _ PART".

In light of the above explanation, fig. 1 illustrates a method for selecting an available transmission variable combination for transmitting the kth sub-packet of an encoded packet. In this example, it is assumed that both the sender and receiver are already aware of each N_EP ^d、N_slot，k ^gCombining related S_d，gThe definition of (1). Also, when one of the available transmission variable combinations is selected, the transmitting side transmits the sub-packet according to the selected transmission variable combination, and it must inform the receiving side of the selected variable combination.

In general, a sender informs a receiver of selected variables through a physical channel that mainly transmits control information, which is called a Packet Data Control Channel (PDCCH). in the present invention, variable selection information is not directly transmitted to the receiver through the PDCCH, but only indexes allocated to selected variable combinations are transmitted.

Meanwhile, in order to reduce the difficulty of the hardware implementation of the receiving side, "transmission _ method _ combination _ PART" in which the number of transmission symbols is greater than or equal to a predetermined value (hereinafter referred to as "Lmax") is removed. In this example, the final number of Walsh codes, N ', is calculated'_Walsh，kThe equation of (c) will be given by equation 14.

Equation 14

Wherein,represents the smallest integer value greater than or equal to a, and max (B, C) represents a value greater than or equal to the other of B and C. Similarly, m in equation 14_k，d，gIs shown as M of time_kThe value of (c).

DISCLOSURE OF THE INVENTION

Example 1

Example 1 will be described under the conditions of equations 15 to 18 below.

N_EPE {408, 792, 1560, 2328, 3096, 3864} equation 15

$N_{\mathrm{Walsh},k}^{\max }=28$ Equation 16

N_slot，kE {1, 2, 4} equation 17

S ═ equation 18 {0.1, 0.35, 0.6, 0.82, 1.02, 1.1, 1.3, 1.41, 1.5, 1.55, 1.7, 1.8, 1.9, 2, 2.1, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2}

In equation 15, assume that

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, assuming that G ═ 3,

S_d，gthe values of (a) are all the same, and in equation 18, the value is assumed to be S.

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

FIG. 5 is a chart showing possible combinations of transmission variables, "transmission _ method _ combination _ ALL", where N is_EP＝3864。

In the following, how the available transmission variable combinations are determined will be explained with reference to fig. 1.

As shown in fig. 5, according to the number N of currently available walsh codes_Walsh，kAnd the current channel environment, any combination of transmission variables is first selected from ALL available transmission variables "transmission _ method _ combination _ ALL". Assume the number N of currently available Walsh codes_Walsh，kIs 17. The selected combination is determined by FIG. 5, where

Here, the MPR calculated by equation 9_k，6，3Is 1.1838 (S12).

According to MPR_k，6，3The value of (1) is defined as well as S, MPR'_k，6，3Is calculated to be 1.3, which is greater than or equal to MPR_k，6，3The smallest of the S elements of value 1.1838. Then apply equation 10, N'_Walsh，kBecomes 16 (S14). Thus, it is indicated in FIG. 5 that the satisfaction is satisfied

And N'_Walsh，kFinal transmission variable combination of 16.

Example 2

The conditions of example 2 are equations 15 to 18 and equation 19 below.

${\mathrm{MPR}}_{k,\mathrm{6,2}}^{\mathrm{Limit}}=1.5$ Equation 19

Hereinafter, the determination of the transmission variable combination will be explained according to embodiment 2.

Based on the number N of currently available Walsh codes_Walsh，kAnd the current channel environment, any combination of transmission variables is first selected from ALL available transmission variables "transmission _ method _ combination _ ALL". Assume the number N of currently available Walsh codes_Walsh，kIs 26. The selected combination is determined by FIG. 5 such that

Here, the MPR calculated by equation 9_k，6，2Is 1.5481 (S12).

According to MPR_k，6，2Value of (2), definition 2 and S, MPR'_k，6，2Is calculated as 1.5481, and MPR_k，6，2Are equal (S13). Then apply equation 26, N'_Walsh，kBecomes 16 (S14). Thus, it is selected to satisfy

And N'_Walsh，kFinal transmission variable combination of 26.

Example 2 shows that when m_kAbove 3, the initially selected combination is the same as the final combination.

Example 3

The conditions of example 3 are equations 15 to 18 and equation 20 below.

${\mathrm{MPR}}_{k,\mathrm{6,2}}^{\mathrm{Limit}}=2$ Equation 20

Hereinafter, the determination of the transmission variable combination will be explained according to embodiment 3.

Based on the number N of currently available Walsh codes_Walsh，kAnd the current channel environment, any combination of transmission variables is first selected from ALL available transmission variables "transmission _ method _ combination _ ALL". Assume the number N of currently available Walsh codes_Walsh，kIs 14. The selected combination is determined by FIG. 5 such that

Here, the MPR calculated by equation 9_k，6，2Is 2.8750 (S12).

According to MPR_k，6，2Value of (2), definition 2 and S, MPR'_k，6，2Is calculated as 2.8750, and MPR_k，6，2Are equal (S13). Then apply equation 10, N'_Walsh，kBecomes 14 (S14). Thus, it is selected to satisfy And N'_Walsh，kThe final transmission variable combination of 14.

Example 3 shows that when m_kAbove 4, the initially selected combination is the same as the final combination.

Example 4

Example 4 will be described under the conditions of equations 15 to 17 and the following equations.

S_1.1＝{0.1，0.35，0.6，0.82，1.02，1.18，1.3，1.41，1.5，1.55，1.77，1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2} equation 21

In equation 15, assume that

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, assuming that G ═ 3,

S_d，gis all the same, in equation 21, the value is set to S_1.1。

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

In the following, how the available transmission variable combinations are determined will be explained with reference to fig. 1.

As shown in fig. 6, according to the number N of currently available walsh codes_Walsh，kAnd the current channel environment, any combination of transmission variables is first selected from ALL available transmission variables "transmission _ method _ combination _ ALL". Assume the number N of currently available Walsh codes_Walsh，kIs 23. The selected combination is determined by fig. 6, wherein,

here, the MPR calculated by equation 9_k，6，3Is 0.8750 (S12).

According to MPR_k，6，3The value of (1) is defined as well as S, MPR'_k，6，3Is calculated to be 1.02, which is greater than or equal to MPR_k，6，3The smallest of the S elements of value 0.8750. Then apply equation 10, N'_Walsh，kBecomes 20 (S14). Thus, it is indicated in FIG. 5 that the satisfaction is satisfied And N'_Walsh，kFinal transmission variable combination of 20.

Example 5

FIG. 7 is a graph showing the results of example 5. Fig. 7 shows the available transmission variable combinations "transmission _ method _ combination _ PART" and the index assigned to each available combination.

Here, the index is represented as a binary number, and the binary number must contain 6 bits when transmitted through the PDCCH.

Due to value MPR_k、m_k、c_kFrom N_EP、N_slot，k、N_Walsh，kIs calculated, and FIG. 7 shows the values according to N_EP，N_slot，k，N_Walsh，kThe value of (c) results in an element of the available combination "transmission _ method _ combination _ PART".

In fig. 7, there are three combinations of transmission variables corresponding to each index. After receiving the index through the PDCCH, the receiver selects one of the three transmission variable combinations which belongs to the received index according to the transmission duration of the PDCCH.

Taking CDMA 2000 release C as an example, corresponding to three different N_slot，kThere may be three different PDCCH transmission times. The receiving party determines N according to the length of the PDCCH transmission time_slot，k. Thereafter, the receiving side finally selects one N corresponding to the determination_slot，kThe transmission variable combination of (1). The term "save" in fig. 7 refers to a specific combination of transmission variables that may be added later.

Example 6

In example 6, equations 15 to 17 are also set as follows.

That is, equation 15 is N_EPE {408, 792, 1560, 2328, 3096, 3864}, and equation 6 is

Equation 17 is N_slot，k∈{1，2，4}。

Based on the foregoing assumptions, all S_d，gThe value can be expressed by the following equation.

S_1.1＝S_1.2＝S_1.3Equation 22 {0.35, 0.6, 0.82, 1.02, 1.18, 1.3, 1.41, 1.5, 1.55, 1.77, 1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2}

S_2.1＝S_2.2＝S_2.3(0.41, 0.61, 0.82, 1.02, 1.18, 1.3, 1.41, 1.5, 1.55, 1.77, 1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2) equation 23

S_3.1＝S_3.2＝S_3.3(0.41, 0.61, 0.82, 1.02, 1.18, 1.3, 1.41, 1.5, 1.55, 1.77, 1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2) equation 24

S_4.1＝S_4.2＝S_4.3Equation 25, {0.61, 0.82, 1.02, 1.18, 1.3, 1.41, 1.5, 1.55, 1.77, 1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2}

S_5.1＝S_5.2＝S_5.3Equation 26 {0.82, 1.02, 1.18, 1.3, 1.41, 1.5, 1.55, 1.77, 1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2}

S_6.1＝S_6.2＝S_6.3Equation 27 {1.02, 1.18, 1.3, 1.41, 1.5, 1.55, 1.77, 1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2}

In equation 15, let D be 6,

${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

in equation 17, let G be 3,

in addition, definition 1 and equation 10 are used to calculate the final number of Walsh codes N'_Walsh，k. Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

FIG. 8 is a graph showing the results according to example 6. The available transmission variable combination "transmission _ method _ combination _ PART" is selected as a partial set of all available transmission variable combinations by embodiment 6. An index "transmission method combination index" is assigned to each available transmission variable combination "transmission _ method _ combination _ PART".

Example 7

In example 7, equations 15 to 17 are also set as follows.

That is, equation 15 is

N_EP{408, 792, 1560, 2328, 3096, 3864} and

equation 16 is

Equation 17 is N_slot，k∈{1，2，4}。

Based on the above assumptions, S_1.1The value of (c) can be represented by the following equation.

S_1.10.41, 0.61, 0.82, 1.02, 1.18, 1.3, 1.41, 1.5, 1.55, 1.77, 1.9, 2.0, 2.21, 2.35, 2.5, 2.65, 2.8, 2.9, 3.0, 3.1, 3.2 equation 28

In equation 15, assume that

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, let

G＝3，

And assume all S_d，gValue equal to S_1.1. Definitions 1 and equation 14 are also used to calculate the final number of Walsh codes, N'_Walsh，k. Here, let L in equation 14_maxIs 7728.

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

FIG. 7 is a graph showing the results of example 5. The available transmission variable combination "transmission _ method _ combination _ PART" is selected as a partial set of all transmission variable combinations by example 7. An index "transmission method combination index" is assigned to each available transmission variable combination "transmission _ method _ combination _ PART".

Example 8

In example 8, equations 15 to 17 are also set as follows.

That is, equation 15 is N_EPE {408, 792, 1560, 2328, 3096, 3864} and

equation 16 is

Equation 17 is N_slot，k∈{1，2，4}。

S_1.1The value of (c) can be represented by the following equation.

S_1.10.607, 1.175, 1.5, 1.8, 2.43, 2.688, 3.2 equation 29

In equation 15, let

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, let G be 3,

suppose all S_d，gValue equal to S_1.1. Definitions 1 and equation 14 are also used to calculate the final number of Walsh codes, N'_Walsh，k。

Here, let L in equation 14_maxIs 7728.

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

FIG. 10 is a graph showing the results of example 8. The available transmission variable combination "transmission _ method _ combination _ PART" is selected as a partial set of all transmission variable combinations by example 8. An index "transmission method combination index" is assigned to each available transmission variable combination "transmission _ method _ combination _ PART".

Example 9

In example 9, equations 15 to 17 are also used.

That is, equation 15 is N_EPE {408, 792, 1560, 2328, 3096, 3864} and

equation 16 is

Equation 17 is N_slot，k∈{1，2，4}。

Based on the above assumptions, S_1.1The value of (c) can be represented by the following equation.

S_1.10.607, 1.175, 1.5, 1.8, 2.43, 2.688, 3.2 equation 30

In equation 15, assume that

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, let G be 3,

and assume all S_d，gValue equal to S_1.1. Definitions 1 and equation 14 are also used to calculate the final number of Walsh codes, N'_Walsh，k. Here, let L in equation 14_maxIs 7728.

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

FIG. 11 is a graph showing the results of example 9. The available transmission variable combination "transmission _ method _ combination _ PART" is selected as a partial set of all transmission variable combinations by example 9. An index "transmission method combination index" is assigned to each available transmission variable combination "transmission _ method _ combination _ PART".

Example 10

In example 10, equations 15 to 17 were used.

That is, equation 15 is N_EPE {408, 792, 1560, 2328, 3096, 3864} and equation 16 is Equation 17 is N_slot，k∈{1，2，4}。

S_1.1The value of (c) can be represented by the following equation.

S_1.10.607, 1.175, 1.5, 2.0, 2.684, 3.2 equation 31

In equation 15, assume that

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, let G be 3,

and assume all S_d，gValue equal to S_1.1. StatorSense 1 and equation 14 are also used to calculate the final number of Walsh codes, N'_Walsh，k. Here, let L in equation 14_maxIs 7728.

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

FIG. 12 is a graph showing the results of example 10. The available transmission variable combination "transmission _ method _ combination _ PART" is selected as a partial set of all transmission variable combinations by example 10. An index "transmission method combination index" is assigned to each available transmission variable combination "transmission _ method _ combination _ PART".

As shown in fig. 12, all three types of transmission variable combinations belonging to the index "transmission method combination index", for example, "11110" and "11111", are represented as "save". These indices "11110" and "11111" do not refer to a particular transmission variable combination and may be used for other purposes.

In the case of CDMA 2000 release C, for example, the Base Station (BS) needs to send a command to the mobile station to transition from the "control reserve state" to the "active state". The indices "11110" and "11111" may be used for this command.

That is, the base station may use one of the indexes "11110" and "11111" to achieve the above-described object. If the base station transmits one of the indexes "11110" and "11111" to the mobile station through the PDCCH, the mobile station may recognize the received index as a command to transition the "control reservation state" to the "active state" and operate according to a preset rule.

Example 11

In example 11, equations 15 to 17 are also used. That is, equation 15 is N_EP{408, 792, 1560, 2328, 3096, 3864} and equation 16 is

Equation 17 is N_slot，k∈{1，2，4}。

Based on the above assumptions, S_1.1The value of (c) can be represented by the following equation.

S_1.10.607, 1.175, 1.5, 2.0, 2.684, 3.2 equation 32

In equation 15, let

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, let G be 3,

and assume all S_d，gValue equal to S_1.1. Definitions 1 and equation 14 are also used to calculate the final number of Walsh codes, N'_Walsh，k. Here, let L in equation 14_maxHas a value of 11592.

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

FIG. 13 is a graph showing the results of example 11. The available transmission variable combination "transmission _ method _ combination _ PART" is selected as a partial set of all transmission variable combinations by example 11. An index "transmission method combination index" is assigned to each available transmission variable combination "transmission _ method _ combination _ PART".

Example 12

In example 12, equations 15 to 17 are also used. That is, equation 15 is N_EPE {408, 792, 1560, 2328, 3096, 3864} and equation 16 is

Equation 17 is N_slot，k∈{1，2，4}。

S_1.1The value of (c) can be represented by the following equation.

S_1.10.41, 0.79, 1.10, 1.32, 1.50, 1.75, 1, 95, 2.30, 2.58, 2.85, 3.10 equation 33

In equation 15, let

D＝6， ${\mathrm{<figure-callout\; id="1"\; label="N\; EP"\; filenames="H03809861XE00032.png,H03809861XE00051.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=408,$ ${\mathrm{<figure-callout\; id="2"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=792,$ ${\mathrm{<figure-callout\; id="3"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=1560,$ ${\mathrm{<figure-callout\; id="4"\; label="N\; EP"\; filenames="H03809861XE00021.png,H03809861XE00031.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=2328,$ ${\mathrm{<figure-callout\; id="5"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3096,$ ${\mathrm{<figure-callout\; id="6"\; label="N\; EP"\; filenames="H03809861XE00061.png,H03809861XE00091.png"\; state="\{\{state\}\}">N</figure-callout>}}_{\mathrm{EP}}^{}=3864.$

In equation 17, let G be 3,

and assume all S_d，gValue equal to S_1.1. Definitions 1 and equation 10 are also used to calculate the final number of Walsh codes, N'_Walsh，k。

Based on the above assumptions, ALL transmission variable combinations "transmission _ method _ combination _ ALL" satisfying equations 4 and 5 are determined.

Fig. 14A to 14D are graphs showing the results of example 12. The available transmission variable combination "transmission _ method _ combination _ PART" is selected as a partial set of all transmission variable combinations by the example 12. As shown in fig. 5, an index "transmission method combination index" is assigned to each available transmission variable combination "transmission _ method _ combination _ PART".

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the inventive concept thereof. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.

According to the present invention, since selection of subpackets for transmission variable combination design of an encoded packet makes it possible to use a limited number of transmission variable combinations without causing substantial degradation of the system, it makes it possible to make efficient use of a transmitting/receiving terminal. In addition, a transmitting/receiving terminal with reduced hardware complexity can be used.

Drawings

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention;

FIG. 1 is a flow chart illustrating a method for determining available variable combinations for transmitting sub-packets in accordance with the present invention;

FIG. 2 is a graph illustrating that when N is_EP＝3864，N_slot，kA possible combination of transmission variables when 4;

FIG. 3 is a graph illustrating that when N is_EP＝3864，N_slot，kA possible combination of transmission variables when 2;

FIG. 4 is a graph depicting the time when N is reached_EP＝3864，N_slot，kA possible combination of transmission variables when 1;

FIG. 5 is a graph depicting the time when N is reached_EP3864, a possible combination of transmission variables;

FIG. 6 is a diagram illustrating a process flow diagram

Possible combinations of time-transfer variables;

FIG. 7 is a diagram depicting "transmission _ method _ combination _ PART" obtained in example 5, and indexes assigned to combinations of variables;

FIG. 8 is a diagram depicting "transmission _ method _ combination _ PART" obtained in example 6, and indexes assigned to combinations of variables;

FIG. 9 is a diagram depicting "transmission _ method _ combination _ PART" obtained in example 7, and indexes assigned to combinations of variables;

FIG. 10 is a diagram depicting "transmission _ method _ combination _ PART" obtained in example 8, and indexes assigned to combinations of variables;

FIG. 11 is a diagram depicting "transmission _ method _ combination _ PART" obtained in example 9, and indexes assigned to combinations of variables;

FIG. 12 is a diagram depicting "transmission _ method _ combination _ PART" obtained in example 10, and indexes assigned to combinations of variables;

FIG. 13 is a diagram depicting "transmission _ method _ combination _ PART" obtained in example 11, and indexes assigned to combinations of variables;

FIGS. 14A to 14D are diagrams illustrating "transmission _ method _ combination _ PART" obtained in example 12, and;

fig. 15 is a diagram describing "transmission _ method _ combination _ PART" obtained in embodiment 12, and indexes assigned to variable combinations.

Claims (9)

1. A method of transmitting at least one subpacket of an encoder packet in a communication system, the method comprising:

setting a plurality of transmission variable combinations for transmitting the sub-packets of the encoded packet;

defining a plurality of predetermined modulation order product code rates (MPRs), each predetermined MPR corresponding to each combination of number of available coded packet bits and number of available slots;

selecting an arbitrary transmission variable combination from a plurality of combinations of transmission variables according to the number of currently available walsh codes;

determining an arbitrary MPR according to the number of available coded packet bits, the number of available slots, and the number of currently available walsh codes, wherein the arbitrary MPR corresponds to the selected arbitrary transmission variable combination;

selecting one of a plurality of predetermined MPRs as a final MPR, which corresponds to the number of available coded packet bits and the number of available slots, the one of the plurality of predetermined MPRs being greater than or equal to the arbitrary MPR and having a smallest difference;

calculating the final number of Walsh codes according to the number of available code packet bits, the number of available time slots and the selected final MPR;

determining an available transmission variable combination from a plurality of transmission variable combinations based on the number of available code bin bits set, the number of available slots set, and the final number of walsh codes; and

transmitting a sub-packet of the encoded packet using one of the determined transmission variable combinations.

2. The method of claim 1, further comprising:

assigning an index to each available combination of transmission variables;

storing the transmission variable combination assigned with the index in a memory;

selecting one of the transmission variable combinations; and

the final index corresponding to the selected combination is transmitted to the receiving side through the physical channel.

3. The method of claim 2, wherein the physical channel is a Packet Data Control Channel (PDCCH).

4. The method of claim 2, wherein the index assigned to each combination contains a total of six binary bits.

5. The method of claim 1, wherein at least two MPRs of the plurality of predetermined MPRs are equal to each other.

6. The method of claim 1, wherein each of the plurality of transmission variable combinations comprises a number of available walsh codes, a number of available time slots for transmitting a subpacket of a coded packet, a modulation order product code rate, a modulation order, and a code rate of a subpacket.

7. The method of claim 1, wherein a final number N 'of said Walsh codes'_Walsh，kIs obtained by the following formula,

wherein the subpacket is a k-th subpacket, MPR ', of the coded packet'_k，d，gRepresenting the final MPR, N_EP ^dAnd N_slot，k ^gRespectively representing the number of available code packet bits and the number of available slots belonging to a selected arbitrary combination of transmission variables, r representing the number of chips of the Walsh code, y representing the transmission rate per chip in Hz, and X representing the value represented by the formula X-y × 1.25 × 10³A value obtained by/r, andrepresents the smallest integer value greater than or equal to a.

8. The method of claim 1, wherein a final number N 'of said Walsh codes'_Walsh，kIs obtained by the following formula,

and

when in use

Deriving the number of available Walsh codes from a plurality of combinations of transmission variables greater than or equal to the derived minimum available Walsh code, wherein the subpacket is a k-th subpacket, MPR ', of the encoder packet'_k，d，gRepresenting the final MPR, N_EPIndicating the number of data bits, N, included in the code packet_slot，kIndicating the number of available slots, N, for transmitting the k-th sub-packet_EP ^dAnd N_slot，k ^gRespectively representing the number of available code packet bits and the number of available slots belonging to a selected arbitrary combination of transmission variables, r representing the number of chips of the Walsh code, y representing the transmission rate per chip in Hz, and X representing the value represented by the formula X-y × 1.25 × 10³A value obtained by/r, and

represents the smallest integer value greater than or equal to a.

9. The method of claim 1, wherein a final number N 'of said Walsh codes'_Walsh，kIs obtained by the following formula,

wherein the subpacket is a k-th subpacket, MPR ', of the coded packet'_k，d，gRepresenting the final MPR, N_EP ^dAnd N_slot，k ^gRespectively representing the number of available code packet bits and the number of available slots belonging to a selected arbitrary combination of transmission variables, r representing the number of chips of the Walsh code, y representing the transmission rate per chip in Hz, and X representing the value represented by the formula X-y × 1.25 × 10³A value obtained by/r, andrepresents the minimum integer value greater than or equal to A, min (A, B) represents A andb is less than or equal to the other, L_maxIndicating the limited number of transmission symbols and when the number of available code packet bits and the number of available time slots respectively belonging to a selected arbitrary combination of transmission variables are respectively N_EP ^dAnd N_slot，k ^gWhen m is_k，d，gIndicating the modulation order.

Images