Cyclic shift-based mapping scheme for uplink control transmission

Abstract

The present disclosure describes a method, system and device for a mapping scheme for uplink control transmission based on cyclic shift in mobile communication technology. An exemplary method for wireless communication includes: a wireless device sends an M-bit payload through a control channel using N symbols, where M and N are positive integers, wherein a base sequence (u(n,m)) and a cyclic shift (n) of the base sequence are used. cs (n,m)) represents each of the N symbols, where n = 0, 1, ... (N-1) indexes the symbols in the N symbols, where m = 0, 1, ... (2 M ‑1) indexes the combination set, where m and n are non-negative integers, where the cyclic shift of the j-th symbol is based on the cyclic shift of the (j‑1)-th symbol, and where j = 1, 2, ... (N‑1) is a positive integer.

Description

Technical Field

[0001] This document relates generally to wireless communications. Background Art

[0002] Wireless communication technology is moving the world towards an increasingly connected and networked society. The rapid development and technological advancement of wireless communications has led to a greater need for capacity and connectivity. Other aspects such as energy consumption, equipment cost, spectrum efficiency and latency are also important to meet the needs of various communication scenarios. Compared with existing wireless networks, next-generation systems and wireless communication technologies need to provide support for more users and devices, as well as support for different code rates and payload sizes, thereby improving coverage enhancement. Summary of the invention

[0003] The present document relates to methods, systems and devices for a cyclic shift-based mapping scheme for uplink control transmission in mobile communication technologies, including fifth generation (5G) and new radio (NR) communication systems.

[0004] In one exemplary aspect, a wireless communication method is disclosed. The method includes: a wireless device transmits an M-bit payload through a control channel using N symbols, where M and N are positive integers, wherein a base sequence (u(n, m)) and a cyclic shift (n) of the base sequence are used. cs (n, m)) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, where m=0, 1, ... (2 M -1) indexes the combination set, where m and n are non-negative integers, where the cyclic shift of the jth symbol is based on the cyclic shift of the (j-1)th symbol, and where j=1, 2, ... (N-1) is a positive integer.

[0005] In another exemplary aspect, a wireless communication method is disclosed. The method includes: a network node receives an M-bit payload on N symbols from a wireless device via a control channel, where M and N are positive integers; and after receiving, sending one or more subsequent communications to the wireless device via a data channel, wherein a base sequence (u(n, m)) and a cyclic shift (n) of the base sequence are used. cs (n, m)) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, where m=0, 1, ... (2 M -1) indexes the combination set, where m and n are non-negative integers, where the cyclic shift of the jth symbol is based on the cyclic shift of the (j-1)th symbol, and where j=1, 2, ... (N-1) is a positive integer.

[0006] In yet another exemplary aspect, a wireless communication method is disclosed. The method includes: a wireless device transmits an M-bit payload through a control channel using N symbols, where M and N are positive integers, wherein a base sequence (u(n, m)) and a cyclic shift (n) of the base sequence are used. cs (n, m)) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, where m=0, 1, ... (2 M -1) indexes the combination set, where m and n are non-negative integers, and where the cyclic shift of each of the N symbols is based on one or more pseudo-random binary sequences.

[0007] In another exemplary aspect, a wireless communication method is disclosed. The method includes: a network node receives an M-bit payload on N symbols from a wireless device via a control channel, where M and N are positive integers; and after receiving, sending one or more subsequent communications to the wireless device via a data channel, wherein a base sequence (u(n, m)) and a cyclic shift (n) of the base sequence are used. cs (n, m)) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, where m=0, 1, ... (2 M -1) indexes the combination set, where m and n are non-negative integers, and where the cyclic shift of each of the N symbols is based on one or more pseudo-random binary sequences.

[0008] In yet another exemplary aspect, the above method is implemented in the form of processor executable code and stored in a computer readable program medium.

[0009] In yet another exemplary embodiment, an apparatus configured or operable to perform the above method is disclosed.

[0010] The above and other aspects and implementations thereof are described in more detail in the drawings, the description and the claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] Figure 1 An example of a base station (BS) and a user equipment (UE) in wireless communication is shown.

[0012] Figure 2 Examples of sequence generation using mapping schemes with different cyclic shifts are shown.

[0013] Figure 3 An example of a wireless communication method is shown.

[0014] Figure 4 Another example of a wireless communication method is shown.

[0015] Figure 5 is a block diagram of a portion of an apparatus that may be used to implement the methods and / or techniques of the presently disclosed technology. DETAILED DESCRIPTION

