CN1630380A - Transmission method of uplink signaling for uplink channel enhancement in high speed CDMA system - Google Patents

Abstract

In a 3.84Mcps high-rate time-division duplex communication system, a method for transmitting uplink signaling required for uplink channel enhancement by utilizing reserved bits in the high-speed shared information channel HS-SICH, comprising the steps of: for n-bit uplink signaling, Use (N, n) block codes to encode to generate an N-bit sequence; for the N-bit encoded sequence, a 72-bit sequence is generated after a 72-N-bit cyclic redundancy check; the generated 72-bit sequence After multiplexing with coded CQI and ACK/NACK bits in the following manner, the data bits carried in the HS-SICH are formed. The present invention makes full use of reserved resources in the existing system to realize new functions, which is simple to implement and has good backward compatibility; The coding method of the signaling adopts the coding method stipulated in the current specification as far as possible, so as to minimize the implementation complexity of coding at the UE side and decoding at the Node B side.

Description

Uplink Signaling Transmission Method for Uplink Channel Enhancement in High Rate Code Division Multiple Access System

technical field

The present invention relates to code division multiple access (abbreviated as CDMA) mobile communication system, specifically in 3.84Mcps high-speed time division duplex code division multiple access mobile communication system (abbreviated as HCR-TDD), the uplink signal used for uplink channel enhancement command transmission method.

Background technique

The 3rd Generation Partnership Project (abbreviated as 3GPP) is a technical standardization organization implementing the 3rd generation mobile communication system, wherein the 3rd generation mobile communication technology standard includes Frequency Division Duplex (FDD) and Time Division Duplex (TDD) modes. Since its establishment, 3GPP has announced in October 1999 the third-generation mobile communication system technical standards, which mainly include 3.84Mcps Frequency Division Duplex (FDD) and Time Division Duplex (HCR-TDD), referred to as Release 99; in 2000 In 2018, the technical standard of the third generation mobile communication system, which mainly includes frequency division duplex (FDD) of 3.84Mcps, time division duplex (HCR-TDD) and time division duplex (LCR-TDD) of 1.28Mcps, was announced, Release 4 for short. ; And in 2001, it announced the addition of High Speed Data Packet Access (HSDPA) to 3.84Mcps Frequency Division Duplex (FDD), Time Division Duplex (HCR-TDD) and 1.28Mcps Time Division Duplex (LCR-TDD) The technical standard of the third generation mobile communication system, referred to as Release 5. Currently, 3GPP is implementing 3.84Mcps frequency division duplex (FDD), time division duplex (HCR-TDD) and 1.28Mcps time division duplex (LCR-TDD) technology pre-research on the uplink enhancement of the third generation mobile communication system , and it is expected that in 2004, on the basis of the pre-research on the above-mentioned uplink enhancement technology, the technical standardization of uplink enhancement will be formally studied, and the resulting technical solution will be included in the future 3.84Mcps frequency division duplex ( FDD), time division duplex (HCR-TDD) and 1.28Mcps time division duplex (LCR-TDD) third-generation mobile communication system technical standards, referred to as Release 6.

Regardless of the uplink enhancement technology of 3.84Mcps frequency division duplex (FDD) and time division duplex (HCR-TDD) in the third generation mobile communication system, or the uplink enhancement technology of 1.28Mcps time division duplex (LCR-TDD) technology, its purpose is to pass the third generation mobile communication system composed of the above-mentioned 3.84Mcps frequency division duplex (FDD), time division duplex (HCR-TDD) and 1.28Mcps time division duplex (LCR-TDD) Effective management and planning of the uplink transmission resources of the wireless network to improve the uplink capacity of the above-mentioned system and the coverage of the wireless cells of the above-mentioned system, so as to be suitable for data services with strong transmission burst; in addition, by improving The performance of the uplink dedicated transmission channel, thereby improving the coverage and throughput of the cell, increasing the uplink transmission rate, and reducing the uplink delay.

3GPP's discussion on uplink channel enhancement first started with 3.84Mcps frequency division duplex (FDD). In June 2003, the 20th meeting of RAN agreed to start research on uplink channel enhancement of time division duplex (TDD) system. The main research projects include scheduling controlled by the base station (Node B), hybrid retransmission request (referred to as HARQ), etc., among which HARQ is a method that combines automatic retransmission of data packets and channel coding for data transmission. For the FDD mode, some new uplink signaling is required for uplink channel enhancement, which are scheduling-related, HARQ-related or may be required in the future. Although the uplink channel enhancement of TDD has just begun to be discussed, similar to FDD, in order to support Node B-controlled scheduling and HARQ, new uplink signaling is also required, which are scheduling-related, HARQ-related or may be required in the future of.

Regarding the scheduling method controlled by the base station (Node B), for the FDD mode, 3GPP TR25.896V0.4.2 contains two main methods: one is the rate scheduling method controlled by the base station (Node B) (that is, two threshold schemes) , and the other is the rate and time scheduling method controlled by the base station (Node B). They are also possible scheduling schemes for TDD patterns.

In order to support the rate scheduling method, two new messages are introduced: one is the uplink signaling called rate request (RR for short), which is used for UE to apply to Node B for raising or lowering its own rate threshold; the other is called rate response (RG for short) downlink signaling, which is used for Node B to tell the terminal (UE) whether to allow it to raise or lower its own rate threshold. The main idea of the rate scheduling method controlled by Node B is: during the initialization process of the transmission channel of each UE, the base station controller (RNC) allocates a transport format combination set (TFCS) to the UE, as shown in Table 1, and notifies the UE and The base station (Node B) that controls the UE, and the RNC also gives two thresholds respectively: one is the UE threshold, and the other is the Node B threshold. This TFCS includes a variety of transmission rates. During the communication process, the UE can freely choose a transmission rate that does not exceed the UE threshold, that is, TFC. If the UE needs to use a TFC higher than the UE threshold, the UE requests the Node B to increase the UE threshold through RR uplink signaling. The NodeB decides whether to allow the UE's threshold to be increased according to the current interference and other factors, and if allowed, the NodeB notifies the UE through the RG downlink signaling. Note that the UE threshold cannot exceed the Node B threshold during this process.

Table 1 shows a TFCS set including three Node B-controlled transport channels (TrCh). These three transport channels can be coded and multiplexed together to form a coded composite transport channel (CCTrCH for short). The CCTrCH may have 8 transport format combinations TFC. In the TFCS set, a validity parameter of RR/RG signaling is introduced. Assuming that the current threshold value of UE is TFC ₅ (that is, TFC with subscript 5 in the table, the total rate is 128k), if UE applies to Node B to increase its threshold value, that is, sends RR=1 signaling, Node B receives After this signaling, according to the interference of the current cell, etc., send the command of whether the RG allows the UE to upgrade. If the UE receives RG=1, the threshold value of the UE is changed from TFC ₅ to TFC ₃ instead of TFC ₄ , because TFC The parameter of RR/RG validity corresponding to ₄ is 0.

Table 1. TFCS set containing three transport channels Transport channel in CCTrCH NodeB-controlled TrCHs1, 2, 3 TFC TrCh1 TrCh2 TrCh3 NodeB controlled rate TFC Validity of RR/RG signaling 0 32k 128k 64k 224 1 1 0 128k 64k 192 1 2 32k 128k 32k 192 0 3 0 128k 32k 160 1 4 32k 64k 64k 160 0 5 0 64k 64k 128 1 6 32k 64k 32k 128 0 7 0 64k 32k 96 0

The time and rate scheduling method controlled by the base station (Node B), its main idea is: the Node B accurately controls the UE's transmission time and transmission data rate according to the information such as the data buffer status and transmission power margin sent by the UE , and control information such as the time interval for sending. The Node B can know the maximum transmit power of the UE according to the power margin of the UE. To support this solution, the required uplink signaling mainly includes data buffer status (4 bits) and transmit power headroom (4 bits).

For the FDD mode, Figure 1 shows a method of transmitting uplink signaling: data buffering and sending power headroom, that is, using an additional uplink physical channel, called an uplink scheduling control channel, to send the information required for uplink scheduling . This solution needs to occupy additional uplink spreading codewords, which is not a good solution for the HCR-TDD system with limited uplink spreading codewords.

HARQ is another major issue discussed in uplink channel enhancement. To support fast HARQ at the physical layer, the required uplink signaling mainly includes: new packet indication (NDI, 1 bit), HARQ logical channel number (HARQ Process ID, PID for short), rate matching version indication (IRversion), etc. Among them, the new packet indicator (NDI, 1 bit) is used for the UE to notify the Node B whether the received packet is a new packet, and the Node B can decide whether to empty the buffer (soft buffer) for soft combining according to the new packet indicator , for example, when NDI is 1, it means that the transmitted packet is a new packet, and Node B clears the corresponding soft buffer after receiving this information. The HARQ transmission adopts the N-stop mode, that is, the HARQ channel is divided into N logical channels, and the size of N is related to the transmission delay. The UE notifies the Node B of the logical channel number used by the current transmission time interval (TTI for short) through the HARQ logical channel number. In the HARQ protocol, in order to quickly adapt to channel changes, especially changes in the physical bits available for each TTI, the 3GPP specification specifies a variety of rate matching parameters, and the UE can select appropriate rate matching parameters according to the actual situation. Therefore, the UE needs to tell the Node B the rate matching parameters it adopts through the IR version, and the Node B performs rate matching according to the parameters.

To sum up, in the uplink channel enhancement, the required uplink signaling mainly includes: rate request RR related to scheduling, data buffering (4 bits) and transmission power headroom (4 bits), and new HARQ related Group indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process Number: 3 information bits), rate matching version indication (IR version: 3 information bits), etc.

In order to illustrate the method of the present invention, it is necessary to briefly describe the transmission method of the uplink signaling working in the FDD mode, and mainly propose the following four possible solutions:

1) Transmission on the high-speed dedicated physical control channel HS-DPCCH in a punching manner, that is, a number of bits on the HS-DPCCH are deleted to transmit possible uplink signaling.

2) Transmission on the dedicated physical control channel DPCCH by means of punching, that is, several bits on the DPCCH are punched out to transmit uplink signaling.

3) Treat uplink signaling as data, that is, introduce a new transport channel to carry signaling specifically, and use the transport format combination indicator (TFCI) to multiplex the new transport channel with other transport channels on the dedicated physical control channel DPDCH for transmission .

4) Redesign a new and independent physical channel to carry uplink signaling, that is, a separate spreading codeword is required to transmit uplink signaling.

For HCR-TDD, there is currently no scheme for transmitting enhanced uplink signaling. Therefore, it is necessary to design a new transmission method for uplink signaling applied in the HCR-TDD mode.

For the FDD mode, it is possible for the Enhanced Uplink Channel (EUCH) and the High Speed Data Shared Channel (HS-DSCH) to exist simultaneously; for the TDD mode, this is similar, that is, it is also possible for the HSDPA and EUSH to exist simultaneously.

The High Speed Shared Information Channel (HS-SICH for short) is an uplink physical channel, which mainly carries ACK/NACK signaling and channel quality indicator information (CQI) related to HS-DSCH. RMF) and 9-bit transport block size (RTBS for short) information.

