Method and apparatus for detecting local discontinuous transmission (DTX) using bits

Abstract

A method and apparatus for detecting a DTX state at a UCI receiver in a wireless communication system are disclosed. The method includes receiving a linear block coded signal on an uplink of the UCI receiver and processing the received signal to generate a soft bit sequence after resource element (RE) demapping. The method includes selecting a plurality of bits from the generated soft bit sequence as comparison bits and comparing the selected comparison bits with corresponding bits in a reconstructed soft bit sequence. The reconstructed soft bit sequence is generated from the generated soft bit sequence by selecting a plurality of bits as reconstruction bits. A comparison or correlation measure between the comparison bits and the corresponding bits in the reconstructed soft bit sequence is determined and a DTX state is determined to have occurred by evaluating the determined comparison or correlation measure.

Description

[Technical Field]

[0001] This invention relates, particularly but not exclusively, to an improved method and apparatus for detecting discontinuous transmission (DTX) on the uplink (UL) of an uplink control information (UCI) receiver in a wireless communication network using bit reconstruction. The invention particularly relates to the detection of local DTX in small-packet coded signals. [Background Technology]

[0002] In Long Term Evolution (LTE) communication systems, in the downlink (DL), the data payload is carried by transport blocks, which are encoded into codewords. These codewords are transmitted through the DL physical data channel, called the Physical Downlink Shared Channel (PDSCH). The scheduling information for the PDSCH codewords, including their resource allocation within subframes and their modulation and coding schemes, is contained in the Physical Downlink Control Channel (PDCCH). Typically, the receiving user equipment (UE) decodes the messages in the PDCCH. When it discovers that a PDSCH has already been allocated to it, it decodes the PDSCH codewords based on the scheduling information decoded from the PDCCH. In other words, correct decoding of the PDCCH is a prerequisite for correct decoding of the PDSCH.

[0003] To prevent the loss of transmission blocks, LTE employs a Hybrid Automatic Repeat Request (HARQ) scheme. In the physical layer of the Evolved UMTS Terrestrial Radio Access Network (E-UTRA), HARQ is implemented in both the UL and DL. The acknowledgment message in E-UTRA is represented as HARQ-ACK.

[0004] HARQ-ACK can be sent by the UE in response to certain PDSCH transmissions, including one or more acknowledgments, positive (ACK) or negative (NACK), in response to a transport block sent in the DL. HARQ-ACK can be sent on either the PUCCH or the Physical Uplink Shared Channel (PUSCH).

[0005] However, if the UE cannot correctly decode the PDCCH, it cannot correctly decode the PDSCH, and may not even know that a HARQ feedback needs to be sent. This is known as discontinuous transmission (DTX).

[0006] If the eNodeB (base station (BS)) detects an ACK instead of a DTX (Distributed Transaction Request), a so-called false ACK detection, the eNodeB will incorrectly assume that the corresponding DL (Distributed Transaction Request) block has been correctly received. Since the UE has not correctly received the block, the corresponding data will not be passed to the Medium Access Control (MAC) layer, nor from the MAC layer to the Radio Link Control (RLC) layer. Therefore, there will be missing data at the RLC layer. This will lead to ARQ retransmissions at the RLC layer, introducing latency and potentially a large number of retransmissions, which is highly undesirable. Furthermore, if a NACK (Negative Acknowledgment) that is actually a DTX is incorrectly detected, the eNodeB will retransmit the data packet in a manner that the UE cannot decode.

[0007] As mentioned earlier, if the UE fails to decode the PDCCH, a problem arises: the UE is unaware of the existence of the PDSCH assigned to it. In this case, the UE will not generate ACK / NACK information. This situation is well-understood; in this case, the UE's response is DTX, meaning it neither sends an ACK signal nor a NACK signal to the eNodeB. Since the eNodeB does not know in advance whether the UE has detected PDCCH failure, it expects or assumes that the symbol at the predetermined position is an ACK / NACK symbol and extracts it for the ACK / NACK decoder to decode. If the eNodeB does not consider the possibility of DTX, the ACK / NACK decoder, after decoding the extracted symbol, will return an ACK or NACK message to the upper layer; in fact, these symbols do not convey any information. Typically, both ACK and NACK messages are equally likely to be returned.

[0008] The consequences of mistakenly detecting DTX as ACK are more detrimental to system performance than those of mistakenly detecting DTX as NACK.

[0009] Similarly, in 5G (or New Radio, NR) wireless communication systems, a message feedback scheme is also used for retransmission control. The ACK or NACK (AN) signal is used to indicate whether the UE has successfully received the signal and whether the BS needs to retransmit the data. If the UE misses the DL control signal, it may encounter DTX in the DL, and the UE will not send any message back to the BS. However, the BS needs to detect one of three possible feedback states—ACK, NACK, or DTX—in order to reschedule the next transmission to the UE.

[0010] Figure 1 This demonstrates how the UL signal from the UE to the BS controls the transmission of payload control data and payload data on the DL from the BS to the UE. Figure 1 In the example, it can be seen that in response to the first "DL Control for Payload Allocation #1" message from the BS to the UE, the UE responds with a UCI "NACK" message. The NACK message is received by the BS's UCI receiver; therefore, the BS is configured to retransmit the first "DL Control for Payload Allocation #1" message and its associated first "DL Payload Data #1" information to the UE. In this example, the UE then returns a UCI "ACK" message to the UCI receiver in response to the retransmitted control signal message; therefore, the BS is configured to subsequently send a second "DL Control for Payload Allocation #2" message and its associated second "DL Payload Data #2" message to the UE. Figure 1 (Not shown in the image). Therefore, Figure 1 This demonstrates how the BS retransmits data to the UE when the UE indicates that the DL data control message has not been successfully received.

[0011] on the contrary, Figure 2 This illustrates what might happen when a UE misses a DL data control message. In this example, the UE misses the first "DL control for payload allocation #1" message and therefore does not send an ACK / NACK message to the BS in response. This situation represents a DTX state. The BS's UCI receiver receives only noise but treats it as a signal containing UL UCI. As a result, in this example, the UCI incorrectly detects or determines that an ACK message from the UE has been received, thus outputting a false ACK message. This causes the BS to begin transmitting new control and payload data in response to the false ACK message, such as "DL control for payload allocation #2," etc.

[0012] For 5G UCI, 3GPP specification 38.212 requires support for two types of channel coding: polar codes and small block codes, as follows: Figure 3 and 4As shown. Polar codes refer to cases where the number of payload bits is greater than 11. Minor block codes refer to cases where the number of payload bits is equal to or less than 11.

[0013] like Figure 3 As shown, in traditional polarity code-based receivers, cyclic redundancy check (CRC) can assist in detecting the presence of DTX. The output of the polarity code decoder includes UCI bits, but the CRC check function (module) enables the polarity code-based receiver to distinguish DTX on the one hand, and to indicate the UCI bits of ACK or NACK on the other.

[0014] exist Figure 4 The image illustrates a conventional packet-code-based receiver. Without CRC functionality, incorrect detection of ACK, NACK, or DTX signals leads to wasted resources on retransmissions and / or packet loss. In a conventional packet-code-based receiver, when CRC is unavailable, if the UE misses a DL control message and nothing is sent to the UE, resulting in the BS receiving only noise, ACK and NACK are each sent with approximately a 50% probability. In packet-code-based receivers, the output of the packet code decoder is assumed to be the UCI bit, leading to possible false ACK or false NACK results. In other words, there is no way to distinguish between DTX on one hand and the UCI bit indicating ACK or NACK on the other.

[0015] exist Figure 4 In a traditional block code-based UCI receiver, the resource element (RE) demapper output is processed by an equalizer module to generate an equalized signal. This equalized signal is then processed by a demodulation module to produce a demodulated soft bit sequence (SEQ). The demodulated soft bit SEQ is then processed by a descrambling module to create a descrambled soft bit SEQ. The descrambled soft bit SEQ is then processed by a rate matching module to create a dematched soft bit SEQ. The dematched soft bit SEQ is then decoded by the block code module's decoder to generate UCI bits (ACK / NACK). Soft bits contain the actual signal values, unlike hard bits, which are parsed into binary values.