[0016] The demand for the 4th Generation Mobile Communication Technology (4G), Long-Term Evolution (LTE), Long-Term Evolution Advanced (LTE-Advanced / LTE-A), and the 5th Generation Mobile Communication Technology (5G) is increasing. From the current development trend, 4G and 5G systems are studying features that support enhanced mobile broadband, ultra-high reliability, ultra-low latency transmission, and massive connections.

[0017] As the basic building blocks for implementing the NR system, the Physical Uplink Control Channel (PUCCH) and / or the Physical Shared Uplink Channel (PUSCH) are used to transmit uplink control information (UCI), which includes:

[0018] - In response to a Hybrid Automated Repeat Request-Acknowledgement (HARQ-ACK) feedback of downlink data transmission;

[0019] - Scheduling Request (SR), used to request resources for uplink data transmission;

[0020] —Channel State Information (CSI) report, which is used for link adaptation and downlink data scheduling. More specifically, the CSI report may include the Channel Quality Indicator (CQI), the Pre-coding Matrix Indicator (PMI), the Rank Indicator (RI), the Layer Indicator (LI), and beam-related information.

[0021] In LTE, PUCCH is transmitted in one or more physical resource blocks (PRBs) at the edge of the system bandwidth, following a mirroring pattern with slot-level frequency hopping within a subframe to maximize frequency diversity. In NR, a more flexible PUCCH structure needs to be considered to target different applications and use cases, especially to support low-latency applications such as URLLC.

[0022] If the UE is not transmitting on PUSCH and the UE is transmitting UCI in PUCCH using, for example, the following format:

[0023] -PUCCH format 0, if

[0024] - Transmit more than 1 or 2 symbols,

[0025] - The number of HARQ-ACK information bits (HARQ-ACK / SR bits) for which SR is positive or negative is 1 or 2

[0026] -PUCCH format 1, if

[0027] - Transmit more than 4 symbols,

[0028] -The number of HARQ-ACK / SR bits is 1 or 2

[0029] -PUCCH format 2, if

[0030] - the transmission exceeds 1 or 2 symbols,

[0031] -The number of UCI bits is greater than 2

[0032] -PUCCH format 3, if

[0033] - Transmission exceeds 4 symbols,

[0034] - the number of UCI bits is greater than 2,

[0035] -PUCCH resources do not include orthogonal cover codes

[0036] -PUCCH format 4, if

[0037] - Transmission exceeds 4 symbols,

[0038] - the number of UCI bits is greater than 2,

[0039] -PUCCH resources include orthogonal cover codes.

[0040] In some embodiments, for PUCCH formats supporting more than two bits, two coding schemes are applied depending on the payload size of the UCI. For example, when the input payload size is between 3 and 11 bits, a block code based on Reed-Muller Codes is applied; and when it is greater than 11 bits, a Polar code is used. Since block codes are not the best coding scheme at low code rates for small and medium payloads, embodiments of the disclosed technology advantageously provide enhanced performance in these cases, especially in coverage enhancement scenarios.

[0041] Figure 1 An example of a wireless communication system (e.g., LTE, 5G, or New Radio (NR) cellular network) including a BS 120 and one or more user equipments (UEs) 111, 112, and 113 is shown. In some embodiments, uplink transmissions (131, 132, 133) include cyclically shifted base sequences that constitute a mapping scheme for uplink control transmissions. The UE may be, for example, a smartphone, a tablet, a mobile computer, a machine to machine (M2M) device, a terminal, a mobile device, an Internet of Things (IoT) device, etc.

[0042] This document uses examples from the 3GPP New Radio (NR) network architecture and 5G protocols only to facilitate understanding, and the disclosed techniques and embodiments may be implemented in other wireless systems that use other communication protocols other than the 3GPP protocols.

[0043] In some embodiments, the PUCCH format may be configured to occupy 1 resource block (RB) in the frequency domain and 14 symbols in the time domain, such as Figure 2 The short sequence used in the frequency domain is a sequence of length 12. According to the following equation, the base sequence Cyclic shift n cs To define a short sequence:

[0044]

[0045] Here, M ZC is the length of the sequence, and MZC =12 represents 1 RB. cs Value, defining multiple sequences from a single base sequence.

[0046] In some embodiments, the low PAPR (Peak-to-Average-Power Ratio) sequence defined in the current NR specification can be multiplexed with the base sequence The base sequence is given by:

[0047]

[0048] In the example, The values ​​are shown in Table 1 below.

[0049] Table 1: When MZC = 12 An exemplary definition of

[0050]

[0051]