According to 3GPP TS25.221v5.4.0 and previous versions, Fig. 2 shows the encoding method of HS-SICH in HCR-TDD. Step 201 of the figure uses (36,1) repetition codes to encode 1-bit ACK/NACK to generate a 36-bit coded ACK/NACK sequence; step 202 of the figure uses (32,1) The repetition code encodes the CQI (RTBS/RMF) of 10 bits to generate a coded CQI sequence of 32 bits; in step 203 of the figure, the coded CQI bits and ACK/NACK bits are multiplexed together in the following manner, Constitute the data bits d ₁ , d ₂ ...d _U carried in the HS-SICH, U represents the number of data bits carried in the HS-SICH:

d ₁ , d ₂ ... d ₃₂ = z ₁ , z ₂ ... z ₃₂

d ₃₂₊₁ , d ₃₂₊₂ ... d ₃₂₊₃₆ = c ₁ c ₂ ... c ₃₆

d ₃₂₊₃₇ , d ₃₂₊₃₈ ...d _U =0,0...0

Where z ₁ , z ₂ ... z ₃₂ represent coded CQI bits, and c ₁ ... c ₃₆ represent coded ACK/NACK bits. According to 3GPP TS25.221v5.5.0, the data format in the HS-SICH adopts the format specified in the time slot 90, that is, one HS-SICH can carry 236 data bits. Therefore, after carrying the 36-bit ACK/NACK sequence and the 32-bit CQI sequence, the HS-SICH still contains 168 reserved bits (zero-filled part).

In the document [R1-030345, Field Coding of HS-SICH for 3.84Mcps TDD] (3GPP TSG-RAN WG1#31, 18-21 February, 2003), it is proposed that the above-mentioned HS-SICH coding method cannot meet the performance requirements of CQI , so a new encoding method of HS-SICH is given. The HS-SICH encoding method in its simulation assumption is shown in Figure 3A, step 3101 of the figure, adopts (36,1) repetition code to encode 1-bit ACK/NACK, and generates 36-bit encoded ACK /NACK sequence; step 3102 of the figure, using (32,1) repetition code to encode the 10-bit CQI (RTBS/RMF), to generate a 32-bit coded CQI sequence; step 3103 of the figure, to The 32-bit coded CQI sequence is encoded by a (3,1) repetition code to generate a 96-bit CQI sequence; after the HS-SICH carries the above-mentioned 36-bit ACK/NACK sequence and 96-bit CQI sequence, Still contains 104 reserved bits.

The simulation results of the document [R1-030345] show that (3,1) repetition code is applied to the 32-bit coded CQI sequence, which can well meet the performance requirements of CQI, but because HS-SICH still retains 104 bits , so these reserved bits can be used to further enhance the reliability of any data field transmitted on the HS-SICH, for example, further enhance the reliability of CQI.

Based on the above reasons, the document [R1-030345] finally proposes to use (4,1) repetition code to encode the 32-bit coded CQI sequence, as shown in Figure 3B, step 3201 of the figure uses (36,1) The repetition code encodes 1-bit ACK/NACK to generate a 36-bit coded ACK/NACK sequence; Step 3202 of the figure uses (32,1) repetition code to perform 10-bit CQI (RTBS/RMF) Encoding, generating a 32-bit encoded CQI sequence; step 3203 of the figure, encoding the 32-bit encoded CQI sequence using (4,1) repetition codes to generate a 128-bit CQI sequence; After the HS-SICH carries the 36-bit ACK/NACK sequence and the 128-bit CQI sequence, it still contains 72 reserved bits. Although this document does not give the simulation results of this encoding method, we can know from the simulation results of the (3,1) repetition code that the CQI has an overprotected coding gain with this encoding method. At the 32nd meeting (2003.5) of RAN1, the above proposal was accepted, that is, the HS-SICH coding method shown in FIG. 3B was adopted in the new version of 3GPPTS 25.221v5.5.0.

In order to illustrate the method of the present invention, it is necessary to briefly describe the transmission method of the uplink signaling working in the FDD mode, and mainly propose the following four possible solutions:

1) Transmission on the HS-DPCCH channel in a punching manner, that is, a number of bits on the HS-DPCCH are deleted to transmit uplink signaling. This method is impossible for HCR-TDD mode, because there is no HS-DPCCH channel similar to FDD mode in HCR-TDD;

2) Transmission on the DPCCH channel in a punching manner, that is, a number of bits on the DPCCH are deleted to transmit uplink signaling. This method is also impossible for HCR-TDD mode, because there is also no DPCCH channel similar to FDD mode in HCR-TDD;

3) Treat uplink signaling as data, that is, introduce a new transmission channel to carry signaling specifically, and use some transmission combination (TFCI) to multiplex and transmit on the DPDCH together with the transmitted data. This approach is possible for HCR-TDD. But its disadvantage is that signaling can only be obtained after demultiplexing, that is, the transmission delay of signaling in this way is relatively large;

4) A new, independent physical channel is used to carry uplink signaling, that is, a separate spreading codeword is required to transmit uplink signaling; this method is also possible for HCR-TDD, but in HCR-TDD The uplink codeword is limited, and this method will increase the uplink interference (PAR), increase the transmission power headroom and implementation complexity of the terminal (UE).

Contents of the invention

The purpose of the present invention is to provide a method for transmitting uplink signaling for uplink channel enhancement in a 3.84McpsHCR-TDD system.

In order to achieve the above object, in a 3.84Mcps high-speed time-division duplex communication system, a method for transmitting the uplink signaling required for uplink channel enhancement by using the reserved bits in the high-speed shared information channel HS-SICH includes steps:

a) Encoding the n-bit uplink signaling by using (N, n) block codes to generate an N-bit sequence;

b) generating a 72-bit sequence after a 72-N bit cyclic redundancy check for the N-bit encoded sequence;

c) After the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner, the data bits d ₁ , d ₂ ... d _U carried in the HS-SICH are formed:

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

The present invention makes full use of reserved resources in the existing system to realize new functions, which is simple to implement and has good backward compatibility; The coding method of the signaling adopts the coding method stipulated in the current specification as far as possible, so as to minimize the implementation complexity of encoding at the UE end and decoding at the Node B end.

Description of drawings

FIG. 1 is a schematic diagram of an uplink scheduling information control channel;

Figure 2 is the encoding method of HS-SICH in the specification 25.222V5.4.0 and earlier versions;

Figure 3A is the HS-SICH encoding method given by the simulation assumption in the document R1-030345;

Figure 3B is the HS-SICH encoding method proposed in the document R1-030345 and adopted by the specification 3GPP TS25.221v5.5.0;

Figure 4 is a method for transmitting possible uplink signaling using reserved bits in the HS-SICH channel;

FIG. 4A is a method for transmitting uplink signaling related to HARQ by using reserved bits in the HS-SICH channel;

FIG. 4B is a method of using reserved bits in the HS-SICH channel to transmit uplink signaling supporting time and rate scheduling;

Figure 4C is a scheme for transmitting RR and HARQ-related uplink signaling using reserved bits in HS-SICH;

Figure 4D is another scheme for transmitting RR and HARQ-related uplink signaling using reserved bits in HS-SICH;

FIG. 4E is a method of using reserved bits in the HS-SICH channel to transmit uplink signaling supporting time and rate scheduling and uplink signaling related to HARQ;

FIG. 4F is another method of using reserved bits in the HS-SICH channel to transmit uplink signaling supporting time and rate scheduling and HARQ-related uplink signaling;

FIG. 5 is a method for transmitting possible uplink signaling by using punctured bits and reserved bits in the HS-SICH channel;

FIG. 5A is a method for transmitting uplink signaling related to HARQ by using punctured bits and reserved bits in the HS-SICH channel;

FIG. 5B is a method for transmitting uplink signaling supporting time and rate scheduling by using punctured bits and reserved bits in the HS-SICH channel;

FIG. 5C is a method for transmitting RR and uplink signaling related to HARQ by using punctured bits and reserved bits in HS-SICH;

Figure 5D is another method for transmitting RR and uplink signaling related to HARQ by using the punctured bits and reserved bits in the HS-SICH;

FIG. 5E is a method for transmitting uplink signaling supporting time and rate scheduling and HARQ-related uplink signaling by using punctured bits and reserved bits in the HS-SICH channel;

FIG. 5F is another method for transmitting uplink signaling supporting time and rate scheduling and HARQ-related uplink signaling using punctured bits and reserved bits in the HS-SICH channel;

FIG. 6 is an embodiment of a method for transmitting HARQ-related uplink signaling using 72 bits reserved in the HS-SICH channel;

FIG. 7 is an embodiment of a method for transmitting uplink signaling supporting time and rate scheduling by using 72 bits reserved in the HS-SICH channel;

FIG. 8 is an embodiment of a method for transmitting RR and HARQ-related uplink signaling using reserved bits in HS-SICH;

FIG. 9 is an embodiment of another method for transmitting RR and HARQ-related uplink signaling using reserved bits in HS-SICH;

FIG. 10 is an embodiment of a method for using reserved bits in the HS-SICH channel to transmit uplink signaling supporting time and rate scheduling and uplink signaling related to HARQ;

FIG. 11 is an embodiment of a method for transmitting HARQ-related uplink signaling using punctured bits and reserved bits in the HS-SICH channel;

FIG. 12 is an embodiment of a method for transmitting uplink signaling supporting time and rate scheduling by using punctured bits and reserved bits in the HS-SICH channel;

Figure 13 is an embodiment of RR supporting rate scheduling and HARQ-related uplink signaling using punctured bits and reserved bits in HS-SICH;

Figure 14 is an embodiment of another method for transmitting RR supporting rate scheduling and uplink signaling related to HARQ by using punctured bits and reserved bits in HS-SICH;

Fig. 15 is an embodiment of a method for transmitting uplink signaling supporting time and rate scheduling and HARQ-related uplink signaling by using punctured bits and reserved bits in the HS-SICH channel.

Detailed ways

According to the latest version of the specification 3GPP TS25.221v5.5.0, in the HCR-TDD system, 72 bits in the HS-SICH are still unused, so the present invention proposes that when the UE has the HS-SICH uplink channel, use the HS-SICH channel The reserved bits in are used to convey the scheme of uplink signaling required for uplink channel enhancement.

At present, the uplink channel enhancement of HCR-TDD has just started to be discussed, and the possible signaling and the performance requirements of the signaling have not been determined, so the 72 reserved bits may not meet the performance requirements of the possible signaling. From the analysis of 1.1, it can be seen that the CQI field in the HS-SICH has an over-protected coding gain, so the present invention also proposes to use a puncture method, that is, to delete some bits in the coded CQI sequence, and use these punctured bits to combine with the reserved Bits are used together to transmit the scheme of uplink signaling related to uplink channel enhancement.

The performance requirements of different signaling supporting uplink channel enhancement may be different, so the present invention designs various schemes of using HS-SICH to transmit part or all of the uplink signaling required for uplink channel enhancement.

In the HCR-TDD system, there are many remaining bits in the HS-SICH channel, for example, 72 reserved bits are not used. For the HCR-TDD system, high-speed downlink packet service (HSDPA) and uplink channel enhancement (EUSH) may exist simultaneously. Therefore, the present invention proposes that when the UE has the HS-SICH channel, the reserved bits in the HS-SICH channel can be used to transmit possible uplink signaling. At present, the uplink channel enhancement of TDD has just started to be discussed, and the possible signaling and the performance requirements of the signaling have not been determined, so the 72 reserved bits may not meet the performance requirements of the possible signaling. Therefore, the present invention provides another solution for transmitting possible uplink signaling by using punctured bits and 72 reserved bits together.

