Use M-sequence to send payload

Abstract

Various aspects relate to techniques and methods for sequence-based non-coherent wireless channel transmission of a payload on a physical uplink channel. A transmitter converts information bits of a payload to be transmitted into decimal integer values, which in turn are used to generate a modified maximal sequence (m-sequence) based on one or more predetermined parameters, such as an m-sequence generator polynomial, a starting position in the sequence, and initialization. The generated modified m-sequence is modulated using a modulation scheme such as π / 2 binary phase shift keying and quadrature phase shift keying for transmission on a physical uplink channel.

Description

[0001] Priority claim

[0002] This patent application claims priority to and the benefit of Non-Provisional Application No. 17 / 320,138 filed in the U.S. Patent Office on May 13, 2021, and Provisional Application No. 62 / 025,962 filed in the U.S. Patent Office on May 15, 2020, the entire contents of which are hereby incorporated by reference into this document as if fully set forth below and for all applicable purposes. Technical Field

[0003] The techniques discussed below relate generally to wireless communication networks, and more particularly, to techniques and methods for transmitting small payloads such as uplink control information (UCI) using a modified maximum sequence (M-sequence). Background Art

[0004] In 5G New Radio (NR) wireless communication networks, various control information and data are sent on uplink (UL) transmissions, i.e., transmissions from a user equipment (UE) to a network node such as a gNodeB (gNB). Specifically, UL transmissions include uplink control information (UCI), which is sent in the 5G NR uplink using various UCI payload sizes and is typically carried by the Physical Uplink Control Channel (PUCCH). In cases where the number of UCI bits exceeds two, channel coding is used to provide error protection and correction for the UCI. In a specific example, if the payload size is greater than 2 bits and less than or equal to 11 bits, Reed-Muller codes are typically used to provide error correction.

[0005] Additionally, in many instances, the PUCCH may include a demodulation reference signal (DMRS) to estimate the radio channel in the receiver (e.g., gNB). This channel estimation is also known as coherent communication because specific reference signaling in the transmission is used for channel estimation. In low signal-to-noise ratio (SNR) scenarios, such as when the UE is at the edge of a cell, the quality of the channel estimation limits the performance of the PUCCH reception and, therefore, the coverage. Summary of the invention

[0006] A simplified summary of one or more aspects of the present disclosure is presented below to provide a basic understanding of these aspects. This summary is not a broad overview of all expected aspects of the present disclosure, is neither intended to identify the key or important elements of all aspects of the present disclosure, nor is it intended to describe the scope of any or all aspects of the present disclosure. Its sole purpose is to present some concepts of one or more aspects of the present disclosure in a simplified form as a preface to a more detailed description presented later.

[0007] According to one example, a method for wireless communication in a user equipment (UE) in a communication network is disclosed. The method includes: generating a modified maximum sequence (m-sequence) from information bits of a payload to be transmitted based on one or more predetermined parameters. In addition, the method includes: modulating the modified m-sequence based on a modulation scheme to derive a modulated modified m-sequence, and transmitting the modulated modified m-sequence in a wireless channel.

[0008] In another example, a user equipment (UE) is disclosed, which includes a transceiver, a memory, and a processor communicatively coupled to the transceiver and the memory. The processor and the memory are configured to: generate a modified maximum sequence (m-sequence) from information bits of a payload to be transmitted based on one or more predetermined parameters, modulate the modified m-sequence based on a modulation scheme to derive a modulated m-sequence, and transmit the modulated modified m-sequence in a wireless channel using the transceiver.

[0009] According to yet another example, a method for wireless communication in a base station in a wireless communication network is disclosed. The method includes: receiving a modified maximum sequence (m-sequence) signal from a user equipment (UE), and padding the received modified m-sequence with zeros to increase the length of the received sequence to a length of 2. n , wherein n represents the order of the polynomial used to generate the modified m-sequence to derive the zero-padded m-sequence. In addition, the method includes: permuting the zero-padded m-sequence, performing a fast Hadamard transform on the permuted zero-padded m-sequence, and extracting a cross-correlation measure based on the result of the fast Hadamard transform.

[0010] In yet another example, a base station is disclosed that includes a transceiver, a memory, and a processor communicatively coupled to the transceiver and the memory. The processor and the memory are configured to: receive a signal based on a modified m-sequence from a user equipment (UE), and pad the received modified m-sequence with zeros in the m-sequence to increase the length of the received sequence to a length of 2 n , wherein n represents the order of the polynomial used to generate the m-sequence to derive the zero-padded m-sequence. In addition, the processor and the memory are configured to: permute the zero-padded m-sequence, perform a fast Hadamard transform on the permuted zero-padded m-sequence, and extract a cross-correlation metric based on the result of the fast Hadamard transform.

[0011] After reading the following specific embodiments, these and other aspects of the present invention will be more fully understood. After reading the following description of the specific exemplary examples of the present invention in conjunction with the accompanying drawings, other aspects, features and examples of the present invention will become apparent to those of ordinary skill in the art. Although the features of the present invention can be discussed below with respect to certain examples and accompanying drawings, all examples of the present invention may include one or more of the advantageous features discussed herein. That is, although one or more examples may be discussed as having certain advantageous features, one or more of such features may also be used according to the various examples of the present invention discussed herein. In a similar manner, although the exemplary examples may be discussed below as device, system or method examples, it should be understood that such exemplary examples may be implemented in various devices, systems and methods. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 is an illustration of a wireless communication system according to some aspects;

[0013] Figure 2 is an illustration of an example of a radio access network in accordance with some aspects.

[0014] Figure 3 is a diagram illustrating organization of wireless resources in an air interface utilizing orthogonal frequency division multiplexing (OFDM) according to some aspects.

[0015] Figure 4 is a block diagram illustrating an apparatus for transmission using sequence generation according to some aspects.

[0016] Figure 5A is a block diagram illustrating another apparatus for transmission using m-sequence generation according to some aspects.

[0017] Figure 5B is a block diagram illustrating yet another apparatus for transmission using m-sequence generation in accordance with some aspects.

[0018] Figure 5C is a block diagram illustrating yet another apparatus for transmission using m-sequence generation in accordance with some aspects.

[0019] Figure 6 is a block diagram illustrating an example linear feedback shift register that may be utilized in an m-sequence generator in accordance with some aspects.

[0020] Figure 7 A table of exemplary generator polynomials that may be utilized by an m-sequence generator according to some aspects is shown.

[0021] Figure 8 is a diagram of a cellular network employing scrambled IDs according to some aspects.

[0022] Fig. 9 Yet another apparatus for transmission using m-sequence generation in accordance with some aspects is shown.

[0023] Fig.10 is a block diagram illustrating an example of a hardware implementation of a scheduled entity (eg, UE) employing a processing system according to some aspects.

[0024] Fig.11 is a flow chart illustrating a method for transmitting an m-sequence in a UE according to some aspects.

[0025] Fig.12 is a block diagram of a receiving apparatus for receiving a truncated m-sequence based transmission according to some aspects.

[0026] Fig.13 is a block diagram illustrating an example of a hardware implementation of a scheduling entity (e.g., a base station or gNB) employing a processing system according to some aspects.

[0027] Fig.14 is a flow chart illustrating a method for receiving an m-sequence in a base station or gNB according to some aspects. DETAILED DESCRIPTION

[0028] The specific embodiments described below in conjunction with the accompanying drawings are intended as descriptions of various configurations and are not intended to represent the only configurations in which the concepts described herein can be practiced. This specific embodiment includes specific details for the purpose of providing a thorough understanding of the various concepts. However, it is apparent to those skilled in the art that these concepts can be practiced without these specific details. In some cases, various structures and components are shown in block diagram form to avoid making these concepts difficult to understand.

[0029] The electromagnetic spectrum is typically subdivided into various categories, bands, channels, etc. based on frequency / wavelength. In 5G NR, the two initial operating frequency bands are identified as frequency range names FR1 (410 MHz-7.125 GHz) and FR2 (24.25 GHz-52.6 GHz). It should be understood that although a portion of FR1 is greater than 6 GHz, FR1 is often (interchangeably) referred to as the "sub-6 GHz" band in various documents and articles. Similar naming issues sometimes arise for FR2, which is often (interchangeably) referred to as the "millimeter wave" band in documents and articles, although it is different from the extremely high frequency (EHF) band (30 GHz-300 GHz) identified as the "millimeter wave" band by the International Telecommunication Union (ITU).

[0030] Frequencies between FR1 and FR2 are generally referred to as mid-band frequencies. Recent 5G NR research has identified the operating bands of these mid-band frequencies as the frequency range name FR3 (7.125GHz-24.25GHz). The frequency bands falling within FR3 can inherit FR1 characteristics and / or FR2 characteristics, and therefore can effectively extend the characteristics of FR1 and / or FR2 to mid-band frequencies. In addition, higher frequency bands are currently being explored to extend 5G NR operations to above 52.6GHz. For example, three higher operating frequency bands have been identified as frequency range names FR4-a or FR4-1 (52.6GHz-71 GHz), FR4 (52.6GHz-114.25GHz) and FR5 (114.25GHz-300GHz). Each of these higher frequency bands falls within the EHF band.

[0031] In view of the above, unless otherwise specifically stated, it should be understood that if used herein, the term "sub-6 GHz" and the like can broadly represent frequencies that can be less than 6 GHz, frequencies that can be within FR1, or frequencies that can include mid-band frequencies. In addition, unless otherwise specifically stated, it should be understood that if used herein, the term "millimeter wave" and the like can broadly represent frequencies that can include mid-band frequencies, frequencies that can be within FR2, FR4-a or FR4-1 and / or FR5, or frequencies that can be within the EHF band.

[0032] Various aspects of the present disclosure relate to techniques and methods for sequence-based non-coherent wireless channel transmission of a payload. A transmitter converts information bits of a payload to be transmitted into decimal integer values, which are in turn used to generate a truncated maximum sequence (m-sequence), and one or more predetermined parameters (such as an m-sequence generator polynomial, a starting position in the sequence, and initialization). The generated m-sequence is modulated using a modulation scheme such as π / 2 binary phase shift keying and quadrature phase shift keying.

[0033] Although various aspects and examples are described in this application by way of illustration of some examples, it will be understood by those skilled in the art that additional implementations and use cases can be implemented in many different arrangements and scenarios. The innovations described herein can be implemented across many different platform types, devices, systems, shapes, sizes, and packaging arrangements. For example, examples and / or uses can be implemented by integrated chip examples and other devices based on non-modular components (e.g., end-user devices, vehicles, communication devices, computing devices, industrial devices, retail / purchase devices, medical devices, AI-enabled devices, etc.). Although some examples may or may not be specifically for use cases or applications, a variety of applicability of the described innovations may occur. Implementations may range from chip-level or modular components to non-modular, non-chip-level implementations, and further to the range of aggregated, distributed, or OEM devices or systems that include one or more aspects of the described innovations. In some practical settings, the device containing the described aspects and features must also include additional components and features for implementing and practicing the claimed and described examples. For example, the transmission and reception of wireless signals must include multiple components for analog and digital purposes (e.g., hardware components including antennas, RF chains, power amplifiers, modulators, buffers, processors, interleavers, adders / summers, etc.) The innovations described herein are intended to be implemented in a wide variety of devices, chip-level components, systems, distributed arrangements, end-user devices, etc., of different sizes, shapes, and configurations.

[0034] The various concepts presented throughout this disclosure may be implemented in a variety of telecommunication systems, network architectures and communication standards. Figure 1 , as a non-limiting illustrative example, a schematic diagram of a radio access network 100 is provided. The RAN 100 may implement any suitable one or more wireless communication technologies to provide radio access. As an example, the RAN 100 may operate in accordance with the 3rd Generation Partnership Project (3GPP) New Radio (NR) specifications (commonly referred to as 5G). As another example, the RAN 100 may operate under a mix of 5G NR and Evolved Universal Terrestrial Radio Access Network (eUTRAN) (commonly referred to as LTE) standards. 3GPP refers to this hybrid RAN as the Next Generation RAN or NG-RAN. Of course, many other examples may be utilized within the scope of the present disclosure.

[0035] The geographical area covered by the radio access network 100 may be divided into a plurality of cellular areas (cells) which may be uniquely identified by a user equipment (UE) based on an identity broadcast from an access point or base station over the geographical area. Figure 1Cells 102, 104, 106, and cell 108 are shown, each of which may include one or more sectors (not shown). A sector is a sub-area of ​​a cell. All sectors within a cell are served by the same base station. A radio link within a sector may be identified by a single logical identifier belonging to the sector. In a cell divided into sectors, multiple sectors within a cell may be formed by antenna groups, where each antenna is responsible for communicating with UEs in a portion of the cell.