[0016] exist Figure 1 and Figure 2As explained, if the UE loses the DL control signal, it will not send a UCI ACK / NACK feedback, resulting in a DTX state. The BS treats DTX as a failed DL transmission. Retransmission is required if DTX occurs. However, if DTX is mistakenly detected as ACK, no retransmission will occur. More specifically, DTX may be partial, meaning only a portion of the UCI payload bits may be lost. Partial DTX is more difficult to detect than complete DTX (loss of all UCI bits). From the perspective of a packet-code-based UCI receiver, partial DTX codewords are still considered part of the valid codeword set. Given that packet-code-based UCI receivers lack CRC checks to assist in detecting complete or partial DTX, effective detection of partial DTX is necessary, i.e., effectively distinguishing between partial and non-DTX signals.

[0017] CN105491591 discloses a UCI receiving apparatus configured to divide a descrambling sequence into N blocks, each containing 32 soft bits. It then compares the symbols of the soft bits in the first block with all other N-1 blocks. It calculates the number of identical symbol pairs as 'a' and the number of different symbol pairs as 'b', and compares the ratio a / b with a predetermined DTX threshold 'Th'. If a / b is less than or equal to 'Th', a DTX state is determined to have occurred; however, if a / b is greater than 'Th', a DTX state is determined not to have occurred. The DTX decision is a hard decision based on soft bit symbols. This decision is sensitive to noise or UL channel attenuation. If the number of non-DTX blocks in the N blocks is much higher than the number of DTX blocks, the ratio a / b can still be very high, meaning it is difficult to determine whether a DTX state has occurred using this metric. Therefore, if only some RBs in any of the N blocks suffer DTX, it is difficult to detect DTX. Furthermore, different DTX cases between RBs within a 32-bit block are not considered.

[0018] CN104168095 discloses a UCI receiving apparatus configured to decode a descrambled sequence to obtain a received UCI b. It then obtains a canonical sequence by selecting a subsequence with 32 soft bits from the descrambled sequence. It decodes the canonical sequence to obtain a canonical UCI r. The received UCI is then compared with the canonical UCI r to determine if a DTX state has occurred. This is a very complex solution, requiring a high signal-to-noise ratio (SNR) to decode the UCI. Furthermore, selecting a suitable canonical sequence is difficult.

[0019] Therefore, a method is needed to distinguish between local DTX signals and non-DTX signals.

[0020] [Purpose of the Invention]

[0021] One object of the present invention is to mitigate or avoid to some extent one or more of the problems associated with known methods of determining or detecting DTX on UL at a UCI receiver in a wireless communication network.

[0022] The above objective is achieved by a combination of features of the main claim; the dependent claims disclose other advantageous embodiments of the invention.

[0023] Another object of the present invention is to provide a method for distinguishing local DTX signals and non-DTX signals on a UCI receiver in a wireless communication network.

[0024] Another object of the present invention is to provide a method for distinguishing local DTX signals and non-DTX signals on the UL of a UCI receiver using bit reconstruction in a wireless communication network.

[0025] Another object of the present invention is to provide an improved UCI receiver.

[0026] Another object of the present invention is to provide an improved UCI receiver based on small-packet coding.

[0027] Other objects of the invention will become apparent to those skilled in the art from the following description. Therefore, the foregoing statement of objects is not exhaustive, but merely illustrative of some of the many objects of the invention. [Summary of the Invention]

[0028] This invention relates to a method for determining DTX when the PUCCH carries UCI feedback from the UE to the BS. In particular, it is a method capable of effectively distinguishing between local DTX signals and non-DTX signals on the UL of the UCI receiver.

[0029] Generally, this invention provides a method and apparatus for detecting DTX state at a UCI receiver in a wireless communication system. The method includes: receiving a linearly block-coded signal on the uplink of the UCI receiver, and processing the received signal after resource element (RE) demapping to generate a soft bit sequence. The method includes: in the generated soft bit sequence Select multiple bits as comparison bits, and compare the selected comparison bits with the reconstructed soft bit sequence. The corresponding bits in the sequence are compared. The reconstructed soft bit sequence is then obtained. From the generated soft bit sequence Multiple bits are selected as reconstructed bits. This is generated from the comparison bits and the reconstructed soft bit sequence. The corresponding bits in the comparison or correlation metric are used to determine whether the DTX state has occurred, and the evaluation of the determined comparison or correlation metric is used to determine whether the DTX state has occurred.

[0030] In a first key aspect, the present invention provides a method for detecting DTX state on a UCI receiver, the method comprising: receiving a linear block coded signal on the uplink (UL) of the UCI receiver; and processing the received linear block coded signal after resource element (RE) demapping to generate a soft bit sequence. The generated soft bit sequence Select multiple bits as comparison bits; compare the selected comparison bits with the reconstructed soft bit sequence. The corresponding bits in the reconstructed soft bit sequence are compared. From the generated soft bit sequence Multiple bits are selected as reconstruction bits; the generated soft bit sequence is determined. The selected comparison bits and the reconstructed soft bit sequence The comparison or correlation measure between the corresponding bits in the data; the evaluation of the determined comparison or correlation measure is used to determine whether the DTX state has occurred.

[0031] In a second key aspect, the present invention provides a method for processing a linearly block-coded signal at a UCI receiver, the method comprising: receiving the linearly block-coded signal on an uplink (UL) of the UCI receiver; processing the received linearly block-coded signal after resource element (RE) demapping to generate a soft bit sequence; selecting a plurality of bits as verification bits in the generated soft bit sequence; comparing the selected verification bits of the generated soft bit sequence with corresponding bits in a reconstructed soft bit sequence, wherein the reconstructed soft bit sequence is generated by selecting a plurality of bits as reconstructed bits from the generated soft bit sequence. Based on the comparison between the selected verification bits in the generated soft bit sequence and the corresponding bits in the reconstructed soft bit sequence, it is determined whether to compare the selected reconstructed bits in the generated soft bit sequence with the corresponding bits in the reconstructed soft bit sequence.

[0032] In a third principal aspect, the present invention provides a UCI receiver in a wireless communication system, the UCI receiver comprising: a memory storing machine-readable instructions; and a processor for executing the machine-readable instructions, wherein when the processor executes the machine-readable instructions, it configures the UCI receiver to implement the methods of the first principal aspect and / or the second principal aspect of the present invention.

[0033] In a fourth principal aspect, the present invention provides a non-transitory computer-readable medium storing machine-readable instructions, wherein, when the machine-readable instructions are executed by a processor of a UCI receiver in a wireless communication system, they configure the processor to implement methods of the first principal aspect and / or the second principal aspect of the invention.

[0034] This summary does not necessarily disclose all the features necessary to define the invention. The invention may exist in sub-combinations of the disclosed features.

[0035] The features of the invention have been outlined quite extensively above to provide a better understanding of the detailed description of the invention below. Other features and advantages of the invention that form the subject matter of the claims will now be described. Those skilled in the art will understand that the disclosed concepts and specific embodiments can be readily used as the basis for modifications or the design of other structures for achieving the same objectives of the invention. [Attached Image Description]

[0036] The foregoing and further features of the present invention will become apparent from the following description of preferred embodiments, which are provided by way of example only in conjunction with the accompanying drawings, wherein:

[0037] Figure 1 This diagram shows the signal exchange between the BS and UE for retransmitting control data and payload data.

[0038] Figure 2 This diagram shows the signal of erroneous transmission of control data and payload data from the BS to the UE when the BS's UCI receiver determines a false ACK message.

[0039] Figure 3 This is a schematic block diagram of a traditional receiver based on polar codes in a 5G communication system;

[0040] Figure 4 This is a schematic block diagram of a traditional receiver based on small packet codes in a 5G communication system.

[0041] Figure 5 Displays the RE mapping for PUCCH format 2 where no DTX state has occurred;

[0042] Figure 6 show Figure 5 The descrambling process of RE mapping when DTX state does not occur;

[0043] Figure 7 Shows the RE mapping of PUCCH format 2 when the first local DTX state occurs;

[0044] Figure 8 show Figure 7The descrambling process of the RE mapping when the first local DTX state occurs;

[0045] Figure 9 Displays the RE mapping of PUCCH format 2 when the second local DTX state occurs;

[0046] Figure 10 show Figure 9 The descrambling process of the RE mapping when the second local DTX state occurs;

[0047] Figure 11 Displays the RE mapping of PUCCH format 2 when the third local DTX state occurs;

[0048] Figure 12 A schematic block diagram showing the improved UCI receiver of the present invention is shown;

[0049] Figure 13 A schematic block diagram of the improved UCI receiver of the present invention is shown, illustrating in principle the method of the present invention performed by the UCI receiver;