The present invention mainly introduces the transmission method of the uplink signaling, and briefly describes the transmission mode of the downlink signaling.

In the following description, coded CQI bits are represented by z ₁ , z ₂ ... z _nCQI , where n _CQI is the number of coded CQI bits; coded ACK/NACK is represented by c ₁ ... C ₃₆ Bits; use e ₁ , e ₂ ...e _NEL to represent encoded bits related to uplink signaling enhancement, where N _EL is the number of encoded bits related to uplink signaling enhancement; use d ₁ , d ₂ . ..d _U represents the data bits carried in the HS-SICH, where U represents the number of data bits carried in the HS-SICH.

Solution 1: Use the reserved 72 bits in the HS-SICH channel to transmit possible uplink signaling.

Referring to Fig. 4, in step 401 of the figure, for the possible n-bit uplink signaling, which may be related to scheduling, related to HARQ or other uplink signaling that may be discussed in the future, a certain encoding method is adopted, for example (N, n) block codes, which are encoded to generate N-bit encoded sequences;

In step 402 of the figure, the encoded sequence of N bits generates 72-bit sequences e ₁ , e ₂ ... e ₇₂ after a 72-N bit cyclic redundancy check (CRC for short);

In step 403, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ ... carried in the HS-SICH d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

Note that when N=72 bits, step 402 can be omitted.

According to the different signaling and performance requirements carried, the present invention provides six sub-solutions of Scheme 1 below:

Solution 1A: use reserved bits in HS-SICH to transmit uplink signaling related to HARQ;

Solution 1B: Utilize reserved bits in HS-SICH to transmit uplink signaling related to supporting time and rate scheduling;

Scheme 1C: using reserved bits in HS-SICH to transmit RR supporting rate scheduling and uplink signaling related to HARQ is a scheme; its characteristic is that the transmitted signaling adopts the same coding method.

Scheme 1D: Another scheme that supports rate-scheduled RR and HARQ-related uplink signaling using the reserved bits in HS-SICH transmission; it is characterized in that the transmitted RR signaling and HARQ-related uplink signaling adopt different encoding methods.

Solution 1E: Utilize the reserved bit transmission in HS-SICH to support uplink signaling related to time and rate scheduling: UE transmit power margin (power margin) and data buffer (data buffer), and uplink signaling related to HARQ. Its characteristic is that the same coding scheme is adopted for the transmitted signaling.

Solution 1F: Utilize the reserved bit transmission in HS-SICH to support uplink signaling related to time and rate scheduling: UE transmit power margin (power margin) and data buffer (data buffer), and other uplink signaling related to HARQ a scheme. It is characterized in that different coding schemes are adopted for the dispatched signaling related to scheduling and the signaling related to HARQ.

Referring to Figure 4A, the uplink signaling related to HARQ mainly includes: new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), a total of 7 information bits. The scheme of using reserved bits in HS-SICH to transmit HARQ-related uplink signaling is scheme 1A, and its specific steps include:

In step 4101 of the figure, the 7-bit uplink signaling related to HARQ is encoded with a (N, 7) block code to generate an N-bit sequence; wherein the (N, 7) block code can be a second-order Reed- The subcode of the Muller code, for example, the last three columns of the subcode of the (64, 10) second-order Reed-Muller code given in Section 4.4.2.1 of the 3GPP specification TS25.222 are removed, and the (64, 7) second-order A subcode of a Reed-Muller code.

In step 4102 of the figure, the sequence after the N-bit encoding is generated after a 72-N bit cyclic redundancy check (CRC for short), and a 72-bit sequence e ₁ , e ₂ ... e ₇₂ is generated;

In step 4103 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

Note that when N=72 bits, step 4102 can be omitted.

Referring to Figure 4B, using the reserved bits in the HS-SICH to transmit uplink signaling related to the time and rate scheduling mechanism, mainly includes the UE's transmission power margin (power margin) and data buffer (data buffer) scheme, that is, the scheme 1B, the specific steps include:

Step 4201 of said figure, adopt (N, 8) block codes to encode the transmission power margin (power margin) and data buffer (data buffer) of 8 bits, and generate the sequence of N bits;

In step 4202 of the figure, the N-bit coded sequence is generated through a 72-N bit cyclic redundancy check (CRC) to generate a 72-bit sequence e ₁ , e ₂ ... e ₇₂ ;

In step 4203 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

The (N, 8) block code in the above steps can be the subcode of the second-order Reed-Muller code, for example, the (64, 10) second-order Reed-Muller code given in Section 4.4.2.1 of the 3GPP specification TS25.222 The last two columns of the subcode are removed, and the subcode of the (64, 8) second-order Reed-Muller code is generated.

Note that when N=72 bits, step 4202 can be omitted.

Referring to Figure 4C, the scheme of RR supporting rate scheduling and HARQ-related uplink signaling using reserved bits in HS-SICH transmission, that is, Scheme 1C, its specific steps include:

In step 4301 of the figure, 1-bit RR and 7-bit uplink signaling related to HARQ are encoded with (N, 8) block codes to generate an N-bit sequence; wherein the uplink signaling related to HARQ is mainly Including new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits);

The 4302 step of described figure, with the sequence after described N bit encoding, generate 72 bit sequence after the cyclic redundancy check (abbreviation CRC) of 72-N bit;

In step 4303 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

The (N, 8) block code described in the above steps can be a subcode of the second-order Reed-Muller code, for example, the (64, 10) second-order Reed-Muller code given in Section 4.4.2.1 of the 3GPP specification TS25.222 The last two columns of the subcode of the code are removed, and the subcode of the (64, 8) second-order Reed-Muller code is generated.

Note that when N=72 bits, step 4302 can be omitted.

Referring to Fig. 4D, another scheme of RR supporting rate scheduling and HARQ-related uplink signaling using reserved bits in HS-SICH transmission, that is, scheme 1D, its specific steps include:

In step 4401 of the figure, 1-bit RR signaling is encoded using (M1, 1) repetition codes to generate M1-bit encoding information; the value of M1 is related to the performance requirements of RR signaling, and M1≤72 -7 bits.

Step 4402 of the figure, for 7-bit uplink signaling related to HARQ, mainly includes new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID) , the rate matching version indication (IR version: 3 information bits), using (M2, 7) block code for encoding to generate a sequence of M2 bits, where M2≤72-M1.

In 4403 of the above figure, the sequence of M1 and the sequence of M2 are concatenated to generate a bit sequence of length M1+M2, which is then generated after a 72-M1-M2 bit cyclic redundancy check (referred to as CRC). 72-bit sequence;

In 4404 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ ... carried in the HS-SICH d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

The (M2, 7) block code described in the above steps can be a subcode of the second-order Reed-Muller code, for example, the (64, 10) second-order Reed-Muller code given in Section 4.4.2.1 of the 3GPP specification TS25.222 The last three columns of the subcode of the code are removed, and the subcode of the (64, 7) second-order Reed-Muller code is generated.

Note that when M1+M2=72 bits, the cyclic redundancy check in step 4403 can be omitted.

Referring to Figure 4E, assuming that the uplink signaling related to HARQ and the uplink signaling related to supporting time and rate scheduling have the same performance requirements, the reserved bits in the HS-SICH are used to transmit the uplink signaling related to HARQ and the supporting time A scheme of uplink signaling related to rate scheduling (UE transmission power margin (power margin) and data buffer (data buffer)), that is, scheme 1E, its specific steps include:

In step 4501 of the figure, the 15-bit uplink signaling (including 8-bit scheduling signaling and 7-bit HARQ-related uplink signaling) is encoded using (N, 15) block codes to generate N-bit sequence;

The 4502 step of described figure, with the sequence after described N bit code, generate 72 bit sequence after the cyclic redundancy check (abbreviation CRC) of 72-N bit;

In step 4503 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

Note that when N=72 bits, step 4502 can be omitted.

Referring to Figure 4F, assuming that the uplink signaling related to HARQ and the uplink signaling related to supporting time and rate scheduling have different performance requirements, the reserved bits in the HS-SICH are used to transmit the uplink signaling related to HARQ and the supporting time Another scheme for uplink signaling related to rate scheduling (UE transmission power margin (power margin) and data buffer (data buffer)), that is, scheme 1F, its specific steps include:

Step 4601 of the figure, for the 7-bit HARQ-related uplink signaling, mainly includes a new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID) , the rate matching version indication (IR version: 3 information bits), using (M1, 7) block code for encoding, generating a sequence of M1 bits; where the value of M1 is related to the performance requirements of HARQ signaling, and M1≤72 -8 bits.

Step 4602 of the figure, the uplink signaling (power margin and data buffer of the UE) related to the 8-bit support time and rate scheduling is performed using (M2, 8) block codes Encode to generate a sequence of M2 bits, where M2≤72-M1.

In 4603 of the figure, the sequence of M1 and the sequence of M2 are concatenated to generate a bit sequence of length M1+M2, which is then generated after a 72-M1-M2 bit cyclic redundancy check (CRC for short). 72-bit sequence;

In 4604 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ ... carried in the HS-SICH d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

The (M1, 7) block code in the above steps can be a subcode of the second-order Reed-Muller code, for example, the (32, 10) second-order Reed-Muller given in Table 8 of section 4.3.1.1 in 3GPP specification TS25.222 The last three columns of the subcode of the code are removed, and the subcode of the (32, 7) second-order Reed-Muller code is generated.

The (M2, 8) block code in the above steps can also be the subcode of the second-order Reed-Muller code, for example, the (32, 10) second-order Reed-Muller code given in Table 8 of section 4.3.1.1 in 3GPP specification TS25.222 The last two columns of the subcode of the Muller code are removed, and the subcode of the (32, 8) second-order Reed-Muller code is generated.

Note that when M1+M2=72 bits, the cyclic redundancy check in step 4603 can be omitted.

At present, the uplink enhancement of TDD has just started to be discussed, and the performance requirements of each possible signaling have not been determined, so the 72 reserved bits may not meet the performance requirements of possible signaling. Therefore, we can use the puncturing method to delete some bit information in the HS-SICH channel, and use the obtained punctured bits (indicated by P) and 72 reserved bits together to transmit possible uplink signaling. Therefore, the present invention will describe the scheme of using punctured bits and 72 reserved bits together to transmit possible uplink signaling.

Scheme 2: Use the punctured bits in the HS-SICH channel and the reserved 72 bits to transmit possible uplink enhanced signaling.

We can remove the coded CQI part and ACK/NACK part in HS-SICH to obtain punctured bits. However, the use of puncturing, that is, deleting some bit information in the HS-SICH channel, may affect the performance of the data originally carried in the HS-SICH. It is known from Section 1.1 that CQI has over-protected coding gain, so a possible puncturing solution is: P bits out of the 128 coded CQI bits in the HS-SICH channel are dropped. This can ensure that the performance of the original information in the HS-SICH channel is not affected as much as possible, and available punctured bits can be obtained. In order not to affect the existing specifications, the present invention maintains the existing coding method of CQI, that is, first uses (32, 10) to generate 32-bit information, and then uses (4, 1) repetition code to perform 32 coded bit information Encoding to generate 128-bit encoded CQI information.

In each scheme described below, it is assumed that any consecutive P bits are deleted in the coded CQI bits, that is, there are P punctured bits and 72 reserved bits in each HS-SICH that can be used to carry uplink signaling. So N _EL =P+72.

