Method, device and system for transmitting coded complementary sequences

By generating low PAPR OFDM signals through complementary sequence encoders, the challenges of PAPR control and frequency diversity in unlicensed frequency bands are solved, thereby improving the effectiveness of low-latency communication and enhancing signal coverage.

CN112997428BActive Publication Date: 2024-11-01INTERDIGITAL PATENT HOLDINGS INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201980071971.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2018-09-13
Filing Date
2019-09-13
Publication Date
2024-11-01
Estimated Expiration
2039-09-13

AI Technical Summary

Technical Problem

In unlicensed frequency bands, existing technologies struggle to effectively control peak-to-average power ratio (PAPR) while simultaneously supporting frequency diversity and low-latency communication. This is particularly true in ultra-reliable low-latency communication (URLLC) and PUCCH designs in unlicensed spectrum, where high receiver complexity and reduced signal coverage due to power back-off are problems.

Method used

A complementary sequence encoder is used to generate a coded complementary sequence. A low PAPR OFDM signal is generated through sequential coding, phase coding, shift coding and synthesizer. It supports the allocation of continuous and non-continuous frequency domain resources and optimizes signal transmission through frequency diversity and coding gain.

Benefits of technology

It achieves a peak-to-average power ratio of less than 3dB, supports frequency diversity and low-latency communication, reduces receiver complexity, and improves signal coverage and transmission efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112997428B_ABST
    Figure CN112997428B_ABST
Patent Text Reader

Abstract

Methods, apparatus, and systems for complementary sequence (CS) encoding and coded CS transmission are provided. Among these apparatus, an apparatus has a transmitter that can be configured to: (i) transmit a coded CS via a block-based (e.g., orthogonal frequency division multiplexing (OFDM)) waveform, and / or (ii) generate the coded CS using multiple seed sequences and multiple information items, wherein: the concatenation of the elements of the coded CS encodes a first set of the multiple information items; (b) the phase of the coded CS elements encodes a second set of the multiple information items; and (c) the coded CS elements define a number of zeros that encode a third set of the multiple information items. The coded CS elements can define a corresponding number of zeros that together form the number of zeros that encode the third set of information items.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of U.S. Provisional Patent Application No. 62 / 731,085, filed September 13, 2018, which is incorporated herein by reference. Background Art Technical Field

[0003] The present disclosure generally relates to the fields of communications, software and coding, including, for example, methods, architectures, devices and systems related to complementary sequence coding and coded complementary sequence transmission.

[0004] Related fields

[0005] Mobile communications are in continuous evolution and are already on the threshold of their fifth incarnation, which is referred to as 5th Generation ("5G"). As with previous generations, new use cases have been proposed that are related to the demand setting for new systems.

[0006] Such a 5G system may correspond, at least in part, to a new radio access technology ("NR") that meets 5G requirements. The NR access technology may be expected to support a variety of use cases, such as enhanced mobile broadband (eMBB), ultra-high reliability and low latency communications (URLLC), and massive machine type communications (mMTC). For example, each use case has its own set of requirements, namely, spectral efficiency, low latency, and massive connectivity. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] A more detailed understanding can be obtained from the following detailed description given by way of example in conjunction with the accompanying drawings. The drawings in the specification are examples. Therefore, the drawings and detailed description should not be considered limiting, and other equivalent examples are possible and possible. In addition, the same reference numerals in the figures represent the same elements, among which:

[0008] Figure 1A is a system diagram illustrating an example communication system in which one or more disclosed embodiments may be implemented;

[0009] Figure 1B is a diagram showing that according to one embodiment, Figure 1A A system diagram of an example wireless transmit / receive unit (WTRU) for use within a communication system is shown;

[0010] Figure 1C is a diagram showing that according to one embodiment, Figure 1A A system diagram of an example radio access network (RAN) and an example core network (CN) used within the communication system shown;

[0011] Figure 1Dis a diagram showing that according to one embodiment, Figure 1A A system diagram of another exemplary RAN and another exemplary CN used within the communication system shown;

[0012] Figure 2 An example resource allocation interleaving is shown;

[0013] Figure 3 An example truth table representation of a generalized Boolean function is shown;

[0014] Figure 4 An exemplary entry-by-entry mapping function is shown;

[0015] Figure 5 is a graph showing a peak-to-average power ratio (PAPR) distribution of an OFDM signal;

[0016] Figure 6 is a graph showing peak-to-average power ratio (PAPR) distribution of sPUCCH format 0 in MulteFire;

[0017] Figure 7 is a block diagram illustrating an exemplary transmitter in which one or more embodiments may be implemented;

[0018] Figure 8 is a block diagram illustrating an exemplary transmitter in which one or more embodiments may be implemented;

[0019] Fig. 9 is a block diagram illustrating an exemplary transmitter in which one or more embodiments may be implemented;

[0020] Fig.10 shows a constellation of complementary sequences with a 16-QAM constellation;

[0021] Fig.11 shows an example interleaving according to one embodiment;

[0022] Fig.12 shows an example interleaving according to one embodiment;

[0023] Fig.13 shows an example interleaving according to one embodiment;

[0024] Fig.14 shows an example interleaving according to one embodiment; and

[0025] Figure 15-18 is a flow chart illustrating a representative process according to various embodiments. DETAILED DESCRIPTION

[0026] Figure 1A1 is a diagram showing an exemplary communication system 100 in which one or more disclosed embodiments may be implemented. The communication system 100 may be a multiple access system that provides content such as voice, data, video, messaging, broadcast, etc. to multiple wireless users. The communication system 100 may enable multiple wireless users to access such content by sharing system resources including wireless bandwidth. For example, the communication system 100 may use one or more channel access methods such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), single carrier FDMA (SC-FDMA), zero tail unique word DFT spread OFDM (ZT UW DTS-s OFDM), unique word OFDM (UW-OFDM), resource block filtered OFDM, and filter bank multi-carrier (FBMC), etc.

[0027] like Figure 1A As shown, the communication system 100 may include wireless transmit / receive units (WTRUs) 102a, 102b, 102c, 102d, RAN 104 / 113, CN 106 / 115, public switched telephone network (PSTN) 108, Internet 110, and other networks 112, although it should be appreciated that the disclosed embodiments contemplate any number of WTRUs, base stations, networks, and / or network components. Each WTRU 102a, 102b, 102c, 102d may be any type of device configured to operate and / or communicate in a wireless environment. By way of example, any of the WTRUs 102a, 102b, 102c, 102d may be referred to as a “station” and / or “STA”, which may be configured to transmit and / or receive wireless signals, and may include a user equipment (UE), a mobile station, a fixed or mobile subscriber unit, a subscription-based unit, a pager, a cellular phone, a personal digital assistant (PDA), a smart phone, a laptop, a netbook, a personal computer, a wireless sensor, a hotspot or Mi-Fi device, an Internet of Things (IoT) device, a watch or other wearable device, a head-mounted display (HMD), a vehicle, a drone, medical devices and applications (e.g., remote surgery), industrial devices and applications (e.g., robots and / or other wireless devices working in an industrial and / or automated process chain environment), consumer electronic devices, and devices working on a commercial and / or industrial wireless network, etc. Any of the WTRUs 102a, 102b, 102c, 102d may be interchangeably referred to as a UE.

[0028] The communication system 100 may also include a base station 114a and / or a base station 114b. Each base station 114a and / or base station 114b may be any type of device configured to facilitate access to one or more communication networks (e.g., CN 106 / 115, Internet 110, and / or other networks 112) by wirelessly interfacing with at least one of the WTRUs 102a, 102b, 102c, 102d. For example, the base stations 114a, 114b may be base transceiver stations (BTS), Node Bs, eNode Bs, Home Node Bs, Home eNode Bs, gNBs, NR Node Bs, site controllers, access points (APs), wireless routers, and the like. Although each base station 114a, 114b is depicted as a single component, it should be appreciated that the base stations 114a, 114b may include any number of interconnected base stations and / or network components.

[0029] The base station 114a may be part of the RAN 104 / 113, and the RAN may also include other base stations and / or network components (not shown), such as a base station controller (BSC), a radio network controller (RNC), a relay node, and the like. The base station 114a and / or the base station 114b may be configured to transmit and / or receive wireless signals on one or more carrier frequencies called cells (not shown). These frequencies may be in a licensed spectrum, an unlicensed spectrum, or a combination of licensed and unlicensed spectrum. A cell may provide wireless service coverage for a specific geographic area that is relatively fixed or may change over time. A cell may be further divided into cell sectors. For example, a cell associated with the base station 114a may be divided into three sectors. Thus, in one embodiment, the base station 114a may include three transceivers, i.e., each transceiver corresponds to a sector of the cell. In one embodiment, the base station 114a may use multiple-input multiple-output (MIMO) technology and may use multiple transceivers for each sector of the cell. For example, by using beamforming, signals may be transmitted and / or received in a desired spatial direction.

[0030] The base stations 114a, 114b may communicate with one or more of the WTRUs 102a, 102b, 102c, 102d over an air interface 116, which may be any suitable wireless communication link (e.g., radio frequency (RF), microwave, centimeter wave, millimeter wave, infrared (IR), ultraviolet (UV), visible light, etc.). The air interface 116 may be established using any suitable radio access technology (RAT).

[0031] More specifically, as described above, the communication system 100 may be a multiple access system and may use one or more channel access schemes, such as CDMA, TDMA, FDMA, OFDMA, and SC-FDMA, among others. For example, the base station 114a in the RAN 104 / 113 and the WTRUs 102a, 102b, 102c may implement a radio technology such as Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access (UTRA), which may use Wideband CDMA (WCDMA) to establish the air interface 115 / 116 / 117. WCDMA may include communication protocols such as High Speed ​​Packet Access (HSPA) and / or Evolved HSPA (HSPA+). HSPA may include High Speed ​​Downlink (DL) Packet Access (HSDPA) and / or High Speed ​​UL Packet Access (HSUPA).

[0032] In one embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may utilize a radio technology such as Evolved UMTS Terrestrial Radio Access (E-UTRA), which may utilize Long Term Evolution (LTE) and / or LTE-Advanced (LTE-A) and / or LTE-Advanced Pro (LTE-A Pro) to establish the air interface 116.

[0033] In one embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as NR radio access, which may establish the air interface 116 using new radio (NR).

[0034] In one embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement multiple radio access technologies. For example, the base station 114a and the WTRUs 102a, 102b, 102c may jointly implement LTE radio access and NR radio access (e.g., using dual connectivity (DC) principles). Thus, the air interface used by the WTRUs 102a, 102b, 102c may be characterized by multiple types of radio access technologies and / or transmissions sent to / from multiple types of base stations (e.g., eNBs and gNBs).

[0035] In other embodiments, the base station 114a and the WTRUs 102a, 102b, 102c may implement radio technologies such as IEEE 802.11 (i.e., Wireless Fidelity (WiFi)), IEEE 802.16 (i.e., Worldwide Interoperability for Microwave Access (WiMAX)), CDMA2000, CDMA2000 1X, CDMA2000 EV-DO, Interim Standard 2000 (IS-2000), Interim Standard 95 (IS-95), Interim Standard 856 (IS-856), Global System for Mobile Communications (GSM), Enhanced Data Rates for GSM Evolution (EDGE), and GSM EDGE (GERAN), among others.

[0036] Figure 1A The base station 114b in the example may be a wireless router, a Home NodeB, a Home eNodeB, or an access point, and may use any appropriate RAT to facilitate wireless connectivity in a local area, such as a business location, a residence, a vehicle, a campus, an industrial facility, an air corridor (e.g., for use by drones), a road, and the like. In one embodiment, the base station 114b and the WTRUs 102c, 102d may establish a wireless local area network (WLAN) by implementing a radio technology such as IEEE 802.11. In one embodiment, the base station 114b and the WTRUs 102c, 102d may establish a wireless personal area network (WPAN) by implementing a radio technology such as IEEE 802.15. In yet another embodiment, the base station 114b and the WTRUs 102c, 102d may establish a picocell or a femtocell by using a cellular-based RAT (e.g., WCDMA, CDMA2000, GSM, LTE, LTE-A, LTE-A Pro, NR, etc.). Figure 1A As shown, the base station 114b may be directly connected to the Internet 110. Thus, the base station 114b does not need to access the Internet 110 via the CN 106 / 115.

[0037] The RAN 104 / 113 may be in communication with the CN 106 / 115, which may be any type of network configured to provide voice, data, applications and / or Voice over Internet Protocol (VoIP) services to one or more WTRUs 102a, 102b, 102c, 102d. The data may have different quality of service (QoS) requirements, such as different throughput requirements, latency requirements, fault tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, etc. The CN 106 / 115 may provide call control, billing services, mobile location-based services, prepaid calls, Internet connectivity, video distribution, etc., and / or may perform advanced security functions such as user authentication. Although in Figure 1AAlthough not shown, it will be appreciated that the RAN 104 / 113 and / or the CN 106 / 115 may be in direct or indirect communication with other RANs that employ the same RAT or a different RAT as the RAN 104 / 113. For example, in addition to being connected to the RAN 104 / 113 employing NR radio technology, the CN 106 / 115 may also be in communication with other RANs (not shown) employing GSM, UMTS, CDMA 2000, WiMAX, E-UTRA, or WiFi radio technology.

[0038] The CN 106 / 115 may also act as a gateway for the WTRUs 102a, 102b, 102c, 102d to access the PSTN 108, the Internet 110, and / or other networks 112. The PSTN 108 may include a circuit-switched telephone network that provides plain old telephone service (POTS). The Internet 110 may include a global system of interconnected computer network devices that use common communication protocols (e.g., the Transmission Control Protocol (TCP), the User Datagram Protocol (UDP), and / or the Internet Protocol (IP) in the TCP / IP Internet Protocol Suite). The networks 112 may include wired and / or wireless communication networks owned and / or operated by other service providers. For example, the networks 112 may include another CN connected to one or more RANs, wherein the one or more RANs may use the same RAT or a different RAT as the RAN 104 / 113.

[0039] Some or all of the WTRUs 102a, 102b, 102c, 102d in the communication system 100 may include multi-mode capabilities (e.g., the WTRUs 102a, 102b, 102c, 102d may include multiple transceivers for communicating with different wireless networks over different wireless links). Figure 1A The illustrated WTRU 102c may be configured to communicate with the base station 114a, which may employ a cellular-based radio technology, and with the base station 114b, which may employ an IEEE 802 radio technology.

[0040] Figure 1B is a system diagram showing an example WTRU 102. Figure 1B As shown, the WTRU 102 may include a processor 118, a transceiver 120, a transmit / receive element 122, a speaker / microphone 124, a numeric keypad 126, a display / touchpad 128, a non-removable memory 130, a removable memory 132, a power source 134, a global positioning system (GPS) chipset 136, and other peripherals 138. It should be appreciated that the WTRU 102 may include any sub-combination of the foregoing components while remaining consistent with an embodiment.

[0041] The processor 118 may be a general purpose processor, a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors associated with a DSP core, a controller, a microcontroller, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) circuit, any other type of integrated circuit (IC), a state machine, and the like. The processor 118 may perform signal coding, data processing, power control, input / output processing, and / or any other functionality that enables the WTRU 102 to operate in a wireless environment. The processor 118 may be coupled to the transceiver 120, which may be coupled to the transmit / receive element 122. Although Figure 1B The processor 118 and the transceiver 120 are depicted as separate components, however it should be appreciated that the processor 118 and the transceiver 120 may also be integrated into one electronic component or chip.

[0042] The transmit / receive component 122 may be configured to transmit or receive signals to or from a base station (e.g., base station 114a) via the air interface 116. For example, in one embodiment, the transmit / receive component 122 may be an antenna configured to transmit and / or receive RF signals. As an example, in another embodiment, the transmit / receive component 122 may be an emitter / detector configured to transmit and / or receive IR, UV, or visible light signals. In yet another embodiment, the transmit / receive component 122 may be configured to transmit and / or receive RF and light signals. It should be appreciated that the transmit / receive component 122 may be configured to transmit and / or receive any combination of wireless signals.

[0043] Although in Figure 1B 102 as a single component, but the WTRU 102 may include any number of transmit / receive components 122. More specifically, the WTRU 102 may employ MIMO technology. Thus, in one embodiment, the WTRU 102 may include two or more transmit / receive components 122 (e.g., multiple antennas) for transmitting and receiving radio signals over the air interface 116.

[0044] The transceiver 120 may be configured to modulate signals to be transmitted by the transmit / receive component 122 and to demodulate signals received by the transmit / receive component 122. As described above, the WTRU 102 may have multi-mode capabilities. Thus, the transceiver 120 may include multiple transceivers that allow the WTRU 102 to communicate via multiple RATs (e.g., NR and IEEE 802.11).