[0052] In some embodiments, the combination set m{<u(n,m), n cs (n, m)>, n=0, 1, 2, ..., N-1} is used to represent the information of one symbol (or bit). The embodiments of the disclosed technology are configured for small and medium payload sizes, such as 3 to 11 bits, so combinations based only on cyclic shifts may be sufficient, because when N=14 and M=11, 12 N >>2 M Here, u(n,m)=u(n′,m), n,n′=0,1,2,....N-1,n≠n′, and the combination set m can be simplified to {n cs (n, m), n=0, 1, 2, ..., N-1}. According to some embodiments, the information carried on the PUCCH is mapped one-to-one with the combination set, regardless of whether the information is represented as a bit sequence or converted to a decimal value.

[0053] In some embodiments, different cyclic shifts are used for different time domain symbols to represent different information. Figure 1 As shown, the sequence z(·) to be mapped to the allocated resources for PUCCH transmission can be obtained according to the following equation:

[0054]

[0055] Here, N is the number of OFDM symbols used for the PUCCH format (in this example, N=14). In some embodiments, the sequence z(·) may be mapped to the allocated resources of the PUCCH in a "frequency first, time second" order. In other embodiments, the sequence z(·) may be mapped to the allocated resources of the PUCCH in a "time first, frequency second" order.

[0056] In this way, different combination sets (or equivalently, different CS hopping sequences n) can be used. cs (n, m)) is used to indicate different uplink control information to generate a sequence z(·) for PUCCH transmission.

[0057] Some embodiments of the disclosed technology define uplink control information and a short sequence of CS hopping sequences n for transmission on each time domain symbol of the PUCCH. cs Assuming that the payload of uplink control information is between 3 bits and 11 bits, different numbers of CS hopping sequences may be required to support different payload sizes. For symbol representation, the length of the UCI payload is represented as M bits, and the number of CS hopping sequences is assumed to be N. CSHop =2 M .

[0058] In some embodiments, the cyclic shift (represented by its decimal value) for symbol index n for UCI bit m may be determined as:

[0059]

[0060] or

[0061]

[0062] Here, B is the number of cyclic shifts used for the base sequence, A and D are constants greater than zero, n′ and C are constants greater than zero or functions based on the values ​​of m and / or n, and n cs (n, m) = M(T cs (n, m)) represents T cs (n, m) and n cs A mapping between , where M(·) outputs the cyclic shift of its argument for sequence generation.

[0063] In this example, B = M ZC = 12, which is equal to the length of the sequence of z(·). In this case, all cyclic shifts available for the sequence are used, and T cs (n, m) and n cs The mapping between can be simplified to n cs =T cs (n, m).

[0064] In another example, B=8, which is less than the length of the sequence z(·). In this case, not all cyclic shifts available for the sequence are used, and T can be predefined. cs (n, m) and n cs For example, T cs (n, m) and n cs The pre-definition of the mapping between them can be shown in Table 2.

[0065] Table 2: T cs (n, m) and n cs The mapping between

[0066] <![CDATA[T cs (n,m)]]> <![CDATA[n cs ]]> 0 0 1 1 2 2 3 3 4 4 5 6 6 8 7 10

[0067] In some embodiments, A and D are selected from prime numbers between 10,000 and 100,000, for example, they may be selected from Table 3. In other embodiments, a numerical search may be performed to determine the allowed values ​​of A and D.

[0068] In some embodiments, C is a parameter for the UE. In an example, C may be related to a Cell Radio Network Temporary Identifier (C-RNTI) of the UE.

[0069] In some embodiments, the number of identical elements in the same position in any pair of CS hopping sequences within a CS hopping pattern (referring to a set of CS hopping sequences) is denoted as K. Table 3 also shows the maximum K value for different (A, D, m) combinations, assuming n′=0, K=1, B=12, and n cs =T cs (n, m).

[0070] Table 3: Exemplary maximum K values ​​for A, D and m

[0071]

[0072] In another example, Table 4 shows that A=39827, D=62039, n′=0, K=1, B=12, and n cs =T cs The cyclic shift sequence (n) in the case of (n, m) cs ).

[0073] Table 4: Example cyclic shift sequences for the case where A=39827 and D=62039

[0074]

[0075]

[0076] In yet another example, Table 5 shows that A=39827, D=62039, n′=0, K=1, B=12, and n cs =T cs The cyclic shift sequence (n) in the case of (n, m) cs ).

[0077] Table 5: Example cyclic shift sequences for the case where A=39827 and D=62039

[0078]

[0079] In yet another example, Table 6 shows that A=25321, D=11311, n′=0, K=1, B=12, and n cs =T cs The cyclic shift sequence (n) in the case of (n, m) cs ).