[0050] Figure 14 show Figure 13 The main steps of the method;

[0051] Figure 15 A schematic block diagram of the improved UCI receiver of the present invention is shown, and detailed steps of the method of the present invention are shown.

[0052] Figure 16 show Figure 14 The method is about Figure 7 The grouping and segmentation steps of the RE mapping, where it is assumed that a first local DTX state has occurred;

[0053] Figure 17 show Figure 14 The method is about Figure 9 The grouping and segmentation steps of the RE mapping, where it is assumed that a second local DTX state has occurred;

[0054] Figure 18 show Figure 14 The method involves grouping and segmenting steps for single-symbol RE mappings;

[0055] Figure 19 Show an example of the encoding matrix M;

[0056] Figure 20 Show an example of the reconstructed matrix R;

[0057] Figure 21 A schematic block diagram of the improved UCI receiver of the present invention is shown, illustrating the detailed steps of the bit reconstruction DTX detection method of the present invention;

[0058] Figure 22 The flowchart of the bit reconstruction DTX detection method of the present invention is shown, including a verification process.

Detailed Implementation Methods

[0059] The following description illustrates preferred embodiments by way of example only and is not limited to the combination of features required to carry out the invention.

[0060] The term "one embodiment" as used in this specification means that a specific feature, structure, or characteristic described in relation to that embodiment is included in at least one embodiment of the invention. The phrase "in one embodiment" appearing in different places in the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. Furthermore, various features are described that may be exhibited by some embodiments but not by others. Similarly, various requirements are described that may be required by some embodiments but not by others.

[0061] It should be understood that the elements shown in the accompanying drawings can be implemented in various forms of hardware, software, or a combination thereof. These elements can be implemented in a combination of hardware and software on one or more appropriately programmed general-purpose devices, which may include processors, memory, and input / output interfaces.

[0062] This specification illustrates the principles of the invention. It will therefore be understood that those skilled in the art will be able to devise various arrangements that, while not explicitly described or shown herein, embody the principles of the invention and are included within its spirit and scope.

[0063] Furthermore, all statements herein describing the principles, aspects, and embodiments of the invention, and specific examples thereof, are intended to cover their structural and functional equivalents. Additionally, it is intended that such equivalents include both currently known equivalents and those developed in the future; that is, any developed element having the same function, regardless of its structure.

[0064] Therefore, for example, those skilled in the art will understand that the block diagrams presented herein represent conceptual diagrams of systems and apparatuses embodying the principles of the present invention.

[0065] The functions of the various elements shown in the accompanying drawings can be provided by dedicated hardware as well as hardware capable of executing software in conjunction with appropriate software. When provided by a processor, these functions can be provided by a single dedicated processor, a single shared processor, or multiple separate processors, some of which may be shared. Furthermore, the explicit use of the terms "processor" or "controller" should not be construed as referring only to hardware capable of executing software, and may implicitly include, but is not limited to, digital signal processor ("DSP") hardware, read-only memory ("ROM"), random access memory ("RAM"), and non-volatile memory for storing software.

[0066] In the claims of this invention, any element representing a means for performing a particular function is intended to cover any manner in which that function is performed, including, for example, a) a combination of circuit elements performing that function, or b) any form of software, thus including firmware, microcode, etc., combined with suitable circuitry for performing that software to perform that function. The invention as defined by such claims lies in the fact that the functions provided by the various said means are combined and integrated in the manner claimed in the claims. Therefore, any means capable of providing these functions is considered equivalent to the means shown herein.

[0067] Figure 5 This shows the RE mapping of a linear block-coded signal in PUCCH format 2 received on a BS-based UCI receiver, where no DTX state occurs. In this example, all RB or PUCCH units were successfully received, each consisting of 16 bits, for a total of 128 bits transmitted.