[0045] The processor 118 of the WTRU 102 may be coupled to a speaker / microphone 124, a keypad 126, and / or a display / touchpad 128 (e.g., a liquid crystal display (LCD) display unit or an organic light emitting diode (OLED) display unit), and may receive user input data from these components. The processor 118 may also output user data to the speaker / microphone 124, the keypad 126, and / or the display / touchpad 128. In addition, the processor 118 may access information from and store information in any suitable memory such as a non-removable memory 130 and / or a removable memory 132. The non-removable memory 130 may include a random access memory (RAM), a read-only memory (ROM), a hard disk, or any other type of memory storage device. The removable memory 132 may include a subscriber identity module (SIM) card, a memory stick, a secure digital (SD) memory card, and the like. In other embodiments, the processor 118 may access information from, and store data in, memory that is not physically located on the WTRU 102, such as, for example, on a server or a home computer (not shown).

[0046] The processor 118 may receive power from the power source 134, and may be configured to distribute and / or control power for use by other components in the WTRU 102. The power source 134 may be any suitable device for powering the WTRU 102. For example, the power source 134 may include one or more dry cell batteries (e.g., nickel-cadmium (Ni-Cd), nickel-zinc (Ni-Zn), nickel-metal hydride (NiMH), lithium-ion (Li-ion), etc.), solar cells, fuel cells, and the like.

[0047] The processor 118 may also be coupled to the GPS chipset 136, which may be configured to provide location information (e.g., longitude and latitude) related to the current location of the WTRU 102. In addition to or in lieu of the information from the GPS chipset 136, the WTRU 102 may receive location information from a base station (e.g., base stations 114a, 114b) via the air interface 116 and / or determine its location based on the timing of signals received from two or more nearby base stations. It should be appreciated that the WTRU 102 may acquire location information via any suitable positioning method while remaining consistent with an embodiment.

[0048] The processor 118 may also be coupled to other peripheral devices 138, which may include one or more software and / or hardware modules that provide additional features, functionality, and / or wired or wireless connectivity. For example, the peripheral devices 138 may include an accelerometer, an electronic compass, a satellite transceiver, a digital camera (for photos and / or video), a universal serial bus (USB) port, a vibration device, a television transceiver, a hands-free headset, Modules, frequency modulation (FM) radio units, digital music players, media players, video game console modules, Internet browsers, virtual reality and / or augmented reality (VR / AR) devices, and activity trackers, etc. The peripherals 138 may include one or more sensors, which may be one or more of the following: gyroscopes, accelerometers, Hall effect sensors, magnetometers, orientation sensors, proximity sensors, temperature sensors, time sensors, geolocation sensors, altimeters, light sensors, touch sensors, magnetometers, barometers, gesture sensors, biometric sensors, and / or humidity sensors.

[0049] The WTRU 102 may include a full-duplex radio in which the reception or transmission of some or all signals (e.g., associated with specific subframes for UL (e.g., for transmission) and downlink (e.g., for reception)) may be concurrent and / or simultaneous for the radio. The full-duplex radio may include an interference management unit 139 that reduces and / or substantially eliminates self-interference by means of hardware (e.g., chokes) or by signal processing by a processor (e.g., a separate processor (not shown) or by the processor 118). In one embodiment, the WTRU 102 may include a half-duplex radio that transmits or receives some or all signals (e.g., associated with specific subframes for UL (e.g., for transmission) or downlink (e.g., for reception)).

[0050] Figure 1C 1 is a system diagram showing the RAN 104 and the CN 106 according to one embodiment. As described above, the RAN 104 may communicate with the WTRUs 102a, 102b, 102c using an E-UTRA radio technology over the air interface 116. The RAN 104 may also be in communication with the CN 106.

[0051] The RAN 104 may include eNode-Bs 160a, 160b, 160c, however it will be appreciated that the RAN 104 may include any number of eNode-Bs while remaining consistent with an embodiment. Each of the eNode-Bs 160a, 160b, 160c may include one or more transceivers for communicating with the WTRUs 102a, 102b, 102c over the air interface 116. In one embodiment, the eNode-Bs 160a, 160b, 160c may implement MIMO technology. Thus, for example, the eNode-B 140a may use multiple antennas to transmit wireless signals to, and / or receive wireless signals from, the WTRU 102a.

[0052] Each eNodeB 160a, 160b, 160c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, user scheduling in UL and / or DL, etc. Figure 1C As shown, the eNode-Bs 160a, 160b, 160c may communicate with each other via an X2 interface.

[0053] Figure 1C The illustrated CN 106 may include a mobility management entity (MME) 162, a serving gateway (SGW) 164, and a packet data network (PDN) gateway (or PGW) 166. Although each of the foregoing components is described as being part of the CN 106, it should be appreciated that any of these components may be owned and / or operated by an entity other than the CN operator.

[0054] The MME 162 may be connected to each of the eNode-Bs 162a, 162b, 162c in the RAN 104 via an S1 interface and may serve as a control node. For example, the MME 162 may be responsible for authenticating users of the WTRUs 102a, 102b, 102c, performing bearer activation / deactivation processing, and selecting a particular serving gateway during an initial attach of the WTRUs 102a, 102b, 102c. The MME 162 may also provide a control plane function for switching between the RAN 104 and other RANs (not shown) that employ other radio technologies, such as GSM and / or WCDMA.

[0055] The SGW 164 may be connected to each of the eNode-Bs 160a, 160b, 160c in the RAN 104 via an S1 interface. The SGW 164 may generally route and forward user data packets to / from the WTRUs 102a, 102b, 102c. The SGW 164 may also perform other functions, such as anchoring the user plane during inter-eNode-B handovers, triggering paging processing when DL data is available for the WTRUs 102a, 102b, 102c, and managing and storing the contexts of the WTRUs 102a, 102b, 102c, and the like.

[0056] The SGW 164 may be connected to the PGW 166, which may provide the WTRUs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between the WTRUs 102a, 102b, 102c and IP-enabled devices.

[0057] The CN 106 may facilitate communications with other networks. For example, the CN 106 may provide the WTRUs 102a, 102b, 102c with access to circuit-switched networks, such as the PSTN 108, to facilitate communications between the WTRUs 102a, 102b, 102c and traditional land-line communications devices. For example, the CN 106 may include or communicate with an IP gateway, such as an IP Multimedia Subsystem (IMS) server, which may serve as an interface between the CN 106 and the PSTN 108. In addition, the CN 106 may provide the WTRUs 102a, 102b, 102c with access to other networks 112, which may include other wired and / or wireless networks that are owned and / or operated by other service providers.

[0058] Although in Figures 1A-1D While the WTRU is described as a wireless terminal, it should be appreciated that in certain representative embodiments, such a terminal may use a (eg, temporary or permanent) wired communication interface with a communication network.

[0059] In some representative embodiments, other network 112 may be a WLAN.

[0060] A WLAN using an infrastructure basic service set (BSS) mode may have an access point (AP) for the BSS and one or more stations (STAs) associated with the AP. The AP may access or be connected to a distributed system (DS) or other types of wired / wireless networks that send traffic into and / or out of the BSS. Traffic originating from outside the BSS and destined for the STA may arrive through the AP and be delivered to the STA. Traffic originating from the STA and destined for a destination outside the BSS may be sent to the AP for delivery to the corresponding destination. Traffic between STAs within the BSS may be sent through the AP, for example, where the source STA may send traffic to the AP and the AP may deliver the traffic to the destination STA. Traffic between STAs within the BSS may be considered and / or referred to as point-to-point traffic. The point-to-point traffic may be sent between the source and destination STAs (e.g., directly therebetween) using a direct link setup (DLS). In certain representative embodiments, the DLS may use 802.11e DLS or 802.11z tunneled DLS (TDLS)). For example, a WLAN using an independent BSS (IBSS) mode may not have an AP, and STAs (eg, all STAs) within or using the IBSS may communicate directly with each other. Here, the IBSS communication mode may sometimes be referred to as an "ad hoc" communication mode.

[0061] When using the 802.11ac infrastructure mode of operation or a similar mode of operation, the AP may transmit a beacon on a fixed channel (e.g., a primary channel). The primary channel may have a fixed width (e.g., a bandwidth of 20 MHz) or a width that is dynamically set by means of signaling. The primary channel may be a working channel of the BSS and may be used by the STA to establish a connection with the AP. In certain representative embodiments, carrier sense multiple access (CSMA / CA) with collision avoidance (e.g., in an 802.11 system) may be implemented. For CSMA / CA, STAs (e.g., each STA) including the AP may sense the primary channel. If a particular STA senses / detects and / or determines that the primary channel is busy, the particular STA may back off. In a specified BSS, one STA (e.g., only one station) transmits at any given time.

[0062] A high throughput (HT) STA may communicate using a 40 MHz wide channel (eg, by combining a 20 MHz wide primary channel with a 20 MHz wide adjacent or non-adjacent channel to form a 40 MHz wide channel).

[0063] Very high throughput (VHT) STA can support channels with widths of 20MHz, 40MHz, 80MHz and / or 160MHz. 40MHz and / or 80MHz channels can be formed by combining continuous 20MHz channels. A 160MHz channel can be formed by combining 8 continuous 20MHz channels or by combining two discontinuous 80MHz channels (this combination can be referred to as an 80+80 configuration). For the 80+80 configuration, after channel coding, the data can be transmitted and passed through a segment parser, which can separate the data into two streams. Inverse fast Fourier transform (IFFT) processing and time domain processing can be performed separately on each stream. The stream can be mapped on two 80MHz channels, and the data can be transmitted by the STA performing the transmission. At the receiver of the STA performing the reception, the above operations for the 80+80 configuration can be reversed, and the combined data can be sent to the medium access control (MAC).

[0064] 802.11af and 802.11ah support sub-1 GHz operating modes. Compared to 802.11n and 802.11ac, the channel operating bandwidth and carrier used in 802.11af and 802.11ah are reduced. 802.11af supports 5MHz, 10MHz and 20MHz bandwidths in the TV White Space (TVWS) spectrum, and 802.11ah supports 1MHz, 2MHz, 4MHz, 8MHz and 16MHz bandwidths using non-TVWS spectrum. According to a representative embodiment, 802.11ah can support instrument type control / machine type communication (e.g., MTC devices in macro coverage areas). MTC can have certain capabilities, such as limited capabilities including support (e.g., only support) certain and / or limited bandwidths. MTC devices can include a battery, and the battery life of the battery is higher than a threshold (e.g., for maintaining a very long battery life).

[0065] For WLAN systems that can support multiple channels and channel bandwidths (e.g., 802.11n, 802.11ac, 802.11af, and 802.11ah), these systems include a channel that can be designated as a primary channel. The bandwidth of the primary channel can be equal to the maximum common operating bandwidth supported by all STAs in the BSS. The bandwidth of the primary channel can be set and / or limited by a STA, where the STA is derived from all STAs operating in the BSS that supports the minimum bandwidth operating mode. In the example of 802.11ah, even if the AP and other STAs in the BSS support 2MHz, 4MHz, 8MHz, 16MHz and / or other channel bandwidth operating modes, for STAs (e.g., MTC-type devices) that support (e.g., only support) 1MHz mode, the width of the primary channel can be 1MHz. Carrier sensing and / or network allocation vector (NAV) settings can depend on the state of the primary channel. If the primary channel is busy (eg, because a STA (which only supports 1 MHz operating mode) is transmitting to the AP), then the entire available band may be considered busy even though most of the band remains empty and available for use.

[0066] In the United States, the available frequency band for 802.11ah is 902MHz to 928MHz. In South Korea, the available frequency band is 917.5MHz to 923.5MHz. In Japan, the available frequency band is 916.5MHz to 927.5MHz. Depending on the country code, the total bandwidth available for 802.11ah is 6MHz to 26MHz.

[0067] Figure 1D 1 is a system diagram showing the RAN 113 and the CN 115 according to one embodiment. As described above, the RAN 113 may communicate with the WTRUs 102a, 102b, 102c using NR radio technology over the air interface 116. The RAN 113 may also be in communication with the CN 115.

[0068] The RAN 113 may include gNBs 180a, 180b, 180c, though it will be appreciated that the RAN 113 may include any number of gNBs while remaining consistent with the embodiments. Each of the gNBs 180a, 180b, 180c may include one or more transceivers to communicate with the WTRUs 102a, 102b, 102c over the air interface 116. In one embodiment, the gNBs 180a, 180b, 180c may implement MIMO technology. For example, the gNBs 180a, 180b may use beamforming processing to transmit and / or receive signals to and / or from the gNBs 180a, 180b, 180c. Thus, for example, the gNB 180a may use multiple antennas to transmit wireless signals to and / or receive wireless signals from the WTRU 102a. In one embodiment, the gNBs 180a, 180b, 180c may implement carrier aggregation technology. For example, the gNB 180a may transmit a plurality of component carriers (not shown) to the WTRU 102a. A subset of these component carriers may be on an unlicensed spectrum while the remaining component carriers may be on a licensed spectrum. In one embodiment, the gNBs 180a, 180b, 180c may implement coordinated multi-point (CoMP) technology. For example, the WTRU 102a may receive coordinated transmissions from the gNB 180a and gNB 180b (and / or gNB 180c).

[0069] The WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using transmissions associated with the scalable parameter configurations. For example, the OFDM symbol spacing and / or OFDM subcarrier spacing may be different for different transmissions, different cells, and / or different portions of the radio transmission spectrum. The WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using subframes or transmission time intervals (TTIs) of different or scalable lengths (e.g., containing different numbers of OFDM symbols and / or lasting different absolute time lengths).

[0070] The gNBs 180a, 180b, 180c may be configured to communicate with the WTRUs 102a, 102b, 102c in a standalone configuration and / or a non-standalone configuration. In a standalone configuration, the WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c without accessing other RANs (e.g., the eNodeBs 160a, 160b, 160c). In a standalone configuration, the WTRUs 102a, 102b, 102c may use one or more of the gNBs 180a, 180b, 180c as mobility anchors. In a standalone configuration, the WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using signals in an unlicensed band. In a non-standalone configuration, the WTRU 102a, 102b, 102c may communicate / connect to the gNB 180a, 180b, 180c while communicating / connecting to another RAN (e.g., the eNode-B 160a, 160b, 160c). For example, the WTRU 102a, 102b, 102c may communicate with one or more gNBs 180a, 180b, 180c and one or more eNode-Bs 160a, 160b, 160c in a substantially simultaneous manner by implementing the DC principle. In a non-standalone configuration, the eNode-B 160a, 160b, 160c may act as a mobility anchor for the WTRU 102a, 102b, 102c, and the gNB 180a, 180b, 180c may provide additional coverage and / or throughput to serve the WTRU 102a, 102b, 102c.

[0071] Each gNB 180a, 180b, 180c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, user scheduling in UL and / or DL, support network slicing, implement dual connectivity, implement interworking between NR and E-UTRA, route user plane data to user plane functions (UPFs) 184a, 184b, and route control plane information to access and mobility management functions (AMFs) 182a, 182b, and the like. Figure 1D As shown, gNBs 180a, 180b, and 180c can communicate with each other through the Xn interface.

[0072] Figure 1DThe CN 115 shown may include at least one AMF 182a, 182b, at least one UPF 184a, 184b, at least one session management function (SMF) 183a, 183b, and may include a data network (DN) 185a, 185b. Although each of the aforementioned components is described as part of the CN 115, it should be understood that any of these components may be owned and / or operated by entities other than the CN operator.

[0073] The AMF 182a, 182b may be connected to one or more gNBs 180a, 180b, 180c in the RAN 113 via the N2 interface and may act as a control node. For example, the AMF 182a, 182b may be responsible for authenticating users of the WTRU 102a, 102b, 102c, supporting network slicing (e.g., handling different PDU sessions with different requirements), selecting a specific SMF 183a, 183b, managing registration areas, terminating NAS signaling, and mobility management, etc. The AMF 182a, 1823b may use network slicing processing to customize the CN support provided to the WTRU 102a, 102b, 102c based on the type of service used by the WTRU 102a, 102b, 102c. As an example, different network slices may be established for different use cases, such as services relying on ultra-reliable low latency (URLLC) access, services relying on enhanced massive mobile broadband (eMBB) access, and / or services for machine type communication (MTC) access, etc. The AMF 162 may provide a control plane function for switching between the RAN 113 and other RANs (not shown) using other radio technologies (e.g., LTE, LTE-A, LTE-A Pro, and / or non-3GPP access technologies such as WiFi).

[0074] The SMF 183a, 183b may be connected to the AMF 182a, 182b in the CN 115 via the N11 interface. The SMF 183a, 183b may also be connected to the UPF 184a, 184b in the CN 115 via the N4 interface. The SMF 183a, 183b may select and control the UPF 184a, 184b, and may configure traffic routing through the UPF 184a, 184b. The SMF 183a, 183b may perform other functions such as managing and allocating WTRU IP addresses, managing PDU sessions, controlling policy enforcement and QoS, and providing downlink data notifications, etc. The PDU session type may be IP-based, non-IP-based, Ethernet-based, etc.