[0080] Table 6: Example cyclic shift sequences for the case where A=25321 and D=11311

[0081]

[0082] Tables 3 to 5 show examples of cyclic shift sequences, where the cyclic shift of the nth symbol is based on the cyclic shift of the (n-1)th symbol, which advantageously ensures that if there is the same value at the kth position, then the value at the (k+1)th position will be different. This makes it possible to always avoid the situation where two consecutive positions are the same on two symbols.

[0083] In some embodiments, for a PUCCH with N1 symbols (N1<N), the CS hopping pattern may be shortened based on the basic pattern to meet the target length. In the example, CS mapping on the first N1 symbols among the N symbols is adopted.

[0084] In some embodiments, the CS hopping sequence described herein may be an initial CS hopping sequence used to generate a sequence.A symbol-based CS hopping sequence for a cell may be applied on top of the initial CS hopping sequence.

[0085] In some embodiments, the PUCCH format can be configured to occupy 1 resource block (RB) in the frequency domain and 14 symbols in the time domain. The short sequence used in the frequency domain is a sequence of length 12. According to equation 1, the base sequence Cyclic shift n csDefine a short sequence. As defined in Equation 2, the low PAPR sequence defined in the current NR specification can be reused as the base sequence And among them The values ​​are shown in Table 1.

[0086] In some embodiments, the cyclic shift employed in symbol index n for UCI bit m may be expressed (expressed as a decimal value) as:

[0087]

[0088] where c(k) is a binary sequence and is defined as follows:

[0089]

[0090] Where Nc is an integer, and the first m sequence x 1 (k) should be x 1 (0) = 1, x 1 (1) = x 1 (2) = ... = x 1 (30) = 0 initialization. The second m sequence x 2 The initialization of (k) depends on the UCI. For example, if the UCI bits are [a 0 , a 1， , ..., a M-1 ], then x 2 The initialization of (k) will be: x 2 (0) = a 0 , x 2 (1) = a 1 , x 2 (2) = a 2 , ..., x 2 (M-1) = a M-1 , x 2 (M) = x 2 (M+1)=...=x 2 (30)=0.

[0091] In this example, N c Selected from Table 7, the table also shows the c , m) the maximum K value of the combination.

[0092] Table 7: For N c and the maximum K value for the example values ​​of m

[0093]

[0094] In the example, Table 8 shows N c =7487 and B = 12 when the cyclic shift sequence (ncs ).

[0095] Table 8: N c =7487 and B=12

[0096]

[0097]

[0098] In the example, Table 9 shows N c =3447 and B = 12 when the cyclic shift sequence (n cs ).

[0099] Table 9: N c =3447 and B=12

[0100]

[0101] Tables 8 and 9 show examples where the cyclic shift depends on a pseudo-random sequence. In the examples, the pseudo-random sequence is a maximum length sequence (also called an m-sequence) generated using a maximum linear feedback shift register (LFSR).

[0102] Figure 3 An example of a wireless communication method 300 for a cyclic shift-based mapping scheme for uplink control transmission is shown. The method 300 includes: in operation 310, a wireless device transmits an M-bit payload through a control channel using N symbols, where M and N are positive integers.

[0103] In some embodiments, a base sequence (u(n, m)) and a cyclic shift of the base sequence (n cs (n, m)) represents each of the N symbols, n=0, 1, ... (N-1) indexes the symbols in the N symbols, m=0, 1, ... (2 M -1) is used to index the combination set, m and n are non-negative integers, the cyclic shift of the jth symbol is based on the cyclic shift of the (j-1)th symbol, and j=1, 2, ... (N-1) is a positive integer. In other embodiments, m is selected from the values ​​0, 1, ... (2 M -1) and index the combined set.

[0104] In some embodiments, the cyclic shift (n cs (n, m)) is determined as n cs (n, m) = M(T cs (n,m)), T cs(n, m) = mod(Y n , B), Y n =mod(AY n-1 , D), Y -1 =m+C, where Y i is the i-th symbol, and where A, B, C and D are positive integers.

[0105] In some embodiments, the cyclic shift (n cs (n, m)) is determined as n cs (n, m) = M(T cs (n,m)), T cs (n, m) = mod(Y n+n ,,B),Y n =mod(AY n-1 , D), Y -1 =m+C, where Y i is the i-th symbol, and where A, B, C, D and n′ are positive integers.

[0106] In some embodiments, B is the number of cyclic shifts used for the base sequence.

[0107] In some embodiments, B=12.

[0108] In some embodiments, C is a predetermined constant.