[0068] Figure 6 show Figure 5 The descrambling process of the RE mapping, wherein the local scrambling SEQ R, consisting of eight 16-bit blocks (r0 to r7) of hard bits of binary values ​​"1" or "-1", is performed in the demodulation module ( Figure 4 The descrambling module () is demodulated to provide a demodulated SEQ M, which consists of eight 16-bit blocks (m0 to m7) of soft bits. In this example, all blocks r0 to r7 of SEQ R are aligned with the corresponding blocks m0 to m7 of SEQ M, which makes the descrambling module () Figure 4 It can descramble the demodulated SEQ M to provide a descrambled SEQ S (where S = R*M), which includes four valid 32-soft-bit copies of the received linear block coded signal.

[0069] Figure 7The image shows the RE mapping of the linear block-coded signal received on a small-block-code-based UCI receiver at the BS in PUCCH format 2, where the first local DTX state occurs. In this example, the last RB of each symbol was not successfully transmitted, and signals were received at the location of each missing RB. Figure 7 Noise labeled "X" is considered noise. However, the UCI receiver will assume that the received noise includes a valid portion of the received linear block-coded signal and treat it as valid, which may lead to false ACK or NACK states. Partial DTX indicates a DL transmission failure and needs to be treated as a DTX state. For small block-code-based UCI receivers, DTX is difficult to determine or detect, but partial DTX is particularly difficult to detect or determine compared to a full DTX state, in which none of the symbols' RBs are successfully transmitted, and the UCI receiver only receives noise.

[0070] Figure 8 show Figure 7 The descrambling process of the RE mapping occurs when the first local DTX state occurs. Due to the local DTX state, some copies of the received linear block coded signal will be partially or completely randomized. In this example, only blocks m0 to m2 in SEQ M are aligned with blocks r0 to r2 in SEQ R, while blocks m3 to m5 in SEQ M are aligned with blocks r4 to r6 in SEQ R, thus misaligned with blocks r3 to r5 in SEQ R. Therefore, SEQ M includes some correctly aligned blocks, some noisy blocks, and some misaligned blocks, resulting in the descrambled SEQ S comprising a valid 32-bit copy of the received linear block coded signal, a partially randomized copy, and two fully randomized copies, such as... Figure 8 As shown.

[0071] Figure 9 The image shows the RE mapping of the PUCCH format 2 linear block-coded signal received on a small-block-code-based UCI receiver at the BS, where a second local DTX state occurs. In this example, the last two RBs or PUCCH units of each symbol were not successfully transmitted, and noise was received at each missing RB location.

[0072] Figure 10 show Figure 9The descrambling process of the RE mapping occurs when the second local DTX state occurs. In this example, only blocks m0 to m1 of SEQ M are aligned with blocks r0 to r1 in SEQ R, while blocks m2 to m3 of SEQ M are aligned with blocks r4 to r5 of SEQ R, thus misaligning with blocks r2 to r3 of SEQ R. Therefore, SEQ M includes some correctly aligned blocks, some noisy blocks, and some misaligned blocks, resulting in a descrambled SEQ S consisting of a valid 32-bit copy of the received linear block coded signal and three fully randomized copies.

[0073] Figure 11 The image shows the RE mapping of the linear block-coded signal received on a UCI receiver based on small block coding at the BS in PUCCH format 2, where a third local DTX state occurs. In this example, only one OFDM symbol and two RBs were successfully transmitted, and noise was received at the location of each missing RB. Correlation between multiple subsequences is impossible in this case because if the DTX state does not occur, only a copy of the received linear block-coded signal is obtained, and if the DTX state occurs, only half a copy of the received linear block-coded signal is obtained.

[0074] Therefore, the object of the present invention is to at least solve the above-mentioned technical problems by providing a method and apparatus in the form of a UCI receiver, which detects the local DTX state by distinguishing between local DTX signals and non-DTX signals, preferably by using bit reconstruction as described below, although the method of using bit reconstruction to distinguish between local DTX signals and non-DTX signals can be used in conjunction with other methods of distinguishing between local DTX signals and non-DTX signals.

[0075] Figure 12 An exemplary embodiment of an improved UCI receiver 100 according to the concept of the present invention is shown. In the illustrated embodiment, the UCI receiver 100 may include communication devices operating in a 5G communication system environment 115, such as a network node, a network interface card (NIC), or network circuitry communicatively connected to or forming part of the BS 103 (in... Figure 12 (Indicated by dashed lines), etc., although the improved UCI receiver 100 of the present invention is not limited to operation in 5G communication systems, it may also include a UCI receiver for 4G cellular networks or any cellular network. BS 103 communicates with one or more UEs 125.

[0076] UCI receiver 100 may include multiple functional blocks for performing its various functions. For example, UCI receiver 100 includes receiver module 110, which provides receive signal processing and is configured to provide received signals and / or information extracted therefrom to functional block module 120, which may include various data sinks, control elements, user interfaces, etc. While receiver module 110 is described as providing receive signal processing, it should be understood that this functional block can be implemented as a transceiver providing both transmit and receive signal processing. Regardless of the specific configuration of receiver 110, embodiments include a signal detection module 130 associated with receiver module 110 to facilitate accurate processing and / or decoding of received channel signals according to the invention. Channel signals may be received via antenna module 105.

[0077] Although the signal detection module 130 is shown as being deployed as part of the receiver module 110 (e.g., including part of receiver module control and logic circuitry), there are no limitations on such deployment configurations according to the concept of the invention. For example, the signal detection module 130 may be deployed as a functional block of the UCI receiver 100, distinct from but connected to the receiver module 110. For example, the signal detection module 130 may be implemented using logic circuitry and / or executable code / machine-readable instructions stored in the memory 140 of the UCI receiver 100 for execution by the processor 150 to perform the functions described herein. For example, the executable code / machine-readable instructions may be stored in one or more memories 140 (e.g., random access memory (RAM), read-only memory (ROM), flash memory, magnetic storage, optical storage, etc.) suitable for storing one or more instruction sets (e.g., application software, firmware, operating system, applets, etc.), data (e.g., configuration parameters, operating parameters and / or thresholds, collected data, processed data, etc.). One or more memories 140 may include processor-readable storage with respect to one or more processors 150, which are executable to perform code segments of the signal detection module 130 and / or utilize data provided thereto to perform the functions of the signal detection module 130 described herein. Additionally, or alternatively, the signal detection module 130 may include one or more dedicated processors (e.g., application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), graphics processing units (GPUs), etc.) configured to perform the functions of the signal detection module 130 described herein.

[0078] Figure 13 This is a schematic block diagram of an improved UCI receiver device according to the present invention, illustrating in principle the use of a signal detection module 130 ( Figure 12This invention relates to a method for improving a UCI receiver 100 / 200 based on linear block codes. In one embodiment, the UCI receiver 100 / 200 is configured to receive a UL UCI signal as a demapper output signal. The demapper output signal is first equalized in an equalizer module 202 in a known manner to provide an equalized signal. This equalized signal is then demodulated again in a known manner by a demodulation module 204, which outputs soft bits including the demodulated soft bits SEQ to a descrambling module 206. In step 208, the descrambled soft bits SEQ are processed. To distinguish whether the received linear block coded signal is a partial DTX signal or a non-DTX signal. As described below, the preferred method for detecting the DTX state is based on bit reconstruction. This method is preferred when only one copy or less of the received linear block coded signal is obtained. Then, in decision step 210, it is determined whether the DTX state has occurred. If the determination is positive, then the processing of the received linear block coded signal can be terminated. If the determination is negative, then the descrambling soft bits SEQ of the received linear block coded signal are... The input is fed to rate dematching module 212, which processes the descrambled soft bit SEQ in a known manner to output a dematched soft bit SEQ to decoder module 214, which also generates UCI ACK / NACK bits in a known manner.

[0079] Therefore, it should be understood that the method of the present invention can be implemented in a conventional UCI receiver by any of the changes to the software, firmware and / or hardware of the conventional UCI receiver, preferably by software changes only.

[0080] Reference Figures 14 to 18 , Figures 14 to 18 A method that does not use bit reconstruction is described. This method can be used in conjunction with the bit reconstruction method described below.

[0081] exist Figure 14 and 15 In this configuration, the signal detection module 130 of the UCI receiver 100 / 200 is configured to implement a correlation method without bit reconstruction to distinguish whether the received linear block code signal is a partial DTX signal or a non-DTX signal. This allows determination of whether a (partial) DTX state has occurred.

[0082] Figure 14The main steps of this method 300 are shown. In a first step 312, the descrambled soft bit sequence 302, comprising 128 soft bits, is converted into a plurality of subsequences 304. Preferably, the descrambled soft bit sequence 302 is converted or divided into four subsequences 304 of predetermined length, i.e., each subsequence 304 has a length of 32 soft bits. Preferably, each 32-bit subsequence 304 includes a copy of the descrambled linear block coded signal. If the length of the last subsequence among the plurality of subsequences 304 is less than the predetermined length, then the method may include: padding the last subsequence among the plurality of subsequences 304 with zeros, or ignoring the last subsequence among the plurality of subsequences 304 in subsequent method steps. Preferably, the predetermined length includes the codeword length of the linear block coded signal.

[0083] While it is preferred in method 300 that the grouping and segmentation steps are performed before evaluating the correlation metric, as described below, in one arrangement of method 300, the correlation metric may be determined for two or more of a plurality of subsequences 304, and based on the evaluation of the determined correlation metric, it is then determined whether a (local) DTX state has occurred, i.e., whether the received linear block coded signal exhibits local DTX.

[0084] Local DTX results in randomness among multiple subsequences 304, leading to low correlation among these subsequences 304. In this arrangement of method 300, the method utilizes the low correlation among the multiple subsequences 304 to determine whether the received linear block coded signal exhibits local DTX. This can be achieved by comparing the correlation measures against each other, or by comparing the correlation measures against one or more selected, calculated, or predetermined thresholds Th.

[0085] However, preferably, method 300 includes step 320, grouping the multiple subsequences 304 into subsequence groups 306, also referred to as grouping subsequences 306. In this example, grouping step 320 groups the first subsequence of subsequences 304 into a first subsequence group "Group 1" with a length of 32 soft bits, and the remaining three subsequences 304 into a second subsequence group "Group 2" with a length of 32 soft bits. Group 2 can be obtained by merging corresponding members or bits with the same index in the remaining three subsequences 304. This can be achieved by adding the values ​​of the corresponding soft bits, calculating the average of the corresponding soft bits, calculating the standard value of the corresponding soft bits, or other statistical combination methods. It is understood that the subsequence groups of Group 1 and Group 2 can include different derivatives or combinations of subsequences 304. Preferably, the four subsequences 304 are grouped into only two subsequence groups 306. In one arrangement of method 300, the correlation measure 310 may be determined for two or more subsequence groups 306, and the (local) DTX state may be determined based on the evaluation of the determined correlation measure.

[0086] The advantage of grouping step 320 is that the randomness of channel noise can also lead to low correlation. Therefore, grouping step 320 can average out this randomness, making the randomness caused by (local) DTX more apparent, that is, making it less difficult to detect local DTX signals.

[0087] However, preferably, method 300 further includes step 330, dividing each subsequence group 306 into sequence segments 308, also referred to as segmented grouped subsequences 308. Preferably, as Figure 14 As shown, each of the subsequence groups 306 in groups 1 and 2 is divided into 16-bit sequence segments. Segmentation step 330 may include dividing each subsequence group 306 into a predetermined number of sequence segments 308. The predetermined number of sequence segments is preferably 2. Segmentation step 330 may include forming the first half of the subsequence group 306 into a first sequence segment 308 and the second half of the subsequence group 306 into a second sequence segment 308. In some instances, the entire subsequence group 306 may be considered as comprising a single sequence segment 308. Dividing each subsequence group 306 into a predetermined number of sequence segments 308 may include treating each portion of the subsequence group 306 corresponding to an RB as a sequence segment 308.

[0088] Then, in step 340, the correlation measure 310 of two or more sequence segments 308 of subsequence group 306 is determined and evaluated, and in step 350, based on the evaluation of the determined correlation measure 310, it is detected whether a (local) DTX state has occurred.

[0089] The correlation metric ρ is derived from cosine similarity:

[0090]

[0091] Where x and y are two vectors;

[0092] x·y is the dot product of x and y;

[0093] ║x║ represents the amplitude of x;

[0094] ║y║ represents the amplitude of y.

[0095] Preferably, a correlation metric 310 is calculated for each sequence segment 308 in the two sequence groups 306 (group 1 and group 2). The segment-by-segment correlation metric for segment 1 of group 1 and segment 1 of group 2 may include the product of the correlation metrics 310 for the two segments, wherein the resulting segment 1 correlation metric is compared with a selected, calculated, or predetermined threshold Th to determine whether a local DTX state has occurred. Similarly, the segment-by-segment correlation metric for segment 2 of group 1 and segment 2 of group 2 may include the product of the correlation metrics 310 for the two sequence segments, and then the resulting segment 2 correlation metric is compared with the same threshold Th or their respective different threshold Th. Alternatively, each correlation metric 310 for segment 1 of group 1 and segment 1 of group 2 may be compared with the same threshold Th or their respective different threshold Th, wherein if either comparison indicates that a (local) DTX state has occurred, then this state is determined to have occurred. Once a (local) DTX state is determined to have occurred, processing of the received linear block coded signal can be terminated.

[0096] In one embodiment, a correlation metric 310 can be calculated for paired sequence segments 308. Calculating the correlation metric 310 for each segment of subsequence 304 within subsequence group 306 may include: identifying two subsequence groups 306 as a pair from all subsequence groups 306, and calculating the correlation metric 310 for each segment of the selected pair. Identifying two subsequence groups 306 as a pair from all subsequence groups 306 may include: arbitrarily selecting any two subsequence groups 306 or selecting one subsequence group 306 and designating it as the first subsequence group 306, and then selecting another subsequence group 306 from the remaining subsequence groups 306 as the second subsequence group 306. This may also include: selecting the subsequence group 306 with the lowest expected DTX probability, selecting the subsequence group 306 corresponding to the first RB, or selecting the first-occurring subsequence group 306.

[0097] This method may include obtaining a correlation measure 310 for the pair based on correlation measures of all or part of the sequence segments 308 comprising the pair. This may include calculating a combination of correlation measures of all or part of the sequence segments 308, including the pair of sequence segments 308. The combination of correlation measures may be calculated based on any of the following: the sum of the combined correlation measures, the average of the combined correlation measures, the standard value of the combined correlation measures, the product of the combined correlation measures, or other suitable statistical combination methods.

[0098] Segmentation step 330 utilizes the following facts: such as Figure 8 As shown, some copies of the descrambled signal are only partially randomized, at a granularity of 1 RB. Dividing the copies of the descrambled signal into individual RB segments captures this characteristic, making (local) DTX detection easier.

[0099] In the above context, the correlation measure may include any one or any combination of the following: cosine similarity, correlation coefficient, optional Pearson correlation coefficient, distance feature or value, optional Euclidean distance.

[0100] Soft bits preserve characteristics of linear block-coded signals that hard bits cannot retain, thus offering unexpected advantages in evaluating correlation metrics based on soft bits rather than hard bits. Furthermore, soft bits are less sensitive to signal-to-noise ratio (SNR).

[0101] Therefore, method 300 includes: comparing a determined correlation metric 310 with at least one selected, calculated, or predetermined threshold Th, and determining that a DTX state has occurred if any, some, or all of the determined correlation metric 310 is less than or equal to the at least one threshold Th.

[0102] The at least one threshold Th may include any of the following: a single threshold for all subsequence groups 306, different thresholds for different subsequence groups 306, or multiple thresholds for one or more subsequence groups 306. The multiple thresholds Th for a subsequence group 306 may include a separate threshold Th for each sequence segment 308 of the subsequence group 306.

[0103] Figure 15 This is a schematic block diagram of the improved UCI receiver device 100 / 200, showing the detailed steps of a correlation method that does not use bit reconstruction.

[0104] Method 400 includes: in a first step 405, dividing the 128-bit descrambled soft bits SEQ 302 into N subsequences 304, where N is the number of subsequences 304 constituting the soft bit sequence 302. In the initialization step 410, the iteration value i is set to "1", assuming the value of DTX is "0", that is, assuming that no DTX state occurs, is detected, or is determined.

[0105] In step 415, a grouping step assumption is made, wherein the grouping assumption is preferably based on assumptions derived from potential DTX scenarios. For example, the assumptions may include: the number of RBs that cannot be effectively used due to the occurrence of a local DTX state. Preferably, method 400 is applied iteratively starting from the lowest value of the assumptions. Thus, as... Figure 16 As shown, the assumption could be that an RB is dropped during the transmission of the linear block coded signal, and the next iteration is as follows: Figure 17 As shown, the assumption is that two RBs are dropped during the transmission of the linear block coded signal.

[0106] Once the grouping hypothesis is made, grouping step 420 is performed, dividing the multiple subsequences 304 into subsequence groups 306. This may include: dividing the Nn subsequence groups into a first subsequence group and dividing the remaining n subsequences into a second subsequence group, where n is determined based on the number of RBs that are not used due to the occurrence of a local DTX state.

[0107] In step 425, each of the two resulting subsequence groups 306 is further divided into two 16-bit sequence segments 308.

[0108] In step 430, a relevance measure 310 is calculated for each sequence segment 308. In step 435, if any evaluation of the relevance measure 310 results in the discovery that any relevance measure 310 or the product of any relevance measures is less than or equal to one or more selected, calculated, or predetermined thresholds Th, then the value of DTX is set to "1".

[0109] In decision box 440, a determination is made as to whether DTX equals 1. If the determination is affirmative, a local DTX state is determined to have occurred, and it is treated as a DTX state. Therefore, processing of the received linear block coded signal is terminated without performing the conventional rate dematching and decoding steps. If the determination in decision box 440 is negative, method 400 proceeds to decision box 445, where it is determined whether i is less than N-1. If yes, in step 450, the value of i is incremented by 1, and method 400 iterates to step 415. If it is determined in decision box 445 that i = N, it is determined that the received linear block coded signal does not exhibit local DTX, and the received linear block coded signal continues to undergo the conventional rate dematching and decoding steps to determine the UCI bits of the received linear block coded signal.

[0110] Figure 16 show Figure 15 Steps 415 to 435 of method 400, wherein a first local DTX state is assumed to have occurred, and another DTX assumption is implemented if any correlation metric 310 or the product of any correlation metrics is found to be less than or equal to the threshold Th.

[0111] Figure 17 show Figure 15 Steps 415 to 435 of method 400, wherein assuming a second local DTX state has occurred, a determination is made as to whether the received linear block coded signal exhibits local DTX if any correlation metric 310 or the product of any correlation metrics is found to be less than or equal to a threshold Th.

[0112] Figure 18 show Figure 15 Steps 415 to 435 of method 400 concern a single-symbol RE mapping, where a 32-bit subsequence (a copy of the descrambled linear block coded signal) is carried by two RBs. If only one of the two RBs is DTX, then only half of the subsequence consists of noise. The segmentation step 425 of method 400 is particularly useful for the case of one symbol, in which the number of random soft bits is much smaller than in other cases.

[0113] In method 400, it can be seen that the grouping step 420 may include: dividing a plurality of subsequences 304 into a predetermined number of subsequence groups 306, wherein each subsequence group 306 has one or more sequence segments 308.

[0114] In the above method, the step of comparing one or more correlation metrics with one or more thresholds can be combined with other methods for determining whether a DTX state or a local DTX state has occurred or exists.

[0115] These methods may include determining the occurrence or existence of a DTX state or a local DTX state when any of the following conditions are met: (i) all combined methods for determining the occurrence or existence of a DTX state or a local DTX state indicate the existence of a DTX state or a local DTX state; (ii) at least one of the combined methods for determining the occurrence or existence of a DTX state or a local DTX state indicates the existence of a DTX state or a local DTX state; or at least a predetermined number of the combined methods for determining the occurrence or existence of a DTX state or a local DTX state indicate the existence of a DTX state or a local DTX state.

[0116] Refer again Figure 13 The following describes a method for detecting the DTX state using bit reconstruction in step 208 according to the present invention.

[0117] In a small block code encoder, the 32-bit codeword d i It is generated from the following:

[0118]

[0119] The input includes c with k UCI payload bits. k And 3≤K≤11;

[0120] M is a 32*11 encoding matrix where all elements are either "1" or "0".

[0121] Figure 19 This shows an example of the coding matrix M in Table 5.3.3.3-1 of 3GPP Technical Specification 38.212 V15.13.0.

[0122] Even using the above-described initial description of... Figure 13 Even with subsequence correlation methods, it is difficult to detect local DTX. However, the difficulty increases significantly when only one or fewer copies of the received linear block coded signal are obtained. More specifically, in PUCCH format 2 where only one OFDM symbol and two RBs are obtained, it is very difficult to distinguish local DTX, thus potentially affecting BS scheduling.

[0123] A preferred approach to solving this and other problems is bit reconstruction, which provides a novel method for detecting local DTX with low false alarm rate (FAR) and low false negative rate (MDR). The method for detecting local DTX using bit reconstruction can be derived from... Figure 12 and 13 The improved UCI receiver 100 / 200 is achieved through appropriate software modifications.

[0124] The method for detecting local DTX using bit reconstruction includes: receiving a linear block coded signal on the UL of the UCI receiver 100 / 200; and processing the received linear block coded signal after demapping resource elements (REs) in a known manner to generate a soft bit sequence. This method includes: in the generated soft bit sequence Multiple bits are selected as comparison bits. The selected comparison bits may include the generated soft bit sequence. All bits in, or preferably the generated soft bit sequence A subset of bits. More preferably, the generated soft bit sequence. A subset of bits, a soft bit sequence generated from 32 bits. Starting from the 16th bit, the first bit of the generated soft bit sequence is the 0th bit.

[0125] The generated soft bit sequence (Selecting the comparison bits) can include any of the following: a soft bit sequence generated after RE demapping by descrambling the received linear block coded signal. Descrambled soft bit sequence A subset (to provide descrambled soft bit sequences) A subsequence); Descrambled soft bit sequence A subset of subsequences; descrambled soft bit sequences Bit-by-bit summation or average among multiple subsequences; descrambling soft bit sequences A subset of multiple subsequences, summed bit by bit or averaged.

[0126] In the next step of the bit reconstruction method, the selected comparison bits are compared with the reconstructed soft bit sequence. The corresponding bits in the generated soft bit sequence are compared or correlated. Multiple bits are selected as reconstruction bits, and then a reconstructed soft bit sequence is generated from these multiple bits. Preferably, the selected comparison bit and the selected reconstruction bit are in the generated soft bit sequence The bits do not overlap. The selected reconstructed bits are preferably drawn from the generated soft bit sequence. The first half of the bits are selected. These bits will contain the signal (not noise), even if a local DTX state occurs. In one embodiment, the selected reconstructed bits include the generated soft bit sequence. Bits 1 to 10, where the generated soft bit sequence The first bit is bit 0. Preferably, the selected reconstructed bits never include bit 0, because bit 0 cannot be used together with other bits such as bits 1-10 to uniquely determine the entire code. The selected comparison bits are preferably from the generated soft bit sequence. The comparison bits are selected from the latter half of the bits. In one embodiment, the selected comparison bits include the generated soft bit sequence. Bits 16 through 31, or a subset of these bits, or all bits not used for reconstruction. If a DTX state occurs, these bits will consist of noise.

[0127] From the selected comparison bits and the reconstructed soft bit sequence In the comparison of the corresponding bits, a comparison or correlation metric is determined, and by evaluating the comparison or correlation metric, it is determined whether a (local) DTX state has occurred.

[0128] Determining whether a (local) DTX state has occurred by evaluating this comparison or correlation metric can include any one or more of the following: comparing the sign of the selected comparison bits with the reconstructed soft bit sequence. The symbols of the corresponding bits are compared. If all symbols are the same, it is determined that no DTX state has occurred. The symbol of the selected comparison bit is then compared with the reconstructed soft bit sequence. The symbols of the corresponding bits are compared. If the number of identical symbols is greater than a first threshold value, it is determined that no DTX state has occurred. The selected comparison bits are then compared with the reconstructed soft bit sequence. If the correlation value between the corresponding bits is greater than the first correlation threshold, it is determined that no DTX state has occurred.

[0129] This method may also include: the generated soft bit sequence Multiple bits are selected as verification bits. All or most of the verification bits are preferably drawn from the generated soft bit sequence. The middle portion is selected. Even if a local DTX state occurs, these bits will contain the signal (not noise), and since they cannot be used together with other bits such as bits 1-10 to uniquely identify the entire codeword, they are suitable for verifying whether the reconstruction was successful. However, preferably, the verification bit includes bit 0. In one embodiment, the selected verification bits include bit 0 and bits 11 to 15.

[0130] In one embodiment, the selected verification bits may include some or all of the selected verification bits.

[0131] This method may include: comparing the selected comparison bits with the reconstructed soft bit sequence. Before comparing the corresponding bits in the sequence, the selected verification bits are used to verify the reconstructed soft bit sequence. The reconstruction. If the verification result is invalid, this method may include: terminating the bit reconstruction DTX detection method and passing the linear block coded signal to the rate dematching module 212.

[0132] In one embodiment, the verification process can be an iterative process, including: (a) generating a reconstructed soft bit sequence from selected reconstructed bits. (b) Use the selected verification bits to verify the reconstructed soft bit sequence. If the verification is deemed "invalid", the bit vector will be hard reconstructed. The low-confidence bits in the vector are sign-inverted, and then step (a) is repeated at least once. The bit vector is then hard reconstructed. The low-confidence bits in the data are the reconstructed bit vectors. Bits with medium to small amplitude.

[0133] During the verification process, determining whether a verification is "invalid" may include any one or more of the following: matching the sign of the selected verification bits with the reconstructed soft bit sequence. The symbols of the corresponding bits in the sequence are compared. If all symbols are the same, the method for detecting DTX continues, i.e., the verification is deemed "valid". The symbol of the selected verification bit is then compared with the reconstructed soft bit sequence. The symbols of the corresponding bits are compared. If the number of identical symbols is greater than the second (verification) threshold for identical symbols, the method for detecting DTX continues, determining the selected verification bit and the reconstructed soft bit sequence. If the correlation value between the corresponding bits is greater than the second (verification) correlation value threshold, then the method for detecting DTX continues.

[0134] Reconstructed soft bit sequence To provide reconstructed soft bit sequences This includes: transforming the selected reconstructed bits using a reconstruction matrix R. The reconstruction matrix R is obtained by selecting a square submatrix A from the input encoding matrix M. Only the generated soft bit sequence is used. The first 10 bits can uniquely determine the entire soft bit sequence. Therefore, preferably, the square submatrix A selected from the input coding matrix M includes rows 1-10 and columns 0-9, i.e., A = M. [1:10],[0:9] This method includes: obtaining an inverse matrix A from a submatrix A. -1 Then the inverse matrix A -1 Scale the matrix according to a selected or predetermined scaling factor, for example, scaling factor = 3. Finally, this method includes: scaling the scaled inverse matrix A... -1Multiply by another selected but distinct submatrix of the input encoding matrix M, such as M [0,11:31],[0:9] Therefore, the reconstruction matrix R is obtained as follows: R = [scaling factor]·M [0,11:31],[0:9] A -1 When the scaling factor is 3, R = 3M [0,11:31],[0:9] A -1 Another, but different, submatrix of the input encoding matrix M may include M itself, or rows 0 and 11 and columns 0-9 of M, or both.

[0135] In one embodiment, the reconstruction matrix R is as follows: Figure 20 As shown.

[0136] R is fixed, therefore, online calculation is not required each time it is needed. It can be calculated offline and then stored as a lookup table in the memory 140 of the UCI receiver 100 / 200.

[0137] Figure 21 This is a schematic block diagram of the improved UCI receiver device 100 / 200, showing the steps of the preferred method 500 for generating the reconstructed soft bit sequence. Then use the reconstructed soft bit sequence To determine whether a DTX state has occurred.

[0138] Method 500 includes a first step 505, using the generated soft bit sequence The selected reconstructed bits are used to form the soft reconstructed bit vector. From the generated soft bit sequence The reconstructed bits selected can be obtained by accessing a lookup table in the memory 140 of the UCI receiver 100 / 200, as these can be computed as a one-time offline process. In the next step 510, the reconstructed bit vector... The soft bits are converted into hard bits to form a hard-reconstructed bit vector. By reconstructing the bit vector Converting positive soft bits to "0" will reconstruct the bit vector. The negative soft bits are converted to "1", or vice versa, thus reconstructing the bit vector. The soft bits in the vector can be converted into hard bits to form a hard-reconstructed bit vector. In the next step 515, the bit vector is hard reconstructed. Multiply by the reconstruction matrix R to provide the reconstructed bit vector matrix.

[0139] Hard-reconstructed bit vector Multiply by the reconstruction matrix R to provide the reconstructed bit vector matrix. This may include: looking up the reconstructed matrix R lookup table stored in the memory 140 of the UCI receiver 100 / 200 by index, wherein the index is determined by... Represents a vector or integer value. Hard-reconstructed bit vector. Multiply by the reconstruction matrix R to provide the reconstructed bit vector matrix. The result itself can be stored in memory 140 as a lookup table and accessed later as a lookup run as needed.

[0140] Method 500 includes step 520, which reconstructs the bit vector matrix. The bits are converted to + / - bits through parity to provide a reconstructed soft bit sequence. Reconstruct the bit vector matrix Bits are converted to + / - bits by parity to provide a reconstructed soft bit sequence. This may include: converting odd-value bits to "1" and even-value bits to "-1", or vice versa. In step 525, The selected comparison bits and The corresponding bits are compared or correlated to obtain a comparison or correlation metric. Step 530 includes determining whether the obtained comparison or correlation metric is valid by evaluating it in one of the ways described herein. In decision block 535, if the comparison or correlation metric is invalid, method 500 outputs the DTX result; if the comparison or correlation metric is valid, the processing of the small block coded signal is returned to the rate dematching module 212.

[0141] Figure 22 This paper presents a method 600 for detecting reconstructed bit DTX involving the verification bit reconstruction process. Figure 22 Method 600 can replace Figure 21 Steps 525 to 535 in method 500. Figure 22 The dashed box 601 in the figure includes the bit reconstruction verification process, while Figure 22 The dashed box 602 in the figure includes the bit comparison / correlation process.

[0142] Once the soft bit sequence is reconstructed From the generated soft bit sequence The selected base bits or reconstructed bits are generated in the first step 605 of method 600, from the generated soft bit sequence. The selected verification bits and the reconstructed soft bit sequence The corresponding bits in the sequence are compared or correlated. In decision box 610, the result of bit reconstruction (i.e., the reconstructed soft bit sequence) is determined. Whether it is correct or complete can be determined based on any of the foregoing methods, including, for example, comparing the sign of the selected verification bit with the reconstructed soft bit sequence. If all symbols of the corresponding bits are the same, the verification is considered valid. If the verification is deemed invalid in decision block 610, the small block encoded signal is passed to the rate dematching module 212 in step 615 for rate dematching in a known manner, and then in step 620, small block decoding is also performed in a known manner.

[0143] One advantage of performing the bit verification process before the bit comparison / correlation process is that if the bit verification process returns an invalid decision, it is not necessary to execute the bit reconstruction method 602.

[0144] Although verification method 601 shows that in the event of invalid verification, the small block coded signal is passed to the rate dematching module 212 for rate dematching in step 615, in some embodiments, alternative DTX detection methods may be performed, as previously described. Figures 13 to 18 The method described.

[0145] If the verification is valid in decision box 610, the small block coded signal is passed to bit comparison method 602, and in step 625, the generated soft bit sequence is... The selected comparison bits and the reconstructed soft bit sequence The corresponding bits are compared or correlated. In decision box 630, a determination is made as to whether a (local) DTX state has occurred by evaluating the comparison / correlation metric. The determination can be based on any of the aforementioned methods, including, for example, comparing reconstructed soft bit sequences. If the symbols of the corresponding bits are all the same, it is determined that no DTX state has occurred.

[0146] In decision block 630, if it is determined that no DTX state has occurred, the small packet coded signal is transmitted to the rate dematching module 212 in a known manner in step 615 for rate dematching, and then small packet decoding is also performed in a known manner in step 620. In decision block 630, if it is determined that a DTX state has occurred, the UCI receiver 100 / 200 announces or outputs the DTX state and terminates the processing of the small packet coded signal.

[0147] In one example of the bit reconstruction DTX detection method 602, preferably, from the generated soft bit sequence In this process, a selected comparison bit and a reconstructed soft bit sequence are determined. The correlation value between the corresponding bits in the matrix. The correlation metric ρ is:

[0148]

[0149] in It compares bits;

[0150] yes The range;

[0151] yes The range.

[0152] The correlation metric ρ is compared with the first correlation threshold: ρ≤th c

[0153] If the correlation value ρ is greater than the first correlation threshold th c If the correlation value ρ is less than or equal to the first correlation threshold th, then it is determined that no DTX state has occurred. c Then, a DTX state is determined to have occurred. The first relevant threshold is th. c It is a preset threshold.

[0154] As mentioned above, the reconstructed bit DTX detection method of the present invention can be improved by including some or all of the verification bits as comparison bits.

[0155] After selecting multiple comparison bits, it is possible to implement the reconstructed bit DTX detection method of the present invention by using a subset of the selected comparison bits.

[0156] The reconstructed bit DTX detection method can be implemented in conjunction with other DTX detection methods, including, for example, those previously described regarding... Figures 13 to 18 The subsequence-related methods. Therefore, it is assumed that the number of all DTX detection methods being implemented includes two or more, denoted by "Num", and then Num_th represents a method number threshold. If there is Num DTX The executed DTX detection method announced the occurrence of a (local) DTX state, according to Num DTX If the value is greater than or equal to Num_th (where 1 ≤ Num_th ≤ Num), then a DTX state is declared; otherwise, the small block coded signal is processed normally.

[0157] Linear block codes can be Reed-Muller (RM) codes or supercodes based on RM.

[0158] The present invention provides a UCI receiver device 100 for a wireless communication system. The UCI receiver device 100 includes: a memory 140 for storing machine-readable instructions, and a processor 150 for executing the machine-readable instructions. When the processor 150 executes the machine-readable instructions, it configures the UCI receiver device 100 to implement the aforementioned method of the present invention.

[0159] The present invention provides a non-transitory computer-readable medium 140 for storing machine-readable instructions, wherein, when executed by a processor 150, the machine-readable instructions configure the processor 150 to implement the aforementioned method of the present invention.

[0160] The above-described apparatus can be implemented, at least in part, in software. Those skilled in the art will understand that the above-described apparatus can be implemented, at least in part, using general-purpose computer equipment or using custom-made equipment.

[0161] Here, aspects of the methods and apparatus described herein can be executed on any apparatus, including communication systems. The programmatic aspects of the technology can be considered "products" or "artifacts," typically in the form of executable code and / or associated data, which can be carried or embodied on some type of machine-readable medium. "Storage" type media includes any or all of the memory of a mobile station, computer, processor, etc., or related modules thereof, such as various semiconductor memories, tape drives, disk drives, etc., which can provide storage for software programming at any time. All or part of the software can sometimes be communicated via the Internet or other various telecommunications networks. For example, such communication can load software from one computer or processor into another computer or processor. Therefore, another type of medium that can carry software elements includes light waves, radio waves, and electromagnetic waves, for example, through wired and optical fixed-line networks and through various air links bridging the physical interfaces between local devices. Physical elements carrying such waves, such as wired or wireless links, optical links, etc., can also be considered as media carrying software. As used herein, unless limited to tangible, non-transitory "storage" media, terms such as "computer or machine-readable medium" refer to any medium involved in providing instructions to a processor for execution.

[0162] Although the invention has been shown and described in detail in the accompanying drawings and the foregoing description, the same should be considered illustrative rather than restrictive. It should be understood that what has been shown and described are merely exemplary embodiments and do not limit the scope of the invention in any way. It is understood that any feature described herein can be used with any embodiment. Illustrative embodiments are not mutually exclusive, nor do they exclude other embodiments not listed herein. Therefore, the invention also provides embodiments that include combinations of one or more of the illustrative embodiments described above. Modifications and variations can be made to the invention without departing from the spirit and scope thereof; therefore, only the limitations shown in the appended claims should be imposed.

[0163] In the appended claims and the preceding description of the invention, unless the context requires otherwise due to explicit language or necessary implication, the word “comprising” or variations such as “including” are used in an inclusive sense, indicating the presence of the stated feature but not excluding the presence or addition of further features in various embodiments of the invention.

[0164] It should be understood that if any prior art publication is mentioned in this document, such mention does not imply an admission that the publication constitutes part of common general knowledge in the field.

Claims

1. A method for detecting discontinuous transmission (DTX) state on an uplink control information (UCI) receiver in a wireless communication system, comprising: Linear packet-coded signals are received on the uplink UL of the UCI receiver; After resource element (RE) demapping and before UCI decoding of the received linear block coded signal, the received linear block coded signal is processed to generate a soft bit sequence. ; In the generated soft bit sequence Multiple bits are selected as comparison bits; Compare the selected comparison bits with the reconstructed soft bit sequence The corresponding bits in the reconstructed soft bit sequence are compared. From the generated soft bit sequence It is generated by selecting multiple bits as reconstruction bits; Determine the generated soft bit sequence The selected comparison bits and the reconstructed soft bit sequence A comparison or correlation measure between corresponding bits in the data; Whether a DTX state has occurred is determined by evaluating the identified comparison or correlation metric.

2. The method of claim 1, wherein the step of determining whether a DTX state has occurred includes any one or more of the following: Compare the sign of the selected comparison bits with the reconstructed soft bit sequence. The symbols of the corresponding bits are compared. If the symbols are all the same, it is determined that no DTX state has occurred. Compare the sign of the selected comparison bits with the reconstructed soft bit sequence. The symbols of the corresponding bits are compared. If the number of identical symbols is greater than the first threshold value for identical symbols, it is determined that no DTX state has occurred. Determine the selected comparison bits and the reconstructed soft bit sequence. If the correlation value between the corresponding bits is greater than the first correlation value threshold, it is determined that no DTX state has occurred.

3. The method according to claim 1, wherein, The resulting soft bit sequence includes any of the following: a soft bit sequence generated by descrambling the received linear block coded signal after resource element (RE) demapping. The soft bit sequence generated by descrambling A subset of the subset is used to provide the soft bit sequence generated by descrambling. The subsequence; the soft bit sequence generated by descrambling A subset of the subsequences; the soft bit sequence generated by descrambling. Bit-by-bit summation or average among multiple subsequences; soft bit sequence generated by descrambling. A subset of multiple subsequences, calculated bit by bit or by average.

4. The method of claim 1, wherein the selected comparison bits and the selected reconstruction bits do not overlap.

5. The method according to claim 1, wherein, In the generated soft bit sequence Selecting the plurality of bits as reconstructed bits includes: located in the generated soft bit sequence The first half of the bits, and / or in the resulting soft bit sequence Selecting the plurality of bits as comparison bits includes: located in the generated soft bit sequence The second half of the bits.

6. The method of claim 1, wherein the selected reconstructed bits comprise the resulting soft bit sequence. The first to 10 bits, from which the soft bit sequence is generated The first bit is the 0th bit.

7. The method of claim 1, wherein the selected comparison bits include any of the following: the resulting soft bit sequence All bits; the resulting soft bit sequence A subset of the bits; the generated soft bit sequence starting from the 16th bit of the generated soft bit sequence. A subset of the bits, wherein the first bit of the resulting soft bit sequence is bit 0; and / or all bits not used as the reconstructed bits.

8. The method according to claim 1, further comprising: In the generated soft bit sequence Select multiple bits as verification bits; The generated soft bit sequence The selected verification bits and the reconstructed soft bit sequence Compare the corresponding bits in the data; Based on the generated soft bit sequence The selected verification bits and the reconstructed soft bit sequence The corresponding bits in the comparison determine whether to terminate the DTX detection.

9. The method according to claim 8, wherein, The generated soft bit sequence The selected verification bits and the reconstructed soft bit sequence The steps for comparing the corresponding bits in the data include any one or more of the following: The sign of the selected verification bit is compared with the reconstructed soft bit sequence. The symbols of the corresponding bits in the table are compared. If all symbols are the same, the DTX detection continues. The sign of the selected verification bit is compared with the reconstructed soft bit sequence. The symbols of the corresponding bits in the DTX are compared. If the number of identical symbols is greater than the second threshold value, the DTX detection continues. Determine the selected verification bit and the reconstructed soft bit sequence. If the correlation value between the corresponding bits in the data is greater than the second correlation value threshold, then the DTX detection continues.

10. The method of claim 8, wherein the verification bits include some or all of the selected verification bits, and / or the selected verification bits include the resulting soft bit sequence. The 0th bit and bits 11 through 16, from which the soft bit sequence is generated The first bit is bit 0, and / or the selected verification bits include the resulting soft bit sequence. A subset of the first half of the bits.

11. The method of claim 1, wherein the reconstructed soft bit sequence To provide the reconstructed soft bit sequence ,include: Using the reconstruction matrix R Transform the selected reconstructed bits.

12. The method of claim 11, wherein the reconstruction matrix R It is obtained through the following: From the input encoding matrix M Select a square submatrix A ; From submatrix A Obtain an inverse matrix A -1 ; The inverse matrix A -1 Scale according to the selected or predetermined scaling factor; The scaled inverse matrix A -1 With the input encoding matrix M Multiply another selected but different submatrix.

13. The method of claim 12, wherein the reconstruction matrix is ​​obtained. R It is a one-time operation, and the obtained reconstruction matrix R It is stored in memory as a lookup table.

14. The method of claim 11, wherein the reconstructed soft bit sequence To provide the reconstructed soft bit sequence include: Use the generated soft bit sequence The selected reconstructed bits are used to form a soft reconstructed bit vector. ; The reconstructed bit vector The soft bits are converted into hard bits to form a hard reconstructed bit vector. ; The hard-reconstructed bit vector With the reconstruction matrix R Multiply to provide a reconstructed bit vector matrix R ; The reconstructed bit vector matrix R The bits are converted to + / - bits through parity to provide the reconstructed soft bit sequence. .

15. The method of claim 14, wherein the reconstruction matrix is ​​obtained. R It is a one-time operation, the reconstructed matrix R With the hard-reconstructed bit vector The product of all possible combinations is stored in memory as a lookup table; the method includes any one or more of the following: By reconstructing the bit vector The positive soft bits are converted to "0", and the reconstructed bit vector is... The negative soft bits are converted to "1", or vice versa, the reconstructed bit vector is reconstructed. The soft bits are converted into hard bits to form the hard reconstructed bit vector. ; The hard-reconstructed bit vector With the reconstruction matrix R Multiply to provide the reconstructed bit vector matrix R include: Access the lookup table stored in memory by an index, wherein the index is The vector or integer value represented; The reconstructed bit vector matrix is ​​created by converting odd-valued bits to "1" and even-valued bits to "-1", or vice versa. R The bits are converted to + / - bits through parity to provide the reconstructed soft bit sequence. .

16. The method of claim 15, wherein the resulting soft bit sequence The reconstructed soft bit sequence is generated by selecting the plurality of bits as reconstruction bits. It includes the following iterative process: (a) Generate the reconstructed soft bit sequence from the selected reconstructed bits. ; (b) Using the generated soft bit sequence Multiple verification bits selected in the sequence are used to verify the reconstructed soft bit sequence. ; (c) If the verification is invalid, then hard reconstruct the bit vector. The sign of the low-confidence bits is reversed; (d) Repeat step (a) at least once.

17. The method according to claim 16, wherein, The hard reconstruction bit vector The low-confidence bits in the reconstructed bit vector are the bits in the reconstructed bit vector. The smaller bits in the sequence.

18. The method of claim 1, wherein the method is combined with other methods for detecting DTX status.

19. A method for processing linear block coded signals on an uplink control information (UCI) receiver in a wireless communication system, the method comprising: The linear packet-coded signal is received on the uplink UL of the UCI receiver; After the resource element RE is demapped and before the received linear block coded signal is UCI decoded, the received linear block coded signal is processed to generate a soft bit sequence. Select multiple bits as verification bits from the generated soft bit sequence; The selected verification bit in the generated soft bit sequence is compared with the corresponding bit in the reconstructed soft bit sequence, wherein the reconstructed soft bit sequence is generated by selecting multiple bits as reconstructed bits from the generated soft bit sequence; By comparing the selected verification bit of the generated soft bit sequence with the corresponding bit in the reconstructed soft bit sequence, it is determined whether to compare the selected comparison bit of the generated soft bit sequence with the corresponding bit in the reconstructed soft bit sequence.

20. An uplink control information (UCI) receiver in a wireless communication system, the UCI receiver comprising: Memory that stores machine-readable instructions; as well as A processor for executing the machine-readable instructions, when the processor executes the machine-readable instructions, configures the UCI receiver to: Linear packet-coded signals are received on the uplink UL of the UCI receiver; After the resource element RE is demapped and before the received linear block coded signal is UCI decoded, the received linear block coded signal is processed to generate a soft bit sequence. Select multiple bits as comparison bits from the generated soft bit sequence; The selected comparison bit is compared with the corresponding bit in the reconstructed soft bit sequence, wherein the reconstructed soft bit sequence is generated by selecting multiple bits as reconstructed bits from the generated soft bit sequence; Determine the comparison or correlation measure between the selected comparison bits of the generated soft bit sequence and the corresponding bits in the reconstructed soft bit sequence; Whether a DTX state has occurred is determined by evaluating the identified comparison or correlation metric.

Images