[0075] The UPF 184a, 184b can be connected to one or more gNBs 180a, 180b, 180c in the RAN 113 via the N3 interface, which can provide the WTRU 102a, 102b, 102c with a packet-switched network (e.g., the Internet 110) connection to facilitate communication between the WTRU 102a, 102b, 102c and IP-enabled devices. The UPF 184, 184b can perform other functions such as routing and forwarding packets, implementing user plane policies, supporting multi-host PDU sessions, processing user plane QoS, buffering downlink packets, and providing mobility anchor processing, etc.

[0076] The CN 115 may facilitate communications with other networks. For example, the CN 115 may include or may communicate with an IP gateway (e.g., an IP Multimedia Subsystem (IMS) server) that acts as an interface between the CN 115 and the CN 108. In addition, the CN 115 may provide the WTRUs 102a, 102b, 102c with access to other networks 112, which may include other wired and / or wireless networks owned and / or operated by other service providers. In one embodiment, the WTRUs 102a, 102b, 102c may be connected to a local data network (DN) 185a, 185b via an N3 interface connected to the UPF 184a, 184b and an N6 interface between the UPF 184a, 184b and the DN 185a, 185b and through the UPF 184a, 184b.

[0077] In view of Figures 1A-1D and about Figures 1A-1D In accordance with the corresponding description of the present invention, one or more or all of the functions described herein in comparison with one or more of the following may be performed by one or more simulation devices (not shown): WTRU 102a-d, base station 114a-b, eNodeB 160a-c, MME 162, SGW 164, PGW 166, gNB 180a-c, AMF 182a-ab, UPF 184a-b, SMF 183a-b, DN 185a-b, and / or any other device described herein. These simulation devices may be one or more devices configured to simulate one or more or all of the functions herein. For example, these simulation devices may be used to test other devices and / or simulate network and / or WTRU functions.

[0078] The simulation device can be designed to implement one or more tests about other devices in a laboratory environment and / or an operator network environment. For example, the one or more simulation devices can perform one or more or all functions while being implemented and / or deployed as part of a wired and / or wireless communication network in whole or in part to test other devices inside the communication network. The one or more simulation devices can perform one or more or all functions while being temporarily implemented / deployed as part of a wired and / or wireless communication network. The simulation device can be directly coupled to other devices to perform the test, and / or can use over-the-air wireless communication to perform the test.

[0079] One or more simulation devices can perform one or more functions, including all functions, while not being implemented / deployed as part of a wired and / or wireless communication network. For example, the simulation device can be used in a test lab and / or a test scenario of a wired and / or wireless communication network that is not deployed (e.g., tested) to implement tests on one or more components. The one or more simulation devices can be test devices. The simulation device can transmit and / or receive data using direct RF coupling and / or wireless communication with the aid of RF circuits (as an example, the circuits can include one or more antennas).

[0080] introduce

[0081] Licensed Assisted Access (LAA) and enhanced LAA (eLAA) are features introduced in 3GPP LTE Releases 13 and 14, respectively, to enable interoperability between network infrastructure equipment and user equipment (UE) regarding the extension of Long Term Evolution (LTE) to unlicensed spectrum. LAA enables LTE to operate only in the downlink in unlicensed bands. eLAA enables LTE to operate in both uplink and downlink in unlicensed bands.

[0082] eLAA and LTE operation in licensed bands define corresponding resource allocation frameworks. The resource allocation framework for eLAA may be different from the resource allocation framework for LTE operation in licensed bands. For example, the basic unit of resource allocation for LTE unlicensed ("LTE-U") data channels is an interlace; an example of which is shown in Figure 2 In LAA / eLAA, control channels (e.g., PUCCH) are sent using licensed bands and thus the LTE resource allocation framework is used for licensed bands. The interleaving enables network infrastructure equipment and / or UEs to utilize the maximum available transmit power and comply with regulatory requirements for unlicensed band operation (e.g., occupied bandwidth and 10 dBm / MHz requirements).

[0083] Typically, an interlace is one of M (e.g., 10) interlaces that equally subdivide the bandwidth and includes N (e.g., 120) subcarriers of OFDM symbols subdivided into P (e.g., 10) clusters, each cluster having N / P (e.g., 12) subcarriers (i.e., a cluster size of N / P subcarriers), wherein the P clusters are interleaved with the P clusters of each of the other M-1 (e.g., 9) interlaces. For example, Figure 2 As shown in , 10 interlaces subdivide 100 resource blocks RB0-RB99, where for i=0-9, interlace i is allocated RBi, RBi+10...RBi+90. Assuming that each of the resource blocks RB0-RB99 defines 12 subcarriers, the RB-to-RB separation of the interlace is 9×12 subcarriers

[0084] MulteFire technology differs from LTE-U / LAA / eLAA and / or LTE WLAN Aggregation (LWA) in that it operates only in unlicensed bands. The goal is to merge the performance of LTE with the ease of deployment of WLAN. In practice, the end user installs a MulteFire access point in place of a WLAN gateway to provide LTE coverage. Similar to LAA, MulteFire supports the Listen Before Talk (LBT) protocol. Similar to LTE-U, MulteFire uses the interleaving structure shown in Figure 1 for different channels, which includes the new PUCCH format.

[0085] A study project on NR-based access to unlicensed spectrum has been approved. The study project will focus on NR digital configurations on unlicensed spectrum, including unlicensed bands below 6 GHz and above 6 GHz (e.g., 5 GHz, 37 GHz, 60 GHz). The study should consider scenarios and solutions where NR-LAA is anchored to a legacy LTE carrier through dual connectivity (DC) and CA-based aggregation with a 5G NR anchor. In addition, it would be beneficial to consider standalone operation of NR in unlicensed spectrum at an early stage, and the study should address this issue.

[0086] Glossary

[0087] A sequence of length N can be expressed as a k Can be plural.

[0088] The vector notation of a sequence a is represented by a = [a0, a1…, a N-1 ] T is given by, where the elements of the sequence a are arranged as column vectors and where (·) T is the transpose of its independent variable.

[0089] operate(·)H Represents a Hermitian operation.

[0090] The operation a+b represents the sum of the elements.

[0091] a+b .

[0092] operate(·) * gives the conjugate of its argument.

[0093] sequence is the reverse and conjugate sequence of sequence a and can be expressed as

[0094] The Kronecker product is given by express.

[0095] yes An m-dimensional integer for each element in .

[0096] Aperiodic autocorrelation (APAC) of the sequence: Let ρ a (k) is a complex sequence The non-periodic autocorrelation of a (k) is explicitly given by

[0097]

[0098] in

[0099]

[0100] Polynomial representation of sequences: Sequence The polynomial representation of can be expressed as p a (z) = a N-1 z N-1 +a N-2 z N-2 +…+a0. The inventors explained the polynomial expression as follows:

[0101] p a (z k ) may correspond to an upsampled sequence a with a factor k (for integer values ​​of k);

[0102] It may correspond to the convolution of an upsampled sequence a with a factor k and an upsampled sequence b with a factor l;

[0103] p a (z)z m may correspond to a sequence a padded to the beginning with m null symbols (i.e., zero-valued symbols);

[0104] If z = e j2πt , then p a (z) can be equivalent to an OFDM signal in time (the frequency domain coefficients are the elements of a, where a0 is mapped to a DC tone);

[0105] If z = e j2πt , then the instantaneous power can be calculated as because

[0106] If z = e j2πt ,but is related to the APAC of the sequence and can be calculated as follows:

[0107]

[0108] If the sequence has perfect APAC (i.e., for k≠0, ρ a (k)=0), then:

[0109] (i)|x a (e j2πt )| 2 =ρ a (0), that is, |x a (e j2πt )| 2 becomes a constant function; and / or

[0110] (ii) when these sequences are used in frequency, the sequences that generate good APAC properties also introduce less temporal fluctuations, i.e., low PAPR;

[0111] By using the above equation, the upper limit of the PAPR of an OFDM symbol generated by an arbitrary sequence can be obtained as:

[0112]

[0113] where E[·] is the integral operation of t from 0 to 1; and

[0114] PAPR can optionally be measured by utilizing two quantities of the APAC of a sequence, namely, the integrated sidelobe level (ISL) and the quality factor (MF) of the sequence, which are defined as:

[0115]

[0116] as well as

[0117]

[0118] Algebraic representation of sequences - generalized Boolean functions:

[0119] A generalized Boolean function is f, which follows from Map to

[0120]

[0121] By sorting f(x1,x2,…,x m ) values ​​are listed in 2 m values ​​(x1,x2,…,x m ) range, length 2 m sequence can be associated with a function f. In other words, the (k+1)th element of the sequence f is obtained by a r =f(k1,k2,…,k m ) is given by (i.e., the most significant bit is k1). By using this association, the distinction between a generalized Boolean function f and a sequence f can be discarded, and a generalized Boolean function f can define (e.g., for generation, filling, etc.) a truth table from which the sequence f can be generated. An example of a truth table representation of a generalized Boolean function is given in Figure 3 To simplify notation, a monomial of degree 1 is represented as the sequence x = (x1, x2, ..., x m ). In addition, the sequence x i is defined as the function f(x)=x i A sequence of length 2 m .

[0122] Algebraic representation of a sequence - entry-by-entry mapping function:

[0123] A sequence generated by a generalized Boolean function can be related to another sequence by mapping each element of the sequence to an element in another set via an entry-wise mapping function μ. The entry-wise mapping function can map each element from The elements of As:

[0124]

[0125] For example, if in The associated sequence can be Among them, μ(f) generates the q-PSK sequence. Figure 4 An example mapping generated from such an entry-by-entry mapping function is shown in FIG. As another example, if μ(a)=ax T , then the associated sequence is given by The entry-by-entry mapping function may be an injective or bijective function.

[0126] Algebraic Normal Form (ANF):

[0127] A generalized Boolean function can be uniquely represented as a monomial Linear combinations of :

[0128]

[0129] The coefficient of each monomial belongs to Right now, and Monomials (e.g., 1,x1,x2,x1x2,…,x1x2…x m ) are linearly independent. This linear independence can be proved by using the definition of linear independence, that is, if and only if for all x, a i =0, then ∑ i a i x i = 0. All possible monomials form the basis of generalized Boolean functions. Since for a given m, there are 2 m monomials, so there exists different generalized Boolean functions, each of which is a mapping For example, if q = 4, m = 1, there are 16 different generalized Boolean functions, namely, f(x) = c01 + c1x1, This means there are 16 different values ​​of length 2. m =2, where the elements are in the set {0,1,2,3}.

[0130] Golay complementary pairs and complementary sequences:

[0131] If (GCP)ifρ a (k)+ρ b (k) = 0, k ≠ 0, then the pair (a, b) is a Golay complementary pair (GCP), and if there is another sequence b that is complementary to a = (b0, b1, ..., b N-1 ), ρ a (k)+ρ b (k)=0, k≠0, then the sequence a=(a0,a1,…,a N-1 ) is the complementary sequence (CS).

[0132] The PAPR of OFDM signals generated using CS can be less than 3dB. Since the GCP of a and b satisfies ρ a (k)+ρ b (k)=0, k≠0, so

[0133]

[0134] And when ρ a When (0)=N, the PAPR of the Golay sequence can be limited to:

[0135]

[0136] For large alphabets, ρ a (0) can be different from N. However, ρ a (0) and ρ b The average value of (0) remains equal to N.

[0137] CS with alphabet {1,-1} for all lengths N=2 for any non-negative integers n, m and k n 10 m 26 k The use of GCP and CS may be particularly suitable for any of: peak-average power mitigation, estimation of IQ imbalance parameters, and channel estimation.

[0138] Unified method for constructing Golay complementary pairs - Property 1:

[0139] Assume that a and b are Golay pairs of length N, and c and d are Golay pairs of length M, then sequences e and f are of length Golay pair:

[0140]

[0141]

[0142] Wherein k, l, m are real numbers, and w1, w2, w3 and w4 are arbitrary complex numbers with unit magnitude, and α1 is a complex number.

[0143] Unified method for constructing Golay complementary pairs - Property 2:

[0144] Assume that a and b are Golay pairs of length N. Then, the following e and f sequences are Golay pairs of length k(N-1)+m+1:

[0145] x e (z) = α1w1w3x a (z k )+α2w2w4x b (z k ) m (14)

[0146]

[0147] Where k, m are real numbers, and w1 and w2 are arbitrary complex numbers with unit magnitude, and ∠α1=∠α2=1.

[0148] Unified method for constructing Golay complementary pairs - Property 3:

[0149] Assume that a and b are Golay pairs of length N. Then, the following e and f sequences are Golay pairs of length k(N-1)+m+1:

[0150] x e (z) = α1w1w3x a (z k )+α2w2w4x b (z k ) m (16)

[0151]

[0152] Where k, m are real numbers, and w1 and w2 are arbitrary complex numbers with unit magnitude, and ∠α1=∠α2=1.

[0153] Recursive Golay complementary pair construction method - Golay-based cascade method 1:

[0154] Assume that a and b are Golay pairs of length N. Then, sequences e and f construct a GCP of length 2N

[0155] x e (z) = x a (z)+x b (z)z N (18)

[0156] x f (z) = x a (z)-x b (z)z N (19)

[0157] Note that this is a special case of Property 2, where α 1,2 =w 1,2,3,4 =1,k=l=1,m=N.

[0158] Recursive Golay complementary pair construction method - Golay-based cascade method 2:

[0159] Assume that a and b are Golay pairs of length N. Then, sequences e and f construct a GCP of length 2N

[0160] x e (z) = x a (z)+x b (z)zN (20)

[0161]

[0162] Note that this is a special case of Property 3, where α 1,2 =w 1,2,3,4 =1, m=N.

[0163] Recursive Golay complementary pair construction method - Golay-based interleaving method 1:

[0164] Assume that a and b are Golay pairs of length N. Then, sequences e and f construct a GCP of length 2N

[0165] x e (z) = x a (z 2 )+x b (z 2 )z (22)

[0166] x f (z) = x a (z 2 )-x b (z 2 )z (23)

[0167] Note that this is a special case of Property 2, where α 1,2 =w 1,2,3,4 =1,k=l=2,m=1.

[0168] Recursive Golay complementary pair construction method - Golay-based interleaving method 2:

[0169] Assume that a and b are Golay pairs of length N. Then, sequences e and f construct a GCP of length 2N

[0170] x e (z) = x a (z 2 )+x b (z 2 )z (24)

[0171]

[0172] Note that this is a special case of Property 3, where α 1,2 =w 1,2,3,4 =1,k=l=2,m=1.

[0173] Recursive Golay complementary pair construction method - Sivaswamy's construction:

[0174] Assume c0 and d0 are Golay pairs of length M. Length 2 n The GCP of M can be constructed by the following recursive procedure:

[0175]

[0176]

[0177] where |w n |=1.

[0178] Note that this is a special case of Property 2, where α 1,2 =w 1,3,4 =1,w2=w n ,k=l=1,m=M2 n This construction cascades CS at each iteration.

[0179] Recursive Golay complementary pair construction method - Budisi's construction:

[0180] Assume c0 and d0 are Golay pairs of length M. Length 2 n The GCP of M can be constructed by the following recursive procedure:

[0181]

[0182]

[0183] where |w n |=1,p n is the (n+1)th element of the permutation of {0 1 2 … m-1}.

[0184] Note that this is a special case of Property 2, where α 1,2 =w 1,3,4 =1,w2=w n ,k=l=1, Compared to Sivaswamy's construction, Budisin's approach cascades CS by allowing different orderings at the mth iteration.

[0185] Recursive Golay complementary pair construction method - Turyn's method:

[0186] Assume that a and b are Golay pairs of length N, and c' and d' are Golay pairs of length M. Then, sequences e and f are Golay pairs of length MN:

[0187]

[0188]

[0189] If the initial alphabet for the sequences a, b, c' and d' is {1, -1}, and the sequences c' and d are added or subtracted, then Turyn's method does not change the alphabet of the sequence elements.

[0190] Note that this is a special case of Property 1, where w 1,2,3,4 =1,k=M,l=1,m=0,x c (z)=(x c′ (z)+x d′ (z)) and x d (z)=(x c′ (z)-x d′ (z)). Sequences c and d construct GCP based on property 2.

[0191] Algebraic Golay complementary pair construction method - Davis & Jedwab construction:

[0192] Principle (GCS): Let f be a function, f: Given by:

[0193]

[0194] in and π is a permutation of indices {1,2,…,m}. Then, the sequence pair (a,b) is defined as

[0195] a=μ(f+c) (33)

[0196] b=μ(f+2 h-1 x π(1) +c′) (34)

[0197] Its length is 2 m GCP, any of which And the entry-by-entry function μ(x) = ξ x ,in And H is an even positive integer.

[0198] Algebraic Golay complementary pair construction method - Kenneth's construction:

[0199] Principle: Let f be a function f: As given below:

[0200]

[0201] in and π is a permutation of indices {1,2,…,m}. Then, the sequence pair (a,b) is defined as

[0202] a=μ(f+c) (36)