Referring to Figure 5, the specific steps of the method for transmitting possible uplink enhanced signaling by using the P punctured bits in the HS-SICH channel and the reserved 72 bits are as follows:

Step 501 in the figure, for the possible n-bit uplink signaling, which may be related to scheduling, related to HARQ or other uplink signaling that may be discussed in the future, adopt a certain encoding method, for example (N, n ) block code is encoded to generate the N-bit coded sequence;

The 502 steps of described figure, to the sequence after described N bit code, generate P+72 bit sequence after the cyclic redundancy check (being called for short CRC) of P+72-N bit;

In step 503 of the figure, the generated P+72 bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ and d ₂ carried in the HS-SICH ... d _U :

$d_1,d_2...d_{{\mathrm{no}}_{\mathrm{CQI}}}=z_{1,}{z}_2...z_{{\mathrm{no}}_{\mathrm{CQI}}};$ d _i , d _i+1 ... d _i+P-1 = e ₁ , e ₂ ... e _P

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; P</span>}}<span\; class="notranslate">\; .</span>$

Wherein, i is the starting position of P punctured bits.

According to the different signaling and performance requirements carried, the present invention provides six sub-schemes derived from the second scheme proposed in the present invention:

Solution 2A: Use the punctured bits and reserved bits in the HS-SICH to transmit the uplink signaling related to HARQ;

Solution 2B: Use the punctured bits and reserved bits in the HS-SICH to transmit uplink signaling related to supporting time and rate scheduling;

Scheme 2C: A scheme that uses punctured bits and reserved bits in HS-SICH to transmit RR supporting rate scheduling and uplink signaling related to HARQ; its characteristic is that the same coding scheme is used for transmitted signaling.

Scheme 2D: Another scheme that uses punctured bits and reserved bits in HS-SICH to transmit RR supporting rate scheduling and uplink signaling related to HARQ; its characteristic is that the transmitted RR signaling and HARQ-related Uplink signaling adopts different coding schemes.

Solution 2E: Utilize the punctured bits and reserved bits in HS-SICH to support uplink signaling related to time and rate scheduling: UE transmit power margin and data buffer, and HARQ-related A scheme of uplink signaling. Its characteristic is that the same coding scheme is adopted for the transmitted signaling.

Solution 2F: Utilize the punctured bits and reserved bits in HS-SICH to support uplink signaling related to time and rate scheduling: UE transmit power margin and data buffer, and HARQ-related Another solution for uplink signaling. It is characterized in that different coding schemes are adopted for the dispatched signaling related to scheduling and the signaling related to HARQ.

Referring to Figure 5A, the uplink signaling related to HARQ mainly includes: New Packet Indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), a total of 7 information bits. The specific steps of Scheme 2A for transmitting HARQ-related uplink signaling using the punctured bits and reserved bits in the HS-SICH are as follows:

In step 5101 of the figure, the uplink signaling related to HARQ of 7 bits is encoded by (N, 7) block code to generate a sequence of N bits;

The 5102 step of described figure, with the sequence after described N bit encoding, generate P+72 bit sequence after the cyclic redundancy check (abbreviation CRC) of P+72-N bit;

In step 5103 of the figure, the generated P+72 bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ and d ₂ carried in the HS-SICH ... d _U :

$d_1,d_2...d_{{\mathrm{no}}_{\mathrm{CQI}}}=z_{1,}{z}_2...z_{{\mathrm{no}}_{\mathrm{CQI}}};$ d _i , d _i+1 ... d _i+P-1 = e ₁ , e ₂ ... e _P

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; P</span>}}<span\; class="notranslate">\; .</span>$

Wherein, i is the starting position of P punctured bits.

One way to generate the (N, 7) block code described in the above steps is to first use the subcode of the (32, 7) second-order Reed-Muller (Reed-Muller) code, and then use the repetition code for it . For example, the last three columns of the subcode of the (32, 10) second-order Reed-Muller code given in Table 8 in Section 4.3.1.1 of the 3GPP specification TS25.222 are removed, and the (32, 7) second-order Reed-Muller code is generated The subcode of (32*3,7)=(96,7) is then generated using a repetition code such as (3,1).

Another way to generate the (N, 7) block code described in the above steps is to first use the subcode of the (48, 7) second-order Reed-Muller code, and then use the repetition code for it. For example, the last three columns of the subcode of the (48, 10) second-order Reed-Muller code given in Table 11 in Section 4.4.2.1 of the 3GPP specification TS25.222 are removed, and the (48, 7) second-order Reed-Muller code is generated The subcode of (48*2,7)=(96,7) is then generated using a repetition code such as (2,1).

Note that when N=P+72 bits, step 5102 can be omitted.

Referring to Figure 5B, using the punctured bits and reserved bits in the HS-SICH to transmit uplink signaling related to the time and rate scheduling mechanism, mainly including the scheme of the UE's transmission power margin (powermargin) and data buffer (data buffer) 2B, the specific steps include:

Step 5201 of said figure, to 8-bit transmission power margin (power margin) and data buffer (data buffer), adopt (N, 8) block code to encode, generate the sequence of N bits;

The 5202 step of described figure, with the sequence after described N bit encoding, generate P+72 bit sequence after the cyclic redundancy check (abbreviation CRC) of P+72-N bit;

In step 5203 of the figure, the generated P+72 bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ and d ₂ carried in the HS-SICH ... d _U :

$d_1,d_2...d_{{\mathrm{no}}_{\mathrm{CQI}}}=z_{1,}{z}_2...z_{{\mathrm{no}}_{\mathrm{CQI}}};$ d _i , d _i+1 ... d _i+P-1 = e ₁ , e ₂ ... e _P

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; P</span>}}<span\; class="notranslate">\; .</span>$

Wherein, i is the starting position of P punctured bits.

One way of generating the (N, 8) block code described in the above steps is to first use the subcode of the (32, 8) second-order Reed-Muller code, and then use the repetition code for it. For example, the last two columns of the subcode of the (32, 10) second-order Reed-Muller code given in Table 8 in Section 4.3.1.1 of the 3GPP specification TS25.222 are removed, and the (32, 8) second-order Reed-Muller code is generated subcode, and then use a repetition code such as (3,1) to generate a block code of (32*3,8)=(96,8).

Another way of generating the (N, 8) block code described in the above steps is to first use the subcode of the (48, 8) second-order Reed-Muller code, and then use the repetition code for it. For example, the last two columns of the subcode of the (48, 10) second-order Reed-Muller code given in Table 11 in Section 4.4.2.1 of the 3GPP specification TS25.222 are removed, and the (48, 8) second-order Reed-Muller code is generated The subcode of (48*2,8)=(96,8) is then generated using a repetition code such as (2,1).

Note that when N=P+72 bits, step 5202 can be omitted.

Referring to Fig. 5C, a scheme of using the punctured bits and reserved bits in the HS-SICH to transmit RR supporting rate scheduling and uplink signaling related to HARQ, that is, scheme 2C, its specific steps include:

In step 5301 of the figure, 1-bit RR and 7-bit HARQ-related uplink signaling are encoded using (N, 8) block codes to generate N-bit sequences; wherein the HARQ-related uplink signaling is mainly Including new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, PID for short), rate matching version indication (IR version: 3 information bits).

The 5302 step of described figure, with the sequence after described N bit encoding, generate P+72 bit sequence after the cyclic redundancy check (abbreviation CRC) of P+72-N bit;

In step 5303 of the figure, the generated P+72 bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ and d ₂ carried in the HS-SICH ... d _U :

$d_1,d_2...d_{{\mathrm{no}}_{\mathrm{CQI}}}=z_{1,}{z}_2...z_{{\mathrm{no}}_{\mathrm{CQI}}};$ d _i , d _i+1 ... d _i+P-1 = e ₁ , e ₂ ... e _P

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; P</span>}}<span\; class="notranslate">\; .</span>$

Wherein, i is the starting position of P punctured bits.

Note that when N=P+72 bits, step 5302 can be omitted.

One way of generating the (N, 8) block code described in the above steps is to first use the subcode of the (32, 8) second-order Reed-Muller code, and then use the repetition code for it. For example, the last two columns of the subcode of the (32, 10) second-order Reed-Muller code given in Table 8 in Section 4.3.1.1 of the 3GPP specification TS25.222 are removed, and the (32, 8) second-order Reed-Muller code is generated The subcode of (32*3,8)=(96,8) is then generated by using a repetition code such as (3,1).

Another way of generating the (N, 8) block code described in the above steps is to first use the subcode of the (48, 8) second-order Reed-Muller code, and then use the repetition code for it. For example, the last two columns of the subcode of the (48, 10) second-order Reed-Muller code given in Table 11 in Section 4.4.2.1 of the 3GPP specification TS25.222 are removed, and the (48, 8) second-order Reed-Muller code is generated The subcode of (48*2,8)=(96,8) is then generated using a repetition code such as (2,1).

Referring to Fig. 5D, another scheme of RR supporting rate scheduling and uplink signaling related to HARQ is transmitted using the punctured bits and reserved bits in HS-SICH, that is, scheme 2D, and its specific steps include:

In step 5401 of the figure, 1-bit RR signaling is encoded using (M1, 1) repetition codes to generate M1-bit encoding information; the value of M1 is related to the performance requirements of RR signaling, and M1≤P +72-7 bits.

Step 5402 of the figure, for 7-bit uplink signaling related to HARQ, mainly includes new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID) , the rate matching version indication (IR version: 3 information bits), using (M2, 7) block code for encoding to generate a sequence of M2 bits, where M2≤P+72-M1.

5403 in the figure, concatenate the sequence of M1 and the sequence of M2 to generate a bit sequence of length M1+M2, and then undergo a cyclic redundancy check (CRC for short) of P+72-M1-M2 bits After generating P+72 bit sequence;

In 5404 of the figure, the generated P+72 bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ and d ₂ carried in the HS-SICH. ..d _U :

$d_1,d_2...d_{{\mathrm{no}}_{\mathrm{CQI}}}=z_{1,}{z}_2...z_{{\mathrm{no}}_{\mathrm{CQI}}};$ d _i , d _i+1 ... d _i+P-1 = e ₁ , e ₂ ... e _P

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; P</span>}}<span\; class="notranslate">\; .</span>$

Wherein, i is the starting position of P punctured bits.

One way of generating the (M2, 7) block code described in the above steps is to first use the subcode of the (32, 7) second-order Reed-Muller code, and then use the repetition code for it. For example, the last three columns of the subcode of the (32, 10) second-order Reed-Muller code given in Table 8 in Section 4.3.1.1 of the 3GPP specification TS25.222 are removed, and the (32, 7) second-order Reed-Muller code is generated The subcode of (32*3,7)=(96,7) is then generated using a repetition code such as (3,1).

Another way to generate the (M2, 7) block code described in the above steps is to use the subcode of the (48, 7) second-order Reed-Muller code first, and then use the repetition code for it. For example, the last three columns of the subcode of the (48, 10) second-order Reed-Muller code given in Table 11 in Section 4.4.2.1 of the 3GPP specification TS25.222 are removed, and the (48, 7) second-order Reed-Muller code is generated The subcode of (48*2,7)=(96,7) is then generated using a repetition code such as (2,1).

Note that when M1+M2=P+72 bits, the cyclic redundancy check in step 5403 can be omitted.