[0036] Typically, a corresponding base station (BS) serves each cell. Broadly speaking, a base station is a network element in a radio access network that is responsible for sending radio to and receiving radio from a UE in one or more cells. BS may also be referred to by those skilled in the art as a base transceiver station (BTS), a radio base station, a radio transceiver, a transceiver functional unit, a basic service set (BSS), an extended service set (ESS), an access point (AP), a node B (NB), an eNode B (eNB), a gNode B (gNB), a transmission and reception point (TRP), or some other appropriate term. In some examples, a base station may include two or more TRPs that may be co-located or non-co-located. Each TRP may communicate on the same or different carrier frequencies in the same or different frequency bands. In an example where RAN 100 operates according to both LTE and 5G NR standards, one of the base stations may be an LTE base station, and the other base station may be a 5G NR base station.

[0037] Various base station arrangements can be used. Figure 1 , two base stations 110 and 112 are shown in cells 102 and 104; and a third base station 114 is shown as controlling a remote radio head (RRH) 116 in cell 106. That is, the base station may have an integrated antenna, or may be connected to an antenna or RRH by a feeder cable. In the example shown, cells 102, 104, and 106 may be referred to as macro cells because base stations 110, 112, and 114 support cells with large sizes. In addition, a base station 118 is shown in cell 108, which may overlap with one or more macro cells. In this example, cell 108 may be referred to as a small cell (e.g., a micro cell, a pico cell, a femto cell, a home base station, a home node B, a home eNode B, etc.) because base station 118 supports a cell with a relatively small size. The cell size may be determined based on the system design and component constraints.

[0038] It should be understood that the radio access network 100 may include any number of wireless base stations and cells. In addition, relay nodes may be deployed to extend the size or coverage area of ​​a given cell. The base stations 110, 112, 114, 118 provide wireless access points to the core network for any number of mobile devices.

[0039] Figure 1 Also included is an unmanned aerial vehicle (UAV) 120, which may be a drone or a quadcopter. UAV 120 may be configured to function as a base station, or more specifically as a mobile base station. That is, in some examples, a cell may not necessarily be stationary, and the geographic area of ​​a cell may move depending on the location of a mobile base station, such as UAV 120.

[0040] Typically, a base station may include a backhaul interface for communicating with a backhaul portion of a network (not shown). The backhaul may provide a link between the base station and a core network (not shown), and in some examples, the backhaul may provide interconnection between the base stations. The core network may be part of a wireless communication system and may be independent of the radio access technology used in the radio access network. Various types of backhaul interfaces may be employed, such as a direct physical connection using any suitable transport network, a virtual network, and the like.

[0041] RAN 100 is shown to support wireless communications for multiple mobile devices. In the standards and specifications published by the 3rd Generation Partnership Project (3GPP), mobile devices are generally referred to as user equipment (UE), but those skilled in the art may also refer to them as: mobile station (MS), user station, mobile unit, user unit, wireless unit, remote unit, mobile device, wireless device, wireless communication device, remote device, mobile user station, access terminal (AT), mobile terminal, wireless terminal, remote terminal, handset, terminal, user agent, mobile client, client or some other appropriate term. UE may be a device that provides access to network services to users.

[0042] In this document, a "mobile" device does not necessarily have the ability to move, and can be stationary. The term mobile device or mobile device refers to a wide variety of equipment and technology. For example, some non-limiting examples of mobile devices include mobile devices, cellular (cell) phones, smart phones, session initiation protocol (SIP) phones, laptops, personal computers (PCs), notebooks, netbooks, smart books, tablet computers, personal digital assistants (PDAs) and a wide array of embedded systems (e.g., corresponding to the "Internet of Things" (IoT)). The mobile device can be a car or other transport vehicle, a remote sensor or actuator, a robot or robotic device, a satellite radio device, a global positioning system (GPS) device, an object tracking device, an unmanned aerial vehicle, a multi-axis aircraft, a quadcopter, a remote control device, a consumer and / or a wearable device (such as glasses, a wearable camera, a virtual reality device, a smart watch, a health or fitness tracker, a digital audio player (e.g., an MP3 player), a camera, a game console), etc. The mobile device can be a digital home or smart home device in addition, such as a home audio, video and / or multimedia device, an electrical appliance, a vending machine, smart lighting, a home security system, a smart meter, etc. The mobile device may additionally be a smart energy device, a security device, a solar panel or solar array, a municipal infrastructure device that controls power (e.g., a smart grid), lighting, water, etc.; an industrial automation and enterprise device; a logistics controller; an agricultural device; etc. In addition, the mobile device may provide connected medical or telemedicine support, i.e., healthcare at a distance. Telehealth devices may include telehealth monitoring devices and telehealth management devices, whose communications may be given priority or priority access over other types of information, for example, in terms of priority access for transmitting critical service data, and / or associated QoS for transmitting critical service data.

[0043] Within the RAN 100, a cell may include UEs that may communicate with one or more sectors of each cell. For example, UEs 122 and 124 may communicate with base station 110; UEs 126 and 128 may communicate with base station 112; UEs 130 and 132 may communicate with base station 114 via RRH 116; UE 134 may communicate with base station 118; and UE 136 may communicate with mobile base station 120. In this document, each base station 110, 112, 114, 118, and 120 may be configured to provide an access point to a core network (not shown) to all UEs in the corresponding cell. In some examples, UAV 120 (e.g., a quadcopter) may be a mobile network node and may be configured to function as a UE. For example, UAV 120 may operate within cell 102 by communicating with base station 110.

[0044] Wireless communication between RAN 100 and UE (e.g., UE 122 or 124) can be described as utilizing an air interface. Transmissions over the air interface from a base station (e.g., base station 110) to one or more UEs (e.g., UE 122 or 124) can be referred to as downlink (DL) transmissions. According to certain aspects of the present disclosure, the term downlink can refer to point-to-multipoint transmissions initiated at a scheduling entity (further described below; e.g., base station 110). Another way to describe this scheme can be to use the term broadcast channel multiplexing. Transmissions from a UE (e.g., UE 122) to a base station (e.g., base station 110) can be referred to as uplink (UL) transmissions. According to further aspects of the present disclosure, the term uplink can refer to point-to-point transmissions initiated at a scheduled entity (further described below; e.g., UE 122).

[0045] For example, DL transmission may include unicast or broadcast transmission of control information and / or service information (e.g., user data service) from a base station (e.g., base station 110) to one or more UEs (e.g., UEs 122 and 124), and UL transmission may include transmission of control information and / or service information initiated at a UE (e.g., UE 122). In addition, uplink and / or downlink control information and / or service information may be divided into frames, subframes, time slots, and / or symbols. As used herein, a symbol may refer to a time unit in which each subcarrier carries one resource element (RE) in an orthogonal frequency division multiplexing (OFDM) waveform. A time slot may carry 7 or 14 OFDM symbols. A subframe may refer to a duration of 1 ms. Multiple subframes or time slots may be grouped together to form a single frame or radio frame. In the present disclosure, a frame may refer to a predetermined duration (e.g., 10 ms) for wireless transmission, wherein each frame is composed of, for example, 10 subframes each of 1 ms. Of course, these definitions are not required, and any suitable scheme for organizing the waveform may be utilized, and the various time divisions of the waveform may have any suitable duration.

[0046] In some examples, access to the air interface may be scheduled, wherein a scheduling entity (e.g., a base station) allocates resources (e.g., time-frequency resources) for communication between some or all devices and apparatuses within its service area or cell. In the present disclosure, as further discussed below, a scheduling entity may be responsible for scheduling, allocating, reconfiguring, and releasing resources for one or more scheduled entities. That is, for scheduled communications, a UE or a scheduled entity utilizes resources allocated by the scheduling entity.

[0047] The base station is not the only entity that can be used as a scheduling entity. That is, in some examples, the UE can be used as a scheduling entity to schedule resources for one or more scheduled entities (e.g., one or more other UEs). For example, two or more UEs (e.g., UEs 138, 140, and 142) can communicate with each other using a sidelink signal 137 without relaying the communication through a base station. In some examples, UEs 138, 140, and 142 can each be used as a scheduling entity or a sending sidelink device and / or a scheduled entity or a receiving sidelink device to schedule resources and transmit sidelink signals 137 between them without relying on scheduling or control information from a base station. In other examples, two or more UEs (e.g., UEs 126 and 128) within the coverage area of ​​a base station (e.g., base station 112) can also transmit sidelink signals 127 on a direct link (sidelink) without passing the communication through base station 112. In this example, base station 112 can allocate resources to UEs 126 and 128 for sidelink communication. In either case, such sidelink signaling 127 and 137 may be implemented in a peer-to-peer (P2P) network, a device-to-device (D2D) network, a vehicle-to-vehicle (V2V) network, a vehicle-to-everything (V2X) network, a mesh network, or other suitable direct link network.

[0048] In some examples, a D2D relay framework can be included within a cellular network to facilitate relaying of communications to / from base station 112 via a D2D link (e.g., sidelink 127 or 137). For example, one or more UEs (e.g., UE 128) within the coverage area of ​​base station 112 can operate as relay UEs to extend the coverage of base station 112, improve transmission reliability to one or more UEs (e.g., UE 126), and / or allow the base station to recover from a failed UE link due to, for example, blocking or fading.

[0049] Two main technologies that may be used by V2X networks include dedicated short range communications (DSRC) based on the IEEE 802.11p standard, and cellular V2X based on LTE and / or 5G (New Radio) standards. Various aspects of the present disclosure may relate to New Radio (NR) cellular V2X networks, which for simplicity will be referred to herein as V2X networks. However, it should be understood that the concepts disclosed herein may not be limited to a particular V2X standard, or may be directed to sidelink networks other than V2X networks.

[0050] In order to obtain a low block error rate (BLER) for transmission over the air interface while still achieving very high data rates, channel coding can be used. That is, wireless communications can generally utilize appropriate error-correcting block codes. In a typical block code, an information message or sequence is segmented into code blocks (CBs), and then an encoder (e.g., a codec) at the transmitting device mathematically adds redundancy to the information message. Utilizing this redundancy in the encoded information message can improve the reliability of the message, enabling correction of any bit errors that may occur due to noise.

[0051] Data encoding can be implemented in a variety of ways. In early 5G NR specifications, quasi-cyclic low-density parity check (LDPC) with two different basemaps was used to encode user data: one basemap was used for large code blocks and / or high code rates, and the other basemap was used for other cases. Polar coding was used to encode control information and the physical broadcast channel (PBCH) based on nested sequences. For these channels, puncturing, shortening, and repetition were used for rate matching.

[0052] Aspects of the present disclosure may be implemented using any suitable channel codes. Various implementations of base stations and UEs may include appropriate hardware and capabilities (eg, encoders, decoders, and / or codecs) to utilize one or more of these channel codes for wireless communications.

[0053] In the RAN 100, the ability of a UE to communicate independently of its location while moving is referred to as mobility. Various physical channels between the UE and the RAN are typically established, maintained, and released under the control of an access and mobility management function (AMF). In some scenarios, the AMF may include a security context management function (SCMF) and a security anchor function (SEAF) that perform authentication. The SCMF may manage security contexts for both control plane and user plane functionality in whole or in part.