[0203]

[0204] Its length is 2 m GCP, any of which And the entry-by-entry function μ(x) = ξ x ,in And H is an even positive integer.

[0205] Reference now Figure 5 , shows a graph illustrating the distribution of the peak-to-average power ratio (PAPR) of an OFDM signal under the Gaussian distribution approximation. According to the center limit principle, the sample distribution of an OFDM waveform can be similar to a Gaussian distribution because a large number of modulated, different subcarriers are linearly combined via Fourier transform. By assuming N independent and identically distributed (iid) samples in time (i.e., no oversampling) and normalized sample powers, the complementary cumulative distribution function (CCDF) of the sample power can be given by

[0206]

[0207] like Figure 5 As shown, the instantaneous sample power within an OFDM symbol can be significantly higher than the average symbol power. For example, in an OFDM symbol with 128 active subcarriers, approximately 10% of the samples are 8.5 dB higher than the average sample power, and 50% of the time, the sample power is 7 dB higher than the average symbol power. The result of the instantaneous sample power within an OFDM symbol being significantly higher than the average symbol power is that OFDM signals generated using nonlinear hardware (e.g., the power amplifier of the transmitter) are prone to distortion. To avoid distortion, power backoff can be applied at the transmitter. However, this reduces the coverage of the signal.

[0208] One solution considered in several wireless communication standards is to use single-carrier-like schemes, such as SC-QAM (as in IEEE 802.11ad / ay) and DFT-spread OFDM (as in 3GPP LTE / NR uplink). However, these schemes only allow continuous resource allocation in frequency and do not produce flexible non-continuous allocations that do not affect PAPR. On the other hand, non-continuous resource allocation in the frequency domain may be required for several reasons. For example, spectrum regulation in unlicensed bands may introduce power spectral density (PSD) limits (e.g., 10 dBm / MHz). In order to increase signal power under PSD limits, signal energy may need to be distributed over frequency. However, this may lead to over-utilization of frequency domain resources, which may cause problems in multi-user scenarios. Interleaved resource allocation can be used to avoid such problems. Similarly, non-continuous resource allocation can be used to increase the reliability of signals for low-latency applications such as ultra-reliable low-latency communication (URLLC) signals and wake-up signals, for example. It is not meaningless to control the instantaneous peak power of the transmitted signal on interleaved resource allocation and non-continuous resource allocation. .

[0209] Representative reliable signal with interleaved resource allocation

[0210] In 3GPP 5G Unlicensed New Radio (NR) ("NR-U"), PUCCH may be transmitted on an unlicensed carrier for standalone operation. Since PUCCH may be sent in time periods of short duration, symbols may be sent at high power, e.g., to enhance demodulation performance. Therefore, the design for PUCCH in unlicensed bands should result in signals with low PAPR. Constructing sequences with low PAPR is challenging when considering an interleaving structure that allows high transmit power (e.g., higher than licensed band operation) without violating regulatory requirements.

[0211] Figure 6 is a graph showing the PAPR distribution of sPUCCH format 0 in MulteFire. In MultFire, "sPUCCH format 0" follows the same interleaving structure as LTE-U for scheduling requests using Zadoff-Chu sequences with cyclic padding. Figure 6 As shown, the PAPR is greater than 5.5 dB, ie, it is not optimal in terms of PAPR, and the corresponding sequence may disadvantageously increase the complexity of the receiver due to its polyphase property (elements of the sequence are arbitrary complex numbers with unit amplitude).

[0212] What is needed is a construction method for PUCCH where 1) the PAPR of symbols in PUCCH can be controlled considering the interleaving structure of the waveform in unlicensed bands and 2) the receiver complexity can be minimized, for example by restricting the sequence alphabet (eg, QPSK constellation).

[0213] Representative ultra-reliable and low-latency waveforms

[0214] To achieve ultra-reliable and low-latency communications, the waveform should be immune to hardware nonlinearities and fading in the communication channel. One way to achieve reliability is to use enhanced coding structures, such as polar codes, and exploit frequency diversity by using non-contiguous resource allocation. It is challenging to design a waveform with low cubic metric (CM) / PAPR while utilizing enhanced coding schemes and allowing non-contiguous allocation. The amount of power back-off may result in a significant amount of power loss and reduce the effectiveness of such a scheme.

[0215] In some cases, it may be desirable to support large payloads (e.g., virtual reality, telesurgery applications). However, waveforms such as DFT-spread OFDM or SC-QAM lose their PAPR advantages for higher order modulations. Therefore, URLCC waveforms require a flexible structure that can support a variety of payloads and achieve high modulation orders.

[0216] Overview

[0217] Methods, devices, and systems for complementary sequence (CS) encoding and encoded CS transmission are provided. In these devices, a transmitter has a complementary sequence (CS) encoder that can limit the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) symbols for continuous or non-continuous frequency domain resource allocation. In one embodiment, the CS encoder can convert an initial (e.g., Golay) complementary sequence pair set into a coded CS (e.g., Golay) sequence, and the transmitter can transmit the coded CS sequence (codeword) via an OFDM waveform that can exhibit a low PAPR (e.g., less than 3dB) for continuous or non-continuous frequency domain resource allocation. In one embodiment, the encoder can include a sequential encoder, a phase encoder, and a shift encoder and a synthesizer to perform various encodings.

[0218] A framework for describing the recursion of evolving two linear operators at each operation as encoding operations is provided herein. The framework can algebraically determine how to distribute the operators applied at each recursive operation to the coefficients of the polynomial via a binary construction sequence. By applying the framework to A recursive Golay complementary pair (GCP) construction of the method shows the effects of the initial sequence, phase rotation, sign, real scalar and shift factor applied at each operation on the sequence elements in the GCP. An encoder is provided that can generate a non-continuous CS, that is, a CS with zero symbols, by deriving an algebraic normal form (ANF) of the shift factor. According to the method, device and system provided herein, frequency diversity, coding gain and low PAPR can be achieved simultaneously for OFDM symbols. Also according to the method, device and system provided herein, a standard sequence can be extended by an encoder that separates the amplitude and phase of the elements that control the CS. An encoder is also provided herein that generates a CS with an orthogonal amplitude modulation (QAM) alphabet.

[0219] Among these devices, a device has a transmitter that can be configured to: (i) transmit a coded complementary sequence (CS) via a block-based (e.g., orthogonal frequency division multiplexing (OFDM)) waveform, and / or (ii) construct or otherwise generate (collectively, "generate") the coded CS using multiple seed sequences and multiple information items, wherein (or so that): (a) the juxtaposition of elements of the coded CS ("coded CS elements") encodes a first set of multiple information items ("first information item set"); b) the phase of the coded CS elements encodes a second set of the multiple information items ("second information item set"); and (c) the coded CS elements define a number of zeros that encode a third set of the multiple information items ("third information item set"). In an embodiment, the coded CS elements may define a corresponding number of zeros that together form a number of zeros that encode the third information item set. In an embodiment, each coded CS element may define a number of zeros that do not constitute the number of zeros that encode the third information item set.

[0220] In one embodiment, the transmitter may include a circuit including a processor and a memory configured to implement a complementary sequence (CS) encoder (CSE) entity and an inverse discrete Fourier transform (IDFT) entity. The CSE entity may be configured to generate the coded CS in the frequency domain. The IDFT entity may be configured to apply the IDFT to convert the coded CS to the time domain.

[0221] In one embodiment, said amplitudes of said elements of said code-complementary sequence may encode a fourth set of said plurality of information items.

[0222] In the apparatus, there is an apparatus having a transmitter, which can be configured to (i) generate a first coding sequence using a plurality of seed sequences and a first set of a plurality of information items, wherein a concatenation of elements of the first coding sequence corresponding to different seed sequences encodes the first set of the plurality of information items; (ii) generate a second coding sequence using the first coding sequence and a second set of the plurality of information items, wherein a phase of elements of the second coding sequence encodes the second set of the plurality of information items; (iii) generate a third coding sequence using the second coding sequence and a third set of the plurality of information items, wherein elements of the third coding sequence define a number of zeros encoding a third set of the plurality of information items; and (iv) generate a coded complementary sequence based on the third coding sequence.

[0223] In the apparatus, there is an apparatus having a transmitter, which can be configured to (i) generate a first coded sequence using a plurality of seed sequences and a first set of a plurality of information items, wherein a concatenation of elements of the first coded sequence corresponding to different seed sequences encodes the first set of the plurality of information items; (ii) generate a second coded sequence using the first coded sequence and a second set of the plurality of information items, wherein the amplitude of the elements of the second coded sequence encodes the second set of the plurality of information items; (iii) generate a third coded sequence using the second coded sequence and a third set of the plurality of information items, wherein the phase of the elements of the third coded sequence encodes the third set of the plurality of information items; (iv) generate a fourth coded sequence using the third coded sequence and a fourth set of the plurality of information items, wherein the elements of the third coded sequence define the number of zeros encoding the third set of the plurality of information items; and (v) generate a coded complementary sequence based on the fourth coded sequence.

[0224] In the apparatus, there is an apparatus having a transmitter, which can be configured to (i) perform sequential encoding at least in part by juxtaposing elements of multiple seed sequences based on a first set of multiple information items to generate a first coded sequence; (ii) perform phase encoding at least in part by phase rotating elements of the first coded sequence based on a second set of the multiple information items to generate a second coded sequence; (iii) perform shift encoding at least in part by shifting (e.g., zero padding) elements of the second coded sequence based on a third set of the multiple information items and resource allocation to generate a third coded sequence; and (iv) generate a coded complementary sequence based on the third coded sequence (e.g., the sum of the individual elements).

[0225] In the apparatus, there is an apparatus having a transmitter, which can be configured to (i) perform sequential coding at least in part by juxtaposing elements of a plurality of seed sequences based on a first set of a plurality of information items to generate a first coded sequence; (ii) perform amplitude coding at least in part by adjusting at least one amplitude of at least one element of the first coded sequence based on a second set of the plurality of information items to generate a second coded sequence; (iii) perform phase coding at least in part by phase rotating elements of the second coded sequence based on a third set of the plurality of information items to generate a third coded sequence; (iv) perform shift coding at least in part by shifting (e.g., padding with zeros) elements of the third coded sequence based on a fourth set of the plurality of information items and resource allocation to generate a fourth coded sequence; and (v) generate a coded complementary sequence based on the fourth coded sequence (e.g., a sum of the individual elements).

[0226] According to the method, apparatus and system, the OFDM signal generated using the coded CS can have a low peak-to-average power ratio (PAPR), for example, less than or equal to 3 dB. In addition, according to the method, apparatus and system, continuous and non-continuous allocation can be supported. In addition, according to the method, apparatus and system, it is not necessary to perform different channel coding, modulation and resource allocation processes to generate an OFDM waveform.

[0227] Considering interleaving resource allocation to meet channel occupancy requirements and increase signal power in unlicensed bands and several use cases such as URLLC in licensed bands, the method, apparatus and system can be applicable to various applications in both licensed and unlicensed bands.

[0228] Representative Transmitter Architectures

[0229] Figure 7 is a block diagram illustrating an example transmitter 700 in which one or more embodiments may be implemented. The transmitter 700 may include a complementary sequence (CS) encoder (CSE) entity 710, an IDFT entity 750, and a cyclic prefix append (CP+) entity 760. The transmitter 700 may also include other entities. The CSE entity 740 may be communicatively coupled to the IDFT entity 750, which may be communicatively coupled to the CP+ entity 760. The transmitter 700 may be implemented in any of a WTRU and a base station (or one or more other network elements). For convenience only, the following description assumes that the transmitter 700 is implemented in a WTRU. The WTRU may include circuitry, including a processor and a memory, configured to implement the transmitter and / or its various entities.

[0230] The CSE entity 710 may include one or more inputs ("CSE inputs"), one or more processing entities ("CSE processing entities"), and one or more outputs ("CSE outputs"). The CSE input may receive a set of information symbols (eg, C information bits) and one or more parameters.

[0231] The CSE processing entity may generate a coded CS based on any one of the information symbols and the parameters. As shown, the coded CS may have a length of M elements. The parameters may include fixed values, system parameters, etc. As an example, the parameters may be any of a modulation order, resource allocation, and the number of information symbols / bits. The modulation order may be, for example, M-PSK or M-QAM. The resource allocation may be, for example, discontinuous or continuous. For example, discontinuous resource allocation may result in the coded CS having elements whose values ​​may be zero or other null values.

[0232] The output of the CSE entity 710 may output the coded CS. The IDFT entity 750 may receive the coded CS. The IDFT entity may process the coded CS into a time domain signal and may output the time domain signal. The CP+ entity 760 may receive the time domain signal, append a cyclic prefix, and output a modified time domain signal for further processing. The further processing may be performed by one or more other transmitter entities (not shown). The further processing may include, for example, processing the modified time domain signal into a block-based (e.g., OFDM) signal and / or transmitting the block-based signal.

[0233] The CSE processing entity may include various encoders for encoding the information symbol / bit set. The CSE processing entity may map a subset of the information symbol / bit set to each of the various encoders, and each of the various encoders may separately encode the subset of information symbols / bits mapped thereto. The subsets may, but need not, be mutually exclusive.

[0234] For simplicity, in this context, it is assumed that the information symbol set is a single information symbol set, wherein each subset is a subset of the single information symbol set. One of ordinary skill in the art will recognize that the CSE unit may receive multiple information symbol sets, and the CSE processing unit may map one of the multiple information symbol sets to each of the respective encoders. Alternatively, the CSE processing unit may map the respective information symbol sets to the respective encoders; each information symbol set may have information symbols from one or a combination of the multiple information symbol sets.

[0235] The CSE processing entity does not need to perform different channel coding, modulation and resource allocation assignment processes.The channel coding, modulation and resource allocation assignment of the coded CS may be generated by a joint (collective) operation performed by the CSE processing entity.

[0236] The coded CS may be one of a plurality of possible unique coded CSs that may be generated using the received information set; allowing the coded CS to be operated as a complex codeword. The ability of the CSE entity 710 to generate a plurality of possible unique coded CSs using the received (or given) information set may avoid functionality and / or associated structural elements in the CSE entity 710 and / or transmitter 700 for uniquely encoding the coded CS post-generation.

[0237] Figure 8 8 is a block diagram illustrating an example transmitter 800 in which one or more embodiments may be implemented. The transmitter 800 may include a CSE entity 810, a mapping entity 840, an IDFT entity 850, and a CP+ entity 860. The CSE entity 810 may be communicatively coupled with the mapping entity 840. The mapping entity 840 may be communicatively coupled with the IDFT entity 850. The IDFT entity 850 may be communicatively coupled with the CP+ entity 860.

[0238] The transmitter 800 may be implemented in any of a WTRU and a base station (or one or more other network elements). For convenience only, the following description assumes that the transmitter 800 is implemented in a WTRU. The WTRU may include circuitry, including a processor and a memory, configured to implement the transmitter and / or its various entities.

[0239] and Figure 7 Similar to the transmitter 700, Figure 8 The CSE entity 810 may generate and output a coded CS. The mapping entity 840 may receive the coded CS. The mapping entity 840 may perform a mapping operation on the coded CS. The mapping entity 840 may output the mapped coded CS. The IDFT entity 850 may receive the mapped coded CS. The IDFT entity 850 may process the mapped coded CS into a time domain signal and may output the time domain signal. The CP+ 860 entity may receive the time domain signal, append a cyclic prefix, and output a modified time domain signal for further processing. The further processing may be performed by one or more other transmitter entities (not shown). The further processing may include, for example, processing the modified time domain signal into a block-based (e.g., OFDM) signal and / or sending the block-based signal.

[0240] The CSE entity 810 may include a first mapping entity 812, a second mapping entity 814, a third mapping entity 816, a synthesizer 818, a sequence encoder 820, a phase and sign encoder (collectively referred to as a "phase encoder") 822, a shift encoder 824, and an adder 826. The CSE entity 810 may also include other CSE processing entities. The first, second, and third mapping entities 812-816 and the synthesizer 818 may include bit / symbol processing functions. The adder 826 may include sequence processing functions. The sequence, phase, and shift encoders 820-824 may include bit / symbol processing and sequence processing functions. To simplify the description, Figure 8 A separate branch 828 (e.g., as a construction) of an interconnected sequential encoder 820, a phase encoder 822, a shift encoder 824, and an adder 826 is shown to illustrate the sequence processing performed by the sequential encoder 820, the phase encoder 822, the shift encoder 824, and the adder 826.

[0241] Table 1 below lists Figure 8 The parameters are shown in and are referenced in the following description.

[0242]

[0243] Table 1

[0244] The parameters listed in Table 1 may be configured such that these parameters collectively determine any of: the number of non-zero and / or zero subcarriers (or more generally, the resource allocation assignment), the constellation type, the order of the constellation, and the coding rate.