Referring to Figure 5E, assuming that the performance requirements required for the uplink signaling related to HARQ and the uplink signaling related to supporting time and rate scheduling are the same, the uplink signaling related to HARQ is transmitted using the punctured bits and reserved bits in the HS-SICH. A scheme that supports uplink signaling related to time and rate scheduling (power margin and data buffer of the UE), that is, scheme 2E, and its specific steps include:

In step 5501 of the figure, the 15-bit uplink signaling (including 8-bit scheduling signaling and 7-bit HARQ-related uplink signaling) is encoded using (N, 15) block codes to generate N-bit sequence;

The 5502 step of described figure, with the sequence after described N bit encoding, generate P+72 bit sequence after the cyclic redundancy check (abbreviation CRC) of P+72-N bit;

In step 5503 of the figure, the generated P+72 bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ and d ₂ carried in the HS-SICH ... d _U :

$d_1,d_2...d_{{\mathrm{no}}_{\mathrm{CQI}}}=z_{1,}{z}_2...z_{{\mathrm{no}}_{\mathrm{CQI}}};$ d _i , d _i+1 ... d _i+P-1 = e ₁ , e ₂ ... e _P

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; P</span>}}<span\; class="notranslate">\; .</span>$

where i is the starting position of P punctured bits. .

Note that when N=P+72 bits, step 5502 can be omitted.

Referring to Figure 5F, assuming that the performance requirements required for the uplink signaling related to HARQ and the uplink signaling related to supporting time and rate scheduling are different, the punctured bits and reserved bits in the HS-SICH are used to transmit the uplink signaling related to HARQ Another scheme that supports uplink signaling related to time and rate scheduling (power margin and data buffer of the UE), that is, scheme 2F, the specific steps include:

Step 5601 of the figure, for the 7-bit HARQ-related uplink signaling, mainly includes a new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID) , the rate matching version indication (IR version: 3 information bits), using (M1, 7) block code for encoding, generating a sequence of M1 bits; where the value of M1 is related to the performance requirements of HARQ signaling, and M1≤ P+72-8 bits.

In step 5602 of the figure, the uplink signaling related to 8-bit support time and rate scheduling (power margin and data buffer of the UE) is performed using (M2, 8) block codes Encoding to generate a sequence of M2 bits, where M2≤P+72-M1.

In 5603 of the figure, the sequence of M1 bits is concatenated with the sequence of M2 bits to generate a bit sequence of length M1+M2, and then a cyclic redundancy check (CRC for short) of 72-M1-M2 bits is performed. After generating P+72 bit sequence;

In 5604 of the figure, the generated P+72 bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ and d ₂ carried in the HS-SICH. ..d _U :

$d_1,d_2...d_{{\mathrm{no}}_{\mathrm{CQI}}}=z_{1,}{z}_2...z_{{\mathrm{no}}_{\mathrm{CQI}}};$ d _i , d _i+1 ... d _i+P-1 = e ₁ , e ₂ ... e _P

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}<span\; class="notranslate">\; ;</span>}$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; P</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; P</span>}}<span\; class="notranslate">\; .</span>$

where i is the starting position of P punctured bits.

The (M1, 7) block code described in the above steps can be a subcode of the second-order Reed-Muller code, for example, the (48, 10) second-order Reed code given in Table 11 in Section 4.4.2.1 of 3GPP specification TS25.222 - The last three columns of the subcode of the Muller code are removed, and the subcode of the (48, 7) second-order Reed-Muller code is generated.

The (M2, 8) block code described in the above steps can also be a subcode of the second-order Reed-Muller code, for example, the (48, 10) second-order given in Table 11 of section 4.4.2.1 in 3GPP specification TS25.222 The last two columns of the subcode of the Reed-Muller code are removed, and the subcode of the (48, 8) second-order Reed-Muller code is generated.

Note that when M1+M2=P+72 bits, the cyclic redundancy check in step 5603 can be omitted.

In conjunction with the embodiments, the two schemes proposed by the present invention and their sub-solutions will be described in more detail below. The present invention focuses on the transmission method of the uplink signaling, and omits the transmission mode of the downlink signaling, Node B and other related actions.

Figures 6-10 show examples corresponding to the sub-solutions of Solution 1.

Referring to FIG. 6, an embodiment of a method for transmitting HARQ-related uplink signaling using reserved bits in the HS-SICH, the specific steps include:

In step 601 of the figure, the 7-bit uplink signaling related to HARQ is encoded using the subcode of the (64,7) second-order Reed-Muller code to generate a 64-bit sequence; wherein (64,7) two The generation method of the subcode of the second-order Reed-Muller code is as follows: the last three columns of the subcode of the (64,10) second-order Reed-Muller code given in Section 4.4.2.1 of the 3GPP specification TS25.222 are removed, and the generation ( 64, 7) Subcodes of second-order Reed-Muller codes. In order to adopt the encoding method specified in the current specification as much as possible, another encoding method is to add three zeros at the end of the 7-bit HARQ-related uplink signaling to form a 10-bit sequence, and then use the specified (64, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 64-bit encoding sequence is generated.

The uplink signaling related to HARQ mainly includes: new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), for a total of 7 information bits.

Step 602 of the figure generates a 72-bit sequence after the 64-bit encoded sequence through an 8-bit cyclic redundancy check (CRC), that is, 8 bits are added after the 64-bit encoded sequence CRC check;

In step 603 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

Referring to FIG. 7 , using the reserved bits in HS-SICH to transmit uplink signaling related to the support time and rate scheduling mechanism, mainly includes an embodiment of the UE's transmission power margin (power margin) and data buffer (data buffer) method , the specific steps include:

The 701 step of described figure, to the transmission power margin (power margin) of 8 bits and data buffer (data buffer), adopt the subcode of (64,8) second-order Reed-Muller code to encode, generate the sequence of 64 bits ; Wherein (64,8) the generation method of the subcode of the second-order Reed-Muller yard is: the subcode of the (64,10) second-order Reed-Muller yard given in section 4.4.2.1 in the 3GPP specification TS25.222 The last two columns are removed, and the subcode of (64,8) second-order Reed-Muller code is generated. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add two zeros at the end of the 8-bit scheduling-related uplink signaling to form a 10-bit sequence, and then use the specified (64, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 64-bit encoding sequence is generated.

Step 702 of the figure generates a 72-bit sequence after the 64-bit encoded sequence through an 8-bit cyclic redundancy check (CRC), that is, 8 bits are added after the 64-bit encoded sequence CRC check;

In step 703 of the figure, the generated 72-bit sequence is multiplexed with the encoded CQI and ACK/NACK bits in the following manner to form the HS-SICH borne Data bits d ₁ , d ₂ ...d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

Referring to FIG. 8, an embodiment of a method of using reserved bits in HS-SICH to transmit RR supporting rate scheduling and uplink signaling related to HARQ, the specific steps include:

In step 801 of the figure, the RR of 1 bit and the uplink signaling related to HARQ of 7 bits are encoded by the subcode of the (64,8) second-order Reed-Muller code to generate a 64-bit sequence; where ( 64, 8) The generation method of the subcode of the second-order Reed-Muller code is: the last two columns of the subcode of the (64, 10) second-order Reed-Muller code given in Section 4.4.2.1 of the 3GPP specification TS25.222 Remove, and generate the subcode of (64,8) second-order Reed-Muller code. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add two zeros at the end of the 8-bit RR and the uplink signaling related to HARQ to form a 10-bit sequence, and then use the specified ( 64, 10) subcodes of the second-order Reed-Muller code for encoding; the results of the two encoding methods are the same, that is, the same 64-bit encoding sequence is generated.

The uplink signaling related to HARQ mainly includes new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits);

Step 802 of the figure generates a 72-bit sequence after the 64-bit encoded sequence through an 8-bit cyclic redundancy check (CRC), that is, 8 bits are added after the 64-bit encoded sequence CRC check;

In step 803 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

Referring to FIG. 9 , an embodiment of another method for supporting rate-scheduled RR and HARQ-related uplink signaling using reserved bits in HS-SICH transmission, the specific steps include:

In step 901 of the figure, the 1-bit RR signaling is encoded using (8,1) repetition codes to generate 8-bit encoded information;

In step 902 of the figure, the 7-bit uplink signaling related to HARQ is encoded by the subcode of the (64,7) second-order Reed-Muller code to generate a 64-bit sequence; wherein (64,7) two The generation method of the subcode of the second-order Reed-Muller code is as follows: the last three columns of the subcode of the (64,10) second-order Reed-Muller code given in Section 4.4.2.1 of the 3GPP specification TS25.222 are removed, and the generation ( 64, 7) Subcodes of second-order Reed-Muller codes. In order to adopt the encoding method specified in the current specification as much as possible, another encoding method is to add three zeros at the end of the 7-bit HARQ-related uplink signaling to form a 10-bit sequence, and then use the specified (64, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 64-bit encoding sequence is generated.

The uplink signaling related to HARQ mainly includes: new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), for a total of 7 information bits.

In 903 of the figure, the 8-bit sequence is concatenated with the 64-bit sequence to generate a 72-bit sequence, and then the generated 72-bit sequence is combined with the encoded CQI and ACK/NACK bits according to Data bits d ₁ , d ₂ ... d _U carried in the HS-SICH are formed after multiplexing in the following manner:

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

Referring to Figure 10, assuming that the uplink signaling related to HARQ and the uplink signaling related to supporting time and rate scheduling have different performance requirements, the reserved bits in the HS-SICH are used to transmit the uplink signaling related to HARQ and the supporting time An embodiment of a method for uplink signaling (power margin and data buffer of UE) related to rate scheduling, the specific steps include:

In step 1001 of the figure, the 7-bit uplink signaling related to HARQ is encoded by the subcode of the (32,7) second-order Reed-Muller code to generate a 32-bit sequence; wherein (32,7) two The generation method of the subcode of the first-order Reed-Muller code is as follows: the last three columns of the subcode of the (32,10) second-order Reed-Muller code given in Table 8 in Section 4.3.1.1 of the 3GPP specification TS25.222 are removed, and Generate subcodes of (32,7) second-order Reed-Muller codes. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add three zeros at the end of the 7-bit HARQ-related uplink signaling to form a 10-bit sequence, and then use the specified (32, 10) The subcode of the second-order Reed-Muller code is encoded; the results of the two encoding methods are the same, that is, the same 32-bit encoding sequence is generated.

The uplink signaling related to HARQ mainly includes: new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), for a total of 7 information bits.

The 1002 steps of described figure, to the transmission power margin (power margin) of 8 bits and data buffer (data buffer), adopt the subcode of (32,8) second-order Reed-Muller code to encode, generate the sequence of 32 bits ; Wherein (32,8) the generation method of the subcode of the second-order Reed-Muller yard is: the subcode of (32,10) the subcode of the second-order Reed-Muller yard given in 4.3.1.1 section table 8 in 3GPP standard TS25.222 The last two columns of the code are removed, and the subcode of the (32,8) second-order Reed-Muller code is generated. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add two zeros at the end of the 8-bit scheduling-related uplink signaling to form a 10-bit sequence, and then use the specified (32, 10) The subcode of the second-order Reed-Muller code is encoded; the results of the two encoding methods are the same, that is, the same 32-bit encoding sequence is generated.

In 1003 of the figure, the generated 32-bit sequence related to HARQ is concatenated with the generated 32-bit sequence related to scheduling to generate a 64-bit sequence, and then undergoes an 8-bit cyclic redundancy check (referred to as CRC) after generating a 72-bit sequence, that is, adding an 8-bit CRC check after the 64-bit coded sequence;