[0109] In some embodiments, C is a wireless device specific parameter.

[0110] In some embodiments, C depends on a Cell Radio Network Temporary Identifier (C-RNTI) associated with the wireless device.

[0111] In some embodiments, A and D are prime numbers.

[0112] In some embodiments, (A, D) is selected from (39827, 10289), (39827, 11311), (39827, 12373), (39827, 17851), (39827, 19051), (39827, 21727), (39827, 27077), (39827, 41813), (39827, 62039), (39827, 62273), (39827, 65537), (39827, 95329), (10331, 11311), (12919, 11311), ( The group consisting of (17041, 11311), (22721, 11311), (25321, 11311), (26437, 11311), (45343, 11311), (47963, 11311), (55843, 11311), (65147, 11311), (65167, 11311), (90359, 11311), (93187, 11311), (11689, 65537), (12671, 65537), (23827, 65537) and (50159, 65537).

[0113] In some embodiments, a base sequence (u(n, m)) and a cyclic shift of the base sequence (n cs (n, m)) represents each of the N symbols, n=0, 1, ... (N-1) indexes the symbols in the N symbols, m=0, 1, ... (2 M -1) is used to index the combination set, m and n are non-negative integers, and the cyclic shift of each of the N symbols is based on one or more pseudo-random binary sequences. In other embodiments, m is selected from the values ​​0, 1, ... (2 M -1) and index the combined set.

[0114] In some embodiments, the cyclic shift (n cs (n, m)) is determined as The one or more pseudo-random binary sequences include c(k), x 1 (k) and x 2 (k), which is defined as c(k)=mod(x 1 (k+N c )+x 2 (k+N c ), 2), x 1 (k+31)=mod(x 1 (k+3)+x 1 (k), 2), x 2 (k+31)=mod(x2 (k+3)+x 2 (k+2)+x 2 (k+1)+x 2 (k), 2), where N c is a positive integer.

[0115] In some embodiments, x 1 (k) Initialized to x 1 (0) = 1, x 1 (1) = x 1 (2) =… = x 1 (30)=0.

[0116] In some embodiments, N c Equal to 3447, 3468, 3470, 3486, 4564, 6021, 6021, 6253, 7166, 7487, 8427, 8482, 9611 or 9627.

[0117] In some embodiments, x 2 The initialization of (k) is based on uplink control information (UCI).

[0118] In some embodiments, the UCI includes a bit sequence [a 0 , a 1 , ..., a M-1 ], and x 2 (k) Initialized to x 2 (0) = a 0 , x 2 (1) = a 1 , x 2 (2) = a 2 , …, x 2 (M-1) = a M-1 , and x 2 (M) = x 2 (M+1)=...=x 2 (30)=0.

[0119] Figure 4 Another example of a wireless communication method 400 for a cyclic shift-based mapping scheme for uplink control transmission is shown. The method 400 includes: in operation 410, a network node receives an M-bit payload on N symbols from a wireless device via a control channel, where M and N are positive integers.

[0120] The method 400 includes, at operation 420, sending one or more subsequent communications to the wireless device via the data channel after receiving.

[0121] In some embodiments, a base sequence (u(n, m)) and a cyclic shift of the base sequence (n cs (n, m)) represents each of the N symbols, n=0, 1, ... (N-1) indexes the symbols in the N symbols, m=0, 1, ... (2 M -1) indexes the combination set, m and n are non-negative integers, the cyclic shift of the jth symbol is based on the cyclic shift of the (j-1)th symbol, and j=1, 2, ... (N-1) is a positive integer.

[0122] In some embodiments, a base sequence (u(n, m)) and a cyclic shift of the base sequence (n cs (n, m)) represents each of the N symbols, n=0, 1, ... (N-1) indexes the symbols in the N symbols, m=0, 1, ... (2 M -1) indexing the combination set, m and n are non-negative integers, and the cyclic shift of each of the N symbols is based on one or more pseudo-random binary sequences.

[0123] In some embodiments, the configuration or predefined 2 M combination sets, so that in 2 M There are at most K elements in common between any two combinations of combinations, where K is a non-negative integer.

[0124] In some embodiments, the relative position of each of the at most K elements in each of any two combination sets is the same.

[0125] In some embodiments, transmission is performed on a set of resources of a control channel, and wherein mapping on the set of resources is in the order of "frequency first, time second".

[0126] In some embodiments, the control channel is PUCCH.

[0127] In some embodiments, the combination set includes a base sequence and a cyclic shift for representing a corresponding one of the N symbols.

[0128] In some embodiments, Orthogonal Frequency Division Multiplexing (OFDM) modulation is used on multiple subcarriers to modulate N symbols.

[0129] In some embodiments, Discrete Fourier Transform Spread Orthogonal Frequency Division Multiplexing (DFT-S-OFDM) modulation is used on multiple subcarriers to modulate N symbols.

[0130] Figure 5 5 is a block diagram of a portion of an apparatus according to some embodiments of the presently disclosed technology. An apparatus 505, such as a base station or a wireless device (or UE), may include a processor electronic device 510 (such as a microprocessor that implements one or more techniques proposed in this document). The apparatus 505 may include a transceiver electronic device 515 to send and / or receive wireless signals through one or more communication interfaces (such as one or more antennas 520). The apparatus 505 may include other communication interfaces for sending and receiving data. The apparatus 505 may include one or more memories (not explicitly shown) configured to store information such as data and / or instructions. In some implementations, the processor electronic device 510 may include at least a portion of the transceiver electronic device 515. In some embodiments, the apparatus 505 is used to implement at least part of the disclosed techniques, modules, or functions.

[0131] Some of the embodiments described herein are described in the general context of methods or processes, which can be implemented in one embodiment by a computer program product (including computer executable instructions, such as program code, executed by a computer in a networked environment) contained in a computer-readable medium. Computer-readable media may include removable and non-removable storage devices, including but not limited to read-only memory (ROM), random access memory (RAM), compact disc (CD), digital versatile disc (DVD), etc. Therefore, computer-readable media may include non-transitory storage media. Generally, program modules may include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. Computer executable instructions or processor executable instructions, related data structures, and program modules represent examples of program codes for executing the steps of the methods disclosed herein. The specific order of these executable instructions or related data structures represents an example of corresponding actions for implementing the functions described in these steps or processes.

[0132] Some disclosed embodiments may be implemented as devices or modules using hardware circuits, software, or a combination thereof. For example, a hardware circuit implementation may include discrete analog and / or digital components integrated as a part of a printed circuit board. Alternatively or additionally, the disclosed components or modules may be implemented as application specific integrated circuits (ASIC) and / or field programmable gate arrays (FPGA) devices. Some implementations may additionally or alternatively include a digital signal processor (DSP), which is a dedicated microprocessor having an optimized architecture for the operational requirements of digital signal processing associated with the functions disclosed in the present application. Similarly, various components or subcomponents within each module may be implemented in software, hardware, or firmware form. Any connection method and medium known in the art (including but not limited to communication on the Internet, wired, or wireless networks using suitable protocols) may be used to implement the connection between modules and / or components within the module.

[0133] Although this document contains many details, these details should not be understood as limitations on the scope of the claimed invention or the content that may be claimed, but should be understood as descriptions of features peculiar to a particular embodiment. Certain features described in the context of different embodiments in this document may also be implemented in a single embodiment in the form of a combination. On the contrary, the various features described in the context of a single embodiment may also be implemented in multiple embodiments respectively or in the form of any suitable sub-combination. In addition, although the above may describe features as working in certain combinations and even initially claiming these features, one or more features from the combination may be deleted from the claimed combination in some cases, and the claimed combination may be for a sub-combination or a variant of a sub-combination. Similarly, although operations are described in a specific order in the accompanying drawings, it should not be understood as requiring these operations to be performed in the specific order or order shown or requiring all operations shown to be performed to obtain desired results.

[0134] Only a few implementations and examples are described, and other implementations, enhancements, and variations may be implemented based on what is described and illustrated in this disclosure.

Claims

1. A method for wireless communication, comprising: The wireless device transmits an M-bit payload via a control channel using N symbols, where M and N are positive integers. The base sequence ( ) and the cyclic shift of the base sequence ( ) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, Where m = 0, 1, ... (2M-1) is the combination set of the base sequence and the cyclic shift m {< >}Index, where m and n are non-negative integers, and wherein the cyclic shift of the jth symbol is based on the cyclic shift of the (j-1)th symbol, and wherein j=1, 2, ... (N-1) is a positive integer, and wherein the cyclic shift of the base sequence ( ) is determined as: ,in Outputs a circular shift of its argument; ,or ; ； ； in is the i-th symbol, and among them A, B, C, D and is a positive integer.

2. The method of claim 1, wherein B is the number of cyclic shifts used for the base sequence.

3. The method according to claim 2, wherein B=12. The method according to claim 1 , wherein C is a predetermined constant. The method of claim 1 , wherein C is a parameter specific to the wireless device. The method of claim 5 , wherein C depends on a Cell Radio Network Temporary Identifier (C-RNTI) associated with the wireless device.

7. The method of claim 1, wherein A and D are prime numbers.

8. The method of claim 7, wherein (A, D) is selected from (39827, 10289), (39827, 11311), (39827, 12373), (39827, 17851), (39827, 19051), (39827, 21727), (39827, 27077), (39827, 41813), (39827, 62039), (39827, 62273), (39827, 65537), (39827, 95329), (10331, 11311), (12919, 113 The group consisting of (11), (17041, 11311), (22721, 11311), (25321, 11311), (26437, 11311), (45343, 11311), (47963, 11311), (55843, 11311), (65147, 11311), (65167, 11311), (90359, 11311), (93187, 11311), (11689, 65537), (12671, 65537), (23827, 65537) and (50159, 65537).

9. The method according to any one of claims 1 to 8, wherein the configuration or predefined The combination set, so that There are at most K elements in common between any two of the combination sets, and K is a non-negative integer.

10. The method according to claim 9, wherein the relative position of each of the at most K elements in each of the any two combination sets is the same.

11. The method of claim 1 , wherein transmission is performed on a set of resources of the control channel, and wherein mapping on the set of resources is in the order of “frequency first, time second”.

12. The method according to any one of claims 1 to 8, wherein the control channel is a Physical Uplink Control Channel (PUCCH).

13. The method according to any one of claims 1 to 8, wherein the combination set includes the base sequence and the cyclic shift for representing a corresponding one of the N symbols.

14. The method according to any one of claims 1 to 8, wherein Orthogonal Frequency Division Multiplexing (OFDM) modulation is adopted on a plurality of subcarriers to modulate the N symbols.

15. The method according to any one of claims 1 to 8, wherein discrete Fourier transform spread orthogonal frequency division multiplexing DFT-S-OFDM modulation is adopted on a plurality of subcarriers to modulate the N symbols.

16. A method for wireless communication, comprising: The network node receives a payload of M bits on N symbols from the wireless device via a control channel, where M and N are positive integers; as well as after receiving, sending one or more subsequent communications to the wireless device via the data channel, The base sequence ( ) and the cyclic shift of the base sequence ( ) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, Where m = 0, 1, ... (2M-1) is the combination set of the base sequence and the cyclic shift m {< >}Index, where m and n are non-negative integers, wherein the cyclic shift of the jth symbol is based on the cyclic shift of the (j-1)th symbol, and wherein j=1, 2, ... (N-1) is a positive integer, and wherein the cyclic shift of the base sequence ( ) is determined as: ,in Outputs a circular shift of its argument; ,or ; ； ； in is the i-th symbol, and among them A, B, C, D and is a positive integer. The method of claim 16 , wherein B is the number of cyclic shifts used for the base sequence.

18. The method of claim 17, wherein B=12. The method of claim 16 , wherein C is a predetermined constant.

20. The method of claim 16, wherein C is a parameter specific to the wireless device.

21. The method of claim 20, wherein C depends on a Cell Radio Network Temporary Identifier (C-RNTI) associated with the wireless device.

22. The method of claim 16, wherein A and D are prime numbers.

23. The method of claim 22, wherein (A, D) is selected from (39827, 10289), (39827, 11311), (39827, 12373), (39827, 17851), (39827, 19051), (39827, 21727), (39827, 27077), (39827, 41813), (39827, 62039), (39827, 62273), (39827, 65537), (39827, 95329), (10331, 11311), (12919, 11 The group composed of (17041, 11311), (22721, 11311), (25321, 11311), (26437, 11311), (45343, 11311), (47963, 11311), (55843, 11311), (65147, 11311), (65167, 11311), (90359, 11311), (93187, 11311), (11689, 65537), (12671, 65537), (23827, 65537) and (50159, 65537).

24. The method according to any one of claims 16 to 23, wherein the configuration or predefined The combination set, so that There are at most K elements in common between any two of the combination sets, and K is a non-negative integer.

25. The method of claim 24, wherein the relative position of each of the at most K elements in each of the any two combination sets is the same.

26. The method according to any one of claims 16 to 23, wherein the control channel is a Physical Uplink Control Channel (PUCCH).

27. The method according to any one of claims 16 to 23, wherein the combination set includes the base sequence and the cyclic shift for representing a corresponding one of the N symbols.

28. The method according to any one of claims 16 to 23, wherein Orthogonal Frequency Division Multiplexing (OFDM) modulation is adopted on a plurality of subcarriers to modulate the N symbols.

29. The method according to any one of claims 16 to 23, wherein discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-S-OFDM) modulation is adopted on a plurality of subcarriers to modulate the N symbols.

30. A method for wireless communication, comprising: The wireless device transmits an M-bit payload via a control channel using N symbols, where M and N are positive integers. The base sequence ( ) and the cyclic shift of the base sequence ( ) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, Where m = 0, 1, ... (2M-1) is the combination set of the base sequence and the cyclic shift m {< >}Index, where m and n are non-negative integers, and wherein the cyclic shift of each of the N symbols is based on one or more pseudo-random binary sequences, and wherein the cyclic shift of the base sequence ( ) is determined as: wherein the one or more pseudo-random binary sequences include those defined as follows , and : in is a positive integer.

31. The method according to claim 30, wherein Initialized to: 。 32. The method according to claim 30 or 31, wherein Equal to 3447, 3468, 3470, 3486, 4564, 6021, 6021, 6253, 7166, 7487, 8427, 8482, 9611 or 9627.

33. The method according to claim 30 or 31, wherein The initialization is based on the uplink control information UCI.

34. The method of claim 33, wherein the UCI comprises a bit sequence , and among them will Initialized to: and 。 35. The method according to claim 30 or 31, wherein the configuration or predefined The combination set, so that There are at most K elements in common between any two of the combination sets, and K is a non-negative integer.

36. The method of claim 35, wherein the relative position of each of the at most K elements in each of the any two combination sets is the same.

37. The method of claim 30, wherein transmission is performed on a set of resources of the control channel, and wherein mapping on the set of resources is in the order of "frequency first, time second".

38. The method according to claim 30 or 31, wherein the control channel is a Physical Uplink Control Channel (PUCCH).

39. The method of claim 30 or 31, wherein the combination set includes the base sequence and the cyclic shift for representing a corresponding one of the N symbols.

40. The method according to claim 30 or 31, wherein Orthogonal Frequency Division Multiplexing (OFDM) modulation is adopted on a plurality of subcarriers to modulate the N symbols.

41. The method according to claim 30 or 31, wherein discrete Fourier transform spread orthogonal frequency division multiplexing DFT-S-OFDM modulation is adopted on multiple subcarriers to modulate the N symbols.

42. A method for wireless communication, comprising: The network node receives a payload of M bits on N symbols from the wireless device via a control channel, where M and N are positive integers; as well as after receiving, sending one or more subsequent communications to the wireless device via the data channel, The base sequence ( ) and the cyclic shift of the base sequence ( ) represents each of the N symbols, where n=0, 1, ... (N-1) indexes the symbols in the N symbols, Where m = 0, 1, ... (2M-1) is the combination set of the base sequence and the cyclic shift m {< >}Index, where m and n are non-negative integers, and wherein the cyclic shift of each of the N symbols is based on one or more pseudo-random binary sequences, and wherein the cyclic shift of the base sequence ( ) is determined as: wherein the one or more pseudo-random binary sequences include those defined as follows , and : in is a positive integer.

43. The method according to claim 42, wherein Initialized to: 。 44. The method according to claim 42 or 43, wherein Equal to 3447, 3468, 3470, 3486, 4564, 6021, 6021, 6253, 7166, 7487, 8427, 8482, 9611 or 9627.

45. The method of claim 42 or 43, wherein The initialization is based on the uplink control information UCI.

46. ​​The method of claim 45, wherein the UCI comprises a bit sequence , and among them will Initialized to: and 。 47. The method according to claim 42 or 43, wherein the configuration or predefined The combination set, so that There are at most K elements in common between any two of the combination sets, and K is a non-negative integer.

48. The method of claim 47, wherein the relative position of each of the at most K elements in each of the any two combination sets is the same.

49. The method according to claim 42 or 43, wherein the control channel is a Physical Uplink Control Channel (PUCCH).

50. The method of claim 42 or 43, wherein the combined set includes the base sequence and the cyclic shift for representing a corresponding one of the N symbols.

51. The method according to claim 42 or 43, wherein Orthogonal Frequency Division Multiplexing (OFDM) modulation is adopted on a plurality of subcarriers to modulate the N symbols.

52. The method according to claim 42 or 43, wherein discrete Fourier transform spread orthogonal frequency division multiplexing DFT-S-OFDM modulation is adopted on multiple subcarriers to modulate the N symbols.

53. A wireless communication device, comprising a processor and a memory, wherein the processor is configured to read a code from the memory and implement the method according to any one of claims 1 to 52.

54. A computer program product comprising computer readable program medium code stored thereon, which, when executed by a processor, causes the processor to perform the method of any one of claims 1 to 52.

Images