[0245] The parameters listed in Table 1 may be dynamically or semi-dynamically configured by the network. For example, the base station may indicate the seed sequences a, b, c, and d via one or more downlink control channels, and different users may use different seed sequences. The indication may be an index (or multiple indexes) to a lookup (e.g., specified, predefined, etc.) table populated with the seed sequences a, b, c, and d. Alternatively, the seed sequences a, b, c, and d (e.g., their values) may be sent.

[0246] It can be signaled via the control channel The base station can, for example, indicate a larger frequency by increasing the spacing between non-zero subcarriers. value to exploit frequency diversity. For contiguous allocations, the base station can set In an embodiment, an offset may be signaled to shift the code complementary sequence g in the frequency domain.

[0247] It can be signaled to implement frequency shift keying (FSK), and information can be encoded in the interval with the subcarrier. The base station can generate a reliable FSK signal (i.e., low PAPR) by utilizing the CSE unit, and the mobile station can decode the FSK signal. This type of method can be used to support low-power communication devices such as wake-up radios.

[0248] The base station may configure π for each user by indicating the value of π via a control channel. The user may use the indicated π for its uplink transmission.

[0249] The constellation size q (i.e., the number of phases of the phase encoder) may be signaled from the network. For example, it may be derived from a modulation and coding scheme (MCS) table.

[0250] Representative synthesizer

[0251] The synthesizer 818 may include one or more inputs and one or more outputs. The synthesizer input may receive a plurality of seed sequences, such as complementary sequences a, b, c, and d. The complementary sequences a and b and the complementary sequences c and d may form Golay complementary pairs (GCPs), which are represented as GCP (a, b) and GCP (c, d), respectively. Although not shown, the complementary sequences a, b, c, and d may be of length and Any two GCPs.

[0252] The synthesizer input may also receive a parameter d'. The parameter d' may be a configuration parameter. The parameter d' may be based on the following combination Figure 8 The parameter d′ may be received via signaling from the network.

[0253] The synthesizer 818 may synthesize or otherwise generate vectors a1, a2, b1, and b2 based on the sequences a, b, c, and d and the parameter d′. The synthesizer 818 may output the vectors a1, a2, b1, and b2 via a synthesizer output. The vectors a1, a2, b1, and b2 may be provided as column vectors Output, where (·) T is the transpose of its argument. The synthesizer 818 can generate the vectors a1, a2, b1, and b2 in various ways. For example, the synthesizer 818 can convert or translate the sequences a, b, c, and d into the vectors a1, a2, b1, and b2 according to the following formula, and wherein and

[0254]

[0255]

[0256]

[0257] as well as

[0258]

[0259] in is a matrix that can remove the last d′ elements of the corresponding vector (the last d′ elements of the corresponding vector can be zero), and and is a vector of sequences a, b, c and d.

[0260] For the special case of equations 39-42 above, the synthesizer 818 may apply different rules to form vectors a1, a2, b1, and b2 from sequences a, b, c, and d. For example, the synthesizer 818 may form vectors a1, a2, b1, and b2 such that if parameter d′ is 0, sequence c = (1) and sequence d = (1), then a1 = a, a2 = b, and The synthesizer 818 may form vectors a1, a2, b1, and b2 such that if parameter d' is 0, sequence a = (1) and sequence b = (1), then a1 = c, a2 = d, b1 = c, and b2 = d. The synthesizer 818 may form vectors a1, a2, b1, and b2 such that if parameter d' is 0, sequence a = (1), sequence b = (1), sequence c = (1), and sequence d = (1), then a1 = 1, a2 = 1, b1 = 1, and b2 = 1. In these special cases, the pairs (a1, a2) and (b1, b2) may be GCPs.

[0261] In one embodiment, the synthesizer 818 may generate the vectors a1, a2, b1, and b2 using one or more lookup tables and one or more indices. The indices and / or one or more indications of the indices (collectively referred to as "indexes") may be signaled to the WTRU from the network and / or from higher layers in the WTRU. The lookup tables may be populated based on complementary sequences a, b, c, and d. The signaled indexes may include a parameter d' and / or one or more indications of any of the complementary sequences a, b, c, and d.

[0262] The WTRU may be configured (dynamically, semi-statically and / or statically) with any of the following: a lookup table, complementary sequences a, b, c and d and GCP (a, b), (c, d) (and / or two other lengths and The WTRU may receive, for example, via signaling from the network, one or more configurations for configuring any of the following: complementary sequences a, b, c, and d and GCP (a, b), (c, d) (and / or two other lengths and of GCP).

[0263] Representative first mapping entity

[0264] The first mapping entity 812 may include one or more inputs and one or more outputs. The input of the first mapping entity 812 may receive a first set of information symbols / bits. The first mapping entity 812 may apply a first mapping to the first set of information symbols / bits to obtain a first set of coded information π ("coded information π"). The first mapping entity 812 may output the coded information π via its output.

[0265] Herein (e.g., above and / or below), (i) the term "bit group P" may refer to "a first set of information symbols / bits" and may be used interchangeably; (ii) the term "mapping P" may refer to "a first mapping" and may be used interchangeably; and / or (iii) the term "bit group P mapping entity" may refer to "a first mapping entity" and may be used interchangeably.

[0266] The mapping P may be in any equation and lookup table form. In one embodiment, the mapping P may include a mapping between possible values ​​of the information symbol / bit of the first set and the permutations (i.e., the order of the sequence) of {1, 2, ..., m}, where, for a given m, there are m! permutations. In one embodiment, each permutation may be mapped to possible values ​​of the information symbol / bit of the first set. Table 2 below provides an example of a mapping P that lists the corresponding values ​​of the possible values ​​of the information symbol / bit of the first set and the permutations of {1, 2, ..., m}, where m = 3.

[0267] Bit π 00 [1 2 3] 01 [2 1 3] 10 [1 3 2] 11 [3 2 1]

[0268] Table 2

[0269] Using the example of mapping P provided in Table 2 as an example, the first mapping entity 812 may set the encoding information π to one of the permutations [1 2 3], [2 1 3], [1 3 2], and [3 2 1] based on the value of the information symbol / bit of the first set. For example, if the information symbol / bit of the first set has a value of "00", the encoding information π may be set to the permutation [1 23], and if the information symbol / bit of the first set has a value of "11", the encoding information π may be set to the permutation [3 21].

[0270] Representative Sequential Encoders

[0271] The sequential encoder 820 may include one or more inputs and one or more outputs. The sequential encoder input may receive vectors a1, a2, b1, and b2 (eg, as column vectors ). The sequential encoder input may receive the encoded information π. The sequential encoder 820 may convert the sequence Output to branch 828. In one embodiment, the sequence can be output The (k+1)th element of , so that it corresponds to the vector of the (k+1)th branch, such as Figure 8 As shown, for indexing, the sequence can be The 0th element of is mapped to the 0th branch.

[0272] The sequential encoder 820 may use the vectors a1, a2, b1 and b2 and the encoding information π to generate the sequence In an embodiment, the sequential encoder 820 may generate a sequence based on the encoding information π So that x r ∈{a1,a2,b1,b2} and x r = a1, a2, b1 or b2. For example, the sequence encoder 820 may generate a sequence For each different value of the coded information π and / or for each different value of the information symbol / bit of the first set, may be different (i.e., different sequences a1, a2, b1 and b2). The latter assumes that the mapping P defines a mapping for the coded information π that does not have repeated values, such as the example of mapping P provided in Table 2.

[0273] In an embodiment, the sorting encoder 820 may apply a sorting algorithm to the received vectors a1, a2, b1 and b2, and wherein the sorting algorithm may be based on the encoding information π. The sorting algorithm may be any one of an equation or a lookup table(s).

[0274] The sorting algorithm can be implemented using a matrix (represented here as "matrix Θ"). The sequential encoder 820 may apply the matrix Θ to the vectors a1, a2, b1, and b2, for example, according to the following equation:

[0275]

[0276] The matrix Θ can be, for example, a matrix And o1, o2, o3 and o4 may be column vectors for the corresponding sequences o1, o2, o3 and o4. The column vectors o1, o2, o3 and o4 may be obtained from a truth table. The truth table may be filled based on the encoding information π and a set of algebraic functions. In one embodiment, for the sequence Where i = 1, 2, 3, 4, the algebraic function set can be based on the algebraic function o i : For example, the set of algebraic functions can be Algebraic functions in the domain, such as

[0277] o1(x1,x2,…,x m )=(1-x π(2) )(1-x π(1) ) (44)

[0278] o2(x1,x2,…,x m )=(1-x π(2) )(x π(1) ) (45)

[0279] o3(x1,x2,…,x m )=x π(2) (1-x π(1) ) (46) and

[0280] o4(x1,x2,…,x m )=x π(2) x π(1) (47) wherein the encoded information π(n) may refer to the nth element of the arrangement of {1, 2, …, m}, and

[0281] The truth table, the matrix Θ and the sequence generated using the truth table and / or the matrix Θ For each different value of the coded information π and / or for each different value of the information symbols / bits of the first set, it can be different (i.e., a different ordering). The latter assumes that the mapping P defines a mapping without repeated values ​​for the coded information π, such as the example of mapping P provided in Table 2.

[0282] Table 3 below provides an example of a truth table based on the encoded information π(n) and the set of algebraic functions (44), (45), (46) and (47), where the encoded information π(n) = [3 2 1] and the lexicographic order is assumed for the algebraic functions (44), (45), (46) and (47).

[0283] k <![CDATA[x1]]> <![CDATA[x2]]> <![CDATA[x3]]> <![CDATA[o1]]> <![CDATA[o2]]> <![CDATA[o3]]> <![CDATA[o4]]> 0 0 0 0 1 0 0 0 1 0 0 1 0 1 0 0 2 0 1 0 0 0 1 0 3 0 1 1 0 0 0 1 4 1 0 0 1 0 0 0 5 1 0 1 0 1 0 0 6 1 1 0 0 0 1 0 7 1 1 1 0 0 0 1

[0284] Table 3

[0285] The individual entries listed under o1, o2, o3 and o4 in Table 3 can be obtained from the algebraic function, assuming the encoding information π(n) = [3 2 1] and the lexicographic order, i.e.:

[0286] o1(x1,x2,…,x m )=(1-x2)(1-x3)

[0287] o2(x1,x2,…,x m )=(1-x2)x3

[0288] o3(x1,x2,…,x m )=x2(1-x3)

[0289] as well as

[0290] o4(x1,x2,…,x m )=x2x3.

[0291] The combined entries listed under each o1, o2, o3 and o4 in Table 3 can form column vectors o1, o2, o3 and o4 respectively. The matrix Θ obtained from the example of the truth table provided in Table 3 can be:

[0292]

[0293] The sequential encoder 820 can generate the sequence by applying the matrix Θ obtained from the example of the truth table provided in Table 3 according to equation (43). Right now:

[0294]

[0295] Based on the example of mapping P provided in Table 2, the sequence generated according to equation (49) The values ​​of the first set of information symbols / bits corresponding to the encoded information π(n)=[3 2 1], ie, the value "00", may be encoded.

[0296] Table 4 below provides an example of a truth table based on the encoded information π(n) and the set of algebraic functions (44), (45), (46) and (47), where the encoded information π(n) = [1 2 3] and lexicographic order are assumed for the algebraic functions (44), (45), (46) and (10).

[0297] k <![CDATA[x1]]> <![CDATA[x2]]> <![CDATA[x3]]> <![CDATA[o1]]> <![CDATA[o2]]> <![CDATA[o3]]> <![CDATA[o4]]> 0 0 0 0 1 0 0 0 1 0 0 1 1 0 0 0 2 0 1 0 0 0 1 0 3 0 1 1 0 0 1 0 4 1 0 0 0 1 0 0 5 1 0 1 0 1 0 0 6 1 1 0 0 0 0 1 7 1 1 1 0 0 0 1

[0298] Table 4

[0299] The individual entries listed under o1, o2, o3 and o4 in Table 4 can be obtained from an algebraic function, assuming the encoding information π(n) = [1 2 3] and the lexicographic order, i.e.:

[0300] o1(x1,x2,…,x m )=(1-x2)(1-x1)

[0301] o2(x1,x2,…,x m )=(1-x2)x1

[0302] o3(x1,x2,…,x m )=x2(1-x1)

[0303] as well as

[0304] o4(x1,x2,…,x m )=x2x1.

[0305] The combined entries listed under each o1, o2, o3 and o4 in Table 4 can form column vectors o1, o2, o3 and o4 respectively. The matrix Θ obtained for the example of the truth table provided in Table 4 can be:

[0306]

[0307] The sequential encoder 820 can generate the sequence by applying the matrix Θ obtained from the example of the truth table provided in Table 4 according to equation (43). Right now:

[0308]

[0309] Based on the example of mapping P provided in Table 2, the sequence generated according to equation (51) The value of the first set of information symbols / bits corresponding to the encoded information π(n)=[1 2 3], ie, the value "11", may be encoded.

[0310] By setting For the (k+1)th element of the sequence, the reverse lexicographic order can be used instead of the previous lexicographic order.

[0311] In one embodiment, the sequential encoder 820 may generate the sequence as follows The sequential encoder 820 may perform an entry-by-entry mapping function (e.g., perform calculations using the function), such as according to:

[0312]

[0313] in: and is an entry-by-entry mapping function; And the related sequence (where i = 1, 2, 3, 4) algebraic function o i : Can be Algebraic functions in a field:

[0314] o1(x1,x2,…,x m )=(1-x π(2) )(1-x π(1) ) (53)

[0315] o2(x1,x2,…,x m )=(1-x π(2) )(x π(1) ) (54)

[0316] o3(x1,x2,…,x m )=x π(2) (1-x π(1) ) (55) and

[0317] o4(x1,x2,…,x m )=x π(2) x π(1) (56) where π is a permutation of {1,2,…,m}, and π(n) gives the nth element of π, and

[0318] Representative Second Mapping Entity

[0319] The second mapping entity 814 may include one or more inputs and one or more outputs. The input of the second mapping entity 814 may receive a second set of information symbols / bits. The second mapping entity 814 may apply a second mapping to the second set of information symbols / bits to obtain a second set of coded information c k (“Encoded information c k ”). The second mapping entity 814 may output the coded information c via its output k .

[0320] Herein (e.g., above and / or below), (i) the term "bit group C" may refer to "a second set of information symbols / bits" and may be used interchangeably; (ii) the term "mapping C" may refer to "a second mapping" and may be used interchangeably; and / or (iii) the term "bit group C mapping entity" may refer to "a second mapping entity" and may be used interchangeably.

[0321] The mapping C can be in the form of any equation or lookup table. In one embodiment, the mapping C can include possible values ​​of the information bits of the second set and where k = 0, 1, 2, ..., m. For a given m, there exists H m+1 combinations, and each combination can be mapped to one (or more) possible values ​​of the information symbols / bits of the second set.

[0322] Table 5 below provides an example of a mapping C that lists possible values ​​of the information symbols / bits of the second set and the coded information c k The values ​​listed are for m=3 and H=4 (ie, QPSK or q-PSK). The coded information c k Can be one of 4 different values, namely, c k ∈{0,1,2,3},c k This means that log2H = 2 information bits. Therefore, as described below, when m = 3, 8 bits can be carried using a phase encoder.

[0323] Bit <![CDATA[c k ]]> 00 0 01 1 10 2 11 3

[0324] Table 5

[0325] Using the example of mapping C provided in Table 5 as an example, the second mapping entity 814 may convert the coded information c into k is set to one of 0, 1, 2, and 3. For example, if the information symbol / bit of the second set has the value "00", the coded information c k can be set to 0, whereas if the information symbol / bit of the first set has the value "11", the coded information c k Can be set to 3.

[0326] Note that for a given π, Different values ​​may be generated and additional bits may be transmitted.

[0327] Representative phase and mark encoders

[0328] Phase and sign encoder (collectively referred to as "phase encoder") 822 may include one or more inputs and one or more outputs. The phase encoder input may receive the sequence For example, as a column vector. The phase encoder input can receive the encoded information c k And / or encoding information π. The phase encoder 822 can convert the sequence Output to branch 828.

[0329] Phase encoder 822 may use the sequence Encoded informationc k and the encoded information π to generate the sequence In an embodiment, the phase encoder 822 may apply a phase algorithm and a sign algorithm to the received sequence. The phase and sign algorithm can be based on the coded information c k and encoding information π. Although shown as separate processing operations, the phase and sign algorithms can be combined. The phase and sign algorithms can be in the form of any equation or lookup table (one or more). An exemplary equation form is first provided, followed by an example of a lookup table form.

[0330] The phase and sign algorithm may be based on Kenneth's principle as set out in the vocabulary. The generalized Boolean function f for the phase and sign algorithm phase : Can be The domain is characterized as:

[0331]

[0332] The encoded information H is an even positive integer, and the encoded information π(n) can refer to the nth element of the arrangement of {1,2,…,m}, and

[0333] In the sequence The sequence output after applying the phase and sign algorithm can be mapped to another sequence via an entry-by-entry mapping function

[0334]

[0335] in is the function f phase The related sequence, and the entry-by-entry mapping function μ phase (x) = ξ x and Alternatively, a constant phase can be applied to μ phase (x) = ρξ x With a rotated constellation, where |ρ|=1.

[0336] Assuming the coded information π = [3 2 1], c0 = 1, c1 = 1, c2 = 2, c3 = 3, m = 3 and H = 4, and using lexicographic order, the generalized Boolean function for the phase and sign algorithm can be obtained for the coded information π = [3 2 1]

[0337] f phase (x1,x2,…,x m )=2(x3x2+x2x1)+c1x3+c2x2+c3x1+c0. (59)

[0338] Afterwards, the corresponding sequence w can be calculated as described in Table 6, since

[0339]

[0340] Table 6

[0341] As another example, assuming the encoded information π = [1 2 3], c0 = 1, c1 = 1, c2 = 2, c3 = 3, m = 3 and H = 4 and using lexicographic order, the generalized Boolean function for the phase and sign algorithm can be obtained for π = [1 2 3]

[0342] f phase (x1,x2,…,x m )=2(x1x2+x2x3)+c1x1+c2x2+c3x3+c0. (60)

[0343] Thereafter, the corresponding sequence w can be calculated as described in Table 7, since

[0344]

[0345] Table 7

[0346] Representative third mapping entity

[0347] The third mapping entity 816 may include one or more inputs and one or more outputs. The input of the third mapping entity 816 may receive the third set of information symbols / bits and the basic shift factor. The third mapping entity 816 may apply the third mapping to the third set of information symbols / bits to obtain the third set of coded information d k (“Encoded information k ”). The third mapping entity 816 may output the encoded information s via its output k .

[0348] Herein (e.g., above and / or below), (i) the term "bit group D" may refer to "a third set of information symbols / bits" and may be used interchangeably; (ii) the term "mapping D" may refer to "a third mapping" and may be used interchangeably; and / or (iii) the term "bit group D mapping entity" may refer to "a third mapping entity" and may be used interchangeably.

[0349] The mapping D can be in the form of any equation or lookup table. In one embodiment, the mapping D can include possible values ​​of the information bits of the third set and where k = 0, 1, 2, ..., m, and is the basic shift factor. For a given H s , there exists H s mcombinations, and each combination can be mapped to a one-bit value. Table 8 provides the In this example, d k It can be H s = one of 4 different values, i.e., d k ∈{0,50,100,150}, and d k represents log2 H s = 2 information bits. Therefore, when H s =4 and m=3, a shift encoder can be used to carry log2 H s ×m=6 bits.

[0350] Bit <![CDATA[d k ]]> 00 0 01 50 10 100 11 150

[0351] Table 8

[0352] Note that the shift encoder can generate null symbols at the CSE output while maintaining the PAPR at no more than 3dB. This feature can be used to generate multi-carrier frequency shift keying (FSK), signature design for sparse carrier multiple access, interleaving design for NR-U, and frequency domain index modulation. In different applications, the shift encoder can be used only to adjust resource allocation and can be indicated directly or indirectly by the network.

[0353] Representative shift encoders

[0354] The shift encoder 824 may include one or more inputs and one or more outputs. The shift encoder input may receive the sequence For example, as a column vector. The shift encoder input may receive the encoded information d k And / or encoding information π. The shift encoder 824 may output the sequence via the shift encoder output to branch 828

[0355] The shift encoder 824 may use the sequence Encoded information k and the encoded information π to generate the sequence In an embodiment, the shift encoder 824 may apply a shift algorithm to the received sequence The shift algorithm can be based on the encoded information d k and the encoding information π. The shift algorithm can be in either equation or lookup table (one or more) form. An exemplary equation form is provided first, followed by an example of a lookup table form.

[0356] Generalized Boolean function f for shift algorithm shift : Can be The domain is characterized as:

[0357]

[0358] in The encoded information π(n) may refer to the nth element of the permutation of {1,2,…,m}, and

[0359] When applying the shift algorithm to the sequence The output sequence can then be mapped to another sequence via an entry-by-entry mapping function

[0360]

[0361] in is the function f shift related sequences.

[0362] If for all k, all d k =0, then s = (0, L0, 2L0, ..., (2 m -1)L0), which results in a continuous CS. If d k ≠0, the shift encoder can cause overlapping or non-continuous CS in the frequency domain, because the support of the sequence may intersect or disjoint in frequency. In order to avoid sequence overlap due to frequency shift, for 1≤a≤m-1, the following conditions can be satisfied:

[0363] d k|π(k)=a ≥∑ l∈S:{n|π(n)>a} d l (63) If this condition is met, the sequence length is obtained And the alphabet remains the same for the non-zero elements.

[0364] Under certain conditions, overlap can be allowed. For example, if the sequences a, b, c, and d have zero elements, then d k Some values ​​of do not change the alphabet of nonzero elements, because no two nonzero elements overlap each other. Several examples using this property are provided below.

[0365] Assume the encoded information π = [1 2 3], d1 = 150, d2 = 100, d3 = 50 and m = 3, and use the lexicographic order:

[0366] f shift (x1,x2,…,x m )=d1x1+d2x2+d3x3+d0. (64)

[0367] Because μ phase (x) = x, the corresponding sequence s can be calculated as described in Table 9. This choice does not lead to frequency overlap because

[0368] d k|π(k)=1 =d1=150≥∑ l∈S:{n|π(n)>1} d l =d2+d3=150 (65)

[0369] as well as

[0370] d k|π(k)=2 =d2=100≥∑ l∈S:{n|π(n)>2} d l =d3=50. (66)

[0371]

[0372] Table 9

[0373] Representative sequence processing

[0374] The sequence processing may include sequence modulation, sequence shifting, sequence summing steps and frequency domain mapping.

[0375] The signal sent can be expressed as

[0376] t=AF H Mg (67) where F is the discrete Fourier transform matrix, is the subcarrier mapping matrix, is a matrix that prepends a cyclic prefix to the signal, and is the encoding CS. The vector g can be obtained using:

[0377]

[0378] in

[0379] k is the branch index,

[0380] x k ∈{a1,a2,b1,b2} is the sequence at the k-th branch output from the sequential encoder 820, and, and

[0381] w k is achieved through the phase encoder and The unit norm complex number (i.e., |w k |=1), and w r With vector Multiply to get

[0382] is the shift matrix of the kth branch, which is obtained by replacing s kand Ts k Null symbols are filled into the modulation vector The left and right sides of the modulation vector get in And k is the output of the shift encoder, and

[0383] The length of vector g is equal to

[0384] Reference now Fig. 9 , a block diagram of an example transmitter 900 is shown in which one or more embodiments may be implemented. The transmitter 900 may include a CSE entity 910, a mapping entity 940, an IDFT entity 950, and a CP+ entity 960. The CSE entity 910 may be communicatively coupled to the mapping entity 940. The mapping entity 940 may be communicatively coupled to the IDFT entity 950. The IDFT entity 950 may be communicatively coupled to the CP+ entity 960. The transmitter 900 may be implemented in any one of a WTRU and a base station (or one or more other network elements). For convenience only, the following description assumes that the transmitter 900 is implemented in a WTRU. The WTRU may include circuitry, including a processor and a memory, configured to implement the transmitter and / or its various entities.

[0385] and Figure 7 and 8 The transmitters 700 and 800 are similar, Fig. 9 The CSE entity 910 may generate and output a coded CS. The mapping entity 940 may receive the coded CS. The mapping entity 940 may perform a mapping operation on the coded CS. The mapping entity 940 may output the mapped coded CS. The IDFT entity 950 may receive the mapped coded CS. The IDFT entity 950 may process the mapped coded CS into a time domain signal and may output the time domain signal. The CP+ 960 entity may receive the time domain signal, add a cyclic prefix, and output a modified time domain signal for further processing. The further processing may be performed by one or more other transmitter entities (not shown). The further processing may include, for example, processing the modified time domain signal into a block-based (e.g., OFDM) signal and / or sending the block-based signal.

[0386] The CSE entity 910 may include a first mapping entity 912, a second mapping entity 914, a third mapping entity 916, a fourth mapping entity 917, a synthesizer 918, a sequence encoder 920, an amplitude encoder 921, a phase and sign encoder (collectively referred to as a "phase encoder") 922, a shift encoder 924, and an adder 926. The CSE entity 910 may also include other CSE processing entities.

[0387] The first, second, third and fourth mapping entities 912-917 and synthesizer 918 may include bit / symbol processing functions. Adder 926 may include sequence processing functions. The order, amplitude, phase and shift encoders 920-924 may include bit / symbol processing and sequence processing functions. To simplify the description, Fig. 9 928 (e.g., as a structure) interconnecting the sequence encoder 920, the amplitude encoder 921, the phase encoder 922, the shift encoder 924, and the adder 926 is shown to illustrate the sequence processing performed by the sequence encoder 920, the amplitude encoder 921, the phase encoder 922, the shift encoder 924, and the adder 926. In addition to the fourth mapping entity 919, the amplitude encoder 921, and the descriptions herein, Fig. 9 CSE entity 910 and Figure 8 Similar to the CSE entity 810,

[0388] Table 10 below lists Fig. 9 The parameters are shown in and are referenced in the following description.

[0389]

[0390] Table 10

[0391] The parameters listed in Table 10 may be configured such that these parameters collectively determine any of: the number of non-zero and / or zero subcarriers (or more generally, the resource allocation assignment), the constellation type, the order of the constellation, and the coding rate.

[0392] Representative fourth mapping entity

[0393] The fourth mapping entity 917 may include one or more inputs and one or more outputs. The input of the fourth mapping entity 917 may receive a fourth set of information symbols / bits and a set of basic amplitude factors. The fourth mapping entity 917 may apply a fourth mapping to the fourth set of information symbols / bits to obtain a k ,b k The fourth mapping entity 917 may output a via its output k ,b kHerein (e.g., above and / or below), (i) the term "bit group AB" may refer to "a fourth set of information symbols / bits" and may be used interchangeably; (ii) the term "mapping AB" may refer to "a fourth mapping" and may be used interchangeably; and / or (iii) the term "bit group AB mapping entity" may refer to "a fourth mapping entity" and may be used interchangeably.

[0394] Mapping AB can be in the form of any equation or lookup table. In one embodiment, mapping A can include possible values ​​of the fourth set of information bits and A mapping between values ​​of , where k = 1, 2, ..., m, and is the basic amplitude factor. For a given H a ,exist combinations, and each combination can be mapped to a one-bit value.

[0395] For a given constellation, such as M-QAM, additional rules can be applied. For example, for 16-QAM, for a given π, if a l or b l is set to At the same time, for n≠l and l=1,2,…,m, a n =b n =0,d n =0 and H=4, and L0>1, and a1, a2, b1, b2 are jπ / 4 ,e 3jπ / 4 ,e 5jπ / 4 ,e 7jπ / 4}QPSK constellation sequence, the length can be synthesized to be L02 m The constellation formed due to this operation can be, for example, Fig.10 The constellation shown is 1. Fig.10 The other constellations in can be obtained by scaling and rotating the original QPSK alphabet of a1, a2, b1, b2. In summary, a 16-QAM constellation with a length of L02 can be obtained. M m! 4 m+1 (2m+4) consecutive CSs (i.e., no empty elements). Length The discontinuous CS of can be obtained via a shift encoder such as provided herein. Other generalizations of M-QAM and non-uniform constellations can be derived based on similar basic principles or rules.