In 1004 of the figure, the generated 72-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ ... carried in the HS-SICH d _U :

${\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; z</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; z</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}}<span\; class="notranslate">\; ;</span>$ ${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 36</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>}{\mathrm{<span\; class="notranslate">\; c</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="36"\; label="c"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">c</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 36</span>}}$

${\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 37</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{{\mathrm{<span\; class="notranslate">\; no</span>}}_{\mathrm{<span\; class="notranslate">\; CQI</span>}}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; 38</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; u</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; e</span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span><span\; class="notranslate">\; .</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="72"\; label="e"\; filenames="A20031012334100512.png"\; state="\{\{state\}\}">e</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 72</span>}}<span\; class="notranslate">\; .</span>$

When P=32, Figures 11-15 show examples corresponding to the sub-schemes of the second scheme.

Referring to FIG. 11 , an embodiment of a method for transmitting HARQ-related uplink signaling using punctured bits and reserved bits in HS-SICH, the specific steps include:

Step 1101 of the figure, for the uplink signaling related to HARQ of 7 bits, first adopt (32,7) block code, that is, the subcode of (32,7) second-order Reed-Muller code to encode, generate 32 bits The sequence of wherein (32, 7) the generation method of the subcode of the second-order Reed-Muller code is: the (32, 10) second-order Reed-Muller code given in Table 8 of Section 4.3.1.1 in 3GPP specification TS25.222 The last three columns of the subcode are removed, and the subcode of the (32, 7) second-order Reed-Muller code is generated. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add three zeros at the end of the 7-bit HARQ-related uplink signaling to form a 10-bit sequence, and then use the specified (32, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 32-bit encoding sequence is generated.

Then adopt (3,1) repetition code coding again to the 32-bit coded sequence that described generation, generate the coded sequence of 96 bits;

The uplink signaling related to HARQ mainly includes: new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), for a total of 7 information bits.

Step 1102 of the figure generates a 104-bit sequence after the 96-bit encoded sequence through an 8-bit cyclic redundancy check (CRC), that is, 8 bits are added after the 64-bit encoded sequence CRC check;

In step 1103 of the figure, the generated 104-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

d ₁ , d ₂ ... d ₁₂₈ = z ₁ , z ₂ ... z ₁₂₈ ; d ₉₇ , d ₉₈ ... d ₁₂₈ = e ₁ , e ₂ ... e ₃₂

d ₁₂₈₊₁ , d ₁₂₈₊₂ ... d ₁₂₈₊₃₆ = c ₁ , c ₂ ... c ₃₆ ; d ₁₂₈₊₃₇ , d ₁₂₈₊₃₈ ... d _U = e ₃₂₊₁ , e _{32 +2} ...e ₇₂₊₃₂ .

Referring to Figure 12, using the punctured bits and reserved bits in the HS-SICH to transmit uplink signaling related to the support time and rate scheduling mechanism, mainly including the UE's transmission power margin (powermargin) and data buffer (data buffer) method The embodiment, its specific steps include:

Step 1201 of said figure, the transmission power margin (power margin) and data buffer (data buffer) of 8 bits are encoded using the subcode of (32,8) second-order Reed-Muller code to generate a 32-bit sequence ; Wherein (32,8) the generation method of the subcode of the second-order Reed-Muller yard is: the subcode of (32,10) the subcode of the second-order Reed-Muller yard given in 4.3.1.1 section table 8 in 3GPP standard TS25.222 The last two columns of the code are removed, and the subcode of the (32,8) second-order Reed-Muller code is generated. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add two zeros at the end of the 8-bit scheduling-related uplink signaling to form a 10-bit sequence, and then use the specified (32, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 32-bit encoding sequence is produced;

Then adopt (3,1) repetition code to encode the 32-bit coded sequence of described generation again, generate the coded sequence of 96 bits;

Step 1202 of the figure generates a 104-bit sequence after the 96-bit encoded sequence through an 8-bit cyclic redundancy check (CRC), that is, 8 bits are added after the 96-bit encoded sequence CRC check;

In step 1203 of the figure, the generated 104-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

d ₁ , d ₂ ... d ₁₂₈ = z ₁ , z ₂ ... z ₁₂₈ ; d ₉₇ , d ₉₈ ... d ₁₂₈ = e ₁ , e ₂ ... e ₃₂

d ₁₂₈₊₁ , d ₁₂₈₊₂ ... d ₁₂₈₊₃₆ = c ₁ , c ₂ ... c ₃₆ ; d ₁₂₈₊₃₇ , d ₁₂₈₊₃₈ ... d _U = e ₃₂₊₁ , e _{32 +2} ...e ₇₂₊₃₂ .

Referring to FIG. 13 , an embodiment of a method for transmitting RR supporting rate scheduling and HARQ-related uplink signaling using punctured bits and reserved bits in HS-SICH, the specific steps include:

In step 1301 of the figure, 1-bit RR and 7-bit HARQ-related uplink signaling are encoded by subcodes of (32,8) second-order Reed-Muller codes to generate 32-bit sequences; where ( 32, 8) The subcode of the second-order Reed-Muller code is generated in the following way: after the subcode of the (32, 10) second-order Reed-Muller code given in Table 8 in Section 4.3.1.1 of the 3GPP specification TS25.222 The second column is removed, and the subcode of the (32,8) second-order Reed-Muller code is generated. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add two zeros at the end of the 8-bit scheduling-related uplink signaling to form a 10-bit sequence, and then use the specified (32, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 32-bit encoding sequence is produced;

Then adopt (3,1) repetition code to encode the 32-bit coded sequence of described generation again, generate the coded sequence of 96 bits;

The uplink signaling related to HARQ mainly includes new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits).

Step 1302 of the figure generates a 104-bit sequence after the 96-bit coded sequence through an 8-bit cyclic redundancy check (CRC), that is, 8 bits are added after the 96-bit coded sequence CRC check;

In step 1303 of the figure, the generated 104-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ .. .d _U :

d ₁ , d ₂ ... d ₁₂₈ = z ₁ , z ₂ ... z ₁₂₈ ; d ₉₇ , d ₉₈ ... d ₁₂₈ = e ₁ , e ₂ ... e ₃₂

d ₁₂₈₊₁ , d ₁₂₈₊₂ ... d ₁₂₈₊₃₆ = c ₁ , c ₂ ... c ₃₆ ; d ₁₂₈₊₃₇ , d ₁₂₈₊₃₈ ... d _U = e ₃₂₊₁ , e _{32 +2} ...e ₇₂₊₃₂ .

Referring to FIG. 14 , an embodiment of another method for transmitting RR supporting rate scheduling and HARQ-related uplink signaling by using punctured bits and reserved bits in HS-SICH, the specific steps include:

In step 1401 of the figure, 1-bit RR signaling is encoded using (8,1) repetition codes to generate 8-bit encoded information;

Step 1402 of the figure, for the uplink signaling related to HARQ of 7 bits, first adopt (48,7) block code, that is, the subcode of (48,7) second-order Reed-Muller code to encode, generate 48 bits The sequence of wherein (48, 7) the generation method of the subcode of the second-order Reed-Muller code is: the (48, 10) second-order Reed-Muller code given in Table 11 of Section 4.4.2.1 in 3GPP specification TS25.222 The last three columns of the subcode are removed, and the subcode of (48,7) second-order Reed-Muller code is generated. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add three zeros at the end of the 7-bit HARQ-related uplink signaling to form a 10-bit sequence, and then use the specified (48, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 48-bit encoding sequence is generated.

Then adopt (2,1) repetition code coding again to the 48-bit encoded sequence of described generation, generate the encoded sequence of 96 bits;

The uplink signaling related to HARQ mainly includes: new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), for a total of 7 information bits.

In 1403 of the figure, the generated 8-bit sequence is concatenated with the generated 96-bit sequence to generate a 104-bit sequence;

In 1404 of the figure, the generated 104-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ ... carried in the HS-SICH d _U :

d ₁ , d ₂ ... d ₁₂₈ = z ₁ , z ₂ ... z ₁₂₈ ; d ₉₇ , d ₉₈ ... d ₁₂₈ = e ₁ , e ₂ ... e ₃₂

d ₁₂₈₊₁ , d ₁₂₈₊₂ ... d ₁₂₈₊₃₆ = c ₁ , c ₂ ... c ₃₆ ; d ₁₂₈₊₃₇ , d ₁₂₈₊₃₈ ... d _U = e ₃₂₊₁ , e _{32 +2} ...e ₇₂₊₃₂ .

Referring to Figure 15, assuming that the performance requirements required for the uplink signaling related to HARQ and the uplink signaling related to supporting time and rate scheduling are different, the uplink signaling related to HARQ is transmitted using the punctured bits and reserved bits in the HS-SICH. An embodiment of a method for ordering and supporting uplink signaling related to time and rate scheduling (UE transmission power margin (power margin) and data buffer (data buffer)), the specific steps include:

In step 1501 of the figure, the uplink signaling related to HARQ of 7 bits is encoded by using (48,7) block code, that is, the subcode of (48,7) second-order Reed-Muller code to generate 48-bit Sequence; Wherein (48, 7) the generation mode of the subcode of second-order Reed-Muller code is: the (48, 10) second-order Reed-Muller code that provides in 4.4.2.1 Section Table 11 in 3GPP standard TS25.222 The last three columns of the subcode are removed, and the subcode of the (48,7) second-order Reed-Muller code is generated. In order to adopt the encoding method stipulated in the current specification as much as possible, another encoding method is to add three zeros at the end of the 7-bit HARQ-related uplink signaling to form a 10-bit sequence, and then use the specified (48, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 48-bit encoding sequence is generated.

The uplink signaling related to HARQ mainly includes: new packet indication (NDI, 1 information bit), HARQ logical channel number (HARQ Process id: 3 information bits, referred to as PID), rate matching version indication (IR version: 3 information bits), for a total of 7 information bits.

In step 1502 of the figure, the (48,8) block code is first used for 8-bit uplink signaling (power margin and data buffer) related to the time and rate scheduling of the 8-bit support , that is, the subcode of the (48, 8) second-order Reed-Muller code is encoded to generate a 48-bit sequence; the generation method of the subcode of the (48, 8) second-order Reed-Muller code is: the 3GPP specification TS25. The last two columns of the subcode of the (48,10) second-order Reed-Muller code given in Table 11 in Section 4.4.2.1 of 222 are removed, and the subcode of the (48,8) second-order Reed-Muller code is generated. In order to adopt the encoding method specified in the current specification as much as possible, another encoding method is to add two zeros at the end of the 8-bit scheduling-related uplink signaling to form a 10-bit sequence, and then use the specified (48, 10) The subcode of the second-order Reed-Muller code is encoded; the results of these two encoding methods are the same, that is, the same 48-bit encoding sequence is generated.

In 1503 of the figure, the generated 48-bit HARQ-related sequence is concatenated with the generated 48-bit scheduling-related sequence to generate a 96-bit sequence, and then an 8-bit cyclic redundancy After checking (referred to as CRC), a 104-bit sequence is generated, that is, an 8-bit CRC check is added after the 96-bit coded sequence;

In 1504 of the figure, the generated 104-bit sequence is multiplexed with the coded CQI and ACK/NACK bits in the following manner to form the data bits d ₁ , d ₂ ... carried in the HS-SICH d _U :

d ₁ , d ₂ ... d ₁₂₈ = z ₁ , z ₂ ... z ₁₂₈ ; d ₉₇ , d ₉₈ ... d ₁₂₈ = e ₁ , e ₂ ... e ₃₂

d ₁₂₈₊₁ , d ₁₂₈₊₂ ... d ₁₂₈₊₃₆ = c ₁ , c ₂ ... c ₃₆ ; d ₁₂₈₊₃₇ , d ₁₂₈₊₃₈ ... d _U = e ₃₂₊₁ , e _{32 +2} ...e ₇₂₊₃₂ .

It can be understood that the above-mentioned content of the present invention is only an example, and should not be considered as a limitation to the disclosed method of the present invention.

Claims (76)

1. One kind in 3.84Mcps high-rate time-divided duplexing communication system, utilize reservation bit among the high-speed shared information channel HS-SICH to transmit the method that up channel strengthens required up signaling, comprise step:

   A) to the up signaling of n bit, adopt (N, n) block code is encoded, and produces the sequence of N bit;

   B) to the sequence after the described N bits of encoded, through generating 72 bit sequences after the cyclic redundancy check (CRC) of 72-N bit;

   After CQI behind 72 bit sequences that c) will generate and the coding and ACK/NACK bit are multiplexing in the following manner, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U:

   $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}};}{d}_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36}$

   $d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_1,e_2...e_{72}.$