[0054] In some examples, the RAN 100 may implement mobility and handover (i.e., transferring a UE's connection from one radio channel to another). For example, during a call with a scheduling entity, or at any other time, the UE may monitor various parameters of the signal from its serving cell and various parameters of neighboring cells. Depending on the quality of these parameters, the UE may maintain communication with one or more neighboring cells. During this time, if the UE moves from one cell to another, or if the signal quality from a neighboring cell exceeds the signal quality from the serving cell for a given amount of time, the UE may perform a handover or handover from the serving cell to a neighboring (target) cell. For example, a UE 124 may move from a geographic area corresponding to its serving cell 102 to a geographic area corresponding to a neighboring cell 106. When the signal strength or quality from a neighboring cell 106 exceeds the signal strength or quality of its serving cell 102 for a given amount of time, the UE 124 may send a report message to its serving base station 110 indicating the condition. In response, the UE 124 may receive a handover command, and the UE may undergo a handover to the cell 106.

[0055] In various embodiments, the air interface in the RAN 100 may utilize licensed spectrum, unlicensed spectrum, or shared spectrum. Licensed spectrum provides exclusive use of a portion of the spectrum, typically due to a mobile network operator purchasing a license from a government regulatory agency. Unlicensed spectrum provides shared use of a portion of the spectrum without the need for a government-granted license. Although access to unlicensed spectrum typically still requires compliance with some technical regulations, typically any operator or device can gain access. Shared spectrum may fall between licensed and unlicensed spectrum, where access to the spectrum may require technical regulations or restrictions, but the spectrum may still be shared by multiple operators and / or multiple RATs. For example, a holder of a license for a portion of the licensed spectrum may provide licensed shared access (LSA) to share the spectrum with other parties, for example, with conditions determined by the appropriate license holder to gain access.

[0056] The air interface in the RAN 100 can utilize one or more multiplexing and multiple access algorithms to enable simultaneous communication of various devices. For example, the 5G NR specification provides: multiple access for UL or reverse link transmissions from UEs 122 and 124 to base station 110, and multiple access for multiplexing DL or forward link transmissions from base station 110 to UEs 122 and 124 using orthogonal frequency division multiplexing (OFDM) with a cyclic prefix (CP). In addition, for UL transmissions, the 5G NR specification provides support for discrete Fourier transform-spread-OFDM (DFT-s-OFDM) with CP (also known as single carrier FDMA (SC-FDMA)). However, within the scope of the present disclosure, multiplexing and multiple access are not limited to the above schemes, but can be provided using time division multiple access (TDMA), code division multiple access (CDMA), frequency division multiple access (FDMA), sparse code multiple access (SCMA), resource extension multiple access (RSMA) or other suitable multiple access schemes. In addition, multiplexing of DL transmissions from base station 110 to UEs 122 and 124 may be provided using time division multiplexing (TDM), code division multiplexing (CDM), frequency division multiplexing (FDM), orthogonal frequency division multiplexing (OFDM), sparse code multiplexing (SCM), or other suitable multiplexing schemes.

[0057] In addition, the air interface in the RAN 100 may utilize one or more duplex algorithms. Duplex refers to a point-to-point communication link in which two endpoints can communicate with each other in two directions. Full-duplex means that two endpoints can communicate with each other at the same time. Half-duplex means that only one endpoint can send information to the other endpoint at a time. Half-duplex simulation is often implemented for wireless links that utilize time division duplex (TDD). In TDD, transmissions in different directions on a given channel are separated from each other using time division multiplexing. That is, at certain times, the channel is dedicated to transmissions in one direction, and at other times, the channel is dedicated to transmissions in another direction, where the direction can change very quickly, for example, multiple times per time slot. In wireless links, full-duplex channels generally rely on physical isolation of transmitters and receivers and appropriate interference cancellation techniques. Full-duplex simulation is often implemented for wireless links by utilizing frequency division duplex (FDD) or space division duplex (SDD). In FDD, transmissions in different directions can operate on different carrier frequencies (e.g., within a paired spectrum). In SDD, transmissions in different directions on a given channel are separated from each other using spatial division multiplexing (SDM). In other examples, full-duplex communication can be implemented within an unpaired spectrum (e.g., within a single carrier bandwidth), where transmissions in different directions are performed within different sub-bands of the carrier bandwidth. This type of full-duplex communication may be referred to herein as sub-band full-duplex (SBFD), also known as flexible duplex.

[0058] As another non-limiting illustrative example, Figure 2 Various aspects are illustrated with reference to a schematic diagram of a wireless communication system 200. The wireless communication system 200 includes three interacting domains: a core network 202, a radio access network (RAN) 204, and a user equipment (UE) 206. By means of the wireless communication system 200, the UE 206 may be enabled to perform data communications with an external data network 210, such as (but not limited to) the Internet.

[0059] The RAN 204 may implement any suitable wireless communication technology or technologies to provide radio access to the UE 206. As an example, the RAN 204 may operate according to the 3rd Generation Partnership Project (3GPP) New Radio (NR) specification. As another example, the RAN 204 may operate under a mix of 5G NR and Evolved Universal Terrestrial Radio Access Network (eUTRAN) standards (commonly referred to as LTE), such as in a non-standalone (NSA) system including an EN-DC system. 3GPP also refers to this hybrid RAN as the Next Generation RAN or NG-RAN. In addition, many other examples may be utilized within the scope of the present disclosure.

[0060] like Figure 2 As shown in , RAN 204 includes multiple base stations 208. In different technologies, standards, or contexts, base stations 208 may be referred to differently by those skilled in the art as: base transceiver stations (BTS), radio base stations, radio transceivers, transceiver functions, basic service sets (BSS), extended service sets (ESS), access points (APs), node Bs (NBs), eNode Bs (eNBs), gNode Bs (gNBs), transmission and reception points (TRPs), or some other appropriate terminology. In some examples, a base station may include two or more TRPs that may be co-located or non-co-located. Each TRP may communicate on the same or different carrier frequencies within the same or different frequency bands.

[0061] RAN 204 is further shown to support wireless communications for multiple mobile devices. Mobile devices may be referred to as user equipment (UE) in 3GPP standards, but may also be referred to as mobile stations (MS), user stations, mobile units, user units, wireless units, remote units, mobile devices, wireless devices, wireless communication devices, remote devices, mobile user stations, access terminals (AT), mobile terminals, wireless terminals, remote terminals, handsets, terminals, user agents, mobile clients, clients, or some other appropriate terminology by those skilled in the art. A UE may be a device (e.g., a mobile device) that provides access to network services to a user.

[0062] Wireless communication between RAN 204 and UE 206 can be described as utilizing an air interface. Transmissions over an air interface from a base station (e.g., base station 208) to a UE (e.g., UE 206) can be referred to as downlink (DL) transmissions. According to certain aspects of the present disclosure, the term downlink can refer to point-to-multipoint transmissions initiated at a scheduling entity (further described below; e.g., base station 108). Another way to describe this scheme can be to use the term broadcast channel multiplexing. Transmissions from a UE (e.g., UE 206) to a base station (e.g., base station 208) can be referred to as uplink (UL) transmissions. According to further aspects of the present disclosure, the term uplink can refer to point-to-point transmissions initiated at a UE (e.g., UE 206).

[0063] In some examples, access to the air interface may be scheduled, wherein a scheduling entity (e.g., a base station 208) allocates resources for communication between some or all devices and apparatuses within its service area or cell. In the present disclosure, as discussed further below, a scheduling entity may be responsible for scheduling, allocating, reconfiguring, and releasing resources for one or more scheduled entities. That is, for scheduled communications, a UE 206, which may be a scheduled entity, may utilize resources allocated by the scheduling entity 208.

[0064] like Figure 2 As shown, a base station or scheduling entity 208 may broadcast downlink traffic 212 to one or more UEs (e.g., UE 206). Broadly speaking, a base station or scheduling entity 208 may be configured as a node or device responsible for scheduling traffic in a wireless communication network, the traffic including downlink traffic 212, and in some examples, uplink traffic 216 from UE 206 to scheduling entity 208. UE 206 may be configured as a node or device that also receives downlink control information 214, including, but not limited to, scheduling information (e.g., grant), synchronization or timing information, or other control information from another entity (e.g., scheduling entity 208) in the wireless communication network. In addition, UE 206 may send uplink control information 218 to base station 208, including, but not limited to, scheduling information (e.g., grant), synchronization or timing information, or other control information.

[0065] Typically, the base stations 208 may include a backhaul interface for communicating with a backhaul portion 222 of the wireless communication system. The backhaul 222 may provide a link between the base stations 208 and the core network 202. Furthermore, in some examples, the backhaul interface may provide interconnection between the respective base stations 208. Various types of backhaul interfaces may be employed, such as a direct physical connection using any suitable transport network, a virtual network, etc.

[0066] The core network 202 may be part of the wireless communication system 200 and may be independent of the radio access technology used in the RAN 204. In some examples, the core network 202 may be configured according to a 5G standard (e.g., 5GC). In other examples, the core network 202 may be configured according to a 4G Evolved Packet Core (EPC) or any other suitable standard or configuration.

[0067] In some examples, access to the air interface may be scheduled, wherein a scheduling entity (e.g., a base station 208) allocates resources for communication between some or all devices and apparatuses within its service area or cell. In the present disclosure, as discussed further below, a scheduling entity may be responsible for scheduling, allocating, reconfiguring, and releasing resources for one or more scheduled entities. That is, for scheduled communications, a UE 206, which may be a scheduled entity, may utilize resources allocated by a base station or scheduling entity 208.

[0068] The base station is not the only entity that can be used as a scheduling entity. That is, in some examples, a UE can be used as a scheduling entity to schedule resources for one or more scheduled entities (e.g., one or more other UEs). In other examples, two or more UEs (e.g., Figure 1 UE 138 and 140 or Figure 2 UE 138 and UE 140 may communicate with each other using sidelink signals such as 137 without sending the communication through a base station (e.g., base station 112 or 208) and without relying on scheduling or control information from the base station. In some examples, UE 138 acts as a scheduling entity or initiating (e.g., sending) sidelink device, and UE 140 may act as a scheduled entity or receiving sidelink device. For example, UE 138 may act as a scheduling entity in a device-to-device (D2D) system, a peer-to-peer (P2P) system, a vehicle-to-vehicle (V2V) network, a vehicle-to-everything (V2X) network, and / or a mesh network.

[0069] For example, in a D2D system, two or more UEs (e.g. Figure 1 UEs 138 and 140 in the cellular network can communicate with each other via a direct link without passing through a base station (e.g., base station 112 or 208). For example, UEs 138 and 140 can communicate using narrow directional beams in the FR2 band (e.g., millimeter wave). In this document, D2D communication can refer to sidelink communication or relay communication using sidelink signals. In various aspects of the present disclosure, a D2D relay framework can be included in a cellular network to facilitate communication via a D2D link (referred to herein as a sidelink (e.g., Figure 1127 or 137)) relays communications to / from base station 112, for example, one or more UEs (e.g., UE 138) within the coverage area of ​​base station 112 can operate as relay UEs to extend the coverage of base station 112 or improve transmission reliability to one or more UEs (e.g., UE 140), and / or allow base station 112 or 208 to recover from a UE link failure due to, for example, blocking or fading.

[0070] Reference Figure 3 Various aspects of the present disclosure are described using the OFDM waveform schematically shown in FIG. It should be understood by those skilled in the art that various aspects of the present disclosure can be applied to SC-FDMA waveforms in substantially the same manner as described below herein. That is, although some examples of the present disclosure may focus on OFDM links for clarity, it should be understood that the same principles can also be applied to SC-FDMA waveforms.

[0071] Reference now Figure 3 , shows an expanded view of an exemplary DL subframe 302 showing an OFDM resource grid. However, as will be readily appreciated by those skilled in the art, the PHY transmission structure for any particular application may differ from the examples described herein depending on any number of factors. In this document, time is in the horizontal direction in units of OFDM symbols; frequency is in the vertical direction in units of subcarriers.

[0072] Resource grid 304 can be used to schematically represent the time-frequency resources for a given antenna port. That is, in a multiple-input multiple-output (MIMO) implementation with multiple available antenna ports, corresponding multiple resource grids 304 can be used for communication. Resource grid 304 is divided into multiple resource elements (REs) 306. RE is 1 subcarrier × 1 symbol, is the smallest discrete part of the time-frequency grid, and contains a single complex number representing data from a physical channel or signal. Depending on the modulation used in a specific implementation, each RE can represent one or more bits of information. In some examples, RE blocks can be referred to as physical resource blocks (PRBs) or more simply resource blocks (RBs) 308, which contain any suitable number of consecutive subcarriers in the frequency domain. In one example, an RB can include 12 subcarriers, the number of which is independent of the digital scheme used. In some examples, depending on the digital scheme, an RB can include any suitable number of consecutive OFDM symbols in the time domain. In the present disclosure, it is assumed that a single RB such as RB 308 corresponds entirely to a single direction of communication (transmission or reception for a given device).

[0073] A UE typically utilizes only a subset of the resource grid 304. An RB may be the smallest unit of resources that can be allocated to a UE. Thus, the more RBs scheduled for a UE and the higher the modulation scheme selected for the air interface, the higher the data rate for the UE.

[0074] In this figure, RB 308 is shown as occupying less than the entire bandwidth of subframe 302, with some subcarriers shown above and below RB 308. In a given embodiment, subframe 302 may have a bandwidth corresponding to any number of one or more RBs 308. Furthermore, in this figure, RB 308 is shown as occupying less than the entire duration of subframe 302, although this is merely one possible example.

[0075] Each 1 ms subframe 302 may consist of one or more adjacent time slots. Figure 4 In the example shown, as an illustrative example, one subframe 302 includes four time slots 310. In some examples, a time slot can be defined according to a specified number of OFDM symbols with a given cyclic prefix (CP) length. For example, a time slot can include 7 or 14 OFDM symbols with a nominal CP. Other examples may include mini-slots with shorter durations (e.g., one or two OFDM symbols). In some cases, these mini-slots can be sent, occupying resources scheduled for ongoing time slot transmissions of the same or different UEs.

[0076] An expanded view of one of the time slots 310 shows that the time slot 310 includes a control region 312 and a data region 314. In general, the control region 312 may carry a control channel (e.g., PDCCH or PUCCH), and the data region 314 may carry a data channel (e.g., PDSCH or PUSCH). Of course, a time slot may contain all DL, all UL, or at least one DL portion and at least one UL portion. Figure 3 The simple structure shown in is merely exemplary in nature, and different slot structures may be utilized and may include one or more of each of the control region(s) and the data region(s).

[0077] Although in Figure 3 Although not shown in the figure, each RE 306 within the RB 308 can be scheduled to carry one or more physical channels, including control channels, shared channels, data channels, etc. Other REs 306 within the RB 308 can also carry pilot or reference signals, including but not limited to demodulation reference signals (DMRS) or sounding reference signals (SRS). These pilot or reference signals can be provided to a receiving device to perform channel estimation for the corresponding channel, which can enable coherent demodulation / detection of control channels and / or data channels within the RB 308.

[0078] In DL transmission, a transmitting device (e.g., a scheduling entity) may allocate one or more REs 306 (e.g., within a control region 312) to carry DL control information to one or more scheduled entities, including: one or more DL control channels, such as PBCH; Physical Control Format Indicator Channel (PCFICH); Physical Hybrid Automatic Repeat Request (HARQ) Indicator Channel (PHICH); and / or Physical Downlink Control Channel (PDCCH), etc. The transmitting device may also allocate one or more REs 306 to carry other DL signals, such as DMRS; Phase Tracking Reference Signal (PT-RS); Channel State Information-Reference Signal (CSI-RS); Primary Synchronization Signal (PSS); and Secondary Synchronization Signal (SSS).

[0079] The synchronization signals PSS and SSS, and in some examples the PBCH and PBCH DMRS, may be sent in a synchronization signal block (SSB) comprising 4 consecutive OFDM symbols, which are numbered in increasing order from 0 to 3 via a time index. In the frequency domain, the SSB may be spread over 240 consecutive subcarriers, where the subcarriers are numbered in increasing order from 0 to 239 via a frequency index. Of course, the present disclosure is not limited to this particular SSB configuration. Other non-limiting examples may utilize more or less than two synchronization signals; may include one or more supplemental channels in addition to the PBCH; may omit the PBCH; and / or may utilize different numbers of symbols and / or non-contiguous symbols for the SSB, all of which are within the scope of the present disclosure.

[0080] The PBCH may also include a master information block (MIB) that includes various system information and parameters for decoding a system information block (SIB). The SIB may be, for example, a system information type 1 (SystemInformationType1) (SIB1) that may include various additional system information. Examples of system information may include, but are not limited to, subcarrier spacing, system frame number, cell barring indication, a common control resource set (CoreSet) list (e.g., PDCCH CoreSet0 or CoreSet1), a common search space list, a search space for SIB1, a paging search space, a random access search space, and uplink configuration information.

[0081] The PCFICH provides information to help the receiving device receive and decode the PDCCH. The PDCCH carries downlink control information (DCI), which includes but is not limited to power control commands, scheduling information, grants and / or allocation of REs for DL ​​and UL transmissions. The PHICH carries HARQ feedback transmissions, such as acknowledgments (ACKs) or negative acknowledgments (NACKs). HARQ is a technology well known to those of ordinary skill in the art, in which the integrity of packet transmissions can be checked on the receiving side for accuracy, for example using any appropriate integrity check mechanism (such as a checksum or cyclic redundancy check (CRC)). If the integrity of the transmission is confirmed, an ACK can be sent, and if there is no confirmation, a NACK can be sent. In response to the NACK, the transmitting device can send a HARQ retransmission, which can implement soft combining, incremental redundancy, etc.

[0082] In UL transmission, a transmitting device (e.g., a scheduled entity) may utilize one or more REs 306 to carry UL control information, which includes one or more UL control channels, such as a physical uplink control channel (PUCCH) and / or a random access channel (RACH). For example, during initial access of the uplink, RACH may be used in a random access process. The UL control information may include various packet types and categories, including pilots, reference signals, and information configured to enable or assist in decoding uplink data transmission. For example, the UL control information may include a DMRS or an SRS. In some examples, the control information may include a scheduling request (SR), i.e., a request for scheduling an uplink transmission for a scheduling entity. In this article, in response to an SR sent on a control channel, a scheduling entity may send downlink control information, which may schedule resources for uplink packet transmission. The UL control information may also include HARQ feedback, channel state feedback (CSF), or any other suitable UL control information.

[0083] In addition to control information, one or more REs 306 (e.g., within the data region 314) may be allocated for user data or traffic data. Such traffic may be carried on one or more traffic channels, such as, for DL ​​transmissions, the PDSCH; or for UL transmissions, the physical uplink shared channel (PUSCH). In some examples, one or more REs 306 in the data region 314 may be configured to carry a SIB (e.g., SIB1), which carries system information that may enable access to a given cell.

[0084] These physical channels are typically multiplexed and mapped to transport channels for processing at the medium access control (MAC) layer. Transport channels carry blocks of information called transport blocks (TBs). The transport block size (TBS) may correspond to the number of bits of information and may be a controlled parameter based on the modulation and coding scheme (MCS) and the number of RBs in a given transmission.

[0085] References Figures 1 to 3 The channels or carriers described are not necessarily all channels or carriers that may be utilized between a scheduling entity and a scheduled entity, and those skilled in the art will recognize that other channels or carriers may be utilized in addition to those described, such as other traffic, control, and feedback channels.

[0086] As mentioned before, when the SNR of the transmission is low, such as in the example where the UE is located at the cell edge, the quality of the channel estimate at the receiver is limited. For example, in the case of PUCCH reception at the gNB, the low SNR resulting in lower quality channel estimates limits the performance of PUCCH reception, which in turn affects coverage. To improve coverage, for example, sequence-based non-coherent transmissions can be used instead of channel coding-based schemes. Specifically, the transmitter can map the k information bits to a radix of 2 k A receiver of such a transmission can then perform sequence detection based on the known set of base sequences to recover the information bits based on the detected sequence.

[0087] Figure 4 4 is a block diagram of an apparatus 400 and associated processes that may be implemented in a transmitter for forming or generating a transmission using a bit sequence. In particular, Figure 4 The example shows the formation of a PUCCH transmission, but Figure 4 The process is also applicable to other transmissions, especially in the case of small payloads and low SNR. For example, Figure 4 The process, and more generally, the method disclosed herein, can be applied to scenarios such as PDCCH transmission (i.e., downlink control channel), PUSCH transmission (i.e., uplink data transmission), wake-up signal (i.e., wake-up signal on downlink), sidelink communication, and random access communication (e.g., physical random access channel (PRACH)).

[0088] like Figure 4 As shown, a plurality of information bits (eg, k information bits), such as uplink control information (UCI), are input to a sequence generator 402, where the information bits are used to generate a sequence, such as by mapping the bits to a sequence having a base 2. ksequence. In addition, the apparatus 400 may include an optional transform precoder 404 that precodes the generated sequence for transmission, such as a specific transform precoding used in 5G NR that includes a discrete Fourier transform (DFT). In particular, the transform precoder 404 can be used to spread the data to reduce the PAPR (peak-to-average power ratio) of the transmission waveform, such as a transformation to a DFT-s-OFDM waveform, as used in some UL transmissions in 5G NR. In addition, the apparatus 400 includes a mapper 406 (or specifically, an RE mapper) that maps the sequence to subcarriers, or in other words, to resource elements (REs) in a transmission frame or subframe, such as Figure 3 As shown in , and specifically, in this example, within the REs used for PUCCH transmission. A receiver of the transmission may then perform sequence detection based on the set of base sequences and recover the information bits based on the detected sequence.

[0089] In a specific embodiment, Figure 4 The sequence generator 402 in may be configured to employ a maximum length sequence or "m-sequence" (or "MLS") for non-coherent transmissions. Using an m-sequence in a transmission allows a receiver of such a transmission to perform sequence detection using a fast Hadamard transform, which is, for example, low complexity.

[0090] As background on m-sequences, note that such sequences are a type of binary sequence that is pseudo-random and can be generated using a linear feedback shift register (LFSR), such as will be explained in more detail later. Figure 6 The shift register shown in . The m-sequence has 2 n -1, where n is the length of the shift register (or memory). Therefore, the m-sequence will be in 2 n -1 element or sample before repeating itself. Note further that the value n is also called the order of the m-sequence.

[0091] In mathematical terms, the set of m-sequences can be represented by a generator polynomial, such as the following polynomial equation:

[0092] x n +a n-1 x n-1 +…+a1x+1 (1)

[0093] Among them, (a n-1 ,…,a1) are binary coefficients. According to the polynomial shown in equation (1) above, the m-sequence can be generated by the following recurrence relation:

[0094] x(i+n)=(a n-1 x(i+n-1)+…+a1x(i+1)+x(i))mod 2 (2)

[0095] It has some non-zero initialization, such as [x(n-1), ..., x(1), x(0)] = [0, ..., 0, 1], where i (or d in other examples herein) represents some starting position. The initialization is non-zero because the m-sequence is periodic and the linear shift register cycles through every possible binary value except the zero vector. Therefore, the register can be initialized to any state other than zero.

[0096] By taking different segments of the sequence generated in equation (2) above at x(0), x(1), etc., we can obtain 2 n -1 sequences. In general, the kth sequence in the set can be obtained by taking [x(k-1), x(k), …, x(k+L-2)], where L = 2 n -1.

[0097] As an example of generating an m-sequence with order 3 (ie, n=3), a third-order polynomial x 3 +x+1. Applying Equation 2 above, this polynomial is recursively defined as x(n+3)=(x(n+1)+x(n))mod 2. For example, with the initialization [x(0)x(1),x(2)]=[1,0,0], the x sequence can be generated as the following repeating seven-bit sequence:

[0098] 1 0 0 1 0 1 1,1 0 0 1 0 1 1,…

[0099] Given different starting positions of d = 0, 1, ..., 6, seven different seven-bit length subsequences can be generated based on the third-order polynomial assumed above. For example, the following seven-bit length m-sequences can be generated: 1 0 0 1 0 1 1 0 0 1 0 1 1 1 0 1 0 1 1 1 0 1 0 1 1 1 0 0 0 1 1 1 0 0 1 1 1 1 0 0 1 0 1 1 0 0 1 0 1

[0107] Therefore, from the above discussion, it can be seen that the m-sequence can be uniquely determined by the following: (1) the polynomial; (2) the initialization; and (3) the starting position.

[0108] When applied to sequence generation for wireless transmission, the sequence generator (e.g., generator 402) can be configured to use the m-sequence as a base sequence for sequence-based transmissions (such as PUCCH transmissions). In certain aspects, the sequence generator can be configured to generate a modified m-sequence, wherein the modification can be a truncation of the m-sequence or a repetition of the sequence (i.e., by repeating a portion of the sequence to change the sequence from 2 to 10). n -1 period extends to greater than 2 n -1 period). In another aspect, the modification of the m-sequence may include downsampling, which involves downsampling from 2 n -1 sequences, by adding a sequence of all zeros or all ones, or scrambling, which will be discussed in more detail later.

[0109] With respect to truncation, in particular, in one aspect, the m-sequence is truncated, reduced, or pruned by using one of a plurality of specific modulation schemes, as will be further explained below. The m-sequence is truncated to a desired length determined by the number of resources available for information transmission. The desired length also depends on the modulation format. As an example, if the modulation is QPSK, the m-sequence is truncated to a length of 2L, where L is the number of resource elements in the resource. If π / 2BPSK modulation is used, the length of the m-sequence is truncated to a length of L. By using the truncated m-sequence for sequence-based transmission for incoherent transmission, this allows better coverage under low SNR conditions and reduces the complexity of the cross-correlation process at the receiver.

[0110] Figure 5A and 5B are block diagrams illustrating apparatuses 500 and 520, respectively, for transmission using m-sequence generation according to some aspects. Figure 5A The apparatus 500 in includes a sequence generator 502 configured to generate a sequence for non-coherent transmission of a signal, such as a PUCCH including a UCI payload. The sequence generator 502 includes a binary to decimal converter 504, an m-sequence generator 506, and a quadrature phase shift keying (QPSK) modulator 508. Note that since the m-sequence generation is based on decimal values, the binary to decimal converter 504 is used to convert the input payload information (which is typically a binary sequence such as a UCI payload) into a decimal integer value d. For example, if the input bits are 001, the conversion is an integer value of 1, or if the input bits are 101, the conversion is an integer value of 5. Note that if the number of payload bits input to the sequence generator 502 is some value k, the maximum decimal integer value will be 2 k-1. For example, if k=3, then the maximum integer value (ie, d) would be 7. Note that the decimal integer value d is the same value as discussed previously, and may be the starting position of the m-sequence to be generated.

[0111] After conversion to the decimal integer d, the m-sequence generator 506 is configured to generate the m-sequence based on predetermined parameters including a polynomial, initialization, and a starting position (position or location). In addition, the m-sequence generator 506 can be configured to use segments of the m-sequence based on the decimal integer d and a predetermined offset value d0.

[0112] In one example, note that the expected sequence length can be denoted as N, and the sequence can be represented by the following equation:

[0113] [x0,x1,…,x N-1 ]=[x(d+d0),x(d+d0+1),…,x(d+d0+N-1)] (3)

[0114] Additionally, in other aspects, the initialization of the m-sequence may be [1, 0, 0, ..., 0] or [0, 0, ..., 0, 1].

[0115] Furthermore, note that the result of the m-sequence generator 506 is a binary m-sequence, as previously discussed. However, when modulated for transmission (such as for PUCCH transmission), the sequence can be considered a complex sequence for modulation. Thus, the sequence generator 502 includes a complex modulation implemented according to a predetermined modulation scheme. Figure 5A In the example of FIG. 5 , the modulation scheme is quadrature phase shift keying (QPSK) modulation implemented by the QPSK modulator 508 to output a complex sequence [x0, x1, …, x N-1 Then, optionally, the modulated m-sequence may be transform precoded by a transform precoder 510 and mapped to subcarriers or REs by an RE mapper 512 for output for PUCCH transmission.

[0116] exist Figure 5B In the example of , note that device 520 includes the same elements as device 500, except that sequence generator 522 utilizes a different modulation scheme than sequence generator 502; namely, π / 2 binary phase shift keying (BPSK) modulation, as shown as π / 2 BPSK modulator 524.

[0117] With respect to the choice of when to use a particular modulation scheme, note that π / 2BPSK modulation tends to have a smaller peak-to-average power ratio (PAPR) and, therefore, may provide better performance when the UE or scheduled entity is transmitting at full power. On the other hand, QPSK modulation may provide better performance when the UE or scheduled entity is not transmitting at full power. This is because with QPSK, the modulated tone sends more information (i.e., two bits instead of one bit for BPSK modulation) and, therefore, will be able to send a sequence in less time and with fewer tones. In other respects, note that the network (e.g., Figure 2 The RAN 204 in the network may configure the UE or scheduled entity for using QPSK or π / 2BPSK modulation. In other aspects, note that other modulation schemes may be suitable for m-sequence generation, including quadrature amplitude modulation (i.e., M-QAM such as 16QAM, 64QAM, 256QAM, etc.) and phase shift keying modulation (i.e., M-PSK such as 8-PSK, 16PSK, etc.). In addition, the network may configure the d0 offset value used for m-sequence generation by the m-sequence generator 506. This configuration may be achieved through RRC signaling in the network from the base station or gNB to the UE, or may be a predetermined or a priori established value for the network, which is a setting configuration in the UE for the network.

[0118] Various examples are possible regarding which order of polynomial representation to use for the sequence generator 502 or 522 (particularly the m-sequence generator 506). In a first example, to convey k bits, an m-sequence of order k plus an additional sequence (e.g., an all-zero or all-one sequence) is used. As described above, for a k-order polynomial, there are only 2 k -1 m-sequence. Therefore, since 2 k sequences to send k bits, so an extra sequence is added to the set of m-sequences. Note further that when the full number of 2 k When there is -1 m-sequence, the offset value here is set to zero (ie, d0=0).

[0119] In another example, to convey k bits, an m-sequence of degree k+1 can be used. Since there are 2 (k+1) -1 m-sequences, so there are more m-sequences than are needed to deliver k bits (i.e., 2 k Therefore, we can get more m-sequences from 2 (k+1) -Select 2 from 1 m-sequence k A subset of m-sequences, wherein the subset is determined by an offset value d0. In this case, the offset value d0 may be configured by the network (e.g., gNB), or may be predetermined or pre-specified, in which case the scheduled entity or UE is pre-configured with the offset value.

[0120] In yet another example, to transfer k bits, k max An m-sequence of order k max ≥ k, and is an integer independent of the value of k. In this case, in order to Select 2 from the set of m-sequences k For a given sequence, a subsequence starting from x(d+d0) can be used. Alternatively, for a given d, a subsequence starting from x(η·d+d0) can be used, where η=1, 2, 4, ... (i.e., a sequence of powers of 2).

[0121] Figure 5C Another exemplary apparatus 540 is shown for transmission (such as UCI transmission in PUCCH) using m-sequence generation. In this example, the apparatus 540 does not utilize Figure 5A and 5B , i.e., converter 504). In contrast, device 540 includes a sequence generator 542, which includes an m-sequence generator 544. Generator 544 determines an m-sequence based on an input UCI payload (e.g., information bits corresponding to a binary payload) by initializing the m-sequence with a binary payload (i.e., information bits of a payload to be transmitted). In this particular case, the value d is set to zero (i.e., d=0). Thus, the truncated m-sequence determined by equation (3) above will be [x0, x1, ..., x N-1 ]=[x(d0),x(d0+1),…,x(d0+N-1)], where N is the length of the desired sequence, and according to the relationship [x(k-1),…,x(1),x(0)]=[a k-1 ,…,a0] or [x(k-1),…,x(1),x(0)]=[a0,…,a k-1 ] to initialize the sequence x(0), x(1),… Figure 5A and 5B The process and Figure 5C The difference between the processes of is that the offset used to select the portion of the m-sequence does not depend on the UCI payload. That is, a fixed offset value d0 will be used to generate all truncated m-sequences. The dependency on the binary payload (e.g., UCI payload) is conveyed through the initialization of the m-sequence. Note, on the other hand, that Figure 5C The means in allow to initialize the m-sequence with an all-zero vector (ie, if the UCI payload is all zeros). The resulting m-sequence will also be an all-zero sequence.

[0122] Also note that Figure 5A , 5B or Figure 5CThe m-sequence generator 506 in the apparatus may be configured to utilize Figure 6 6. As shown in this example, the LFSR 600 has a register length of k bits (ie, registers a0 to a1). k-1 The outputs of registers a0 to a1 are input to a modulo-2 summation or adder 602, the result of which is then fed back to register a during the next shift. k-1 The most significant bit at .

[0123] When generating m-sequences, it should also be noted that for each particular polynomial order, an exemplary polynomial of the form of equation (1) above may be utilized. Figure 7 A table or listing 700 of exemplary generator polynomials that may be utilized by an m-sequence generator (eg, 506) in accordance with some aspects is shown. As shown, the polynomials shown using the variable "D" are for orders 3 through 12, although the disclosure is not necessarily limited to these orders.

[0124] According to further aspects, when the presently disclosed method is used in multi-cell operation, scheduled entities or UEs in different cells may use the same set of base sequences. Thus, to mitigate interference, the UE may scramble the generated sequence with a cell-specific scrambling sequence or a scrambling ID-specific sequence related to the scrambling ID of a specific cell to randomize the transmission, thereby reducing interference.

[0125] Figure 8 An exemplary communication system is shown with at least two cells 802 and 804 and associated base stations or gNBs 806 and 808. The figure is used to illustrate that each UE can have an assigned scrambling ID n (which is independent of the value N or n used above), and the scrambling ID can be used to determine a scrambling sequence for scrambling the modulated m-sequence. According to various aspects, the scrambling sequence can be used to mitigate inter-cell interference as well as intra-cell interference. In the case of inter-cell interference, note that UE 810 or UE 812 in cell 802 can utilize a first scrambling ID n. ID1 , the first scrambling ID n ID1 The second scrambling ID n used by the UE 814 in another cell 804 ID2 These different cell-specific scrambling IDs are then used to scramble the modulated m-sequence to avoid inter-cell interference between transmissions from UE 810 and / or 812 in the first cell (ie, cell 802) and UE 814 in the second cell (ie, cell 804).

[0126] In other aspects, each UE in a cell can use a different scrambling sequence or ID to avoid intra-cell interference. Figure 8 As further shown in FIG. 8 , a UE 810 in cell 802 may have a unique scrambling ID n when generating a scrambling sequence. ID1-1 , while another UE 812 in the same cell 802 may use another scrambling IDn when generating a different scrambling sequence ID1-2 Therefore, these different scrambling sequences can help mitigate intra-cell interference for UEs utilizing the same m-sequence.

[0127] Furthermore, the scrambling of the modulated m-sequence may depend on the sequence generator (e.g. Figure 5A and 5B 502 or 522 in 502 or 522). As an example, if the m-sequence is modulated by π / 2BPSK, the m-sequence can be scrambled with another cell-specific generated equal-length binary sequence. On the other hand, if the m-sequence is modulated by QPSK, the QPSK sequence can be scrambled with another QPSK equal-length sequence. In other aspects, it is noted that for both QPSK and π / 2BPSK, the scrambling sequence can be another m-sequence of the same or different order.

[0128] According to further aspects, the scrambling sequence may be a Gold code or sequence determined based on a cell-specific scrambling ID. In certain aspects, for a Gold sequence, the scrambling ID is used to determine a random seed for generating the Gold sequence. Additionally, for an m-sequence, note that according to other aspects, the scrambling ID may be used to determine a location for deriving an m-sequence from a generated sequence.

[0129] Fig. 9 A block diagram of an exemplary apparatus 900 is shown, the exemplary apparatus 900 being used to generate a transmission (e.g., a PUCCH transmission) using an m-sequence and also including using scrambling to mitigate inter-cell interference and / or intra-cell interference. As shown, the apparatus 900 includes a plurality of elements, including a sequence generator 902 and an optional transform precoder 910, the sequence generator 902 having: Figure 5A and 5B A device similar to the binary to decimal converter 904 of the sequence generator 902, or as Figure 5C The example shown in FIG. 9 does not have this element; m-sequence generator 906; modulator 908 operable according to π / 2BPSK or QPSK modulation. The apparatus 900 further comprises a scrambler 914 configured to scramble the modulated m-sequence output by the sequence generator 902 before being mapped to resource elements by the RE mapper 916.

[0130] The scrambling sequence generator 918 may be associated with or in communication with the scrambler 914. Specifically, the scrambling sequence generator 918 may generate a scrambling sequence based on a scrambling ID (UE or cell specific), a Gold sequence, or another QPSK sequence as discussed above. Additionally, as previously discussed, the selection of a scrambling sequence may be determined based on the type of modulation scheme used in the modulator.

[0131] Fig.10 1 is a diagram illustrating an example of a hardware implementation for a wireless communication device 1000 employing a processing system 1014. For example, the wireless communication device 1000 may be a scheduled entity, such as a user equipment (UE) or other device configured to communicate wirelessly with a base station, such as Figure 1 , 2 In some embodiments, the wireless communication device 1000 may correspond to Figure 1 The scheduled entity 106 (eg, UE, etc.) Figure 2 UE 222, 224, 226, 228, 230, 232, 234, 238, 240 or 242, or Figure 8 One or more of UE 810, 812 or 814 in.

[0132] The wireless communication device 1000 may be implemented with a processing system 1014 including one or more processors 1004. Examples of the processor 1004 include a microprocessor, a microcontroller, a digital signal processor (DSP), a field programmable gate array (FPGA), a programmable logic device (PLD), a state machine, a gated logic, a discrete hardware circuit, and other suitable hardware configured to perform the various functions described throughout the present disclosure. In various examples, the wireless communication device 1000 may be configured to perform any one or more of the functions described herein. That is, the processor 1004 as used in the wireless communication device 1000 may be used to implement any one or more of the processes and procedures described below.

[0133] In some instances, the processor 1004 may be implemented via a baseband or modem chip, and in other embodiments, the processor 1004 may include multiple devices that are distinct and different from the baseband or modem chip (e.g., in the case where they can work together to implement the examples discussed herein). And as described above, various hardware arrangements and components other than a baseband modem processor may be used in embodiments, including RF chains, power amplifiers, modulators, buffers, interleavers, adders / summers, etc.

[0134] In this example, the processing system 1014 can be implemented with a bus architecture represented generally by the bus 1002. The bus 1002 may include any number of interconnecting buses and bridges, depending on the specific application and overall design constraints of the processing system 1014. The bus 1002 communicatively couples various circuits including one or more processors (represented generally by the processor 1004), a memory 1005, and a computer-readable medium (represented generally by the computer-readable medium 1006). The bus 1002 may also link various other circuits, such as timing sources, peripherals, voltage regulators, and power management circuits, etc., which are well known in the art and therefore will not be described further. The bus interface 1008 provides an interface between the bus 1002 and the transceiver 1010 and between the bus 1002 and the user interface 1012. The transceiver 1010 provides an interface or unit for communicating with various other devices via a wireless transmission medium. On the other hand, the bus interface 1008 can be configured to provide a communication interface or unit for communicating with various other devices and equipment (e.g., other devices contained in the same device with a wireless communication device or other external device) via an internal bus or an external transmission medium (such as an Ethernet cable). Depending on the nature of the device, a user interface 1012 (e.g., a keypad, display, speaker, microphone, joystick, etc.) may also be provided. Of course, such a user interface 1012 is optional and may be omitted in some examples such as IoT devices.

[0135] The processor 1004 is responsible for managing the bus 1002 and general processing, including executing software stored on the computer-readable medium 1006. When executed by the processor 1004, the software causes the processing system 1014 to perform the various functions described below for any particular device. The computer-readable medium 1006 and the memory 1005 can also be used to store data that is manipulated by the processor 1004 when executing the software.

[0136] One or more processors 1004 in the processing system can execute software. Software should be broadly interpreted to mean instructions, instruction sets, codes, code segments, program codes, programs, subroutines, software modules, applications, software applications, software packages, routines, subroutines, objects, executable programs, threads of execution, processes, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. The software may reside on a computer-readable medium 1006.

[0137] The computer-readable medium 1006 may be a non-transitory computer-readable medium. As an example, a non-transitory computer-readable medium includes a magnetic storage device (e.g., a hard disk, a floppy disk, a magnetic stripe), an optical disk (e.g., a compact disc (CD) or a digital versatile disc (DVD)), a smart card, a flash memory device (e.g., a card, a stick or a key drive), a random access memory (RAM), a read-only memory (ROM), a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), a register, a removable disk, and any other suitable medium for storing software and / or instructions that can be accessed and read by a computer. The computer-readable medium 1006 may reside in the processing system 1014, outside the processing system 1014, or distributed on multiple entities including the processing system 1014. The computer-readable medium 1006 may be embodied in a computer program product. As an example, a computer program product may include a computer-readable medium in a packaging material. Those skilled in the art will recognize how to best implement the functions presented throughout the present disclosure depending on the specific application and the overall design constraints imposed on the entire system.

[0138] The wireless communication device 1000 may be configured to perform any one or more operations described herein (e.g., as described above in conjunction with Figure 4-9 As described and in combination with Fig.11 In some aspects of the present disclosure, the processor 1004, as used in the wireless communication device 1000, may include circuit systems configured for various functions.

[0139] Processor 1004 may include m-sequence generation circuitry 1042. m-sequence generation circuitry 1042 may include one or more hardware components that provide for execution of the same techniques as described herein. Figure 5A , 5B , 6 and 7. The m-sequence generation circuit system 1042 may also include one or more hardware components that provide physical structures for executing various processes related to the selection of polynomials, initialization of sequence generation, and selection of starting positions as described above. The m-sequence generation circuit system 1042 may also be configured to execute m-sequence generation software 1052 included on the computer-readable medium 1006 to implement one or more functions described herein.

[0140] Processor 1004 may include modulation circuitry 1044 configured to perform π / 2BPSK or QPSK modulation as described herein. Additionally, modulation circuitry 1044 may include hardware or physical structures for determining when to use a particular modulation scheme, which may be based on power transmission level and peak-to-average power ratio (PAPR). Modulation circuitry 1044 may also be configured to execute modulation software 1054 included on computer-readable medium 1006 to implement one or more functions described herein.

[0141] The processor 1004 may include a decimal conversion circuit system 1046 configured to perform conversion of a binary payload (e.g., UCI bits) to a decimal value as described herein. The decimal conversion circuit system 1046 may also be configured to execute decimal conversion software 1056 included on the computer-readable medium 1106 to implement one or more functions described herein.

[0142] Processor 1004 may also include scrambling sequence generation circuitry 1048, which is configured as described herein in conjunction with Figure 8 and 9 The modulated m-sequence is scrambled as discussed above. The scrambling sequence generation 1048 may also be configured to execute scrambling sequence generation software 1058 included on the computer readable medium 1106 to implement one or more functions described herein.

[0143] Fig.11 1 is a flow chart illustrating a method 1100 for a wireless communication system according to some aspects. As described below, some or all of the illustrated features may be omitted in certain implementations within the scope of the present disclosure, and some of the illustrated features may not be necessary for implementation of all examples. In some examples, the method 1100 may be performed by Fig.10 The wireless communication device 1000 shown in FIG. 1 may be used to perform the above operation, or the wireless communication device 1000 may be used to perform the above operation. Figure 1 , 2 , 5A-5C, 6 and / or 9. In some aspects, the wireless communication device may be a user equipment (UE). In some examples, the method 1100 may be performed by any suitable device or unit for performing the functions or algorithms described below.

[0144] At block 1102, a wireless communication device such as a UE may convert a binary payload to be transmitted (i.e., information bits of the payload) into a decimal integer value. Fig.10 The decimal conversion circuit system 1046 shown and described above is combined with Figure 5A and 5B The converter 504 shown and described above is combined with Fig. 9The converter 904 shown and described, or its equivalent, may provide a means for converting a binary payload to be transmitted into a decimal integer value. In addition, according to some aspects, the binary payload may include uplink control information (UCI), but need not be limited thereto. As described above, in Figure 5C In the case of an apparatus, in the case of an m-sequence generator based on an input UCI payload, the conversion process shown in block 1102 may not be required.

[0145] Next, method 1100 includes generating a modified m-sequence based on one or more predetermined parameters, as shown in block 1104. In one aspect, in the case of utilizing conversion to decimal integer values, the process of block 1104 may include using the decimal integer value determined by the process of optional block 1102. In another aspect, the above combined Figure 5A and 5B The generator 506 shown and described above combines Fig. 9 The generator 906 shown and described, or Fig.10 The m-sequence generation circuit system 1042 or its equivalent in the embodiment of the present invention may provide a unit for generating a modified m-sequence based on one or more predetermined parameters. In addition, the one or more predetermined parameters may include: a polynomial of a specific order, such as Figure 7 ; a starting position, which may be further determined, established, or set by using an offset value (e.g., d0); and an initialization sequence as previously described. According to further aspects, it is noted that the generation of the m-sequence may be implemented based on various options, such as setting the m-sequence to order k, k+1, or k as previously discussed. max .

[0146] The method 1100 may further include in blocks 1102 and 1104, generating the modified m-sequence includes: converting information bits of a payload to be transmitted into decimal integer values, and generating the modified m-sequence based at least on the decimal integer values, wherein the modified m-sequence is limited to a predetermined sequence length. In addition, the decimal integer value corresponds to a starting position of the modified m-sequence.

[0147] Once the m-sequence(s) are determined in block 1104, flow proceeds to block 1106 where the m-sequence(s) are modulated based on the modulation scheme to derive a modulated m-sequence. Figure 5A The QPSK modulator 508 shown and described above is combined with Figure 5B The π / 2BPSK modulator 524 shown and described above is combined with Fig. 9The QPSK or π / 2BPSK modulator 908 shown and described, or a combination of the above Fig.10 The modulation generation circuit system 1044, or its equivalent, shown and described, may provide a means for modulating the m-sequence based on the modulation scheme to derive a modulated m-sequence. Additionally, the determination of the modulation scheme may be determined in the network or gNB and sent to the UE via RRC messaging / signaling (which may include dynamic selection of the modulation scheme based on network conditions), or established a priori.

[0148] In a further aspect, the method 1100 can cause the generation of the modified m-sequence to be based on truncating the m-sequence or repeating the m-sequence. For example, the modification can include: truncating the m-sequence to obtain a modified m-sequence of a first predetermined sequence length, the first predetermined sequence length will be less than the original length of the m-sequence. In another example, the generation of the modified m-sequence is achieved by repeating the m-sequence to obtain a modified sequence of a second predetermined sequence length, wherein the second sequence length will be greater than the length of the original m-sequence.

[0149] In addition, the method 1100 includes: transmitting the modulated m-sequence in the wireless channel, as shown in block 1108. The process in block 1108 may include various processes, such as the previously described process in conjunction with Figure 5A , 5B and 9, including: mapping the modified m-sequence to one or more resource elements (REs) in at least one transmission time slot before transmitting the modulated modified m-sequence in the wireless channel. In addition, the transmitting in block 1108 may also include: using as combined Figure 8 and 9 The scrambling discussed (e.g., see also scrambler 914 and scrambling sequence generator 918). In a further aspect, the wireless channel may be a PUCCH channel sent from a UE to a base station or gNB, but need not be limited thereto. According to other aspects, the above in conjunction with Figure 5A and 5B The RE mapper 512 shown and described above is combined with Fig. 9 The scrambling 914, scrambling sequence generator 918 and RE mapper 916 shown and described, and / or in combination with the above Fig.10 The scrambling sequence generation circuitry 1048 and transceiver 1010, or their equivalents, shown and described may provide means for transmitting a modulated m-sequence in a wireless channel.

[0150] As mentioned before, the advantage of using an m-sequence based design is that the complexity of detecting an m-sequence at the receiver side is much lower than designs for detecting other types of sequences. Fig.12An exemplary receiver 1200 for receiving, detecting and / or decoding the above-described modified m-sequence based transmission is shown. Note that in order to detect the sequence at the receiver, the receiver 1200 converts the received signal (composed of [y0, ..., y N-1 ] means) with all possible 2 k The sequences are cross-correlated, as will be explained below.

[0151] As shown, the receiver 1200 includes optional circuitry or software 1202 for removing transform precoding for the received signal if transform precoding was performed at the transmitter. In addition, the receiver 1200 includes a padding block 1204 configured to zero-fill the received signal sequence to a length of 2. n , where n represents the order of the polynomial used to generate the m-sequence. Padding is performed because the transmitted signal is a modified m-sequence.

[0152] Next, the receiver includes a permutation block 1206 for permuting the zero-padded sequence from block 1204. After permuting the zero-padded sequence in block 1206, a cross-correlation may be performed on the received sequence. In particular, note that if each candidate m-sequence is considered as a row vector and all candidate sequences are stacked together (i.e., a total of 2 k sequences or row vectors), you can create a k ×2 n The matrix M, where 2 n is the length of the received sequence after zero padding. Note that the order n of the polynomial generating the m-sequence may be different from the number k of information bits sent by the transmitter. And the output of the fast Hadamard transform in block 1208 has a length of 2 n The sequence is similar to the received signal Y = [y(0),…,y(2 n -1)] is simply the inner product, and thus the calculation of 2 k The cross-correlation result (correlator) is equivalent to the following matrix multiplication:

[0153] M.Y H (4)

[0154] Among them, the vector matrix Y H represents the conjugate transpose (also known as the Hermitian transpose) of Y. The structure of the stacked m-sequence allows the matrix multiplication in (4) to be computed using a low complexity algorithm. In particular, according to certain aspects, the matrix multiplication of equation (4) can be performed by blocks 1208 labeled Fast Hadamard Transform and blocks 1209 labeled Extract 2 kIn particular, if the sequence is an m-sequence, the Hermitian transpose Y H The multiplication with the matrix M can be efficiently computed via a fast Hadamard transform, where the output from block 1208 is 2 n A signal.

[0155] Additionally, with respect to the permutation operation performed by block 1206, note that for a length of 2 n The (fast) Hadamard transform of a vector a is equivalent to Ha, where H denotes the Hadamard matrix. However, when detecting m-sequences, equation (4) is performed with the matrix M (i.e., M·Y H ), where M is a matrix generated by stacking m-sequences together. The Hadamard matrix H used in the calculation can be obtained by permuting the columns of M. Therefore, to calculate M·Y H , the signal Y may first be permuted to obtain a permuted version of Y (which may be represented as a matrix “Z”), and then Z may be multiplied by H, where M·Y H =H·Z H Therefore, Y is permuted in block 1206 before performing a fast Hadamard transform in block 1208 .

[0156] After the cross-correlation in block 1208, the 2 n The output signal is extracted 2 k A cross-correlation metric is provided, as shown in block 1210. k The cross-correlation metric corresponds to the received signal y and 2 k More specifically, if k bits are sent in the transmitter, the transmitter will select from 2 based on the k-bit payload. k After receiving the signal, the receiver will need to determine whether the transmitter sent a sequence of 2 k Therefore, the receiver can calculate the received signal and 2 k The determination is made by calculating the cross-correlation between each of the candidate sequences and determining the candidate sequence that produces the largest cross-correlation.

[0157] The reason for extracting the cross-correlation metric is that since the transmitter has sent k bits, the receiver needs to calculate 2 k cross-correlation measure. However, as previously described, due to truncation and scrambling, the order n of the m-sequence can be greater than k. As a result, the fast Hadamard transform in block 1208 can produce 2 n Therefore, the receiver needs to n Determine which 2 of the calculated values k The value corresponds to 2k A cross-correlation measure.

[0158] Finally, these cross-correlation metrics determined in block 1210 are then input to a max block 1212, which is used to determine 2 k The maximum value of the mutual correlation metrics. In particular, the receiver will determine that the candidate sequence that produces the maximum mutual correlation is the sequence sent by the transmitter. This sequence will be the final detected sequence at the receiver and output from box 1212. If the detected sequence is the same as the transmitted sequence, the detection is correct. Otherwise, an error occurs and the receiver will not be able to correctly recover the UCI bit. For example, if k=2, and there are four possible sequences, such as x1, x2, x3, and x4. The receiver will need to calculate the mutual correlation between each of the x1, x2, x3, and x4 sequences and the received y signal. If the mutual correlation metric is represented by a1, a2, a3, and a4, and is related to the corresponding x1, x2, x3, and x4, the receiver will check the maximum value of a1, a2, a3, and a4. If a1 is the maximum value, the receiver determines that x1 is the transmitted sequence. Similarly, if a2 is the maximum value, the receiver determines that x2 is the transmitted sequence, and so on.

[0159] Fig.13 1 is a block diagram illustrating an example of a hardware implementation of a scheduling entity 1300 employing a processing system 1314. For example, the scheduling entity 1300 may be a scheduling entity such as a base station, a gNB, or other device configured to wirelessly communicate with a UE, such as Figure 1 , 2 In some embodiments, as some examples, the wireless communication device 1300 may correspond to Figure 1 The scheduling entity 108 (eg, a base station, etc.) Figure 2 Base station 210 or 212 or RRH 216, or Figure 8 One or more of the gNBs 806 or 808 in.

[0160] The scheduling entity 1300 may be implemented with a processing system 1314 including one or more processors 1304. Examples of processors 1304 include microprocessors, microcontrollers, digital signal processors (DSPs), field programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, gated logic, discrete hardware circuits, and other suitable hardware configured to perform the various functions described throughout the present disclosure. In various examples, the scheduling entity 1300 may be configured to perform any one or more of the functions described herein. That is, the processor 1304 as used in the scheduling entity 1300 may be used to implement any one or more of the processes and procedures described below.

[0161] In this example, the processing system 1314 may be implemented with a bus architecture generally represented by the bus 1302. The bus 1302 may include any number of interconnecting buses and bridges, depending on the specific application and overall design constraints of the processing system 1314. The bus 1302 communicatively couples various circuits including one or more processors (generally represented by the processor 1304), a memory 1305, and a computer-readable medium (generally represented by the computer-readable medium 1306). The bus 1302 may also link various other circuits, such as timing sources, peripherals, voltage regulators, and power management circuits, etc., which are well known in the art and therefore will not be described further. The bus interface 1308 provides an interface between the bus 1302 and the transceiver 1310. The transceiver 1310 provides one or more communication interfaces or a unit for communicating with various other devices through a transmission medium (e.g., air, wired) via multiple communication interfaces. Depending on the nature of the device, a user interface 1312 (e.g., a keypad, a display, a speaker, a microphone, a joystick, a touch screen, etc.) may also be provided. Of course, such a user interface 1312 is optional and may be omitted in some examples.

[0162] The processor 1304 is responsible for managing the bus 1302 and general processing, including executing software stored on the computer-readable medium 1306. When executed by the processor 1304, the software causes the processing system 1314 to perform various functions described below for any particular device. The computer-readable medium 1306 and memory 1305 can also be used to store data that is manipulated by the processor 1304 when executing the software.

[0163] One or more processors 1304 in the processing system can execute software. Software should be broadly interpreted to mean instructions, instruction sets, codes, code segments, program codes, programs, subroutines, software modules, applications, software applications, software packages, routines, subroutines, objects, executable programs, threads of execution, processes, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. The software may reside on a computer-readable medium 1306.

[0164] Computer readable medium 1306 may be a non-transitory computer readable medium. As an example, non-transitory computer readable media include magnetic storage devices (e.g., hard disks, floppy disks, magnetic strips), optical disks (e.g., compact disks (CDs) or digital versatile disks (DVDs)), smart cards, flash memory devices (e.g., card, stick or key drives), random access memory (RAM), read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), registers, removable disks, and any other suitable medium for storing software and / or instructions that can be accessed and read by a computer. Computer readable medium 1306 may reside in processing system 1314, outside of processing system 1314, or distributed across multiple entities including processing system 1314. Computer readable medium 1306 may be embodied in a computer program product. As an example, a computer program product may include a computer readable medium in a packaging material. Those skilled in the art will recognize how to best implement the functions presented throughout this disclosure depending on the specific application and the overall design constraints imposed on the entire system.

[0165] In some aspects of the present disclosure, processor 1304 may include circuitry configured for various functions. In one example, processor 1304 may include m-sequence cross-correlation circuitry 1342, as an example, configured to cross-correlate received m-sequence-based transmissions to determine error correction and channel coding. In one example, m-sequence cross-correlation circuitry 1342 may include a fast Hadamard transform to implement the previously described Fig.12 Additionally, the m-sequence cross-correlation circuitry 1342 may be further configured to execute m-sequence cross-correlation software 1352 included on the computer-readable medium 1306 to implement one or more of the functions described herein.

[0166] In some additional aspects, the processor 1304 may include a cross-correlation metric extraction circuitry 1344 configured to extract 2 k A cross-correlation measure, such as Fig.12 In addition, the cross-correlation metric extraction circuit system 1344 can also be configured to execute the cross-correlation metric extraction software 1354 included on the computer-readable medium 1306 to implement one or more functions described herein.

[0167] In some additional aspects, the processor 1304 may include a zero padding circuit system 1346 configured to add zero padding to the received transmission based on the modified m-sequence. In one example, the zero padding circuit system 1346 may be configured to zero pad the received signal y(0), ..., y(N-1) to a length of 2 n , where n represents the order of the polynomial generating the m-sequence transmission. In addition, the zero padding circuit system 1346 can also be configured to execute the zero padding software 1356 included on the computer readable medium 1306 to implement one or more of the functions described herein.

[0168] Of course, in the above examples, the circuit system included in the processor 1304 is provided only as an example, and other units for performing the described functions may be included in various aspects of the present disclosure, including but not limited to instructions stored in the computer-readable medium 1306, or using, for example, the present invention for Fig.13 The described process and / or algorithm is Figure 1 , 2 , 8 and 12. Any other suitable device or unit described in any one of them.

[0169] Fig.14 1400 is a flow chart illustrating a method 1400 for a wireless communication system according to some aspects. As described below, in certain implementations within the scope of the present disclosure, some or all of the illustrated features may be omitted, and some of the illustrated features may not be necessary for implementation of all examples. In some examples, the method 1400 may be performed by Fig.13 The wireless communication device 1300 shown in FIG. 1 may be executed, or may also be used Figure 1 , 2 and / or the apparatus shown in 9. In some aspects, the wireless communication device may be a user equipment (UE). In some examples, the method 1400 may be performed by any suitable apparatus or unit for performing the functions or algorithms described below.

[0170] Method 1400 includes receiving a signal based on an m-sequence, such as a PUCCH (and UCI information therein), as shown in block 1402. In one aspect, the m-sequence is a modified sequence. In another aspect, the above combined Fig.12 The block 1202 shown and described above combines Fig.13 The transceiver 1310, or its equivalent, shown and described may provide means for receiving a modified m-sequence based signal.

[0171] Next, method 1400 may include padding the received modified m-sequence with zeros to increase the length of the received signal to a length of 2. n, where n represents the order of the polynomial generating the m-sequence at the transmitter, as shown in block 1404. In one aspect, the above combination Fig.12 The zero padding block 1204 shown and described above is combined Fig.13 The zero padding circuitry 1346, or its equivalent, shown and described may provide means for zero padding a received modified m-sequence.

[0172] In addition, method 1400 includes permuting the zero-padded modified m-sequence, as shown in block 1406. In one aspect, the above combination Fig.12 The permutation 1206 shown and described, the above combination Fig.13 The zero padding circuitry 1346, or its equivalent, shown and described may also provide means for permuting the zero-padded m-sequence.

[0173] Next, the method 1400 includes performing a fast Hadamard transform on the permuted zero-padded modified m-sequence, as shown in block 1408. In one aspect, the above Fig.12 The fast Hadamard transform block 1208 shown and described above is combined with Fig.13 The m-sequence cross-correlation circuitry 1342, or its equivalent, shown and described may also provide means for performing a fast Hadamard transform on the permuted, zero-padded, modified m-sequence.

[0174] In addition, method 1400 includes block 1410, which implements extracting a cross-correlation metric based on the results of the fast Hadamard transform performed in block 1408. In one aspect, the above Fig.12 The extraction block 1210 shown and described above is combined with Fig.13 The cross-correlation metric extraction circuitry 1344, or its equivalent, shown and described may also provide means for extracting a cross-correlation metric based on the results of a fast Hadamard transform.

[0175] In further aspects, method 1300 may also include: a base station (e.g., UE 1300) selecting a modulation scheme that the UE can use to generate a modified m-sequence, and sending to the UE one of radio resource control (RRC) signaling or downlink control information (DCI) configured to indicate the selection of the modulation scheme.

[0176] Several aspects of a wireless communication network have been presented with reference to exemplary embodiments. As those skilled in the art will readily appreciate, various aspects described throughout this disclosure may be extended to other telecommunication systems, network architectures, and communication standards.

[0177] The following provides an overview of various aspects of the present disclosure:

[0178] Aspect 1: A method for performing wireless communication in a user equipment (UE) in a communication network, the method comprising: generating a modified maximum sequence (m-sequence) from information bits of a payload to be transmitted based on one or more predetermined parameters; modulating the modified m-sequence based on a modulation scheme to derive a modulated modified m-sequence; and sending the modulated modified m-sequence in a wireless channel.

[0179] Aspect 2: A method according to Aspect 1, wherein generating a modified m-sequence further comprises: converting information bits of a payload to be transmitted into decimal integer values; and generating a modified m-sequence based at least on the decimal integer value, wherein the modified m-sequence is limited to a predetermined sequence length.

[0180] Aspect 3: The method according to aspect 2, wherein the decimal integer value corresponds to the starting position of the modified m-sequence.

[0181] Aspect 4: A method according to any one of Aspects 1 to 3, wherein generating a modified m-sequence comprises one of the following: truncating the m-sequence to obtain a modified m-sequence of a first predetermined sequence length; or repeating the m-sequence to obtain a modified sequence of a second predetermined sequence length.

[0182] Aspect 5: The method according to any one of aspects 1 to 4, wherein the wireless channel is a sequence-based physical uplink control channel (PUCCH).

[0183] Aspect 6: The method according to any one of Aspects 1 to 5, wherein the information bits of the payload to be transmitted include uplink control information (UCI).

[0184] Aspect 7: The method according to any one of Aspects 1 to 6, wherein the modulation scheme comprises one of a π / 2 binary phase shift keying (BPSK) modulation scheme or a quadrature phase shift keying (QPSK) modulation scheme.

[0185] Aspect 8: A method according to any one of Aspects 1 to 7, wherein sending the modulated modified m-sequence further includes: before sending the modulated modified m-sequence in the wireless channel, mapping the modified m-sequence to one or more resource elements (REs) in at least one transmission time slot.

[0186] Aspect 9: A method according to any one of Aspects 1 to 8, wherein sending the modulated modified m-sequence further includes: transform precoding the modulated modified m-sequence before sending the modulated modified m-sequence in the wireless channel.

[0187] Aspect 10: A method according to any one of Aspects 1 to 9, wherein the one or more predetermined parameters include at least one of the following: an initialization sequence of the modified m-sequence, a starting position of the modified m-sequence, and a polynomial representation of a specific order for determining the modified m-sequence.

[0188] Aspect 11: The method according to any one of aspects 1 to 10, wherein the one or more predetermined parameters include a preconfigured offset value configured to set a starting position of the modified m-sequence.

[0189] Aspect 12: The method according to any one of aspects 1 to 11 further comprises: using a plurality of modified m-sequences of a predetermined order of a generating polynomial to convey k bits of information bits of a payload to be transmitted.

[0190] Aspect 13: The method according to aspect 12 further comprises: setting the predetermined order of the plurality of modified m-sequences to a value equal to k; using 2 of the k-order in the plurality of truncated m-sequences; k - 1 modified m-sequence; and adding an additional sequence to the 2 k -1 modified m-sequences in order to convey the k bits.

[0191] Aspect 14: The method according to aspect 13, wherein the one additional sequence comprises one of an all-zero sequence or an all-one sequence.

[0192] Aspect 15: The method according to any one of Aspects 1 to 12 further comprises: setting a preconfigured offset value, wherein the preconfigured offset value is configured to set the starting position of the modified m-sequence to a zero value, wherein no offset is used.

[0193] Aspect 16: The method according to aspect 12, further comprising: setting the predetermined order of the plurality of truncated m-sequences to be equal to a value k+1; and setting the k+1 order of 2 k+1 A subset of -1 modified m-sequences is used for the plurality of modified m-sequences, wherein the subset is determined by an offset value configured to set a starting position of the modified m-sequences.

[0194] Aspect 17: The method according to aspect 11 or aspect 16, wherein the offset value is set in the wireless device by a base station through radio resource control (RRC) signaling.

[0195] Aspect 18: The method according to aspect 12 further comprises: setting the predetermined order of the plurality of modified m-sequences to be equal to the maximum k value (k max ), where kmax ≥ k, and is an integer independent of k; and the order of the modified m-sequences is k max The total number of modified m-sequences is Among the modified m-sequences, select 2 k A set of modified m-sequences, wherein the set is further selected by selecting a subsequence starting from a value x(d+d0), wherein d is a decimal integer and d0 is a predetermined offset value.

[0196] Aspect 19: The method according to aspect 12 further comprises: setting the predetermined order of the plurality of modified m-sequences to be equal to the maximum k value (k max ), where k max ≥ k, and is an integer independent of k; and the order of the modified m-sequences is k max The total number of modified m-sequences is Among the modified m-sequences, select 2 k A set of modified m-sequences, wherein the set is further selected by selecting a subsequence starting from a value x(η·d+d0), wherein the value η is selected from a sequence of powers of two, d is a decimal integer, and d0 is a predetermined offset value.

[0197] Aspect 20: The method according to any one of aspects 1 to 19 further comprises: before sending the modulated modified m-sequence, scrambling the modulated modified m-sequence using a predetermined scrambling sequence.

[0198] Aspect 21: A method according to Aspect 20, wherein the predetermined scrambling sequence comprises one of the following: for a π / 2 binary phase shift keying (BPSK) modulation scheme, a binary sequence having a length equal to the modified m-sequence; or for a quadrature phase shift keying (QPSK) modulation scheme, a QPSK modulated binary sequence having a length equal to the modified m-sequence.

[0199] Aspect 22: The method according to aspect 21, wherein the predetermined scrambling sequence comprises a Gold sequence determined based on a cell-specific scrambling ID.

[0200] Aspect 23: The method according to Aspect 22, wherein the scrambling ID is used to determine a random seed used to generate the Gold sequence.

[0201] Aspect 24: The method according to aspect 20, wherein the predetermined scrambling sequence is a modified m-sequence for scrambling determined based on a cell-specific scrambling ID.

[0202] Aspect 25: The method according to any one of Aspects 1 to 25 further comprises: receiving control signaling configured to indicate selection of the modulation scheme from a base station.

[0203] Aspect 26: The method according to aspect 25, wherein the control signaling includes one of radio resource control (RRC) signaling or downlink control information (DCI).

[0204] Aspect 27: A UE or a scheduled entity configured for wireless communication, comprising a processor and a memory coupled to the processor, wherein the processor and the memory are configured to perform the method of any one of aspects 1 to 26.

[0205] Aspect 28: A method for wireless communication in a base station in a wireless communication network, the method comprising: receiving a modified maximum sequence (m-sequence) signal from a user equipment (UE); padding the received modified m-sequence with zeros to increase the length of the received sequence to a length of 2 n , wherein n represents the order of the polynomial used to generate the modified m-sequence to derive a zero-padded m-sequence; permuting the zero-padded m-sequence; performing a fast Hadamard transform on the permuted zero-padded m-sequence; and extracting a cross-correlation measure based on the result of the fast Hadamard transform.

[0206] Aspect 29: The method according to Aspect 28 further includes: selecting a modulation scheme that the UE can use to generate the modified m-sequence; and sending to the UE one of radio resource control (RRC) signaling or downlink control information (DCI) configured to indicate the selection of the modulation scheme.

[0207] Aspect 30: A base station, gNB or network entity configured for wireless communication, comprising a processor and a memory coupled to the processor, wherein the processor and the memory are configured to execute the method of Aspect 28 or Aspect 29.

[0208] Aspect 31: An apparatus configured for wireless communication, comprising at least one unit for performing the method of any one of aspects 1 to 26 or aspects 28 to 29.

[0209] Aspect 32: A non-transitory computer-readable medium storing computer-executable code, comprising code for causing an apparatus to perform the method of any one of aspects 1 to 26 or aspects 28 to 29.

[0210] For example, various aspects may be implemented within other systems defined by 3GPP, such as Long Term Evolution (LTE), Evolved Packet System (EPS), Universal Mobile Telecommunications System (UMTS), and / or Global System for Mobile Communications (GSM). Various aspects may also be extended to systems defined by the Third Generation Partnership Project 2 (3GPP2), such as CDMA2000 and / or Evolution-Data Optimized (EV-DO). Other examples may be implemented within systems employing IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE802.20, Ultra Wideband (UWB), Bluetooth, and / or other suitable systems. The actual telecommunication standard, network architecture, and / or communication standard employed will depend on the specific application and the overall design constraints imposed on the system.

[0211] In this disclosure, the word "exemplary" is used to mean "serving as an example, instance, or illustration". Any implementation or aspect described herein as "exemplary" is not necessarily to be construed as preferred or superior to other aspects of the disclosure. Likewise, the term "aspect" does not require that all aspects of the disclosure include the discussed features, advantages, or modes of operation. The term "coupled" is used herein to refer to a direct or indirect coupling between two objects. For example, if object A physically contacts object B, and object B contacts object C, objects A and C can still be considered to be coupled to each other - even if they are not in direct physical contact with each other. For example, a first object can be coupled to a second object even if the first object has never been in direct physical contact with the second object. The terms "circuit" and "circuitry" are used broadly and are intended to include: hardware implementations of electrical devices and conductors that, when connected and configured, enable the performance of the functions described in the disclosure without limitation on the type of electronic circuits; and software implementations of information and instructions that, when executed by a processor, enable the performance of the functions described in the disclosure.

[0212] Figure 1-14 One or more of the components, steps, features and / or functions shown in the drawings can be rearranged and / or combined into a single component, step, feature or function or embodied in several components, steps or functions. Additional elements, components, steps and / or functions can also be added without departing from the novel features disclosed herein. Figure 1-14 The apparatus, devices and / or components shown in the can be configured to perform one or more of the methods, features or steps described herein. The novel algorithms described herein can also be effectively implemented in software and / or embedded hardware.

[0213] It should be understood that the specific order or hierarchy of steps in the disclosed methods is an illustration of an exemplary process. Based on design preferences, it is understood that the specific order or hierarchy of steps in the methods may be rearranged. The accompanying method claims present elements of the various steps in an exemplary order, and are not meant to be limited to the specific order or hierarchy presented unless specifically noted herein.

[0214] The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects. Therefore, the claims are not intended to be limited to the various aspects shown herein, but should be given the full scope consistent with the language of the claims, wherein the reference to an element in the singular is not intended to mean "one and only one", unless specifically so stated, but "one or more". Unless otherwise specifically stated, the term "some" refers to one or more. The phrase "at least one" referring to a list of items refers to any combination of these items, including a single member. For example, "at least one of a, b or c" is intended to cover: a; b; c; a and b; a and c; b and c; and a, b and c. All structural and functional equivalents of the elements of the various aspects described in the entire disclosure that are known or later known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be covered by the claims. In addition, regardless of whether these disclosures are explicitly stated in the claims, nothing disclosed herein is intended to contribute to the public.

Claims

1. A method for wireless communication in a user equipment (UE), the method comprising: At least one modified maximal sequence (m-sequence) is generated from the information bits of the payload to be transmitted based on a generating polynomial having a value k, k+1 or a maximum k value k max , where k is the number of information bits of the payload to be transmitted, and where k max ≥k and is an integer independent of k; modulating the at least one modified m-sequence based on a modulation scheme to derive at least one modulated modified m-sequence; and The at least one modulated modified m-sequence is transmitted.

2. The method according to claim 1, wherein: Generating the at least one modified m-sequence further comprises: Converting the information bits of the payload to be sent into a decimal integer value; and The at least one modified m-sequence is generated based at least on the decimal integer value, wherein the at least one modified m-sequence is limited to a predetermined sequence length and the decimal integer value corresponds to a starting position of the at least one modified m-sequence.

3. The method according to claim 1, wherein: Generating the at least one modified m-sequence comprises one of: truncating at least one m-sequence to obtain the at least one modified m-sequence of a first predetermined sequence length; or The at least one m-sequence is repeated to obtain the at least one modified sequence of a second predetermined sequence length.

4. The method according to claim 1, wherein: The at least one modulated modified m-sequence is transmitted on a sequence-based physical uplink control channel (PUCCH).

5. The method according to claim 1, wherein: The information bits of the payload to be transmitted include uplink control information (UCI).

6. The method according to claim 1, wherein: The modulation scheme includes one of a π / 2 binary phase shift keying (BPSK) modulation scheme or a quadrature phase shift keying (QPSK) modulation scheme.

7. The method according to claim 1, wherein: Transmitting the at least one modulated modified m-sequence further comprises: Prior to transmitting the at least one modulated modified m-sequence, the at least one modified m-sequence is mapped to one or more resource elements (REs) in at least one transmission slot.

8. The method according to claim 1, wherein: Transmitting the at least one modulated modified m-sequence further comprises: Prior to transmitting the at least one modulated modified m-sequence, the at least one modulated modified m-sequence is transform precoded.

9. The method according to claim 1, wherein: Generating the at least one m-sequence is also based on at least one of: an initialization sequence of the at least one modified m-sequence, and a starting position of the at least one modified m-sequence.

10. The method according to claim 1, wherein: Generating the at least one m-sequence is also based on a preconfigured offset value configured for setting a starting position of the at least one modified m-sequence.

11. The method according to claim 1, further comprising: The information bits of the payload to be transmitted are conveyed using a plurality of modified m-sequences.

12. The method according to claim 11, further comprising: setting the order of the plurality of modified m-sequences to be equal to a value of k; Using k-order 2 in multiple truncated m-sequences k - 1 modified m-sequence; as well as Add an additional sequence to the 2 k -1 modified m-sequences in order to convey the k bits.

13. The method according to claim 12, wherein: The one additional sequence includes one of an all-zero sequence or an all-one sequence.

14. The method according to claim 11, further comprising: A preconfigured offset value is set, the preconfigured offset value being configured to set a starting position of the at least one modified m-sequence to a zero value without using an offset.

15. The method according to claim 11, further comprising: setting the order of the plurality of modified m-sequences equal to a value k+1; as well as The k+1 order 2 k+1 A subset of a -1 number of modified m-sequences is used for the plurality of modified m-sequences, wherein the subset is determined by an offset value configured to set a starting position of the modified m-sequences.

16. The method according to claim 15, wherein: The offset value is set in the UE by a network node through radio resource control (RRC) signaling.

17. The method according to claim 11, further comprising: The order of the plurality of modified m-sequences is set equal to a maximum k value (k max ), where k max ≥k and is an integer independent of k; as well as From the order k of the plurality of modified m-sequences max The total number of modified m-sequences Among the modified m-sequences, select 2 k A set of modified m-sequences, wherein the set is further selected by selecting a subsequence starting from a value x(d+d0), wherein d is a decimal integer and d0 is a predetermined offset value.

18. The method according to claim 11, further comprising: The order of the plurality of modified m-sequences is set equal to a maximum k value (k max ), where k max ≥k and is an integer independent of k; as well as From the order k of the plurality of modified m-sequences max The total number of modified m-sequences Among the modified m-sequences, select 2 k A set of modified m-sequences, wherein the set is further selected by selecting a subsequence starting from a value x(η·d+d0), wherein the value η is selected from a sequence of powers of two, d is a decimal integer, and d0 is a predetermined offset value.

19. The method of claim 1, further comprising: Prior to transmitting the at least one modulated modified m-sequence, the at least one modulated modified m-sequence is scrambled with a predetermined scrambling sequence.

20. The method according to claim 19, wherein: The predetermined scrambling sequence includes one of the following: for a π / 2 binary phase shift keying (BPSK) modulation scheme, a binary sequence having a length equal to the at least one modified m-sequence; or For a Quadrature Phase Shift Keying (QPSK) modulation scheme, a QPSK modulated binary sequence having a length equal to the at least one modified m-sequence.

21. The method according to claim 19, wherein: The predetermined scrambling sequence includes a Gold sequence determined based on a cell-specific scrambling ID.

22. The method according to claim 21, wherein: The scrambling ID is used to determine a random seed for generating the Gold sequence.

23. The method according to claim 19, wherein: The predetermined scrambling sequence is a modified m-sequence for scrambling determined based on a cell-specific scrambling ID.

24. The method of claim 1, further comprising: Control signaling configured to indicate selection of the modulation scheme is received from a base station.

25. The method according to claim 24, wherein: The control signaling includes one of radio resource control (RRC) signaling or downlink control information (DCI).

26. A user equipment (UE), comprising: one or more memories; as well as one or more processors communicatively coupled to the one or more memories, wherein the one or more processors are configured to: At least one modified maximal sequence (m-sequence) is generated from the information bits of the payload to be transmitted based on a generating polynomial having a value k, k+1 or a maximum k value k max , where k is the number of information bits of the payload to be transmitted, and where k max ≥k and is an integer independent of k; modulating the at least one modified m-sequence based on a modulation scheme to derive at least one modulated modified m-sequence; and The at least one modulated modified m-sequence is transmitted.

27. A method of wireless communication in a network node, the method comprising: receiving a modified maximum sequence (m-sequence) signal from a user equipment (UE); The received modified m-sequence is zero-padded to increase the length of the received sequence to length 2 n , wherein n represents the order of the polynomial generated by the modified m-sequence to derive the zero-padded m-sequence, and wherein the order has a value k, k+1 or a maximum k value k max One of, where k is the number of information bits of the payload to be transmitted, and where k max ≥k and is an integer independent of k; Permuting the zero-padded m-sequence; performing a fast Hadamard transform on the permuted zero-padded m-sequence; and A cross-correlation measure is extracted based on the result of the fast Hadamard transform.

28. The method of claim 27, further comprising: selecting a modulation scheme usable by the UE to generate the modified m-sequence; as well as One of radio resource control (RRC) signaling or downlink control information (DCI) configured to indicate the selection of the modulation scheme is sent to the UE.

29. A network node, comprising: one or more memories; as well as one or more processors communicatively coupled to the one or more memories, wherein the one or more processors are configured to: receiving a signal based on the modified m-sequence from a user equipment (UE); The received modified m-sequence is zero-padded to increase the length of the received sequence to length 2 n , wherein n represents the order of the polynomial generated by the modified m-sequence to derive the zero-padded m-sequence, and wherein the order has a value k, k+1, or a maximum k value k max One of, where k is the number of information bits of the payload to be transmitted, and where k max ≥k and is an integer independent of k; Permuting the zero-padded m-sequence; performing a fast Hadamard transform on the permuted zero-padded m-sequence; and A cross-correlation measure is extracted based on the result of the fast Hadamard transform.

Images