[0396] Representative Amplitude Encoder

[0397] The amplitude encoder 921 may include one or more inputs and one or more outputs. The amplitude encoder input may receive the sequence output from the sequential encoder 820. The amplitude encoder input may receive a from the output of the fourth mapping entity 917 k ,b k The amplitude encoder 921 can convert the sequence Output to branch 928.

[0398] Amplitude encoder 921 can use the sequence a k ,b k value and encoding information π to generate the sequence In one embodiment, the amplitude encoder 921 may apply an amplitude algorithm to the received sequence The amplitude algorithm can be based on a k ,b k The amplitude algorithm can be in any form of an equation or a lookup table (one or more). First, an exemplary equation form is provided, followed by an example of a lookup table form.

[0399] Generalized Boolean function f for amplitude arithmetic phase : Can be The domain is characterized as

[0400]

[0401] in The encoding information π(n) may refer to the nth element of the arrangement of {1,2,…,m}, and

[0402] In one embodiment, the entry-by-entry mapping function may be selected to be compatible with the entry-by-entry mapping function of the phase encoder, yielding

[0403]

[0404] in is the function f amplitude The associated sequence and the entry-by-entry mapping function μ amplitude (x) = ξ x and (That is, no ).

[0405] Assume π=[1 2 3], a1=0, a2=0, b1=0, b2=0, b3=0 and m=3, and the lexicographic order is used,

[0406]

[0407] Then, the corresponding sequence α can be calculated as in Table 11, since μamplitude (x) = ξ x and Therefore, the amplitude encoder scales Fig. 9 The sequence on the kth branch in .

[0408] k <![CDATA[x1]]> <![CDATA[x2]]> <![CDATA[x3]]> <![CDATA[f amplitude (x1,x2,…,x m )]]> s 0 0 0 0 0 1 0 0 1 0.6994 1.0000 2 0 1 0 0 3.0000 3 0 1 1 0.6994 1.0000 4 1 0 0 0 3.0000 5 1 0 1 0.6994 1.0000 6 1 1 0 0 3.0000 7 1 1 1 0.6994 1.0000

[0409] Table 11

[0410] Additional operations for sequence processing due to amplitude encoder 921 may include adding a to g k ,get

[0411]

[0412] where a k is a real number generated by the amplitude encoder.

[0413] Representative use case - NR-U interleaving design for NR-U

[0414] Fig.11 An example interleaving according to one embodiment is shown. Fig.11 The interweaving can be used Figure 8 The transmitter 800 is used to generate. Fig.11 The interleaving may also be generated using other transmitters. The interleaving may be applicable to NR-U operation. The interleaving may include 120 subcarriers of an OFDM symbol, which are subdivided into 10 clusters of 12 subcarriers each, with 9×12 subcarriers separating otherwise adjacent clusters.

[0415] The parameters listed in Table 12 or Table 13 may be used by transmitter 800 to generate the interlaces. Alternatively, transmitter 800 may use the parameters listed in Table 12 and Tables 4-13 to generate the interlaces (eg, to transmit more than 10 bits).

[0416] In an embodiment, the transmitter 800 can use the parameters listed in Table 12 to generate interleaving to place phase-rotated versions of multiple c and d within one RB (e.g., 12 subcarriers) adjacent to each other. The interleaving generated using the parameters listed in Table 12 can carry 10 bits. In one embodiment, bit group P and / or bit group C can be fixed to a specific value. For example, bit group P can be set to (0,0), and bit group C can carry 8 bits. Fixing bit group P and / or bit group C to a specific value can reduce receiver complexity.

[0417]

[0418] Table 12 - Example parameters for neighbor configuration for NR-U PUCCH

[0419] In an embodiment, transmitter 800 can use the parameters listed in Table 13 to generate interleaving, so that phase-rotated versions of multiple non-zero elements of c and d are placed in one RB (i.e., 12 subcarriers) in an interleaved manner. The interleaving generated using the parameters listed in Table 13 can carry 10 bits. In one embodiment, bit group P and / or bit group C can be fixed to a specific value. For example, bit group P can be set to (0,0), and bit group C can carry 8 bits. Fixing bit group P and / or bit group C to a specific value can reduce receiver complexity.

[0420]

[0421] Table 13 Example parameters for staggered configuration of NR-U PUCCH

[0422] Representative use case - URLLC waveform for uplink with 2 resource blocks

[0423] To achieve ultra-reliable and low-latency communications, frequency diversity can be exploited by using non-contiguous resource allocation. For example, 2 RBs separated by S=100 subcarriers can be assigned to a user equipment (UE) for uplink transmission (e.g., a small amount of information (e.g., UCI or data)). To increase the reliability of the transmission, interleaving can be generated. For example Fig.12 as shown in . Fig.12 The interweaving can be used Figure 8 The transmitter 800 is used to generate. Fig.12 The interleaving of may also be generated using other transmitters. The parameters listed in Table 14 may be used by transmitter 800 to generate interleaving for adjacent configurations. The parameters listed in Table 15 may be used by transmitter 800 to generate interleaving for staggered configurations.

[0424] In one embodiment, the transmitter 800 can generate interleaving using the parameters given in Table 4-14, which place phase-rotated versions of c and d adjacent to each other within one RB (i.e., 12 subcarriers). The interleaving generated using the parameters listed in Table 14 can carry 10 bits by using 2 RBs. In one embodiment, bit group P and / or bit group C can be fixed to a specific value. For example, bit group P can be set to (0,0), and bit group C can carry 8 bits. Fixing bit group P and / or bit group C to a specific value can reduce receiver complexity.

[0425]

[0426] Table 14 - Example parameters for neighbor configuration for URLLC