2. 2. method according to claim 1 is characterized in that: the up signaling of n bit in the step a) is relevant, relevant with HARQ with the scheduling of Node B control.
3. 3. method according to claim 1 is characterized in that: when the N=72 bit, step b) can be omitted.
4. One kind in 3.84Mcps high-rate time-divided duplexing communication system, utilize the method for reservation bit transmission among the high-speed shared information channel HS-SICH up signaling relevant with HARQ, comprise step:

   A) to the up signaling relevant of 7 bits with HARQ, adopt (N, 7) block code to encode, generate the sequence of N bit;

   B) with the sequence after the described N bits of encoded, through generating 72 bit sequences after the cyclic redundancy check (CRC) of 72-N bit;

   After CQI behind 72 bit sequences that c) will generate and the coding and ACK/NACK bit are multiplexing in the following manner, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U:

   $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}};}{d}_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36}$

   $d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_1,e_2...e_{72}.$
5. 5. method according to claim 4 is characterized in that: the up signaling relevant with HARQ of 7 bits in the step a) mainly comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
6. 6. method according to claim 4 is characterized in that: (N, the 7) block code in the step a) is the subcode of second order Reed-Muller sign indicating number.
7. 7. method according to claim 4 is characterized in that: when the N=72 bit, step c) can be omitted.
8. One kind in the high-rate time-divided duplexing communication system, utilize the method for the machine-processed relevant up signaling of reservation bit transmission and support time among the high-speed shared information channel HS-SICH and rate scheduling, comprise step:

   A) to 8 bits and the relevant up signaling of scheduling, adopt (N, 8) block code to encode, generate the sequence of N bit;

   B) with the sequence after the described N bits of encoded, through generating 72 bit sequences after the cyclic redundancy check (CRC) of 72-N bit;

   After CQI behind 72 bit sequences that c) will generate and the coding and ACK/NACK bit are multiplexing in the following manner, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U:

   $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}};}{d}_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36}$

   $d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_1,e_2...e_{72}.$
9. 9. method according to claim 8 is characterized in that: the up signaling relevant with scheduling of 8 bits in the step a) comprises transmitted power surplus and the data buffering of UE.
10. 10. method according to claim 8 is characterized in that: (N, the 8) block code in the step a) is the subcode of second order Reed-Muller sign indicating number.
11. 11. method according to claim 8 is characterized in that: when the N=72 bit, step c) can be omitted.
12. 12. one kind in the high-rate time-divided duplexing communication system, the method for RR that utilizes the reservation bit transmission supporting rate scheduling among the high-speed shared information channel HS-SICH and the up signaling relevant with HARQ comprises step:

    A) to the up signaling relevant of the RR and 7 bits of 1 bit with HARQ, adopt (N, 8) block code to encode, generate the sequence of N bit;

    B) with the sequence after the described N bits of encoded, through generating 72 bit sequences after the cyclic redundancy check (CRC) of 72-N bit;

    After CQI behind 72 bit sequences that c) will generate and the coding and ACK/NACK bit are multiplexing in the following manner, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}};}{d}_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36}$

    $d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_1,e_2...e_{72}.$
13. 13. method according to claim 12 is characterized in that: the up signaling relevant with HARQ of 7 bits in the step a) comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
14. 14. method according to claim 12 is characterized in that: (N, the 8) block code in the step a) is the subcode of second order Reed-Muller sign indicating number.
15. 15. method according to claim 12 is characterized in that: when the N=72 bit, step c) can be omitted.
16. 16. in the high-rate time-divided duplexing communication system, the method for RR that utilizes the reservation bit transmission supporting rate scheduling among the high-speed shared information channel HS-SICH and the up signaling relevant with HARQ comprises step:

    A) to the RR signaling of 1 bit, adopt (M1,1) duplication code to encode, generate the coded message of M1 bit;

    B) to the up signaling relevant of 7 bits with HARQ, adopt (M2,7) block code to encode, generate the sequence of M2 bit;

    C) sequence with described M1 is connected in series the living bit sequence of growing into M1+M2 in back with the sequence of described M2, then through generating 72 bit sequences after the cyclic redundancy check (CRC) of 72-M1-M2 bit;

    After CQI behind 72 bit sequences that d) will generate and the coding and ACK/NACK bit are multiplexing in the following manner, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}};}{d}_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36}$

    $d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_1,e_2...e_{72}.$
17. 17. method according to claim 16 is characterized in that: the value of the M1 in the step a) is relevant with the performance requirement of RR signaling, and M1≤72-7 bit.
18. 18. method according to claim 16 is characterized in that: the up signaling relevant with HARQ of 7 bits in the step b) comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
19. 19. method according to claim 16 is characterized in that: the value of the M2 in the step b) satisfies M2≤72-M1;
20. 20. method according to claim 16 is characterized in that: (M2, the 7) block code in the step b) is the subcode of second order Reed-Muller sign indicating number.
21. 21. method according to claim 16 is characterized in that: when the M1+M2=72 bit, the cyclic redundancy check (CRC) in the step c) can be omitted.
22. 22. one kind in the high-rate time-divided duplexing communication system, utilize the reservation bit among the high-speed shared information channel HS-SICH, transmit the method for up signaling relevant and the support time up signaling relevant with rate scheduling with HARQ, comprise step:

    A) to the up signaling of 15 bits, adopt (N, 15) block code to encode, generate the sequence of N bit;

    B) with the sequence after the described N bits of encoded, through generating 72 bit sequences after the cyclic redundancy check (CRC) of 72-N bit;

    After CQI behind 72 bit sequences that c) will generate and the coding and ACK/NACK bit are multiplexing in the following manner, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}};}{d}_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36}$

    $d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_1,e_2...e_{72}.$
23. 23. method according to claim 22 is characterized in that: the up signaling relevant with HARQ in the step a) comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
24. 24. method according to claim 22 is characterized in that: the dispatch of 8 bits in the step a) comprises transmitted power surplus and the data buffering of UE.
25. 25. method according to claim 22 is characterized in that: when the N=72 bit, step b) can be omitted.
26. 26. one kind in the high-rate time-divided duplexing communication system, utilize the reservation bit among the high-speed shared information channel HS-SICH, transmit the method for up signaling relevant and the support time up signaling relevant with rate scheduling with HARQ, comprise step:

    A) to the up signaling relevant of 7 bits with HARQ, adopt (M1,7) block code to encode, generate the sequence of M1 bit;

    B) to the support time of the 8 bits up signaling relevant with rate scheduling, adopt (M2,8) block code to encode, generate the sequence of M2 bit;

    C) sequence with described M1 is connected in series the living bit sequence of growing into M1+M2 in back with the sequence of described M2, then through generating 72 bit sequences after the cyclic redundancy check (CRC) of 72-M1-M2 bit;

    After CQI behind 72 bit sequences that d) will generate and the coding and ACK/NACK bit are multiplexing in the following manner, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}};}{d}_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36}$

    $d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_1,e_2...e_{72}.$
27. 27. method according to claim 26 is characterized in that: the up signaling relevant with HARQ in the step a) comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
28. 28. method according to claim 26 is characterized in that: the value of the M1 in the step a) is relevant with the performance requirement of HARQ signaling, and M1≤72-8 bit.
29. 29. method according to claim 26 is characterized in that: (M1, the 7) block code in the step a) is the subcode of second order Reed-Muller sign indicating number.
30. 30. method according to claim 26 is characterized in that: the dispatch of 8 bits in the step b) comprises transmitted power surplus and the data buffering of UE.
31. 31. method according to claim 26 is characterized in that: the value of the M2 in the step b) satisfies M2≤72-M1;
32. 32. method according to claim 26 is characterized in that: (M2, the 8) block code in the step b) is the subcode of second order Reed-Muller sign indicating number.
33. 33. method according to claim 26 is characterized in that: when the M1+M2=72 bit, the cyclic redundancy check (CRC) in the step c) can be omitted.
34. 34. one kind in the high-rate time-divided duplexing communication system, utilize punching bit among the high-speed shared information channel HS-SICH and reservation bit to come together to transmit the method that up channel strengthens required up signaling, comprise step:

    A) P bit destroyed in ACK/NACK territory behind the coding in HS-SICH and CQI territory, and then obtains P available bits;

    B) to the up signaling of n bit, adopt (N, n) block code is encoded, and produces the coded sequence of N bit;

    C) to the sequence after the described N bits of encoded, through generating the P+72 bit sequence after the cyclic redundancy check (CRC) of P+72-N bit;

    D) with the CQI behind the P+72 bit sequence that generates and the coding and ACK/NACK bit multiplexing in the following manner after, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U, wherein i is the starting position of P punching bit:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}}};d_i,d_{i+1}...d_{i+P-1}=e_1,e_2...e_P$

    $d_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36};d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_{P+1},e_{P+2}...e_{72+P}.$
35. 35. method according to claim 34 is characterized in that: the punching bit of the P in the step a) is an any P successive bits of the CQI sequence behind the coding among the HS-SICH.
36. 36. method according to claim 34 is characterized in that: the up signaling of n bit in the step b) is relevant and relevant with HARQ with the scheduling of Node B control.
37. 37. method according to claim 34 is characterized in that: when the N=P+72 bit, step c) can be omitted.
38. 38. one kind in the high-rate time-divided duplexing communication system, utilize punching bit and reservation bit among the high-speed shared information channel HS-SICH to transmit the method for the up signaling relevant together with HARQ, comprise step:

    A) P bit destroyed in ACK/NACK territory behind the coding in HS-SICH and CQI territory, and then obtains P available bits;

    B) to the up signaling relevant of 7 bits with HARQ, adopt (N, 7) block code to encode, generate the sequence of N bit;

    C) with the sequence after the described N bits of encoded, through generating the P+72 bit sequence after the cyclic redundancy check (CRC) of P+72-N bit;

    D) with the CQI behind the P+72 bit sequence that generates and the coding and ACK/NACK bit multiplexing in the following manner after, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U, wherein i is the starting position of P punching bit:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}}};d_i,d_{i+1}...d_{i+P-1}=e_1,e_2...e_P$

    $d_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36};d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_{P+1},e_{P+2}...e_{72+P}.$