[0427] In an embodiment, transmitter 800 can use the parameters listed in Table 15 to generate interleaving to place phase-rotated versions of c and d in one RB (i.e., 12 subcarriers) in an interleaved manner. The interleaving generated using the parameters listed in Table 15 can carry 10 bits in one interleaving. In one embodiment, bit group P and / or bit group C can be fixed to a specific value. For example, bit group P can be set to (0,0), and bit group C can carry 8 bits. Fixing bit group P and / or bit group C to a specific value can reduce receiver complexity.

[0428]

[0429] Table 15 - Example parameters for interleaving configuration for URLLC

[0430] Representative use case - URLLC waveform with non-uniform resource allocation for uplink with 4 resource blocks

[0431] In another URLLC scenario, 4 RBs separated unevenly by parameters of S1=96 and S2=24 subcarriers may be assigned to the UE for uplink transmission (e.g., a small amount of information (e.g., UCI or data)). To increase the reliability of transmission, interleaving may be generated. For example Fig.13 as shown in . Fig.13 The interweaving can be used Figure 8 The transmitter 800 generates, Fig.13 The interleaving of may also be generated using other transmitters. The parameters listed in Table 16 may be used by transmitter 800 to generate interleaving for adjacent configurations within one RB. The parameters listed in Table 17 may be used by transmitter 800 to generate interleaving for adjacent configurations within one RB.

[0432] In an embodiment, transmitter 800 can use the parameters listed in Table 16 to generate interleaving to place phase-rotated versions of c and d within one RB (i.e., 12 subcarriers) adjacent to each other. The interleaving generated using the parameters listed in Table 16 can carry 14 bits by using 4 RBs. In one embodiment, bit group P and / or bit group C can be fixed to a specific value. For example, bit group P can be set to (0,0), and bit group C can carry 8 bits. Bit group P and / or bit group C are fixed to a specific value can reduce receiver complexity.

[0433]

[0434] Table 16 - Example parameters for neighbor configuration for URLLC

[0435] In an embodiment, the transmitter 800 can use the parameters listed in Table 17 to generate interleaving to place the phase-rotated versions of c and d in an interleaved manner within one RB (i.e., 12 subcarriers). The interleaving generated using the parameters listed in Table 17 can carry 14 bits by using 4 RBs. In an embodiment, bit group P and / or bit group C can be fixed. For example, bit group P can be set to (0,0), and bit group C can carry 8 bits. Fixing bit group P and / or bit group C to a specific value can reduce receiver complexity.

[0436]

[0437] Table 17 - Example parameters for interleaving configuration of URLLC

[0438] Representative use case - 2 resource blocks with 16-QAM and QPSK

[0439] In an embodiment, the transmitter 800 may use the parameters listed in Table 18 to generate interleaving to place the phase-rotated versions of c and d adjacent to each other within one RB (i.e., 12 subcarriers). The parameters listed in Table 18 may be used to generate resource allocations, such as Fig.14 As shown in . In an embodiment, bit group P, bit group AB and / or bit group C may be fixed to a specific value. For example, bit group P may be set to (0,0), and bit group AB and bit group C may carry 11 bits. Fixing bit group P, bit group AB and / or bit group C to a specific value may reduce receiver complexity.

[0440]

[0441]

[0442] Table 18 - Example parameters for neighbor configuration for URLLC

[0443] Fig.14 An interlace with 2 RBs generated using QPSK and 16-QAM is shown. Fig.14 The interweaving can be used Fig. 9 The transmitter 900 generates, Fig.14 The interleaving can also be generated using other transmitters.

[0444] In one embodiment, Fig.14 It can be explained that when m=4,π=(1,2,3),a k|k=2,3 =0,b k|k=1,2,3 =0,C k|k=0,1,2,3= 0, S = 60, an example of a mapped non-contiguous CS in the frequency domain of an OFDM transmitter with normalized QPSK and 16-QAM constellations. When a3 = 0, a non-contiguous CS with two clusters of length 12 separated by 60 subcarriers and the alphabet for the corresponding sequence is \ac{QPSK} constellation can be generated by the transmitter 900. If Then the transmitter 900 can generate non-contiguous CS with 16-QAM with the same resource allocation. The two corresponding OFDM signals achieve frequency diversity via two clusters well separated in frequency while maintaining a PAPR of 3dB.

[0445] The contents of the following are incorporated herein by reference: [1] Matthew G. Parker, Kenneth G. Paterson and Chintha Tellambura, "Golay Complementary Sequences", 2004; [2] B. M. Popovic, "Synthesis of power efficient multitone signals with flat amplitude spectrum," IEEE Transactions on Communications, vol. 39, no. 7, pp. 1031-1033, July 1991; [3] S. Z. Budisin, "Efficient Pulse Compressor for Golay Complementary Sequences", 1990; [4] W. H. Holzmann and H. Kharaghani, "A computer search for complex Golay sequences", 1994; [5] M. Golay, "Complementary series" in IRE Transactions on Information Theory, vol. 7, no. 2, pp. 82-87, April 1961; [6] R. Sivaswamy, "Multiphase Complementary Codes" in IEEE Transactions on Information Theory, vol. 24, no. 5, pp. 546-552, September 1978; [7] R. Turyn, "Hadamard matrices, Baumert-Hall units, four-symbol sequences, pulse compression, and surface wave encodings", J. Comb. Theory Ser. A, 16, pp. 313-333, 1974; [8] J. A. Davis and J.Jedwab, "Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes," in IEEE Transactions on Information Theory, vol. 45, no. 7, pp. 2397-2417, November 1999; [9] KG Paterson, "Generalized Reed-Muller codes and power control in OFDM modulation," in IEEE Transactions on Information Theory, vol. 46, no. 1, pp. 104-120, January 2000; and

[10] Alphan Sahin and Rui Yang, "A Generic Complementary Sequence Encoder," draft, 12 pages, September 3, 2018.

[0446] Representative methods

[0447] Figure 15-18 15 is a flow chart illustrating representative processes 1500 and 1800 according to various embodiments. Figure 15-18 The representative processes 1500-1800 of can be performed using a transmitter, or can be implemented in a transmitter, such as transmitter 700 ( Figure 7 )、Transmitter 800( Figure 8 )、Transmitter 900( Fig. 9 ) or any other transmitter comprising circuitry including a processor and a memory configured to perform representative processes 1500-1800.

[0448] refer to Fig.15 The transmitter may generate a coded CS based on a plurality of seed sequences, and the coded CS encodes each of a plurality of sets of information items as a different attribute of the coded CS (1502). Thereafter, the transmitter may transmit the coded CS via a block-based waveform (1520).

[0449] refer to Fig.16, the transmitter may generate (e.g., synthesize) a sequence ("synthesized sequence") using a plurality of seed sequences (1602). The transmitter may also use configuration parameters (e.g., d') to generate the synthesized sequence. The transmitter may encode the synthesized sequence using each set of information items and a function for encoding one of the different properties of the encoded CS (1604). The transmitter may apply a function to the encoded sequence (e.g., perform a sum of elements) (1618). The transmitter may transmit the resulting encoded CS via a block-based waveform (1620).

[0450] refer to Fig.17 , the transmitter may generate (e.g., synthesize) a synthesized sequence using a plurality of seed sequences (1702). The transmitter may also generate the synthesized sequence using a configuration parameter (e.g., d'). The transmitter may perform a first encoding of the synthesized sequence to generate a first coded sequence that encodes a first set of a plurality of information items as a first attribute of a plurality of different attributes of an encoded CS (1706). For example, the transmitter may perform sequential encoding of the synthesized sequence at least in part by concatenating elements of the synthesized sequence based on the first set of a plurality of information items.

[0451] The transmitter may perform a second encoding on the first coded sequence to generate a second coded sequence that encodes a second set of the plurality of information items as a second attribute of the different attributes 1708. For example, the transmitter may perform phase encoding on the first coded sequence at least in part by phase rotating elements of the first coded sequence based on the second set of the plurality of information items.

[0452] The transmitter may perform a third encoding of the second coded sequence to generate a third coded sequence that encodes a third set of the plurality of information items as a third attribute among the different attributes (1710). For example, the transmitter may perform shift encoding of the second coded sequence at least in part by shifting (e.g., padding with zeros) elements of the second coded sequence based on the third set of the plurality of information items and a resource allocation.

[0453] The transmitter may apply a function to the coded sequence (eg, perform a sum of the elements) (1718). The transmitter may transmit the resulting coded CS via a block-based waveform (1720).

[0454] refer to Fig.18, the transmitter may generate (e.g., synthesize) a synthesized sequence using a plurality of seed sequences (1802). The transmitter may also generate the synthesized sequence using a configuration parameter (e.g., d'). The transmitter may perform a first encoding of the synthesized sequence to generate a first encoded sequence that encodes a first set of a plurality of information items as a first attribute of a plurality of different attributes of an encoded CS (1806). For example, the transmitter may perform sequential encoding of a sequence at least in part by concatenating elements of the sequence based on the first set of the plurality of information items.

[0455] The transmitter may perform a second encoding of the first coded sequence to generate a second coded sequence that encodes a second set of the plurality of information items as a second attribute of the different attributes (1809). For example, the transmitter may perform amplitude encoding of the first coded sequence at least in part by adjusting at least one amplitude of at least one element of the first coded sequence based on the second set of the plurality of information items.

[0456] The transmitter may perform a third encoding of the second coded sequence to generate a third coded sequence that encodes a third set of the plurality of information items as a third attribute among the different attributes (1810). For example, the transmitter may perform phase encoding of the first coded sequence at least in part by phase rotating elements of the first coded sequence based on the second set of the plurality of information items.

[0457] The transmitter may perform a fourth encoding of the third coded sequence to generate a fourth coded sequence that encodes a fourth set of the plurality of information items as a third attribute among the different attributes (1810). For example, the transmitter may perform shift encoding of the second coded sequence at least in part by shifting (e.g., padding with zeros) elements of the second coded sequence based on the third set of the plurality of information items and a resource allocation.

[0458] The transmitter may apply a function to the coded sequence (eg, perform a sum of the elements) (1818). The transmitter may transmit the resulting coded CS via a block-based waveform (1820).

[0459] In various embodiments, such as in the embodiments in conjunction with representative processes 1500 and 1800, each of the plurality of seed sequences may have fewer elements than the generated encoded CS. In various embodiments, such as in the embodiments associated with representative process 1700, each of the plurality of seed sequences may have fewer elements than any of the sequence, the first encoded sequence, the second encoded sequence, and the third encoded sequence. In various embodiments, the first encoded sequence may have fewer (or more) elements than the second encoded sequence. In various embodiments, the second encoded sequence may have fewer (or more) elements than the third encoded sequence. In various embodiments, the first encoded sequence may have fewer (or more) elements than the third encoded sequence.

[0460] In various embodiments, such as those associated with representative process 1800, each of the plurality of seed sequences may have fewer elements than the sequence, the first coding sequence, the second coding sequence, the third coding sequence, and the fourth coding sequence. In various embodiments, the first coding sequence may have fewer (or more) elements than the second coding sequence. In various embodiments, the second coding sequence may have fewer (or more) elements than the third coding sequence. In various embodiments, the third coding sequence may have fewer (or more) elements than the fourth coding sequence. In various embodiments, the first coding sequence may have fewer (or more) elements than the third or fourth coding sequence. In various embodiments, the second coding sequence may have fewer (or more) elements than the fourth coding sequence. In various embodiments, a subsequent coding sequence may have fewer (or more) elements than its (e.g., immediately preceding) coding sequence.

[0461] In various embodiments, such as those in conjunction with representative processes 1500 and 1800, the elements of the coding complementary sequence may include a plurality of non-zero valued elements and zero or more zero valued elements. In various embodiments, such as those associated with representative methods 1500-1800, each seed sequence may be a complementary sequence pair. In various embodiments, such as those associated with representative methods 1500 and 1800, the different attributes may be any of the following: (i) the juxtaposition of the elements of the coding complementary sequence; (ii) the phase of the elements of the coding complementary sequence; (iii) the amount of null valued elements of the coding complementary sequence; and (iv) the amplitude of the elements of the coding complementary sequence.

[0462] In various embodiments, such as those related to representative method 1700, any of the plurality of seed sequences, the sequence, the first encoding sequence, the second encoding sequence, and the third encoding sequence may be complementary sequences. In various embodiments, such as those related to representative procedure 1800, any of the plurality of seed sequences, the [synthesized] sequence, the first encoding sequence, the second encoding sequence, the third encoding sequence, and the fourth encoding sequence may be complementary sequences.

[0463] In various embodiments, such as those described in conjunction with representative process 1700, any of the first set of the plurality of information items, the second set of the plurality of information items, and the third set of the plurality of information items may be a set of fixed values. In various embodiments, such as those described in conjunction with representative process 1800, any of the first set of the plurality of information items, the second set of the plurality of information items, the third set of the plurality of information items, and the fourth set of the plurality of information items may be a set of fixed values.

[0464] In various embodiments, such as those in conjunction with representative processes 1700.1800, the plurality of information items may be any of a plurality of information bits and a plurality of coded information bits. In various embodiments, such as those in conjunction with representative process 1700, the first set of the plurality of information items may be any of a set of information bits and a set of coded information bits. In various embodiments, such as those in conjunction with representative processes 1700-1800, the second set of the plurality of information items may be any of a set of information bits and a set of coded information bits. In various embodiments, such as those in conjunction with representative processes 1700-1800, the third set of the plurality of information items may be any of a set of information bits and a set of coded information bits. In various embodiments, such as those in conjunction with representative process 1800, the fourth set of the plurality of information items may be any of a set of information bits and a set of coded information bits.

[0465] In various embodiments, such as those in conjunction with representative process 1700, any of the first set of the plurality of information items, the second set of the plurality of information items, and the third set of the plurality of information items may be a separate set of information items from the plurality of information items. In various embodiments, such as those in conjunction with representative process 1800, any of the first set of the plurality of information items, the second set of the plurality of information items, the third set of the plurality of information items, and the fourth set of the plurality of information items may be a separate set of information items from the plurality of information items.

[0466] In various embodiments, such as those in conjunction with representative processes 1500-1800, the encoded CS limits the PAPR of the resulting OFDM signal to a low level (eg, 3 dB).

[0467] in conclusion

[0468] Although the features and elements are described above in specific combinations, one of ordinary skill in the art will recognize that each feature or element may be used alone or in any combination with the other features and elements. In addition, the methods described herein may be implemented in a computer program, software, or firmware incorporated into a computer-readable medium for execution by a computer or processor. Examples of non-transitory computer-readable media include, but are not limited to, read-only memory (ROM), random access memory (RAM), registers, buffer memory, semiconductor storage devices, magnetic media (e.g., internal hard disks and removable disks), magneto-optical media, and optical media (e.g., CD-ROM disks and digital versatile disks (DVDs)). A processor associated with the software may be used to implement a radio frequency transceiver for use in a WTRU 102, UE, terminal, base station, RNC, or any computer host.

[0469] In addition, in the above embodiments, processing platforms, computing systems, controllers, and other devices (including constraint servers and assembly points / servers containing processors) are mentioned. These devices may include at least one central processing unit ("CPU") and memory. According to the practice of technicians in the field of computer programming, references to behaviors or symbolic representations of operations or instructions may be performed by different CPUs and memories. Such behaviors and operations or instructions may be referred to as "running", "computer running", or "CPU running".

[0470] Those of ordinary skill in the art will appreciate that actions and symbolically represented operations or instructions include manipulation of electronic signals by a CPU. The electronic system represents data bits that may cause electronic signals to be transformed or reduced thereby, and stores the data bits in memory locations in a memory system, thereby reconfiguring or otherwise altering the data bits for CPU operations and other signal processing. The memory locations that hold data bits are physical locations that have specific electrical, magnetic, optical, or organic properties that correspond to or represent the data bits. It should be understood that the representative embodiments herein are not limited to the above-mentioned platforms or CPUs, and other platforms and CPUs may also support the provided methods.

[0471] The data bits may also be stored on a computer-readable medium, including a magnetic disk, an optical disk, or any other volatile (e.g., random access memory ("RAM")) or non-volatile (e.g., read-only memory ("ROM")) mass storage system that can be read by the CPU. The computer-readable medium may include cooperating or interconnected computer-readable media that may exist alone on a processing system or distributed among multiple interconnected processing systems that are local or remote to the processing system. It should be understood that these representative embodiments are not limited to the above-mentioned memories, and other platforms and memories may also support the described methods.

[0472] In an illustrative embodiment, any operations, processes, etc. described herein may be implemented as computer-readable instructions stored on a computer-readable medium. The computer-readable instructions may be executed by a processor of a mobile unit, a network component, and / or any other computing device.

[0473] There is almost no difference between hardware and software embodiments of various aspects of the system. Whether to use hardware or software is usually (but not always, because in some contexts, the choice between hardware and software may be important) a design choice that represents a compromise between cost and efficiency. The processes and / or systems and / or other techniques described herein can be implemented by various carriers (e.g., hardware, software, and / or firmware), and the preferred carrier can change with the context in which the processes and / or systems and / or other techniques are deployed. For example, if the implementation determines that speed and accuracy are primary, then the implementer may tend to use primarily hardware and / or firmware carriers. If flexibility is primary, then the implementer may tend to use primarily software embodiments. Alternatively, the implementer may choose some combination of hardware, software, and / or firmware.

[0474] The above specific embodiments have been described in detail with reference to different embodiments of the device and / or process using block diagrams, flow charts and / or examples. Just as such block diagrams, flow charts and / or examples contain one or more functions and / or operations, those skilled in the art will understand that each function and / or operation within such block diagrams, flow charts or examples can be implemented individually and / or collectively by a wide range of hardware, software, firmware or nearly any combination thereof. As an example, suitable processors include general-purpose processors, special-purpose processors, conventional processors, digital signal processors (DSPs), multiple microprocessors, one or more microprocessors associated with a DSP core, controllers, microcontrollers, application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), field-programmable gate arrays (FPGAs) circuits, any other type of integrated circuits (ICs), and / or state machines.

[0475] The present disclosure is not limited according to the embodiments described in the present application, wherein the purpose of the embodiments is to illustrate different aspects. Those skilled in the art will appreciate that numerous modifications and variations are feasible without departing from the essence and scope. Unless provided in an explicit manner, the elements, behaviors or instructions used in the specification of the present application should not be interpreted as being essential to the present invention. In addition to the methods and devices enumerated here, those skilled in the art can clearly understand from the above description that the functionally equivalent methods and devices within the scope of the present disclosure. Such modifications and variations should all fall within the scope of the appended claims. The present disclosure is limited only in accordance with the appended claims and the complete equivalent range of such claims. It should be understood that the present disclosure is not limited to a specific method or system.

[0476] It should also be understood that the terminology used herein is used only to describe specific embodiments and is not intended to be limiting. When referred to herein, the term "station" and its abbreviation "STA", "user equipment" and its abbreviation "UE" may refer to (i) a wireless transmit and / or receive unit (WTRU) as described below; (ii) any of the multiple embodiments of the WTRU described below; (iii) a device with wireless capabilities and / or wired capabilities (e.g., connectable), in particular, the device is configured with some or all of the structures and functions of the WTRU described above; (iii) a device with wireless capabilities and / or wired capabilities configured with relatively less structures and functions than all of the structures and functions of the WTRU described above; or (iv) a similar device. Details of an exemplary WTRU that can represent any WTRU described herein are provided below in conjunction with Figure 1.

[0477] In certain representative embodiments, several portions of the subject matter described herein may be implemented with the aid of an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), and / or other integrated formats. However, those skilled in the art will recognize that some aspects of the embodiments disclosed herein may be implemented in whole or in part in an integrated circuit in an equivalent manner, as one or more computer programs running on one or more computers (e.g., as one or more programs running on one or more computer systems), as one or more programs running on one or more processors (e.g., as one or more programs running on one or more microprocessors), as firmware, or as nearly any combination thereof, and that circuit design and / or code writing for software and / or firmware are also within the technical scope of those skilled in the art in accordance with the present disclosure. In addition, those skilled in the art will appreciate that the mechanisms of the subject matter described herein may be distributed in various forms as a program product, and that the illustrative embodiments of the subject matter described herein are applicable regardless of the particular type of signal-bearing medium used to actually perform the distribution. Examples of signal bearing media include, but are not limited to, the following: recordable media, such as floppy disks, hard drives, CDs, DVDs, digital tapes, computer memory, etc., and transmission-type media, such as digital and / or analog communication media (e.g., optical cables, waveguides, wired communication links, wireless communication links, etc.).

[0478] The subject matter described here sometimes shows different components contained in or connected to other different components.It should be understood that the architecture described in this way is only some examples, and other numerous architectures for implementing the same function are actually all implementable.Conceptually, any arrangement of the components that realize the same function is effectively "associated", so that the desired function can be realized.Therefore, any two components that are combined here to realize a specific function can be considered to be "associated" with each other, so that the desired function will be realized, without considering architecture or intermediate components.Similarly, any two components associated in this way can also be considered to be "operably connected" or "operably coupled" to each other, so as to realize the desired function, and any two components that can be associated in this way can also be considered to be "operably coupled" to each other, so as to realize the desired function.About the specific example that can be operably coupled, include but are not limited to components that can be physically paired and / or physically interacted and / or components that can be wirelessly interacted and / or wirelessly interacted and / or components that can be logically interacted and / or components that can be logically interacted.

[0479] As for the use of substantially any plural and / or singular terms herein, those skilled in the art may appropriately convert from the plural to the singular and / or from the singular to the plural, depending on the context and / or application. For clarity, various singular / plural arrangements may be explicitly set forth herein.

[0480] Those skilled in the art will understand that, in general, terms used herein, and particularly in the appended claims (e.g., the bodies of the appended claims), should generally be treated as "open" terms (for example, the term "including" should be interpreted as "including but not limited to," the term "having" should be interpreted as "having at least," the term "comprising" should be interpreted as "including but not limited to," etc.). Those skilled in the art will further understand that if an introduced claim recitation is directed to a specific quantity, such intent should be expressly recited in the claim, and if such recitation is absent, such intent is absent. For example, if only one item is intended, the term "single" or similar language may be used. As an aid to understanding, subsequent appended claims and / or the description herein may include the use of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be construed as a way of introducing claim recitations by the indefinite article "a" or "an" to limit any particular claim containing claim recitations introduced in this manner to embodiments containing only one such recitation, even if the same claim contains the introductory phrases "one or more" or "at least one" and an indefinite article such as "a" or "an" (e.g., "a" and / or "an" should be construed to mean "at least one" or "one or more"). The same is true for the use of definite articles to introduce claim recitations. Furthermore, even if a specific number of claim recitations introduced is explicitly recited, one skilled in the art will recognize that such recitation should be construed to refer to at least the recited number (e.g., an unmodified recitation of "two recitations" without other modifiers means at least two recitations or two or more recitations).

[0481] Furthermore, in these examples, if a convention similar to "at least one of A, B, and C, etc." is used, such a structure should generally have the meaning of the convention understood by those skilled in the art (e.g., "a system having at least one of A, B, and C" would include but not be limited to systems having only A, only B, only C, A and B, A and C, B and C, and / or A, B, and C, etc.). In examples where a convention similar to "at least one of A, B, or C, etc." is used, such a structure should generally have the meaning of the convention understood by those skilled in the art (e.g., "a system having at least one of A, B, or C" would include but not be limited to systems having only A, only B, only C, A and B, A and C, B and C, and / or A, B, and C, etc.). Those skilled in the art will further understand that almost any disjunctive word and / or phrase that proposes two or more alternatives, whether in the specification, claims, or drawings, should be understood to contemplate the possibility of including one, any, or both of these items. For example, the phrase "A or B" will be understood to include the possibilities of "A" or "B" or "A and B." In addition, the term "any" as used herein followed by a list of multiple items and / or multiple categories of items is intended to include "any," "any combination," "any plurality," and / or "any combination of plurality" of the items and / or categories of items, alone or in combination with other items and / or other categories of items. In addition, the terms "set" or "group" as used herein shall include any number of items, including zero. In addition, the term "number" as used herein is intended to include any number, including zero.

[0482] In addition, where features or aspects of the disclosure are described in terms of Markush groups, those skilled in the art will recognize that the disclosure is thereby described in terms of any individual member or subgroup of members of the Markush group.

[0483] Those skilled in the art will appreciate that, for any and all purposes (e.g., in providing a written description), all ranges disclosed herein also include any and all possible sub-ranges and combinations of sub-ranges thereof. Any range listed can be easily considered to fully describe and enable the same range to be decomposed into at least two equal parts, three equal parts, four equal parts, five equal parts, ten equal parts, etc. As a non-limiting example, each range discussed herein can be easily decomposed into a lower third, a middle third, and an upper third range. Those skilled in the art will appreciate that all languages ​​such as "at most", "at least", "greater than", "less than", etc. include the narrated numbers and refer to ranges that can be subsequently decomposed into sub-ranges as described above. Finally, as those skilled in the art understand, a range includes each individual member. Thus, for example, a group having 1-3 cells refers to a group having 1, 2, or 3 cells. Similarly, a group having 1-5 cells refers to a group having 1, 2, 3, 4, or 5 cells, and so on.

[0484] A processor in association with software may be used to implement a radio frequency transceiver for use in a wireless transmit receive unit (WTRU), user equipment (UE), terminal, base station, mobility management entity (MME) or evolved packet core (EPC) or any host computer. The WTRU may be used in conjunction with modules implemented in hardware and / or software, including software defined radios (SDRs) and other components such as cameras, video camera modules, video phones, speaker amplifiers, vibration devices, speakers, microphones, television transceivers, hands-free headsets, keyboards, module, a frequency modulation (FM) radio unit, a near field communication (NFC) module, a liquid crystal display (LCD) display unit, an organic light emitting diode (OLED) display unit, a digital music player, a media player, a video game console module, an Internet browser and / or any wireless local area network (WLAN) or ultra-wideband (UWB) module.

[0485] Although the present invention has been described in terms of a communication system, it is contemplated that the system may be implemented in software on a microprocessor / general purpose computer (not shown). In some embodiments, one or more of the functions of the various components may be implemented in software controlling a general purpose computer.

[0486] Furthermore, while the invention has been shown and described herein with reference to specific embodiments, the invention is not limited to the details shown. Rather, various modifications may be made to the details within the range of equivalents of the claims and without departing from the invention.

[0487] Throughout the disclosure, those skilled in the art will appreciate that certain representative embodiments may be used instead of or in combination with other representative embodiments.

[0488] Furthermore, the claims should not be construed as limited to the described order or elements unless otherwise indicated. In addition, the term "means for..." used in any claim is intended to invoke 35 U.S.C. § 112, 6 or means a “means-plus-function” claim format, and any claim without the word “means” shall not have this meaning.

Claims

1. A method implemented in a transmitter, the method comprising: Based on the plurality of seed sequences and the first, second and third coding sequences, a coding complementary sequence is generated, wherein: Each of the plurality of seed sequences is a complementary sequence; a first set of a plurality of information items being encoded as a sequence of elements of said first encoding sequence; The second set of the plurality of information items is encoded as phases of elements of the second coded sequence; and A third set of said plurality of information items is encoded as a non-zero number of null-valued elements of said third encoding sequence; and The coded complementary sequence is transmitted via a block-based waveform.

2. The method of claim 1, wherein generating the coding complementary sequence comprises: Using the plurality of seed sequences, generating a sequence; encoding the sequence at least in part by ordering elements of the sequence based on the first set of the plurality of information items to form the first encoded sequence; encoding the first coded sequence at least in part by phase rotating elements of the first coded sequence based on the second set of the plurality of information items to form the second coded sequence; encoding the second coded sequence at least in part by shifting elements of the second coded sequence based on the third set of the plurality of information items and a resource allocation to form the third coded sequence; as well as A summation of the elements of the third encoded sequence is performed.

3. The method of claim 1 , wherein generating the coded complementary sequence is further based on a fourth coded sequence, wherein the fourth set of information items is encoded as amplitudes of the fourth coded sequence, and wherein generating the coded complementary sequence comprises: Using the plurality of seed sequences, generating a sequence; encoding the sequence at least in part by ordering elements of the sequence based on the first set of the plurality of information items to form the first encoded sequence; encoding the first coded sequence at least in part by adjusting at least one amplitude of at least one element of the first coded sequence based on the fourth set of the plurality of information items to form the fourth coded sequence; encoding the fourth coded sequence at least in part by phase rotating elements of the fourth coded sequence based on the second set of the plurality of information items to form the second coded sequence; encoding the second coded sequence at least in part by shifting elements of the second coded sequence based on the third set of the plurality of information items and a resource allocation to form the third coded sequence; as well as A summation of the elements of the third encoded sequence is performed.

4. The method of claim 2, wherein each of the plurality of seed sequences has fewer elements than any of the sequence, the first encoding sequence, the second encoding sequence, the third encoding sequence, and the encoding-complement sequence.

5. The method of claim 3, wherein each of the plurality of seed sequences has fewer elements than any of the sequence, the first encoding sequence, the second encoding sequence, the third encoding sequence, the fourth encoding sequence, and the encoding-complement sequence. The method of claim 2 , wherein any of the first coding sequence, the second coding sequence, and the third coding sequence are complementary sequences.

7. The method of claim 3, wherein any of the first coding sequence, the second coding sequence, the third coding sequence, and the fourth coding sequence are complementary sequences.

8. The method according to any one of claims 1 to 7, wherein: The elements of the code-complementary sequence include a plurality of non-zero-valued elements and zero or more zero-valued elements.

9. The method according to any one of claims 1 to 7, wherein: The plurality of seed sequences include a first complementary sequence, a second complementary sequence, a third complementary sequence, and a fourth complementary sequence, wherein the first and second complementary sequences are a first pair of complementary sequences, and wherein the third and fourth complementary sequences are a second pair of complementary sequences.

10. The method according to any one of claims 1 to 7, wherein: Generating the coding complementary sequence further comprises: generating the coding complementary sequence based on non-continuous resource allocation, and wherein the elements of the coding complementary sequence comprise at least one zero-valued or null-valued element, and the at least one zero-valued or null-valued element is generated from generating the coding complementary sequence based on the non-continuous resource allocation.

11. A wireless transmit / receive unit WTRU, the WTRU comprising a circuit, the circuit comprising a transmitter, a receiver, a processor and a memory, the WTRU being configured to: Based on the plurality of seed sequences and the first, second and third coding sequences, a coding complementary sequence is generated, wherein: Each of the plurality of seed sequences is a complementary sequence; a first set of a plurality of information items being encoded as a sequence of elements of said first encoding sequence; The second set of the plurality of information items is encoded as phases of elements of the second coded sequence; as well as A third set of the plurality of information items is encoded as a non-zero number of null-valued elements of the third encoding sequence; as well as The coded complementary sequence is transmitted via a block-based waveform.

12. The WTRU of claim 11 , wherein the circuitry configured to generate a code-complement sequence comprises the circuitry configured to: Using the plurality of seed sequences, generating a sequence; encoding the sequence at least in part by ordering elements of the sequence based on the first set of the plurality of information items to form the first encoded sequence; encoding the first coded sequence at least in part by phase rotating elements of the first coded sequence based on the second set of the plurality of information items to form the second coded sequence; encoding the second coded sequence at least in part by shifting elements of the second coded sequence based on the third set of the plurality of information items and a resource allocation to form the third coded sequence; as well as A summation of the elements of the third encoded sequence is performed.

13. The WTRU of claim 11 , wherein the circuitry configured to generate a code complementary sequence comprises the circuitry configured to: (i) generate the code complementary sequence based on a plurality of seed sequences and first, second, third, and fourth code sequences, wherein the fourth set of information items is encoded as amplitudes of the fourth code sequence, (ii): Using the plurality of seed sequences, generating a sequence; encoding the sequence at least in part by ordering elements of the sequence based on the first set of the plurality of information items to form the first encoded sequence; encoding the first coded sequence at least in part by adjusting at least one amplitude of at least one element of the first coded sequence based on the fourth set of the plurality of information items to form the fourth coded sequence; encoding the fourth coded sequence at least in part by phase rotating elements of the fourth coded sequence based on the second set of the plurality of information items to form the second coded sequence; encoding the second coded sequence at least in part by shifting elements of the second coded sequence based on the third set of the plurality of information items and a resource allocation to form the third coded sequence; as well as A summation of the elements of the third encoded sequence is performed.

14. The WTRU of claim 12, wherein each of the plurality of seed sequences has fewer elements than any of the sequence, the first coding sequence, the second coding sequence, the third coding sequence, and the coding complement sequence.

15. The WTRU of claim 13, wherein each of the plurality of seed sequences has fewer elements than any of the sequence, the first coding sequence, the second coding sequence, the third coding sequence, the fourth coding sequence, and the coding complement sequence.

16. The WTRU of claim 12, wherein any of the first coding sequence, the second coding sequence, and the third coding sequence are complementary sequences.

17. The WTRU of claim 13, wherein any of the first coding sequence, the second coding sequence, the third coding sequence, and the fourth coding sequence are complementary sequences.

18. The WTRU of any one of claims 11-17, wherein the elements of the code complementary sequence include a plurality of non-zero valued elements and zero or more null valued elements.

19. The WTRU of any one of claims 11-17, wherein each seed sequence is a complementary sequence pair.

20. The WTRU of any one of claims 11-17, wherein: The circuit being configured to generate a coded complementary sequence comprises: the circuit being configured to generate the coded complementary sequence based on non-contiguous resource allocation, and wherein the elements of the coded complementary sequence include at least one zero-valued or null-valued element, and the at least one zero-valued or null-valued element is generated from generating the coded complementary sequence based on the non-contiguous resource allocation.