39. 39. according to the described method of claim 38, it is characterized in that: the punching bit of the P in the step a) is an any P successive bits of the CQI sequence behind the coding among the HS-SICH.
40. 40. according to the described method of claim 38, it is characterized in that: the up signaling relevant with HARQ of 7 bits in the step b) mainly comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
41. 41. according to the described method of claim 38, it is characterized in that: the producing method of (N, the 7) block code in the step b) is to adopt earlier the subcode of (32,7) second order Reed-Muller sign indicating number, and then to the use duplication code.
42. 42. according to the described method of claim 38, it is characterized in that: the another kind of producing method of (N, the 7) block code in the step b) is to adopt earlier the subcode of (48,7) second order Reed-Muller sign indicating number, and then to the use duplication code.
43. 43. according to the described method of claim 38, it is characterized in that: when the N=P+72 bit, step c) can be omitted.
44. 44. one kind in the high-rate time-divided duplexing communication system, utilize punching bit and reservation bit among the high-speed shared information channel HS-SICH to transmit the method for the up signaling relevant with rate scheduling mechanism together with the support time, comprise step:

    A) P bit destroyed in ACK/NACK territory behind the coding in HS-SICH and CQI territory, and then obtains P available bits;

    B) to the transmitted power surplus and the data buffering of 8 bits, adopt (N, 8) block code to encode, generate the sequence of N bit;

    C) with the sequence after the described N bits of encoded, through generating the P+72 bit sequence after the cyclic redundancy check (CRC) of P+72-N bit;

    D) with the CQI behind the P+72 bit sequence that generates and the coding and ACK/NACK bit multiplexing in the following manner after, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U, wherein i is the starting position of P punching bit:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}}};d_i,d_{i+1}...d_{i+P-1}=e_1,e_2...e_P$

    $d_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36};d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_{P+1},e_{P+2}...e_{72+P}.$
45. 45. according to the described method of claim 44, it is characterized in that: the punching bit of the P in the step a) is an any P successive bits of the CQI sequence behind the coding among the HS-SICH.
46. 46. according to the described method of claim 44, it is characterized in that: the producing method of (N, the 8) block code in the step b) is to adopt earlier the subcode of (32,8) second order Reed-Muller sign indicating number, and then to the use duplication code.
47. 47. according to the described method of claim 44, it is characterized in that: the another kind of producing method of (N, the 8) block code in the step b) is to adopt earlier the subcode of (48,7) second order Reed-Muller sign indicating number, and then to the use duplication code.
48. 48. according to the described method of claim 44, it is characterized in that: when the N=P+72 bit, step c) can be omitted.
49. 49. one kind in the high-rate time-divided duplexing communication system, utilize the method for RR that punching bit and reservation bit among the high-speed shared information channel HS-SICH transmit the supporting rate scheduling together and the up signaling relevant with HARQ, comprise step:

    A) P bit destroyed in ACK/NACK territory behind the coding in HS-SICH and CQI territory, and then obtains P available bits;

    B) to the up signaling relevant of the RR and 7 bits of 1 bit with HARQ, adopt (N, 8) block code to encode, generate the sequence of N bit;

    C) with the sequence after the described N bits of encoded, through generating the P+72 bit sequence after the cyclic redundancy check (CRC) of P+72-N bit;

    D) with the P+72 bit sequence of described generation, with CQI behind the coding and ACK/NACK bit multiplexing in the following manner after, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U, wherein i is the starting position of P punching bit:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}}};d_i,d_{i+1}...d_{i+P-1}=e_1,e_2...e_P$

    $d_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36};d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_{P+1},e_{P+2}...e_{72+P}.$
50. 50. according to the described method of claim 49, it is characterized in that: the punching bit of the P in the step a) is an any P successive bits of the CQI sequence behind the coding among the HS-SICH.
51. 51. according to the described method of claim 49, it is characterized in that: the up signaling relevant with HARQ of 7 bits in the step b) comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
52. 52. according to the described method of claim 49, it is characterized in that: the producing method of (N, the 8) block code in the step b) is to adopt earlier the subcode of (32,8) second order Reed-Muller sign indicating number, and then to the use duplication code.
53. 53. according to the described method of claim 49, it is characterized in that: the another kind of producing method of (N, the 8) block code in the step b) is to adopt earlier the subcode of (48,8) second order Reed-Muller sign indicating number, and then to the use duplication code.
54. 54. according to the described method of claim 49, it is characterized in that: when the N=P+72 bit, step c) can be omitted.
55. 55. one kind in the high-rate time-divided duplexing communication system, utilize the method for RR that punching bit and reservation bit among the high-speed shared information channel HS-SICH transmit the supporting rate scheduling together and the up signaling relevant with HARQ, comprise step:

    A) P bit destroyed in ACK/NACK territory behind the coding in HS-SICH and CQI territory, and then obtains P available bits;

    B) to the RR signaling of 1 bit, adopt (M1,1) duplication code to encode, generate the coded message of M1 bit;

    C) to the up signaling relevant of 7 bits with HARQ, adopt (M2,7) block code to encode, generate the sequence of M2 bit;

    D) sequence with described M1 is connected in series the living bit sequence of growing into M1+M2 in back with the sequence of described M2, then through generating the P+72 bit sequence after the cyclic redundancy check (CRC) of P+72-M1-M2 bit;

    E) with the CQI behind the P+72 bit sequence that generates and the coding and ACK/NACK bit multiplexing in the following manner after, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U, wherein i is the starting position of P punching bit:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}}};d_i,d_{i+1}...d_{i+P-1}=e_1,e_2...e_P$

    $d_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36};d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_{P+1},e_{P+2}...e_{72+P}.$
56. 56. according to the described method of claim 55, it is characterized in that: the punching bit of the P in the step a) is an any P successive bits of the CQI sequence behind the coding among the HS-SICH.
57. 57. according to the described method of claim 55, it is characterized in that: the value of the M1 in the step b) is relevant with the performance requirement of RR signaling, and M1≤P+72-7.
58. 58. according to the described method of claim 55, it is characterized in that: the up signaling relevant with HARQ of 7 bits in the step b) comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
59. 59. according to the described method of claim 55, it is characterized in that: the value of the M2 in the step c) satisfies M2≤P+72-M1;
60. 60. according to the described method of claim 55, it is characterized in that: the producing method of (M2, the 7) block code in the step c) is to adopt earlier the subcode of (32,7) second order Reed-Muller sign indicating number, and then to the use duplication code.
61. 61. according to the described method of claim 55, it is characterized in that: the another kind of producing method of (M2, the 7) block code in the step c) is to adopt earlier the subcode of (48,7) second order Reed-Muller sign indicating number, and then to the use duplication code.
62. 62. according to the described method of claim 55, it is characterized in that: when the N=P+72 bit, the cyclic redundancy check (CRC) in the step d) can be omitted.
63. 63. one kind in the high-rate time-divided duplexing communication system, utilize punching bit and reservation bit among the high-speed shared information channel HS-SICH, transmit the method for up signaling relevant and the support time up signaling relevant, comprise step with rate scheduling with HARQ:

    A) P bit destroyed in ACK/NACK territory behind the coding in HS-SICH and CQI territory, and then obtains P available bits;

    B) to the up signaling of 15 bits, adopt (N, 15) block code to encode, generate the sequence of N bit;

    C) with the sequence after the described N bits of encoded, through generating the P+72 bit sequence after the cyclic redundancy check (CRC) of P+72-N bit;

    D) with the CQI behind the P+72 bit sequence that generates and the coding and ACK/NACK bit multiplexing in the following manner after, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U, wherein i is the starting position of P punching bit:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}}};d_i,d_{i+1}...d_{i+P-1}=e_1,e_2...e_P$

    $d_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36};d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_{P+1},e_{P+2}...e_{72+P}.$
64. 64. according to the described method of claim 63, it is characterized in that: the punching bit of the P in the step a) is an any P successive bits of the CQI sequence behind the coding among the HS-SICH.
65. 65. according to the described method of claim 63, it is characterized in that: the dispatch of 8 bits in the step b) mainly comprises transmitted power surplus and the data buffering of UE.
66. 66. according to the described method of claim 63, it is characterized in that: the up signaling relevant with HARQ in the step b) comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
67. 67. according to the described method of claim 63, it is characterized in that: when the N=P+72 bit, step c) can be omitted.
68. 68. one kind in the high-rate time-divided duplexing communication system, utilize punching bit and reservation bit among the high-speed shared information channel HS-SICH, transmit the method for up signaling relevant and the support time up signaling relevant, comprise step with rate scheduling with HARQ:

    A) P bit destroyed in ACK/NACK territory behind the coding in HS-SICH and CQI territory, and then obtains P available bits;

    B) to the up signaling relevant of 7 bits with HARQ, adopt (M1,7) block code to encode, generate the sequence of M1 bit;

    C) to the support time of the 8 bits up signaling relevant with rate scheduling, adopt (M2,8) block code to encode, generate the sequence of M2 bit;

    D) sequence with described M1 is connected in series the living bit sequence of growing into M1+M2 in back with the sequence of described M2, then through generating 72 bit sequences after the cyclic redundancy check (CRC) of P+72-M1-M2 bit;

    E) with the CQI behind the P+72 bit sequence that generates and the coding and ACK/NACK bit multiplexing in the following manner after, form the data carried by data bit d of institute among the HS-SICH ₁, d ₂... d _U, wherein i is the starting position of P punching bit:

    $d_1,d_2...d_{n_{\mathrm{CQI}}}=z_1,z_2...z_{n_{\mathrm{CQI}}};d_i,d_{i+1}...d_{i+P-1}=e_1,e_2...e_P$

    $d_{n_{\mathrm{CQI}}+1},d_{n_{\mathrm{CQI}}+2}...d_{n_{\mathrm{CQI}}+36}=c_1,c_2...c_{36};d_{n_{\mathrm{CQI}}+37},d_{n_{\mathrm{CQI}}+38}...d_U=e_{P+1},e_{P+2}...e_{72+P}.$
69. 69. according to the described method of claim 68, it is characterized in that: the punching bit of the P in the step a) is an any P successive bits of the CQI sequence behind the coding among the HS-SICH.
70. 70. according to the described method of claim 68, it is characterized in that: the up signaling relevant with HARQ in the step b) mainly comprises: new grouping indication, HARQ logical channel number, the indication of rate-matched version.
71. 71. according to the described method of claim 68, it is characterized in that: the value of the M1 in the step b) is relevant with the performance requirement of HARQ signaling, and M1≤P+72-8 bit.
72. 72. according to the described method of claim 68, it is characterized in that: (M1, the 7) block code in the step b) is the subcode of second order Reed-Muller sign indicating number.
73. 73. according to the described method of claim 68, it is characterized in that: the dispatch of 8 bits in the step c) comprises transmitted power surplus and the data buffering of UE.
74. 74. according to the described method of claim 68, it is characterized in that: the value of the M2 in the step c) satisfies M2≤P+72-M1;
75. 75. according to the described method of claim 68, it is characterized in that: (M2, the 8) block code in the step c) is the subcode of second order Reed-Muller sign indicating number.
76. 76. according to the described method of claim 68, it is characterized in that: when the M1+M2=P+72 bit, the cyclic redundancy check (CRC) in the step d) can be omitted.

Images