Non-orthogonal multiple access

Information

  • Patent Grant
  • 11115160
  • Patent Number
    11,115,160
  • Date Filed
    Friday, May 22, 2020
    3 years ago
  • Date Issued
    Tuesday, September 7, 2021
    2 years ago
Abstract
Systems, methods, and apparatuses for analyzing and synthesizing wireless communication signals are provided. A receiver might transform a received signal into a basis in which the transformed signal is sparse, which can reduce the complexity of joint detection by facilitating message passing algorithm (MPA) decoding. A transmitter might employ dense codewords in a first basis, which may facilitate certain signal-processing operations and may provide a transmission with a low peak-to-average-power ratio. The codewords can be designed to be sparse when transformed to a second basis. The codewords may be configured for non-orthogonal multiple access.
Description
BACKGROUND

Aspects of this disclosure relate generally to communication systems, and more particularly, to transmission and reception in fifth generation (5G) and beyond cellular networks.


The background description includes information that may be useful in understanding the present inventive subject matter. It is not an admission that any of the information provided herein is prior art or relevant to the presently claimed inventive subject matter, or that any publication, specifically or implicitly referenced, is prior art.


Wireless communication systems provide various telecommunication services, such as telephony, video, data, messaging, and broadcasts. Wireless communication systems may employ multiple-access technologies capable of supporting communication with multiple users by sharing available system resources (e.g., time, frequency, power). Examples of multiple-access technologies include code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal frequency division multiple access (OFDMA), single-carrier frequency divisional multiplexing (SC-FDM), and discrete Fourier transform spread orthogonal division multiplexing (DFT-s-OFDM). It should be understood that SC-FDM and DFT-s-OFDM are two names of essentially similar technologies, known as Carrier Interferometry (CI). However, DFT-s-OFDM is the terminology used in 3GPP specifications.


These multiple access technologies have been adopted in various telecommunication and wireless network standards. For example, 5G (also called New Radio (NR)) wireless access is being developed with three broad use case families in mind: enhanced mobile broadband (eMBB), massive or enhanced machine-type communications (MTC), and ultra-reliable low-latency communications (URLLC). Beyond 5G refers to visions for future generations of wireless communications (e.g., SG-Advanced, SG-Extended, 6G) that enable groundbreaking high-bandwidth, low-latency, massive capacity, and massive connectivity. As demand for telecommunication and wireless access continues to increase, improvements in NR communications technology and beyond may be desired.


SUMMARY

The following presents a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated aspects, and is intended to neither identify key or critical elements of all aspects nor delineate the scope of any or all aspects.


5G's use cases for various services and emerging applications include enhanced Mobile Broadband (eMBB), which requires high data rate and mobility, massive Machine Type Communication (mMTC), supporting massive connection, and Ultra Reliable Low latency Communication (URLLC). 5G candidate waveforms include orthogonal frequency division multiplexing (OFDM), SC-FDM, Zero-tail SC-FDM, SC-FDM+WOLA, filter bank multi-carrier (FBMC), and generalized frequency division multiplexing (GFDM). Multicarrier spread spectrum transmission methods often employ a linear transform to spread energy of transmitted symbols over the subcarriers.


Disclosed aspects can be configured for non-orthogonal multiple access (NOMA) techniques, including power-domain techniques, such as super-position coding NOMA (SPC-NOMA), code-domain techniques, such as sparse code multiple access (SCMA) or pattern domain multiple access (PDMA), inter-leaver techniques, such as interleave division multiple access (IDMA), resource spread multiple access (RSMA), or multi-user shared access (MUSA).


PDMA relies on mapping the users' data that are to be transmitted into a group of resource elements (REs) according to a defined pattern. An RE might have a power, code, time, and/or spectral dimension. The transmission order is defined as the number of mapped resources. NOMA is provided when multiple users are multiplexed on the same resource.


Various modulation types and combinations may be performed. Phase-shift key (PSK), quadrature PSK (QPSK), pulse-amplitude modulation (PAM), frequency-shift key (FSK), quadrature amplitude modulation (QAM), and offset-QAM (OQAM) are some examples. Index modulation (IM) schemes may be used to map information bits by altering the on/off status of their transmission entities, such as REs, transmit antennas, subcarriers, radio frequency (RF) mirrors, transmit light emitting diodes (LEDs), relays, modulation types, time slots, precoder matrices, dispersion matrices, spreading codes, signal powers, loads, routing paths, and so on. IM can activate a subset of the transmission entities to carry data bits via both M-ary complex data symbols and active transmission-entity indices.


SCMA modulation maps input data bits to a multi-dimensional codeword chosen from a layer-specific SCMA codebook. SCMA codewords are sparse, wherein only a few of their entries are non-zero and the rest are zero. The SCMA codewords corresponding to an SCMA layer have a unique location of non-zero entries, referred to as a sparsity pattern. The sparse codewords are then mapped onto resources, such as REs. For example, in SCMA-OFDM, codewords are mapped to input frequency bins of an IFFT, where only the non-zero values activate the IFFT. The discrete-time OFDM signal has a frequency-domain (e.g., OFDM) sparsity pattern based on the non-zero activations of the IFFT. However, this typically results in the discrete-time OFDM signal having a high peak-to-average-power ratio (PAPR).


In one aspect, at least one direct-sequence spreading code modulates a plurality of waveforms (e.g., a block, or sequence of pulses) to produce a discrete-time transmission signal. Each waveform may have its physical parameters (e.g., period, number of periods, pulse width, pulse shape, roll-off factor, sample rate, and so on) configured to provide certain time/frequency signal attributes (e.g., 5G NR numerology, OFDM symbol length, number of physical resource blocks, number of subcarriers, number of slots per subframe, slot length, PAPR, subcarrier bandwidth, subcarrier spacing, subcarrier pulse-shaping, total bandwidth, duty cycle, roll-off, out-of-band (OOB) leakage, cyclic prefix and/or suffix length, and so on) for a multicarrier signal. The spreading code may be designed to provide the discrete-time transmission signal with a particular frequency-domain sparsity pattern, and may be configured to provide this signal with a low PAPR. The code might be adapted to change the frequency-domain sparsity pattern without substantially affecting the PAPR. Unlike SCMA codewords, the direct-sequence code may be dense (although the direct-sequence code may be constructed by combining sparse codes), but it can provide the discrete-time signal with characteristics of a frequency-sparse multicarrier signal. The direct-sequence code may be configured to have a low PAPR (e.g., relative to other codewords), which usually provides the discrete-time signal with low PAPR. Codebook design may comprise selecting a direct-sequence codeword set with low PAPR (e.g., relative to SCMA codes), and then constellation adjustments of users colliding in a resource may be jointly designed via adaptations to the direct-sequence codes to keep the PAPR low.


For example, following a spreader that spreads data symbols with direct-sequence codes, a pulse-shaping filter might shape the spread symbols (or the spread symbols or codes may be modulated onto the pulse waveforms) to produce a discrete-time signal. The pulse-shaping filter may be a Dirichlet pulse-shaping filter that configures waveform parameters (e.g., pulse width, waveform duration, pulse shape) to produce an OFDM signal having a specified numerology and possibly other features. An OFDM sparsity pattern can be selected or adapted by selecting or adapting the direct-sequence spreading codes instead of selecting or adapting SCMA codebooks or the input mapping to the IFFT. In aspects disclosed herein, at least one direct-sequence code may be adjusted to effect a change in at least one of the discrete-time signal's frequency-domain properties. Such adjustments can exploit DFT or DTFT properties, such as linearity, time shifting (e.g., circular time shift or circular shift), frequency shifting, circular convolution, multiplication, differencing in time, time scaling, accumulation, decimation, interpolation, circular correlation, Parseval's relation, and so on.


SCMA modulation is a bits-to-symbols mapping that maps a set of data bits to multiple symbols in a sparse codeword, and thus provides for low-density spreading of the data when the symbols are modulated onto PEs. In some examples, dense direct-sequence codes are configured to effectively produce low-density spreading in the frequency domain. Direct-sequence spreading (or encoding) multiplies each data symbol by a direct-sequence code to produce a block or sequence of spread (or coded) data symbols such that information about each data symbol resides in multiple spread data symbols. Encoding can include or be referred to as spreading. The direct-sequence code (or a mathematical operation based on the code) may be used to reconstruct the original data at the receiving end. This is despreading or decoding. Decoding can include or be referred to as despreading. In some aspects, despreading comprises a correlation of the received spread data symbols with the direct-sequence code that the receiver already knows the transmitter is using. Spreading may comprise one or more linear transform operations (e.g., invertible transforms), and despreading can comprise the inverse operation(s). If spreading employs an orthogonal spreading matrix, despreading can employ the transpose of the spreading matrix. If the spreading matrix is unitary, despreading can employ the Hermitian adjoint (conjugate transpose) of the spreading matrix. Disclosed aspects may employ rectangular matrices (i.e., spreading matrices that are not square), such as matrices with orthonormal rows/columns, and the corresponding mathematics may be suitably adapted. For a spreading matrix that is not invertible, despreading may employ a generalized inverse of the spreading matrix. The Penrose conditions define different generalized matrix inverses. Depending on these conditions, despreading may employ the reflexive generalized inverse or the pseudoinverse of the spreading matrix. Despreading may employ other kinds of generalized inverses, such as one-sided inverse (left inverse or right inverse), Bott-Duffin inverse, or Drazin inverse.


Sparsity pattern describes the locations of non-zero values in a set of values in which the number of non-zero values is generally less than the number of zero values. A sparsity pattern can be the pattern of non-zero values in a sparse matrix (e.g., a sparse vector). A sparse matrix is typically defined as a matrix in which half or more of its values are zero. A frequency-domain sparsity pattern describes a sparse pattern of non-zero values in the spectrum of a discrete-time signal. For example, an OFDM sparsity pattern describes a pattern of non-zero discrete frequency values (such as OFDM subcarriers) in the spectrum of the discrete-time OFDM signal. A sparse vector may represent the OFDM sparsity pattern.


In general, a codebook may define layers that provide symbols to be transmitted via orthogonal resources. OFDM subcarriers are just one example of orthogonal resources that could be used. Orthogonal resources can be created by various means, such as in the frequency domain, the time domain, the code domain, the spatial domain, or others. For purposes of illustration, the examples that follow may simply refer to transmission via OFDM subcarriers. It should be appreciated that the teachings herein may be applicable to transmission via other resources as well. Non-orthogonal or quasi-orthogonal resources might be used in some applications.


In some aspects, a codebook uniquely maps each set of input bits to at least one direct-sequence codeword. Although the direct-sequence codeword might be dense, it can be configured to have an OFDM sparsity pattern characterized by a certain plurality of active subcarriers and a certain plurality of non-active subcarriers. Thus, for each input bit pattern, each discrete-time transmission is silenced on particular subcarriers, thereby providing the sparsity that is desired at the receiver side. Each codeword corresponding to a layer may have the same sparsity pattern.


In one aspect, an apparatus comprises a receiver, a transform, and a decoder. The receiver can be a radio receiver configured to receive a transmission from at least one transmitting device, wherein the transmission comprises an original codeword generated in a first basis by the transmitting device. The transform, also known as a linear transformation, a linear mapping, or a linear map, is configured to transform the original codeword from the first basis to a second basis to produce a transformed codeword, the second basis being different from the first basis. The transformed codeword is more sparsely distributed than the original codeword, which may be due to how the original codeword is designed, how the transform is selected, or both. The decoder performs joint detection of multiplexed layers in the received transmissions, such as by employing relationships between different transformed codewords.


Some examples of the method, apparatus, and non-transitory computer-readable medium described herein may be used in eMBB, MTC, URLLC, mmWave, D2D, ProSe, mobile edge computing, vehicular networks, or IOT communications. D2D and ProSe includes use cases wherein a UE supports ProSe Discovery and/or ProSe Communication (e.g., a ProSe-enabled UE). 3GPP Services working group defined use cases and scenarios for ProSe in TR 22.803, which is incorporated by reference in its entirety. Configuration signaling described herein can include ProSe discovery and/or communications signaling.


All patent applications and patents mentioned in this disclosure are hereby incorporated by reference in their entireties, including: U.S. Pat. Nos. 8,670,390, 9,225,471, 9,270,421, 9,325,805, 9,473,226, 8,929,550, 7,430,257, 6,331,837, 7,076,168, 7,965,761, 8,098,751, 7,787,514, 9,673,920, 9,628,231, 9,485,063, U.S. patent application Ser. No. 10/145,854, U.S. patent application Ser. No. 14/789,949, Pat. Appl. No. 62/197,336, U.S. patent application Ser. No. 14/967,633, Pat. Appl. No. 60/286,850, U.S. patent application Ser. No. 14/709,936, U.S. patent application Ser. No. 14/733,013, U.S. patent application Ser. No. 14/789,949, U.S. patent application Ser. No. 13/116,984, U.S. patent application Ser. No. 15/218,609, U.S. patent application Ser. No. 15/347,415, U.S. patent application Ser. No. 15/988,898, U.S. patent application Ser. No. 16/021,001, U.S. patent application Ser. No. 16/307,039, U.S. patent application Ser. No. 16/751,946, Pat. Appl. No. 62/510,987, Pat. Appl. No. 62/527,603, Pat. Appl. No. 62/686,083, Pat. Appl. No. 62/778,894, Pat. Appl. No. 62/662,140, Pat. Appl. No. 62/536,955, and PCT/US16/43852.


All publications disclosed herein are incorporated by reference in their entireties, including: LTE: Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (3GPP TS 36.211 version 8.7.0 Release 8), 06/2009; LTE: Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (3GPP TS 36.212 version 8.8.0 Release 8), 01/2010; 3GPP TR 21.914 version 0.8.0 Release 14: Technical Specification Group Services and Systems Aspects; and 3GPP TR 21.915 version 15.0.0 Release 15.


To the accomplishment of the foregoing and related ends, the one or more aspects comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects may be employed, and this description is intended to include all such aspects and their equivalents.





BRIEF DESCRIPTION OF THE DRAWINGS

Each depicted element in the drawings can be a part or step of a method or apparatus. Each element may be a means for performing its corresponding step, such as an electronic circuit, a computer processor programmed to perform the step, at least a portion of a non-transitory computer-readable memory comprising software instructions stored therein and executable by a processor to perform the step, or a software program or source code segment executable by a processor to perform the step. A means for performing a step may comprise a Cloud, a Fog, virtualized machines, and/or software-defined networks.



FIG. 1 illustrates an example of a wireless communication system in which disclosed aspects can be configured to operate.



FIG. 2A-2M are diagrams that illustrate apparatus and method aspects in a transmitter. These aspects may be implemented by a computer processor or stored as software instructions in a non-transitory computer-readable memory.



FIG. 3A-3P are signal plots that depict time-domain and frequency-domain signals that can be transmitted and received according to aspects disclosed herein.



FIG. 4A is a diagram of a receiver and receiver method according to disclosed aspects. These aspects may be implemented by a computer processor or stored as software instructions in a non-transitory computer-readable memory.



FIG. 4B is a diagram of a transceiver that can be configured to operate according to disclosed aspects.



FIGS. 5A and 5B are example factor graphs for codewords disclosed herein.





DETAILED DESCRIPTION

The detailed description set forth below in connection with the appended drawings is intended as a description of various configurations and is not intended to represent the only configurations in which the concepts described herein may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details. In some instances, well known structures and components are shown in block diagram form in order to avoid obscuring such concepts.


Several aspects of telecommunication systems will now be presented with reference to various apparatus and methods. These apparatus and methods will be described in the following detailed description and illustrated in the accompanying drawings by various blocks, components, circuits, processes, algorithms, etc. (collectively referred to as “elements”). These elements may be implemented using electronic hardware, computer software, or any combination thereof. Whether such elements are implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system.


By way of example, an element, or any portion of an element, or any combination of elements may be implemented as a “processing system” that includes one or more processors. Examples of processors include microprocessors, microcontrollers, graphics processing units (GPUs), central processing units (CPUs), application processors, digital signal processors (DSPs), reduced instruction set computing (RISC) processors, systems on a chip (SoC), baseband processors, field programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, gated logic, discrete hardware circuits, and other suitable hardware configured to perform the various functionality described throughout this disclosure. One or more processors in the processing system may execute software. Software shall be construed broadly to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, software components, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, procedures, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.


Accordingly, in one or more example embodiments, the functions described may be implemented in hardware, software, or any combination thereof. If implemented in software, the functions may be stored on or encoded as one or more instructions or code on a computer-readable medium. Computer-readable media includes computer storage media. Storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise a random-access memory (RAM), a read-only memory (ROM), an electrically erasable programmable ROM (EEPROM), optical disk storage, magnetic disk storage, other magnetic storage devices, combinations of the aforementioned types of computer-readable media, or any other medium that can be used to store computer executable code in the form of instructions or data structures that can be accessed by a computer.



FIG. 1 illustrates an example of a wireless communication system in which a user equipment (UE) can communicate with other devices via wireless communication signals. For example, a first UE 101 and a second UE 102 may communicate with a transmit receive point (TRP) 103 using wireless communication resources managed by the TRP 103 and/or other network components (e.g., a core network, an internet service provider (ISP), peer devices and so on). In some implementations, UEs may communicate with each other directly via a device-to-device (D2D) link 110 or some other similar type of direct link.


The components and links of the wireless communication system may take different forms in different implementations. For example, and without limitation, UEs may be cellular devices, Internet of Things (IoT) devices, cellular IoT (CIoT) devices, machine-type communication (MTC) devices, unmanned aerial systems (UASs), navigation systems, vehicles, robotic devices, smart alarms, remote sensors, smart phones, mobile phones, smart meters, personal digital assistants (PDAs), personal computers, wearables, mesh nodes, and tablet computers.


In some aspects, a TRP may refer to a physical entity that incorporates radio head functionality for a particular physical cell. In some aspects, the TRP may include 5G NR functionality with an air interface based on OFDM. NR may support, for example and without limitation, eMBB, mission-critical services, and wide-scale deployment of IoT devices. The functionality of a TRP may be similar in one or more aspects to (or incorporated into) the functionality of a CIoT base station (C-BS), a NodeB, an evolved NodeB (eNodeB), radio access network (RAN) access node, a radio network controller (RNC), a base station (BS), a radio base station (RBS), a base station controller (BSC), a base transceiver station (BTS), a transceiver function (TF), a radio transceiver, a radio router, a basic service set (BSS), an extended service set (ESS), a macro cell, a macro node, a Home eNB (HeNB), a femto cell, a femto node, a pico node, or some other suitable entity. In different scenarios, a TRP may be referred to as a gNodeB (gNB), an eNB, a base station, an access point (AP), a data aggregation point (DAP), or some other terminology.


Various types of network-to-device links and D2D links may be supported in the wireless communication system. For example, D2D links may include, without limitation, machine-to-machine (M2M) links, MTC links, vehicle-to-vehicle (V2V) links, and vehicle-to-anything (V2X) links. Network-to-device links may include, without limitation, uplinks (or reverse links), downlinks (or forward links), vehicle-to-network (V2N) links, and V2X links. Broadcast links may include, without limitation, V2V links, V2X links, M2M links, and MTC links. In some aspects, V2V and V2N communication may be considered as examples of V2X communication.


In one example, a first wireless communication device transmits digital information over a communication channel (e.g., a wireless channel) to a second wireless communication device. In some implementations, each of the first wireless communication device and the second wireless communication device may correspond to the UE 101, the UE 102, or the TRP 103 of FIG. 1. An encoder at the first wireless communication device (a transmitting device, in this example) encodes information from an information source and sends the encoded data over the communication channel. A decoder at the second wireless communication device (a receiving device, in this example) decodes the received encoded data to recover the digital information. The encoder may comprise a direct-sequence encoder, or spreader. The decoder may comprise a direct-sequence decoder, or despreader. Alternatively, other types of decoders may be employed.



FIG. 2A is a block diagram of a transmitting device, such as a UE or TRP, comprising a bits-to-symbols mapper 200, a direct-sequence spreader (e.g., encoder) 202, a pulse-shaping filter 204, and a transmitter 206. A direct-sequence controller 201 may provide for code synthesis and/or selection in the encoder 202 based on one or more configuration signaling parameters, at least some of which may be received from an upper layer, e.g., a radio resource control (RRC) layer 199 or application layer.


In some aspects, a method of communication comprises selecting at least one direct-sequence spreading code (e.g., in the encoder 202) corresponding to a layer or data symbol, followed by modulating (e.g., in the encoder 202 or filter 204) a block (or sequence) of pulse waveforms with the at least one direct-sequence spreading code to produce a discrete-time signal (e.g., which can be transmitted by the transmitter 206). The controller 201 operating with the encoder 202 can configure the at least one direct-sequence code to provide the discrete-time signal with a frequency-domain sparsity pattern designed for non-orthogonal multiple access. This can enable the transmitting device to conform with a conventional SCMA technical specification. Furthermore, the transmitting device and method can improve SCMA by generating discrete-time signals with a low PAPR. Here, low PAPR can mean that when a disclosed feature is used, the PAPR is lower than if the feature is not used. Numerous additional or alternative advantages can be realized in this and other disclosed aspects.



FIG. 2B is a flow diagram of an example implementation of the encoder 202. A code selector 220 can receive configuration signaling parameters, such as SCMA codebooks, frequency-domain parameters (e.g., sparsity patterns), and/or other signaling parameters. One or more direct-sequence code vectors c1, . . . , cn can be processed in a frequency-domain pattern shifter 222. In the case of multiple codes being selected 220, the codes can be summed (combined) in a code combiner 224 to produce a direct-sequence code vector c, which may spread 226 a data signal sd. For example, two or more sparse direct-sequence codes may be summed to produce a dense direct-sequence code c. A code-space pulse-shaping filter 221 may shape (filter) the code vector c with respect to one or more predetermined or received pulse-shape parameters (e.g., roll-off factor, pulse type, etc.). The filter 221 can be configured to reduce OOB leakage of the transmission. Thus, pulse-shape parameter(s) might be selected from configuration signaling based on whether adjacent resource blocks to the transmission signal are used, such as may be determined from scheduling or predicted from the amount of network traffic. Code selection 220 may be based on a PAPR parameter, which may be received from configuration signaling, or based on a power-saving requirement for the device.



FIG. 2C is a flow diagram in accordance with disclosed transmitter and receiver aspects. One or more direct-sequence codes are selected 220, such as based on code book, layer, and/or data-symbol inputs. Selection 220 can provide the direct-sequence codes with at least one particular frequency-domain sparsity pattern. Optionally, the code(s) may be shaped with a code-space pulse-shaping filter 221. The filter 221 may operate on the combined signal after step 224. One or more codes may be cyclically shifted 223. One or more codes may be phase-shifted 222 to produce a cyclic shift of the frequency-domain pattern(s). The codes may be scaled and/or combined 224. In some aspects, direct-sequence codes may be converted 227 to frequency-domain codes, such as via a fast Fourier transform (FFT). The steps 220-224 provide for direct-sequence code generation. The code(s) may be used in an encoder or decoder 228.



FIG. 3A illustrates a set of direct-sequence codes 301-303 and their corresponding spectrums 311-313. A first and second direct-sequence codes 301 and 302 are length-12 codes with zero values depicted as unshaded boxes and non-zero values depicted as shaded boxes. Codes 311 and 312 each have similar sparsity patterns 311 and 312, respectively, where zero frequency values are depicted as unshaded boxes and non-zero frequency values are depicted as shaded boxes. With the appropriate pulse-shaping filter 204, the spectrums 311-313 can represent OFDM subcarrier frequencies, and thus, SCMA signals. Direct-sequence code 303 is the sum of codes 301 and 302, and its spectrum 313 (which is the sum of spectrums 311 and 312) has the same sparsity pattern as the spectrums 311 and 312. Thus, the code 303 is a dense sequence, but its corresponding OFDM code space is sparse. If the non-zero values in codes 301 and 302 are selected to have similar amplitudes, then the code 303 enables the discrete-time transmission signal to have low PAPR.


In FIG. 3B, direct-sequence codes 301 and 304 are combined to produce code 305. However, code 304 has a cyclically shifted spectrum 314 compared to code 301's spectrum 311. Code 305's spectrum 315 equals the sum of spectrums 311 and 314, as a result of the linearity property of the transform. Thus, FIGS. 3A and 3B depict how direct-sequence codes can be selected (and combined) to produce a desired frequency-domain sparsity pattern.


In one aspect, each direct-sequence code is selected 220 (or generated) to have a particular NOMA OFDM sparsity pattern of a set of NOMA OFDM sparsity patterns. For example, code 301's OFDM sparsity pattern 311 might be cyclically shifted 222 left one tone so it appears as pattern 314. There are 12/2 (code length divided by the number of non-zero values) orthogonal circular (e.g., cyclic) shift positions. Similarly, direct-sequence code 302 can have 6 orthogonal OFDM sparsity pattern shifts. All the OFDM-pattern-shifted codes 301 and 302 are orthogonal to each other, since Fourier mapping preserves orthogonality. Codes 301 and 302 might be part of a NOMA OFDM sparsity pattern set that includes at least one other direct-sequence code that is non-orthogonal to at least one of codes 301 and 302. For example, the at least one other code might have an OFDM sparsity pattern with at least one non-zero tone corresponding with a non-zero tone in the sparsity pattern of code 301 or 302.


In the following example, codes c1 and c2 are selected 220 such that when combined 224, they produce a discrete-time signal with a desired frequency-domain sparsity pattern and a low PAPR:

c1(:,1)=[1 0 −1 0 1 0 −1 0 1 0 −1 0];
c2(:,1)=[0 1 0 −1 0 1 0 −1 0 1 0 −1];



FIG. 3C depicts a discrete-time signal 321 produced by modulating a pulse sequence with code c1, and FIG. 3D depicts a discrete-time signal 322 produced by modulating a pulse sequence with code c2. For example, signal 321 is plotted as plot(1:512,(ifft(D*c1,512))), where D is a 12×12 DFT matrix (or a 12-point FFT operator), and the combination of a 512-point IFFT and the 12-point DFT operation has the effect of providing a sequence of 12 cyclically shifted orthogonal pulses, each comprising a weighted sum of 12 OFDM subcarriers. Signal 322 represents similar operations using code c2.


When c1 and c2 are summed, the resulting direct-sequence code c12 is a dense code that has low PAPR:

c12(:,1)=c1(:,1)+c2(:,1)=[1 1 −1 −1 1 1 −1 −1 1 1 −1 −1];



FIG. 3E depicts the absolute values 321′ and 322′ of signals 321 and 322, respectively. FIG. 3F depicts the spectrum 321″ of the discrete-time signal 321. In this case, the spectrum corresponding to c1 is computed as spectrum c1=fft(ifft(D*c1,512),5120); and it is plotted for the first 500 data points.



FIG. 2D is a block diagram of a Dirichlet-pulse transmitter apparatus and method wherein the pulse-shaping filter 204 can produce Dirichlet-based pulse waveforms that provide for OFDM signaling. The filter 204 receives pulse-shape configuration signaling, which may comprise configuration signaling, such as an indication of NR numerology, scheduling, or other information, which the filter 204 uses to shape the pulse waveforms. For example, the configuration signaling can indicate OFDM signal parameters, such as subcarrier spacing, OFDM symbol duration, cyclic prefix length, number of subcarriers, and so on.


The filter 204 comprises a DFT spreader 241, a subcarrier map 243, an IDFT 244, and optionally, a time-domain pulse-shaping filter 245. Optionally, a DFT-spread-OFDM code-space pulse-shape filter and controller 242 is provided. The controller 242 may be responsive to a pulse-shape message in a downlink control channel, modulation and coding information, resource scheduling, or other control information to select a DFT code space filter parameter (e.g., roll-off factor), or the controller may be responsive to internal state information, such as regarding battery power, data buffers, and so on. DFT 241 size, mapping 243, IDFT 244 size and zero padding, and filter 245 parameters are some of the possible features that can be adapted in accordance with the received configuration signaling.


With respect to the transmitter in FIG. 2D, an OFDM code space for signal 321 may be computed from the 12-point FFT:

fft(c1,12)=[0 0 0 0.5 0 0 0 0 0 0.5 0 0];

The OFDM code space for signal 322 has the same sparsity pattern as the OFDM code space for signal 321, and is expressed by:

fft(c2,12)=[0 0 0 −0.5i0 0 0 0 0 0.5i0 0]

The sum of signals 321 and 322 also has the same sparsity pattern, and is expressed by:

fft(c12,12)=[0 0 0(0.5−0.5i)0 0 0 0 0(0.5+0.5i)0 0];

Accordingly, the linearity property of the DFT or DTFT can be exploited to combine two or more direct-sequence codes to produce a discrete-time signal with a desired OFDM sparsity pattern configured for NOMA, such as SCMA-OFDM. The linearity property can be expressed by:

c1[n]α1e1+c2[n]α2e2custom characterC1(k)α1e1+C2(k)α2e2

The complex weights αjej can be selected for code synthesis, including codebook optimization.


The Fourier map preserves the inner product, as shown by Parseval's theorem:










n
=
0


N
-
1





x


[
n
]





g
·



[
n
]




=


1
N






k
=
0


N
-
1





X


[
k
]





G
·



[
k
]










Thus, a set of vectors that are orthogonal in one domain (i.e., their inner product is zero) are orthogonal when Fourier transformed to another domain. Similarly, the inner product for non-orthogonal vectors is preserved. This means that codebook design and optimization which are normally employed on SCMA codes can be adapted to be performed on direct-sequence codes instead. This may enable certain advantages, such as better control of PAPR.


Fourier-related transforms preserve the Euclidean distance between data values in the transformed domain. Thus, the constellation can be designed in the direct-sequence domain instead of the frequency code domain, which also enables the design to occur within constraints of a low-PAPR criterion. Similarly, rotations and other operators, and their evaluations, can be performed in the direct-sequence domain. In one example, first a multi-dimensional constellation is designed with a good Euclidean distance profile. The base constellation is then rotated to achieve a reasonable product distance. Having the rotated constellation, different sets of operators such as phase rotations are applied on top of it to build multiple sparse codebooks for several layers of SCMA. In some aspects, Karush-Kuhn-Tucker (KKT) conditions are introduced to realize codebook optimization.


A weighted sum of direct-sequence codes may provide a desired frequency-domain sparsity pattern, wherein the weights can be adapted to reduce the PAPR of the combined discrete-time signal without changing the sparsity pattern. In one aspect, a weighted sum of direct-sequence codes provides a desired frequency-domain sparsity pattern, wherein the weights can be adapted to change the non-zero frequency-domain values without changing the sparsity pattern. In another aspect, a sum of direct-sequence codes that produces a discrete-time signal with low PAPR can have one or more of the direct-sequence codes operated upon by a linear-phase vector (e.g., circular frequency shift 222) to change the frequency-domain sparsity pattern while preserving low PAPR.


In one example, code vector c2 is element-wise multiplied 222 by a column of the 12-point DFT matrix, e.g., the second column, D(:,2), to shift its frequency-domain pattern:

c2s1=c2·*D(;,2);=[0{0.866−0.5i)0 I 0(−0.866−0.5i)0{0.866−0.5i)0 I 0{−0.866−0.5i)]

and its OFDM code space is

fft(c2s1,12)=[0 0 −0.5i0 0 0 0 0 0.5i0 0 0];

Each column of D provides a different circular shift 222 of the direct-sequence code's frequency-domain (e.g., OFDM) sparsity pattern. For example, the second column of D causes a left circular shift by one unit, which is seen by comparing fft(c2,12) with fft(c2s1,12).



FIG. 3G shows the spectrum 319 corresponding to c2s1, and FIG. 3H shows the spectrum corresponding to the sum, c1+c2s1. The OFDM code space of this discrete-time signal is:

fft(c1+c2s1,12)=[0 0 −0.5i0.5 0 0 0 0 0.5i0.5 0 0];

and the spectrum 320 for this discrete-time signal is shown in FIG. 3H, which is to the sum of spectrums 321″ and 319. As taught herein, the frequency-shift property of a Fourier transform can be exploited to adapt a direct-sequence code such that its frequency-domain sparsity pattern is shifted. Generally, this can be implemented as:

eiϕnc[n]custom characterC(ei(ω−ϕ))

wherein ω is the frequency of the corresponding frequency-domain samples of C( ), and φ indicates a phase shift applied to a code sequence or coded sequence c[n], which results in a frequency offset of the C( ) samples. Similarly, OFDM index modulation may be at least partially effected by the mapping of the spread-DFT symbols to input (frequency) bins of the IFFT. Other transform properties may be exploited to effect code index modulation and OFDM index modulation. For example, circular convolution or circular correlation may be exploited in one domain to effect a corresponding multiplication in the other domain, and vice versa. In some aspects, this may be performed to effect multiplication of the frequency-domain samples by a sparse matrix.


The shift 222 may be implemented by multiplication of the sequence c[n] with the complex exponential sequence






e

i

2

π



m

n

N







to produce a circular shift of the frequency-domain pattern by m units.








c


[
n
]




e

i

2

π



m

n

N







DFT



C


(


(

k
-
m

)


mod





N

)






A shift in position in one domain gives rise to a phase change in another domain. Circular shift 223 of the sequence c[n] corresponds to multiplying the frequency-domain values by a linear phase.







c


[

n
-

m






mod

N



]





DFT




C


(
k
)




e


-
i


2

π



k

m

N








As illustrated above, a circular shift 223 of a sparse direct-sequence code can be performed such that a sum 224 of sparse direct-sequence codes produces a dense direct-sequence code, which may have low PAPR. In other aspects, circular shifts of a code or one or more of the code's sparse components can be performed for codebook optimization.


In some aspects, a set of direct-sequence basis codes is provisioned to generate a NOMA OFDM signal. A selection 220 of direct-sequence basis codes may comprise orthogonal (or non-orthogonal) basis vectors, such as vectors c1, c2, and c3:

w1·c1(:,1)=w1·[1 0 0 1 0 0 1 0 0 1 0 0];
w2·c2(:,1)=w2·[0 1 0 0 1 0 0 1 0 0 1 0];
w3·c3(:,1)=w3·[0 0 1 0 0 1 0 0 1 0 0 1];


where w1, w2, and w3 are complex weights. A composite or aggregate direct-sequence code c comprises a linear combination 224 of direct-sequence basis codes (e.g., by summing complex-weighted basis codes). Parseval's theorem and the linearity of the Fourier map means a set of complex-weighted orthogonal basis vectors in one domain maps to a set of complex-weighted orthogonal basis vectors in the other domain:

fft(w1·c1(;,1),12)=w1·[4 0 0 0 4 0 0 0 4 0 0 0];
fft(w2·c2(:,1),12)=w2·[4 0 0 0 −2−3.464i0 0 0 −2+3.464i0 0 0];
fft(w3·w3(:,1),12)=w3·[4 0 0 0 −2+3.464i0 0 0 −2−3.464i0 0 0];


The OFDM sparsity pattern for each of the direct-sequence codes c1, c2, and c3 is [α1 0 0 0 α2 0 0 0 α3 0 0 0], where α1, α2, and α3 are non-zero complex values corresponding to the first, fourth, and eighth tones, respectively. In NOMA, the direct-sequence codes c1, c2, and c3 may be selected 220 to have an OFDM sparsity pattern that overlaps (e.g., collides) with at least one other different sparsity pattern. An example of one of these other different sparsity patterns is the OFDM sparsity pattern associated with c2s1 described above, which is [0 0 β1 0 0 0 0 0 β2 0 0 0], where β1 and β2 are non-zero complex values corresponding to the third and eighth tones, respectively. Since there is an overlap (i.e., collision of non-zero values) at one or more tones (e.g., α3 and β2 at the eighth tone), these are NOMA OFDM sparsity patterns.



FIG. 2E is a block diagram of a transmitter apparatus and method wherein the pulse-shaping filter 204 comprises a pulse waveform selector 246 that is responsive to configuration signaling to retrieve one or more pulse waveforms from memory 247. A pulse-waveform synthesizer 248 may store kernel or prototype waveforms and/or pulse sequences in the memory 247. A cyclic shifter 249 may be used to perform sequence (e.g., time) and/or frequency shifts on a kernel waveform. A modulator 250 multiplies each kernel with a code symbol from the coder 202, and the modulated kernels are combined (e.g., summed) 251 to produce a discrete-time signal.


In FIG. 2F, a transmitter comprises bits-to-symbols mapper 200 (e.g., an SCMA coder, a QAM modulator, etc.), which maps a set of input bits b to one or more (e.g., q) data symbols s1(b), . . . , sq(b). The data bits may first be encoded using a forward error correcting (FEC) code. As an example, a turbo encoder, a low-density parity-check encoder, or a polar encoder may be used to encode the data bits. The mapper 200 then produces a plurality of constellation points from the encoded bits. The constellation may be one dimensional or multidimensional. At least one code selector 220 may produce one or more orthogonal (e.g., orthonormal) basis vectors (e.g., direct-sequence spreading codes)c1, . . . , cq to spread 202 each data symbol s1(b), . . . , sq(b). The spread symbols s1(b)c1, . . . , sq(b)cq may be combined 224 (e.g., weighted and summed) and modulated 229 onto a sequence (e.g., block) of cyclically shifted pulses produced by pulse generator 204 (e.g., a pulse-shaping filter). The code selector 220 may produce non-orthogonal basis vectors to provide for NOMA.


In some aspects, direct-sequence basis codes having similar OFDM sparsity patterns can be combined 224 to produce a different OFDM sparsity pattern, such as by cancelling out at least one element in the pattern. For example, the sum (c1−c2) has the NOMA OFDM sparsity pattern, [0 0 0 0 α2 0 0 0 α3 0 0 0]. Different direct-sequence basis vectors might have the same or different OFDM sparsity patterns. The one or more of the selected basis codes may be filtered 221, may be shifted 223, and/or may be element-wise multiplied 222 with a linear-phase vector to shift its OFDM sparsity pattern. Combining 224 may produce NOMA signals.


Due to the similarity of the PAPR in the direct-sequence code space to the PAPR of the resulting discrete-time signal, the complex weights w1, w2, and/or w3 can be selected to control or adjust the discrete-time signal's PAPR while corresponding adjustments to the SCMA constellation in the frequency-domain are confined to a particular NOMA-OFDM sparsity pattern. This can be useful for codebook design and optimization, signal synthesis in the transmitter, and/or signal analysis in the receiver.


In other aspects, assigning (e.g., scheduling) multiple layers to a device (a UE or TRP) can be provisioned to provide the aggregate transmission of those layers with a low PAPR. In FIG. 2G, each of layers 1 to q to be multiplexed has a corresponding bit streams b1 to bq. Bits-to-symbols mappers 200.1-200.q map their respective blocks of data bits to symbols s1(b1) to sq(bq). In one example, multiple data symbols may each express the bits in block b1. Each data symbol may be encoded 202 (e.g., spread) with at least one orthogonal basis vector, and the resulting sequences s1(b1)c1 to sq(bq)cq are combined 224, followed by modulation 229 onto a cyclic sequence of pulses. In some aspects, the basis vectors are non-orthogonal.


For example, a first layer may employ the basis (c1-c2), which is the direct-sequence code [1 −1 0 1 −1 0 1 −1 0 1 −1 0] with corresponding OFDM sparsity pattern, [0 0 0 0 α2 0 0 0 α3 0 0 0]. A second layer may employ the direct-sequence basis code, c3. *D(:,2), which is [0 0 e−i2π2/12 0 0 e−i2π5/12 0 0 e−i2π8/12 0 0 e−i2π11/12], with corresponding OFDM sparsity pattern [0 0 0 γ1 0 0 0 γ2 0 0 0 γ3]. The first and second layers are orthogonal, as their OFDM sparsity patterns have no collisions. However, the first and second layers could employ non-orthogonal bases in other examples. The sum of the direct-sequence codes (c1-c2) and c3. *D(:,2) is a vector in which each element has an absolute value of one, which can provide a low-PAPR discrete-time signal. Each layer's codebook might comprise products of data symbols with its bases.


NOMA-OFDM signals can be generated via direct-sequence coding instead of requiring the IDFT typically used in OFDM modulation. Also, this approach can avoid the complex architectures and filters associated with the various types of GFDM, FBMC, and other transmission schemes mentioned herein. In FIG. 2H, a pulse-shaping filter 230 can provide at least one kernel waveform comprising a pulse that may be represented by a superposition of a plurality of frequency subcarriers, possibly with subcarrier-level filtering. The kernel may be stored in a memory 231 and read by a kernel selector 232, which may include a cyclic shifter that can generate cyclic shifted versions of the kernel. Alternatively, cyclic shifted versions of the kernel may be stored in the memory 231, and particular ones retrieved by the kernel selector 232. Pulse waveforms, such as GFDM, FBMC, Dirichlet, SC-FDM, Zero-tail SC-FDM, SC-FDM+WOLA, raised cosine, half-cosine, root raised cosine, Gaussian, Isotropic Orthogonal Transform Algorithm (IOTA), Extended Gaussian Function (EGF), and so on may be stored. Each waveform can be modulated 229 with a code symbol of a direct-sequence codeword selected from a codebook, wherein the codebook corresponds to a layer assignment, and the codeword corresponds to a pattern of input bits. The modulated waveforms are summed 224 to produce a discrete-time signal.


In one aspect, an apparatus comprises a transceiver and a processor. The processor may be configured to receive, via the transceiver, configuration signaling based on different communication scenarios. Based on the configuration signaling, the kernel selector 232 retrieves a kernel from the memory 231, wherein the kernel has at least one pulse parameter indicated by or derived from the configuration signaling. A sequence of pulses may be generated from the selected kernel (such as via the cyclic shifter 232 and combiner 224), and the sequence modulated 229 with a direct-sequence code selected 220 to filter one or more subcarrier frequencies in the pulses, such as to provide a particular frequency-domain sparsity pattern.


Each kernel may comprise a superposition of subcarriers, and may include subcarrier-level filtering according to different schemes. Thus, each kernel can comprise a subcarrier profile, which includes subcarrier number, spacing, bandwidth, and/or type of subcarrier-level filtering. Each kernel may have associated pulse parameters, such as pulse type, roll-off, and/or other pulse-shape filter parameters. Each kernel may include a cyclic prefix and/or suffix, and/or zero tail. Different pulse shapes, thus different kernels, may be employed for different communication scenarios, such as may be indicated by the configuration signaling received by the transceiver. The kernel selector 232 may be responsive to the configuration signaling for retrieving a kernel having a particular parameter set from the memory 231. Alternatively, the pulse-shaping filter 230 is responsive to the configuration signaling for generating and delivering the kernel to the cyclic shifter 232. The code selector 220 selects at least one direct-sequence code that effectively filters the spectral content of the pulse sequence. For example, the code selector 220 may receive a layer assignment or codebook (possibly from the configuration signaling) that specifies a particular frequency-domain sparsity pattern, and the code selector can select or generate at least one direct-sequence code to produce that pattern when it modulates the pulse sequence. The code selector 220 may perform a bits-to-code mapping to select a particular code(s) corresponding to a set of data bits, such as to perform code-index modulation.


Disclosed aspects can provide for power-domain multiple access or pattern-domain multiple access (PDMA) signaling in which different signal amplitudes convey information. FIG. 3I illustrates spectrums 331 and 332 of direct-sequence codes that have multiple amplitude levels across different frequency components, such as OFDM tones. The direct-sequence codes can be configured to provide the discrete-time signal with low PAPR. Spectrum 333 shown in FIG. 3J is a linear combination of spectrums 331 and 332.


In FIG. 3K, a discrete-time signal 341 of a pulse sequence modulated with a direct-sequence code c1 is compared to a discrete-time signal 342 for when the code is pulse-shaped 221, e.g., f1. *c1. In one example, a pulse-shaping filter may provide an element-wise multiplication of c1 with vector f1, which may have a pulse-shape type (e.g., half-cosine, raised cosine, root raised cosine, Gaussian, etc.) and possibly at least one pulse-shape parameter (e.g., roll-off factor), the type and parameter(s) possibly being provided via configuration signaling from an upper layer 199. FIG. 3L shows spectrums 341′ and 342′ of the discrete-time signals corresponding to direct-sequence codes c1 and f1. *c1, respectively. This code-space filtering 221 can reduce the sidelobes in the spectrum, which can reduce out-of-band emissions. The filtering 221 can be configured to reduce the PAPR of the discrete-time signal. FIG. 3M shows a first contiguous set of mainlobes 343 and a second contiguous set of mainlobes 344 in an OFDM symbol. Separate direct-sequence codes may be applied to the pulse waveforms in signals 343 and 344, such as to select their corresponding OFDM sparsity patterns. Each set might correspond to a different layer.


In FIG. 2I, a transmitter maps data bits to data symbols 200, optionally spreads 230 the data symbols via a filter, spreads 202 each data symbol (or filtered data symbol) with a direct-sequence code, modulates 229 the spread data symbols onto a block of pulse waveforms, and processes 206 the resulting discrete-time signal for transmission in a communication network.


A means for mapping can include the bits-to-data-symbols mapper (200), such as an M-ary modulator, a QAM mapper, an LDS spreader, or an SCMA spreader; and may include an FEC encoder. A means for spreading data symbols across multiple OFDM symbols may include the filter 230. A means for selecting at least one direct-sequence code corresponding to a layer or a data symbol can comprise the code selector 220 (which can generate direct-sequence codes and/or select previously generated codes stored in memory), and/or may comprise a direct-sequence controller 201 and/or spreader 202. The means for selecting may further comprise any of the elements 221-224. A means for modulating a block of pulse waveforms with the at least one direct-sequence code to produce a discrete-time signal may include the modulator 229 or 262.I and 262.Q. The means for modulating may include a pulse-shaping filter 204, which may be or include a pulse generator 204. In one example, the means for modulating can be a component (250) of the pulse-shaping filter 204 (such as shown in FIG. 2E). In another example, the means for modulating can comprise operations or components of the pulse-shaping filter 204 that operate on an input direct-sequence signal, such as elements 241, 243, 244, and 245 in FIG. 2D. A means for transmitting, such as the transmitter 206, can transmit the discrete-time signal. A means for configuring the at least one direct-sequence code to provide the discrete-time signal with a frequency-domain sparsity pattern configured for NOMA can comprise the direct-sequence controller 201. In some aspects, the means for configuring can comprise the spreader 202. For example, this can include the code selector 220 and may include the frequency shift 222, sequence shift 223, filter 221, and/or combiner 224.


In one aspect, modulation 229 may employ a pulse generator, such as the pulse-shaping filter 204 in FIG. 2D, which upsamples the spread data symbols by a factor equal to the ratio of IDFT and DFT block sizes, and applies a circular pulse shape with a Dirichlet function (i.e., periodic sinc) before adding a cyclic prefix. The Dirichlet function is:








D

N
d




(

x
d

)


=

{





sin


(



N
d



x
d


2

)




N
d



sin


(


x
d

/
2

)








x


2

π





k


,

k
=
0

,

±
1

,

±
2

,








(

-
1

)


k


(


N
d


­

1

)







x
=

2

π





k


,

k
=
0

,

±
1

,

±
2

,





}






for any nonzero integer Nd. This function has period 2π for odd Nd and period 4π for even Nd. The magnitude of the function is 1/Nd times the magnitude of the DTFT of the Nd-point Rect window.


The data symbols can modulate 229 the (cyclic) shifted Dirichlet functions. This differs from single-carrier schemes because the shifts are circular, so the pulse shapes associated with the data symbols can lose their contiguity in time. For example, FIG. 3N is a plot of a Dirichlet function for Nd=12 over 0-2π. The main lobe associated with the first input of the DFT appears at the head and tail parts of an OFDM symbol, thus causing sharp transitions at the OFDM symbol boundaries. In some aspects, this can be remedied by shifting the pulse waveforms by half of a pulse width, as shown in FIG. 30, which is a plot of the absolute values of the Dirichlet functions. This discussion can be adapted for the period 4π, for odd Nd, or for other pulse shapes.


For simplicity of illustration, 12 periodic sinc functions can be orthogonally positioned in an OFDM symbol interval, wherein a first set of six are depicted in FIG. 30, and a second set of six can be positioned so each peak of the second set corresponds to one of the zero crossings in the first set. A length-6 direct-sequence code might be modulated on each set, or a length-12 code might be modulated onto the 12 periodic sinc functions.



FIG. 2J depicts an example modulation 229 aspect that can reduce sharp transitions at the OFDM symbol boundaries. The code symbols can be separated 260 into I and Q components to produce Idata and Qdata vectors. First and second pulse sequences 350.1 and 350.Q can be generated, each having a duration of an OFDM symbol, such as depicted in FIG. 3P. Idata may be modulated 262.I onto the first sequence 350.I and Qdata may be modulated 262.Q onto the second sequence 350.Q. A cyclic prefix and/or suffix can be inserted (263.I and 263.Q) to each sequence, each being an integer multiple of a pulse (e.g., mainlobe) width measured between the mainlobe's zero crossings. For example, in FIG. 3P, a cyclic prefix equal to two pulse widths is shown, where pulses 351.1 and 352.1 in the OFDM symbol interval are repeated (shown as 351.2 and 352.2) in the cyclic prefix (I)CP. A similar cyclic prefix (Q)CP is appended to sequence 350.Q. The cyclic prefix (I)CP avoids a sharp transition at the boundary of the previous OFDM symbol (I symbol j−1), which also does not have a pulse that is split between its head and tail parts. Similarly, the sequence 350.I can avoid a sharp transition at the trailing OFDM symbol boundary if the cyclic prefix of the following OFDM symbol (I CP j+1) is provisioned similar to (I)CP.


One of the sequences 350.1 or 350.Q is shifted 264 by half of a pulse width, such as depicted in FIG. 3P, and the sequences 350.I and 350.Q are summed 265. In a receiver, the combined signal might be sampled over a duration depicted by the OFDM symbol duration 350.I plus its cyclic prefix (I)CP. The cyclic prefix (I)CP is normally discarded, leaving the symbol duration 350.I, which in this case also includes the trailing tail of (Q)CP, and OFDM symbol 350.Q minus a trailing tail of this symbol. Since the trailing tail of (Q)CP is the missing portion of the symbol 350.Q (Trailing tail (symbol)), the complete quadrature portion of the OFDM symbol is also within the sampling region of 350.I. Thus, a DFT can demodulate both the I and Q portions of the OFDM symbol.


In an alternative aspect, a split pulse might be subtracted from a pulse sequence (e.g., block) or zeroed (such as by assigning a zero value in the corresponding function or transform). A cyclic prefix and/or suffix equal to an integer number of pulse widths can be added to overlap the zeroed pulse in order to form a cyclic-extended OFDM symbol. Adjacent OFDM symbols can be overlapped at the zeroed pulse to form a smooth transition between OFDM symbols. In some aspects, the data symbols can be spread 230 across multiple OFDM symbols, such as shown in FIG. 2K. This can improve spectral efficiency and relax synchronization requirements, among other benefits. A filter Hk according to one or more parameters is constructed 270. Input data symbols s are organized 271 into blocks of Nb symbols. Optionally, the symbols may be rotated (e.g., phase shifted) 272. This may reduce PAPR in the discrete-time signal. The symbols are upsampled 273. The parameter Kf can be considered to be a stride length for the filter. Zero padding 274 may be performed, followed by filtering 275 with Hk. The function filter(fb,fa,xd) filters 275 input data xd using a rational transfer function defined by numerator and denominator coefficients fb and fa.


Referring back to FIG. 2I, each filtered data symbol is spread with a direct-sequence code 202 and then modulated 229 in a different OFDM symbol interval. The direct-sequence code filters the pulse waveforms, allowing some frequency components to pass while blocking others. The spectrum of each allowed frequency component is shaped by the symmetric filter Hk. Each data symbol sn(j) is mapped into multiple filtered symbols sf. Thus, by causing each data symbol to span multiple OFDM symbols, the filter Hk helps reduce OOB leakage. Parameters (e.g., duration, pulse width, pulse shape, roll-off factor, and so on) of the pulse waveforms can be selected to provide particular OFDM waveform parameters (e.g., 5G NR numerologies, PAPR, and so on), and may be selectable based on configuration signaling, such as from the upper layer 199.


In a UE, the configuration signaling might be received via a downlink channel, such as the physical downlink control channel (PDCCH), and can include resource grants, modulation and coding scheme (MCS) (e.g., MCS index), transport block size (TBS), number of layers, number of allocated physical resource blocks (PRBs), number of REs for DM-RS per PRB in the scheduled duration, overhead, pulse-shape parameters, number of scheduled OFDM symbols in a slot, and other data, possibly configured specifically for disclosed aspects. The physical uplink shared channel (PUSCH) and control parameters might be scheduled via an uplink (UL) grant in the downlink control information (DCI), in a Random Access Response, or via RRC signaling. The configuration signaling might include layer 3 and/or layer 2 signaling. Layer 3 includes the RRC layer, and layer 2 includes a packet data convergence protocol (PDCP) layer, a radio link control (RLC) layer, and a medium access control (MAC) layer. Configuration signaling might be provided via a physical downlink shared channel (PDSCH) or any broadcast channel.


In a TRP, the configuration signaling might be received via an uplink channel, such as the physical uplink control channel (PUCCH) or PUSCH. The PUCCH carries uplink control information (UCI), such as scheduling requests, a channel quality indicator (CQI), a precoding matrix indicator (PMI), a rank indicator (RI), and HARQ ACK/NACK feedback. The PUSCH carries data, and may additionally be used to carry a buffer status report (BSR), a power headroom report (PHR), and/or UCI.


In FIG. 2L, the pulse-shaping filter 204 may include a GFDM or FBMC modulator. In one aspect, the filter 204 might employ a generic block-based filtered multicarrier scheme in which the energy of the data symbols is spread in time with a circularly shifted prototype filter. In some examples, subcarrier filters can avoid both ingress and egress noises.


In FIG. 2M, the bits-to-symbols mapper 200 performs code-index modulation via a code index selector 251, which maps each pattern of bits b1 to a code index. A bit splitter 250 provides a second set of bits b2, to an M-ary modulator 253 that produces symbol values sd[n], which are modulated 226 onto the selected codewords c. In some aspects, a third set of bits (not shown) may be mapped to a frequency index, which frequency-shifts 222 the selected code to one of a set of indexed frequency-sparsity patterns. In another aspect, the second set of bits b2 is mapped to one or more layer identifier values s2, which can allow the receiver to distinguish one layer from another in received signals. This provides for code index modulation coupled with a modulation-domain multiple access (MDMA). Coupling these two approaches can facilitate a non-orthogonal grant-free access scheme supporting collision resolution based on QAM or PAM signature detection techniques on the receive side. The receiver detects the code index to determine what data values were transmitted and demodulates the codes (e.g., estimates 52) to determine which layer sent the data.


In FIG. 4A, a receiver and receiving method comprises a receiver front-end 401, a transform 402, a decoder 403, and a FEC decoder 404. A transform-parameter selector 420 may select one or more transform parameters (e.g., block size, sampling frequency, sampling period, length of signal, and the like) used in the transform 402 to transform received signals from a first basis (the first basis being employed by the transmitter to produce original codewords, which are dense codewords) into a second basis (wherein transformed codewords are sparse, or more sparsely distributed, relative to the original codewords). Here, sparse means that the codeword is spread across fewer resources than a dense codeword. A codebook transform 400 may produce sparse codewords in the second basis, such as by transforming dense codewords in the first basis, and the sparse codewords (or their relationships, such as factor graphs) can be input to the decoder 403, wherein received transmissions can be decoded with respect to the second basis.


The RF front-end 401 can include an antenna, an amplifier, a frequency downconverter, an analog-to-digital converter (ADC) a cyclic-prefix remover, and/or a pulse-shaping filter. In accordance with an example receiver apparatus and method, a UE or TRP receiving device transforms 402 received transmissions from one or more transmitting devices (e.g., UEs and/or TRPs) into a plurality of resource samples in a transform space corresponding to the second basis. For example, a DFT (e.g., an FFT, a filter bank, or some other suitable transform) may transform a received discrete-time signal into frequency samples, the frequency domain being the transform space, and the output frequency bins being the second basis. Although the transmission(s) may be single-carrier (e.g., with a cyclic prefix) signals, the resource samples may be OFDM tones. The transform 402 may include a subcarrier demodulator, such as an OFDM demodulator. The transform 402 may equalize (not shown) the samples. For example, a frequency-domain equalizer (FDE) may apply a weighting matrix to subcarrier samples to equalize the channels between the one or more transmitting devices and the receiving device.


The transform-parameter selector 420 may select parameters for the resource samples produced by transform 402. The parameters may include the number of samples, the size of each sample, the spacing between samples, pulse shaping, and so on. Parameter selection 420 may be made upon determining (e.g., measuring or from the configuration signaling) physical parameters of the received waveform, the physical parameters corresponding to the first basis. Measurements might include measuring the received waveform in the first basis. Parameter selection 420 may be responsive to configuration signaling that provides information about the received waveform, which can be used to select 420 the parameters of the resource samples produced by the transform 402. The parameter selector 420 might measure one or more of the received direct-sequence signal's physical parameters (e.g., period length, number of periods, pulse width, pulse shape, duty cycle, roll-off factor, sample rate, cyclic prefix length, dynamic range, and so on) to determine signal attributes for the transformed signal (e.g., numerology, symbol length, number of physical resource blocks, number of subcarriers, number of slots per subframe, slot length, subcarrier bandwidth, subcarrier spacing, subcarrier pulse-shaping, total bandwidth, roll-off, OOB leakage suppression, and so on), and to configure the transform 402 to produce resource samples in the second basis according to the aforementioned signal attributes.


The receiving device might decode 403 the direct-sequence codewords based on direct-sequence codes known to be associated with the transmitting device(s), but by employing the frequency-domain transform 400 of the codebooks. By virtue of the direct-sequence codes being designed to produce frequency-domain NOMA sparsity patterns, decoding 403 might employ an SCMA decoder configured to use the frequency-domain transform of the direct-sequence codes associated with the transmitter(s) to perform joint detection of direct-sequence multiplexed layers, such as by using message passing algorithm (MPA) decoding. Sparsity of the codewords in the transform space (e.g., the second basis) can reduce the complexity of joint detection by facilitating an MPA. Each layer of SCMA, for example, has an associated codebook set, which may be expressed as both direct-sequence codes and their corresponding frequency-domain codes. The decoding 403 can exploit frequency-domain sparsity designed into the direct-sequence codes to reduce the complexity of joint detection. Decoding 403 can comprise demultiplexing the transmission layers, and data bits for each layer can be decoded 404 using an FEC decoder. As an example, a turbo decoder, an LDPC decoder, or a polar decoder may be used to decode 404 the data bits.


In some aspects, configuration signaling received from an upper layer 399 can assist the codebook transform 400 and/or the selection 420 of transform parameters. Spreading factor (SF) is a parameter that specifies a number of REs over which a signal is spread. In some situations, the signal is carried in a subset of the REs to provide for sparsity. For a direct-sequence code, the REs correspond to code chips or symbol positions in a block or sequence. In a discrete-time signal, REs can correspond to time-domain elements, such as chip intervals, symbol intervals, or slots, for example. REs might comprise pulse waveforms in a block of circular-shifted pulse waveforms. In the frequency domain, REs may be subcarrier frequencies, such as OFDM tones. A code might be selected to have a high SF in one domain and a low SF in another domain. For example, a direct-sequence code may be provisioned to have a low frequency-domain SF relative to its time-domain (or data-domain) SF. The configuration signaling can include an SF for use by a transmitter and/or receiver. In some examples, the SF corresponding to codewords in the first basis is used to select 420 the transform parameter(s), such as the transform size.


Overlay factor (OF) is a parameter that characterizes the ratio of the number of layers to the number of REs. Typically, higher OF may allow more layers to share REs, facilitating support for large numbers of active connections. If OF>1, NOMA is possible. The transmitter may select direct-sequence codes based on adaptation criteria that can include content and application, device capability, device requirements, spectrum sharing mechanism, network topology, channel condition, access mechanism, and the like, as examples. A unit performing adaptation may receive configuration signaling based on SF and OF parameters. In one example, a high time-domain (or data-domain) SF, a low frequency-domain SF, and an OF>1 that direct-sequence codes are to be provisioned that have sparse NOMA patterns in the frequency domain, and possibly low PAPR in the time-domain. The OF (and possibly other codeword relationship information, such as factor graphs) can be in the configuration signaling 399 (and/or determined by the codebook transform 400) and can be used in the decoder 403 to decode received codewords.


In one example, bits to be transmitted are encoded into direct-sequence codewords in a transmitter's encoder, modulated onto a first basis of orthogonal and/or non-orthogonal pulse waveforms, and transmitted, wherein the transmitted signals may be multiplexed in the channel. The receiver employs a second basis, which is different from the first basis in which the codewords were modulated, wherein the second basis provides codeword sparsity to facilitate detection. For example, the receiver can transform received direct-sequence encoded signals into the frequency domain, wherein the direct-sequence codes have been designed to be sparse, and detect these codewords by MPA over the corresponding factor graph. Thus, the transform 402 can demodulate the codewords with respect to a different basis than the basis used by the transmitter to modulate the codewords onto the transmission signal.


In one example, there are J separate layers, and each layer has a codebook Cj containing M complex codewords, i.e., Cj={cj1, . . . ,cjM}. In each layer, every log2 M bits have been mapped into one codeword. The length of each codeword is K, and each codebook has few or no positions corresponding to zero values. Corresponding with the length of the codewords, there are K orthogonal resources (e.g., pulse waveforms, MIMO spatial layers, or other REs), which are the (e.g., first) basis, onto which the code (or encoded) symbols are modulated. Here, we assume K separate code symbols are modulated onto K orthogonal pulse waveforms of a block of circular-shifted pulse waveforms, the block length being an OFDM symbol length, and possibly including a cyclic prefix and/or suffix. The pulse waveforms are the first basis. The codewords are configured to filter the block of circular-shifted pulse waveforms such that the transmitted signal is sparse in the frequency domain and has a layer-specific NOMA OFDM sparsity pattern.


Based on parameters of the pulse waveforms (e.g., pulse width, block length, and possibly others), a set of frequencies or OFDM tones is selected as the second basis, in which the receiver demodulates 402 received transmissions. In this example, each codeword has a frequency-domain pattern, fjm=(f1jm, . . . , fKjm)T, where each code in the jth codebook has the same (jth) OFDM sparsity pattern in which K-N OFDM subcarriers are zero, and each codebook may have a unique sparsity pattern (although in some instances, codebook reuse may be employed).


The jth frequency-domain pattern will be affected by the channel vector,








h
j

=


{

h

k

j


}


k
=
1

K


.





Thus the received signal is:






y
=





j
=
1

J




diag


(

h
j

)




f
j



+
n






where diag(hj) is a diagonal matrix wherein its jth diagonal element is hj, fj=(f1j, . . . ,fKj)T is the jth frequency-domain pattern, and n is complex Gaussian noise. OF=J/K.


The decoder 403 detects the transmitted codewords according to the received signal y, the channel knowledge, and the factor graph, which is formed by the relation between layers and resources. The structures of factor graphs represent constraints, and the messages in MPA can be updated based on the constraints. By changing the basis of the codewords, the transform 402 changes the factor graph. Here, the resources have been transformed 402 from circular pulse waveforms to OFDM subcarriers. For each codebook, the frequency-domain pattern of each codeword has non-zero values in the same N positions, which means the bits in that layer are spread in only N resources.


In FIG. 5A, a factor graph illustrates a dense relationship between layer nodes corresponding to a set of direct-sequence codes or codebooks c1-c6, and resource nodes ý14 corresponding to a first basis (e.g., orthogonal pulse waveform functions). In FIG. 5B, a transform 500 is performed on the direct-sequence codes c1-c6 by the receiver to change the resource nodes to transformed resource nodes f1-f6 and provide for a second basis ÿ1-ÿ4 which has a sparse relationship with the transformed resource nodes f1-f6 (e.g., an OFDM sparsity pattern). The receiver may be responsive to waveform parameters (e.g., symbol length, pulse width, number of pulses, pulse-shape parameter(s), and so on) for selecting transform parameters (e.g., transform size, sampling rate, pulse-shape filter parameters, and so on). The receiver may detect and/or receive the waveform parameters (e.g., in the configuration signaling).


In the factor graph illustrated in FIG. 5B, J=6, K=4, N=2, and df=3. The three edges connected with the first resource node indicates the constraint, h11f1+h21f2+h31f3+n=y1, where hi1 is an element of h1, fi is the first element of the ith frequency-domain pattern (e.g., the codeword represented in the new basis): {fim}m=1M, n is noise, and y1 is the measured value at the first resource node corresponding to the second basis. In each iteration, the MPA detector 403 can deduce the probability distribution of f1 according to f2,f3 and y1. In one example, the K resource nodes in the factor graph may have the same degree df. Under this assumption the following MPA detection algorithm may be performed:














Input: y, {hj}j=1J, {cj}j=1J, N0


Change basis of codebook(s): {Cj}j=1J → {Fj}j=1J


Initialize: Vj→k(0)(fjm) = 1/M, (j ∈ [J], k ∈ [K], m ∈ [M])


for t = 1: Nt


 % update messages from resource nodes


 for all j ∈ [J], k ∈ [K], m ∈ [M] such that Edge(j,k) exists in factor graph






Uj->k(t)(fjm)=ccom1πN0exp[-1N0yk-hkjfkjm-ik\jhkiγik2]ik\jVi->k(t-1)(γi);






% where com = Fi1×...× Fidf-1 is the Cartesian Product of the “new basis” codebooks of the other


% df− 1 variable nodes connected to the kth function node: e.g., i ∈ ∂k\j, γ = (γi1,..., γidf-1) is


% one element of com, and γj = {γik}k=1K


 end


% Update messages from layer nodes


 for all j ∈ [J], k ∈ [K], m ∈ [M] such that Edge(j,k) exists in factor graph


  Vj→k(t)(fjm) = Πl∈∂j\k Ul→k(t)(fjm)


 end


% Normalize probabilities for numerical stability


 for all j ∈ [J], k ∈ [K], m ∈ [M] such that Edge(j,k) exists in factor graph


  Vj→k(t)(fjm) = Vj→k(t)(fjm)/Σm′=1M Vj→k(t)(fjm′)


 end


end


% Make decision after some number of iterations


for j=1:J, m=1:M


  Vj(fjm) = Πk∈∂j\k Uk→j(Nt)(fjm)


end


fjm” = f_decision(Vj, {fjm}m=1M); % returns codeword that maximize Vj( ),










where Uj→k(t)(fjm), is the probability distribution of the jth layer node according to the kth resource node and the rest (df−1) of the adjacent layer nodes. The term







1

π


N
0





exp
[
]






provides the probability that the transmitted codeword in the jth layer is fjm in the condition that the rest (df−1) of the adjacent layer nodes are according to γ, i.e., P(fjm|γ). Vi→k(t−1)i) is the probability that the codeword from the ith layer is γi, i.e., P(γi), The product of these parts is the joint probability P(fjm,γ). Thus, P(fjm) can be computed as a traversal on the set corn.


Optimizations to the receiver method can reduce the complexity per resource node. Early termination may be based on convergence behavior of the MPA. The decoder may adjust beliefs according to the variation trend. Numerical analyses may be performed for conditional probability approximation, which can avoid squares and divisions. Log-likelihood ratio (LLR) can replace multiplications with additions. In partial marginalized (PM) MPA, some symbols are judged in advance. Various techniques can reduce the complexity of maximum a posterior (MAP) detection. Tailoring the edges in the Forney factor graph can reduce collisions on each resource. Sphere decoding may be used to reduce the complexity of maximum likelihood (ML) detection. Node pruning may be used. Mixed-decision (hard and soft) updating during the MPA iterations can be performed. The receiver can employ successive interference cancellation (SIC), multi-user detection (MUD). Various aspects can employ artificial neural networks (ANNs), such as deep learning neural networks, convolutional neural networks, multi-layer perceptrons (MLPs), recursive neural networks (RNNs), recurrent neural networks, bi-directional RNNs, Long Short-Term Memory (LSTM) networks, Gated Recurrent Unit (GRU) networks, Convolutional Neural Networks (CNNs), and others. Codebook design can employ an ANN. A decoder might employ an ANN. It should be appreciated that the receiver shown in FIG. 4A can be adapted for MIMO reception. The receiver may be adapted according to any of the transmitter types disclosed herein, including, but not limited to GFDM and FBMC.


In one configuration, an apparatus for wireless communication includes means for receiving (e.g., a radio receiver 401) a transmission from a transmitting device, the transmission comprising an original codeword generated in a first basis by the transmitting device. A means for transforming (e.g., a linear transformation 402) transforms the original codeword from the first basis to a second basis to produce a transformed codeword, the second basis being different from the first basis. The transformed codeword is more sparsely distributed than the original codeword. A means for decoding (e.g., a joint detection decoder 403, such as an MPA decoder) performs joint detection of multiplexed layers in received transmissions, such as by employing relationships between different transformed codewords.


In another configuration, an apparatus for wireless communication includes means for transforming (e.g., 402) an original codeword in a received signal from a first basis to a second basis to produce a transformed codeword, wherein the original codeword was produced in the first basis by a transmitting device, the original codeword having a first number of non-zero values. The transformed codeword has a second number of non-zero values, the second number being smaller than the first number. A means for decoding (e.g., 403) performs joint detection of multiplexed layers in the received transmissions.


In one aspect, the first basis comprises a block of pulse waveforms, and the second basis comprises a set of subcarrier frequencies. The transformed codeword may have a frequency-domain NOMA sparsity pattern. The means for decoding can be configured to decode one of index-modulated signals and M-ary modulated codewords. The means for decoding might employ at least one factor graph corresponding to the transformed codeword to perform joint detection. The means for transforming can comprises a Fourier transform (e.g., a DFT, DTFT, or an IFFT), a filter bank, and/or a demodulator. The transmissions may include single-carrier-with-cyclic-prefix signals. The means for transforming may comprise a means for equalizing transformed signals, such as an FDE. The apparatus may further comprise means for FEC decoding (e.g., decoder 404) for decoding data bits. A means for transform parameter selection (e.g., transform parameter selector 420) may receive configuration signaling to select linear transformation parameters in the means for transforming (402).



FIG. 4B is an example implementation of a UE or TRP, which may include a variety of components, such as one or more processors 412, memory 416, and transceiver 411 in communication via one or more buses 444, which may operate in conjunction with modem 440, signal processing component 450, and signal coding/decoding component 452 to enable one or more of the functions described herein. The one or more processors 412, modem 414, memory 416, transceiver 411, RF front end 488, and one or more antennas 486 may be configured to support communications in one or more radio access technologies. The RF front end 488, transmitter 408, and modem 440 may comprise or form at least a portion of means for transmitting a communication signal. At least one of the RF front end 488, receiver 408, and modem 440 may comprise or form a portion of means for receiving a communication signal.


The various functions related to signal processing component 450 and signal coding/decoding component 452 may be included in modem 440 and/or processors 412 and may be executed by a single processor or multiple processors. Memory 416 may be configured to store data used herein and/or local versions of applications 475 or signal processing component 450 and/or one or more of its subcomponents being executed by at least one processor 412. Memory 416 can include any type of computer-readable medium usable by a computer or at least one processor 412, such as random access memory (RAM), read only memory (ROM), tapes, magnetic discs, optical discs, volatile memory, non-volatile memory, and any combination thereof. In an aspect, for example, memory 416 may be a non-transitory computer-readable storage medium that stores one or more computer-executable codes defining signal processing component 450 and/or one or more of its subcomponents, and/or data associated therewith, when the UE or TRP is operating at least one processor 412 to execute signal processing component 450 and/or one or more of its subcomponents.


Transmitter 408 and/or receiver 406 may include hardware, firmware, and/or software code executable by a processor, the code comprising instructions and being stored in a memory. The RF front end 488, may provide for receiving and transmitting radio transmissions, may include one or more low-noise amplifiers (LNAs) 490, one or more switches 492, one or more power amplifiers (PAs) 498, and one or more filters 496 for transmitting and receiving RF signals. The RF front end 488 can use one or more switches 492 to select a transmit or receive path using a specified filter 496, LNA 490, and/or PA 498, based on a configuration as specified by transceiver 411 and/or processor 412.


It is understood that the specific order or hierarchy of blocks in the processes/flowcharts disclosed is an illustration of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of blocks in the processes/flowcharts may be rearranged. Further, some blocks may be combined or omitted. The accompanying method claims present elements of the various blocks in a sample order, and are not meant to be limited to the specific order or hierarchy presented.


The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but is to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.”


Unless stated otherwise, the term “some” refers to one or more. Combinations, such as “at least one of A, B, or C,” “one or more of A, B, or C,” “at least one of A, B, and C,” “one or more of A, B, and C,” and “A, B, C, or any combination thereof” include any combination of A, B, and/or C, and may include multiples of A, multiples of B, or multiples of C. Specifically, combinations such as “at least one of A, B, or C,” “one or more of A, B, or C,” “at least one of A, B, and C,” “one or more of A, B, and C,” and “A, B, C, or any combination thereof” may be A only, B only, C only, A and B, A and C, B and C, or A and B and C, where any such combinations may contain one or more member or members of A, B, or C. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims.

Claims
  • 1. A method of communication by a wireless device configured for communicating in a wireless network, comprising: selecting at least one direct-sequence code corresponding to a layer or a data symbol; andmodulating a block of pulse waveforms with the at least one direct-sequence code to produce a discrete-time signal;wherein the at least one direct-sequence code provides the discrete-time signal with a frequency-domain sparsity pattern configured for non-orthogonal multiple access (NOMA).
  • 2. The method of claim 1, wherein selecting comprises: adjusting the at least one direct-sequence code to effect a change in at least one of the discrete-time signal's frequency-domain properties; or combining a plurality of direct-sequence codes to provide the at least one direct-sequence code with the frequency-domain sparsity pattern or to provide the discrete-time signal with a low peak-to-average-power ratio.
  • 3. The method of claim 1, wherein modulating comprises: selecting at least one physical parameter of the block of pulse waveforms to provide at least one signal attribute to the discrete-time signal; the at least one physical parameter comprising period, number of periods, pulse width, pulse shape, roll-off factor, or sample rate; and the at least one signal attribute comprising numerology, symbol length, number of physical resource blocks, number of subcarriers, number of slots per subframe, slot length, peak-to-average-power ratio, total bandwidth, subcarrier bandwidth, subcarrier spacing, subcarrier pulse-shaping, duty cycle, roll-off, out-of-band leakage, cyclic prefix length, or cyclic suffix length.
  • 4. The method of claim 1, wherein modulating comprises: selecting a prototype pulse waveform having a spectrum comprising a plurality of subcarrier frequencies; modulating a symbol from the at least one direct-sequence code onto each of a plurality of waveforms based on the prototype pulse waveform, to generate a plurality of modulated waveforms; and combining the modulated waveforms to produce the block of pulse waveforms.
  • 5. The method of claim 1, wherein at least one of selecting and modulating is responsive to configuration signaling received from an upper layer.
  • 6. The method of claim 1, further comprising pulse-shape filtering the at least one direct-sequence code; or spreading data symbols to be modulated onto the at least one direct-sequence code.
  • 7. The method of claim 1, wherein the discrete-time signal is an orthogonal frequency division multiplexing (OFDM), a filter bank multi-carrier (FBMC), a generalized frequency division multiplexing (GFDM), a super-position coding NOMA (SPC-NOMA), a sparse code multiple access (SCMA), a pattern division multiple access (PDMA), or an interleave division multiple access (IDMA) signal.
  • 8. An apparatus for wireless communication, comprising: a non-transitory computer-readable memory; and at least one processor coupled to the non-transitory computer-readable memory and configured for: selecting at least one direct-sequence code corresponding to a layer or a data symbol; andmodulating a block of pulse waveforms with the at least one direct-sequence code to produce a discrete-time signal;wherein the at least one direct-sequence code provides the discrete-time signal with a frequency-domain sparsity pattern configured for non-orthogonal multiple access (NOMA).
  • 9. The apparatus of claim 8, wherein selecting comprises: adjusting the at least one direct-sequence code to effect a change in at least one of the discrete-time signal's frequency-domain properties; or combining a plurality of direct-sequence codes to provide the at least one direct-sequence code with the frequency-domain sparsity pattern or to provide the discrete-time signal with a low peak-to-average-power ratio.
  • 10. The apparatus of claim 8, wherein modulating comprises: selecting at least one physical parameter of the block of pulse waveforms to provide at least one signal attribute to the discrete-time signal; the at least one physical parameter comprising period, number of periods, pulse width, pulse shape, roll-off factor, or sample rate; and the at least one signal attribute comprising numerology, symbol length, number of physical resource blocks, number of subcarriers, number of slots per subframe, slot length, peak-to-average-power ratio, total bandwidth, subcarrier bandwidth, subcarrier spacing, subcarrier pulse-shaping, duty cycle, roll-off, out-of-band leakage, cyclic prefix length, or cyclic suffix length.
  • 11. The apparatus of claim 8, wherein modulating comprises: selecting a prototype pulse waveform having a spectrum comprising a plurality of subcarrier frequencies; modulating a symbol from the at least one direct-sequence code onto each of a plurality of waveforms based on the prototype pulse waveform, to generate a plurality of modulated waveforms; and combining the modulated waveforms to produce the block of pulse waveforms.
  • 12. The apparatus of claim 8, wherein at least one of selecting and modulating is responsive to configuration signaling received from an upper layer.
  • 13. The apparatus of claim 8, wherein the at least one processor is configured for pulse-shape filtering the at least one direct-sequence code; or spreading data symbols to be modulated onto the at least one direct-sequence code.
  • 14. The apparatus of claim 8, wherein the discrete-time signal is an orthogonal frequency division multiplexing (OFDM), a filter bank multi-carrier (FBMC), a generalized frequency division multiplexing (GFDM), a super-position coding NOMA (SPC-NOMA), a sparse code multiple access (SCMA), a pattern division multiple access (PDMA), or an interleave division multiple access (IDMA) signal.
  • 15. An apparatus for wireless communication, comprising: a direct-sequence controller for selecting at least one direct-sequence code corresponding to a layer or a data symbol;a pulse-shaping filter for generating a block of circular-shifted pulse waveforms; anda modulator for modulating the block with the at least one direct-sequence code to produce a discrete-time signal;wherein the at least one direct-sequence code provides the discrete-time signal with a frequency-domain sparsity pattern configured for non-orthogonal multiple access (NOMA).
  • 16. The apparatus of claim 15, wherein the direct-sequence controller is configured for: adjusting the at least one direct-sequence code to effect a change in at least one of the discrete-time signal's frequency-domain properties; or combining a plurality of direct-sequence codes to provide the at least one direct-sequence code with the frequency-domain sparsity pattern or to provide the discrete-time signal with a low peak-to-average-power ratio.
  • 17. The apparatus of claim 15, wherein the pulse-shaping filter selects at least one physical parameter of the block of pulse waveforms to provide at least one signal attribute to the discrete-time signal; the at least one physical parameter comprising period, number of periods, pulse width, pulse shape, roll-off factor, or sample rate; and the at least one signal attribute comprising numerology, symbol length, number of physical resource blocks, number of subcarriers, number of slots per subframe, slot length, peak-to-average-power ratio, total bandwidth, subcarrier bandwidth, subcarrier spacing, subcarrier pulse-shaping, duty cycle, roll-off, out-of-band leakage, cyclic prefix length, or cyclic suffix length.
  • 18. The apparatus of claim 15, wherein the pulse-shaping filter selects a prototype pulse waveform having a spectrum comprising a plurality of subcarrier frequencies; and the modulator modulates a symbol from the at least one direct-sequence code onto each of a plurality of waveforms based on the prototype pulse waveform, to generate a plurality of modulated waveforms; and wherein the modulated waveforms are combined by the modulator or the pulse-shaping filter to produce the block of pulse waveforms.
  • 19. The apparatus of claim 15, wherein at least one of the direct-sequence controller and modulator is responsive to configuration signaling received from an upper layer.
  • 20. The apparatus of claim 15, further comprising at least one filter configured for pulse-shape filtering the at least one direct-sequence code, or spreading data symbols to be modulated onto the at least one direct-sequence code.
  • 21. The apparatus of claim 15, wherein the discrete-time signal is an orthogonal frequency division multiplexing (OFDM), a filter bank multi-carrier (FBMC), a generalized frequency division multiplexing (GFDM), a super-position coding NOMA (SPC-NOMA), a sparse code multiple access (SCMA), a pattern division multiple access (PDMA), or an interleave division multiple access (IDMA) signal.
CROSS REFERENCE TO PRIOR APPLICATIONS

This application claims the priority benefit of U.S. Patent Application Ser. No. 62/853,051, filed on May 26, 2019, which is expressly incorporated by reference herein in its entirety.

US Referenced Citations (477)
Number Name Date Kind
4164714 Swanson Aug 1979 A
4471399 Udren Sep 1984 A
4479226 Prabhu et al. Oct 1984 A
4550402 Gable et al. Oct 1985 A
4590511 Bocchi et al. May 1986 A
4628517 Schwarz Dec 1986 A
4700341 Huang Oct 1987 A
4827480 Kowalski May 1989 A
4912422 Kobayashi et al. Mar 1990 A
4943973 Werner Jul 1990 A
5003545 Kowalski Mar 1991 A
5016242 Tang May 1991 A
5093863 Galand et al. Mar 1992 A
5125100 Katznelson Jun 1992 A
5191459 Thompson et al. Mar 1993 A
5249201 Posner et al. Sep 1993 A
5282222 Fattouche et al. Jan 1994 A
5309514 Johnson et al. May 1994 A
5406551 Saito et al. Apr 1995 A
5410538 Roche et al. Apr 1995 A
5412648 Fan May 1995 A
5425049 Dent et al. Jun 1995 A
5457557 Zarem et al. Oct 1995 A
5463376 Stoffer Oct 1995 A
5491727 Petit Feb 1996 A
5504783 Tomisato et al. Apr 1996 A
5519692 Hershey May 1996 A
5521937 Kondo et al. May 1996 A
5528581 De Bot Jun 1996 A
5533012 Fukasawa et al. Jul 1996 A
5543806 Wilkinson Aug 1996 A
5548582 Brajal et al. Aug 1996 A
5555268 Fattouche et al. Sep 1996 A
5563906 Hershey et al. Oct 1996 A
5579304 Sugimoto et al. Nov 1996 A
5612978 Blanchard et al. Mar 1997 A
5630154 Bolstad et al. May 1997 A
5640698 Shen et al. Jun 1997 A
5691832 Liedenbaum et al. Nov 1997 A
5694393 Kaye Dec 1997 A
5704013 Watari et al. Dec 1997 A
5712716 Vanoli et al. Jan 1998 A
5765097 Dail Jun 1998 A
5790516 Gudmundson et al. Aug 1998 A
5793413 Hylton et al. Aug 1998 A
5793759 Rakib et al. Aug 1998 A
5815801 Hamalainen et al. Sep 1998 A
5818619 Medved et al. Oct 1998 A
5822368 Wang Oct 1998 A
5828658 Ottersten et al. Oct 1998 A
5831977 Dent Nov 1998 A
5838268 Frenkel et al. Nov 1998 A
5844951 Proakis et al. Dec 1998 A
5862189 Huisken et al. Jan 1999 A
5931893 Dent et al. Aug 1999 A
5940196 Piehler et al. Aug 1999 A
5940379 Startup et al. Aug 1999 A
5943332 Liu et al. Aug 1999 A
5955983 Li Sep 1999 A
5955992 Shattil Sep 1999 A
5960032 Letaief et al. Sep 1999 A
5991334 Papadopoulos et al. Nov 1999 A
6008760 Shattil Dec 1999 A
6018317 Dogan et al. Jan 2000 A
6047190 Haleem et al. Apr 2000 A
6055432 Haleem et al. Apr 2000 A
6058105 Hochwald May 2000 A
6075812 Cafarella et al. Jun 2000 A
6084871 Engstrom et al. Jul 2000 A
6088351 Jenkin et al. Jul 2000 A
6091967 Kruys et al. Jul 2000 A
6097712 Secord et al. Aug 2000 A
6097773 Carter et al. Aug 2000 A
6107954 Li Aug 2000 A
6122295 Kato et al. Sep 2000 A
6128276 Agee Oct 2000 A
6128350 Shastri et al. Oct 2000 A
6130918 Humphrey et al. Oct 2000 A
6141393 Thomas et al. Oct 2000 A
RE36944 Li Nov 2000 E
6144711 Raleigh et al. Nov 2000 A
6154443 Huang et al. Nov 2000 A
6175550 van Nee et al. Jan 2001 B1
6175551 Awater et al. Jan 2001 B1
6178158 Suzuki et al. Jan 2001 B1
6188717 Kaiser et al. Feb 2001 B1
6192068 Fattouche et al. Feb 2001 B1
6208295 Dogan et al. Mar 2001 B1
6211671 Shattil Apr 2001 B1
6215983 Dogan et al. Apr 2001 B1
6233248 Sautter et al. May 2001 B1
6236642 Shaffer et al. May 2001 B1
6240129 Reusens et al. May 2001 B1
6243565 Smith et al. Jun 2001 B1
6243581 Jawanda Jun 2001 B1
6252909 Tzannes et al. Jun 2001 B1
6266702 Darnell et al. Jul 2001 B1
6282167 Michon et al. Aug 2001 B1
6292473 Duske et al. Sep 2001 B1
6301221 Paterson Oct 2001 B1
6307892 Jones et al. Oct 2001 B1
6310704 Dogan et al. Oct 2001 B1
6320897 Fattouche et al. Nov 2001 B1
6331837 Shattil Dec 2001 B1
6351499 Paulraj et al. Feb 2002 B1
6359923 Agee et al. Mar 2002 B1
6377566 Cupo et al. Apr 2002 B1
6389034 Guo et al. May 2002 B1
6405147 Fera Jun 2002 B1
6421528 Rosen et al. Jul 2002 B1
6434390 Rahman Aug 2002 B2
6438173 Stantchev et al. Aug 2002 B1
6442130 Jones, IV et al. Aug 2002 B1
6442193 Hirsch Aug 2002 B1
6442222 Ghazi-Moghadam et al. Aug 2002 B1
6452981 Raleigh et al. Sep 2002 B1
6459740 Lo Oct 2002 B1
6463295 Yun Oct 2002 B1
6470055 Feher Oct 2002 B1
6473393 Ariyavisitakul et al. Oct 2002 B1
6473418 Laroia et al. Oct 2002 B1
6496290 Lee Dec 2002 B1
6504862 Yang et al. Jan 2003 B1
6507319 Sikina Jan 2003 B2
6510133 Uesugi Jan 2003 B1
6512737 Agee Jan 2003 B1
6526105 Harikumar et al. Feb 2003 B1
6532224 Dailey Mar 2003 B1
6549581 Izumi et al. Apr 2003 B1
6563881 Sakoda et al. May 2003 B1
6567482 Popovic May 2003 B1
6567982 Howe et al. May 2003 B1
6570913 Chen May 2003 B1
6603827 Bottomley et al. Aug 2003 B2
6606351 Dapper et al. Aug 2003 B1
6631175 Harikumar et al. Oct 2003 B2
6636495 Tangemann Oct 2003 B1
6650645 Scott et al. Nov 2003 B2
6654408 Kadous et al. Nov 2003 B1
6654719 Papadias Nov 2003 B1
6662024 Walton et al. Dec 2003 B2
6665521 Gorday et al. Dec 2003 B1
6667714 Solondz Dec 2003 B1
6674810 Cheng Jan 2004 B1
6674999 Ramachandran Jan 2004 B2
6678318 Lai Jan 2004 B1
6686879 Shattil Feb 2004 B2
6687511 McGowan et al. Feb 2004 B2
6693984 Andre et al. Feb 2004 B1
6694154 Molnar et al. Feb 2004 B1
6704794 Kejriwal et al. Mar 2004 B1
6717908 Vijayan et al. Apr 2004 B2
6728295 Nallanathan et al. Apr 2004 B1
6747946 Kaneko et al. Jun 2004 B1
6751187 Walton et al. Jun 2004 B2
6757344 Carleton et al. Jun 2004 B2
6760373 Gross et al. Jul 2004 B2
6778514 Boccussi et al. Aug 2004 B1
6785513 Sivaprakasam Aug 2004 B1
6813485 Sorrells et al. Nov 2004 B2
6832251 Gelvin et al. Dec 2004 B1
6850481 Wu et al. Feb 2005 B2
6859506 McCorkle Feb 2005 B1
6859641 Collins et al. Feb 2005 B2
6907270 Blanz Jun 2005 B1
6928047 Xia Aug 2005 B1
6944168 Paatela et al. Sep 2005 B2
6980768 Arend et al. Dec 2005 B2
6982968 Barratt et al. Jan 2006 B1
6985533 Attallah et al. Jan 2006 B2
6996076 Forbes et al. Feb 2006 B1
7010015 Hervey Mar 2006 B2
7010048 Shattil Mar 2006 B1
7020110 Walton et al. Mar 2006 B2
7031309 Sautter et al. Apr 2006 B1
7031371 Lakkis Apr 2006 B1
7035661 Yun Apr 2006 B1
7057555 Lewis Jun 2006 B2
7075999 Redfern Jul 2006 B2
7076168 Shattil Jul 2006 B1
7082153 Balachandran et al. Jul 2006 B2
7099268 Ichihara et al. Aug 2006 B2
7139321 Giannakis et al. Nov 2006 B2
7149211 Bennett et al. Dec 2006 B2
7154936 Bjerke et al. Dec 2006 B2
7155255 Blum et al. Dec 2006 B2
7158504 Kadaba et al. Jan 2007 B2
7194766 Noehring et al. Mar 2007 B2
7197084 Ketchum et al. Mar 2007 B2
7263133 Miao Aug 2007 B1
7283799 Shattil Oct 2007 B2
7286604 Shattil Oct 2007 B2
7295509 Laroia et al. Nov 2007 B2
7317750 Shattil Jan 2008 B2
7376074 Jung et al. May 2008 B2
7391804 Shattil Jun 2008 B2
7406261 Shattil Jul 2008 B2
7418043 Shattil Aug 2008 B2
7430257 Shattil Sep 2008 B1
7469013 Bolt et al. Dec 2008 B1
7508798 Tong et al. Mar 2009 B2
7570956 Bigham et al. Aug 2009 B2
7594010 Dohler et al. Sep 2009 B2
7606137 Shattil Oct 2009 B2
7787514 Shattil Aug 2010 B2
7801247 Onggosanusi et al. Sep 2010 B2
7876729 Grilli et al. Jan 2011 B1
7907588 Schaepperle et al. Mar 2011 B2
8102907 Kim Jan 2012 B2
8107965 Hui et al. Jan 2012 B2
8284757 Berggren Oct 2012 B2
8301139 Lotze et al. Oct 2012 B2
8320301 Walton et al. Nov 2012 B2
8345693 Kim Jan 2013 B1
8363739 Ma et al. Jan 2013 B2
8391913 Zimmer et al. Mar 2013 B2
8396153 Shen et al. Mar 2013 B1
8416837 Wu et al. Apr 2013 B2
8472335 De Pasquale et al. Jun 2013 B2
8498647 Gorokhov et al. Jul 2013 B2
8526400 Tong et al. Sep 2013 B2
8670390 Shattil Mar 2014 B2
8780830 Doppler et al. Jul 2014 B2
8885628 Palanki et al. Oct 2014 B2
8929550 Shattil Jan 2015 B2
8942082 Shattil Jan 2015 B2
8976838 Jaeckel et al. Mar 2015 B2
9025684 Jeong et al. May 2015 B2
9026790 Bolton et al. May 2015 B2
9042468 Barbu et al. May 2015 B2
9130810 Laroia et al. Sep 2015 B2
9210020 Guillemette Dec 2015 B1
9225471 Shattil Dec 2015 B2
9485063 Shattil Nov 2016 B2
9584206 Kim et al. Feb 2017 B2
9628231 Shattil Apr 2017 B2
9693339 Palanki et al. Jun 2017 B2
9712272 Zhu et al. Jul 2017 B2
9768842 Shattil Sep 2017 B2
9798329 Shattil Oct 2017 B2
9800448 Shattil Oct 2017 B1
9819449 Shattil Nov 2017 B2
9831936 Kim et al. Nov 2017 B2
9942013 Malladi et al. Apr 2018 B2
10003486 Zhu et al. Jun 2018 B2
10090978 Sun et al. Oct 2018 B2
10117120 Sun et al. Oct 2018 B2
10148332 Stirling-Gallacher et al. Dec 2018 B2
10149318 Sun et al. Dec 2018 B2
10181934 Chen et al. Jan 2019 B2
10211892 Shattil Feb 2019 B2
10257791 Hojeij et al. Apr 2019 B2
10263660 Sun et al. Apr 2019 B2
10285169 Sun et al. May 2019 B2
10320427 Ueng et al. Jun 2019 B2
10326560 Kim et al. Jun 2019 B2
10396930 Jung et al. Aug 2019 B2
10425198 Baligh et al. Sep 2019 B2
10432345 Shin et al. Oct 2019 B2
10447518 Bayesteh et al. Oct 2019 B2
10461910 Nammi et al. Oct 2019 B1
10516554 Rajatheva Dec 2019 B2
10523324 Cheng et al. Dec 2019 B2
10523383 Ma et al. Dec 2019 B2
10523482 Chaudhuri et al. Dec 2019 B2
10548115 Lee et al. Jan 2020 B2
10554353 Zhao et al. Feb 2020 B2
10560959 Kumar et al. Feb 2020 B2
10568143 Delfeld et al. Feb 2020 B2
10574315 Lee et al. Feb 2020 B2
10587999 Gitlin et al. Mar 2020 B2
10602507 Nammi et al. Mar 2020 B2
10608850 Hormati et al. Mar 2020 B2
10623069 Bayesteh et al. Apr 2020 B2
10630455 Shieh et al. Apr 2020 B2
10630512 Eroz et al. Apr 2020 B2
10630513 Lei et al. Apr 2020 B2
10637606 Shin et al. Apr 2020 B2
10651961 Sun et al. May 2020 B2
10651988 Kim et al. May 2020 B2
10660093 Schellmann et al. May 2020 B2
10666374 Nammi et al. May 2020 B2
10700912 Herath et al. Jun 2020 B2
10701685 Abdoli et al. Jun 2020 B2
10708888 Ren et al. Jul 2020 B2
10721114 Herath et al. Jul 2020 B2
10727897 Gau et al. Jul 2020 B2
10736081 Wu et al. Aug 2020 B2
10736138 Lee et al. Aug 2020 B2
10756932 Lee et al. Aug 2020 B2
20020009096 Odenwalder Jan 2002 A1
20020034191 Shattil Mar 2002 A1
20020044524 Laroia et al. Apr 2002 A1
20020051433 Affes et al. May 2002 A1
20020061068 Leva et al. May 2002 A1
20020118727 Kim et al. Aug 2002 A1
20020118781 Thomas et al. Aug 2002 A1
20020127978 Khatri Sep 2002 A1
20020137472 Quinn et al. Sep 2002 A1
20020168016 Wang et al. Nov 2002 A1
20020172184 Kim et al. Nov 2002 A1
20020172213 Laroia et al. Nov 2002 A1
20020181509 Mody et al. Dec 2002 A1
20020193146 Wallace et al. Dec 2002 A1
20020196733 Shen et al. Dec 2002 A1
20030026222 Kotzin Feb 2003 A1
20030043732 Walton et al. Mar 2003 A1
20030072380 Huang Apr 2003 A1
20030086363 Hernandes May 2003 A1
20030128658 Walton et al. Jul 2003 A1
20030133469 Brockmann et al. Jul 2003 A1
20030147655 Shattil Aug 2003 A1
20030154262 Kaiser et al. Aug 2003 A1
20030169824 Chayat Sep 2003 A1
20030206527 Yim Nov 2003 A1
20030218973 Oprea et al. Nov 2003 A1
20040013101 Akin et al. Jan 2004 A1
20040017824 Koenck Jan 2004 A1
20040047405 Boesel et al. Mar 2004 A1
20040057501 Balachandran et al. Mar 2004 A1
20040086027 Shattil May 2004 A1
20040100897 Shattil May 2004 A1
20040141548 Shattil Jul 2004 A1
20040151109 Batra et al. Aug 2004 A1
20040223476 Jose et al. Nov 2004 A1
20040243258 Shattil Dec 2004 A1
20050058098 Klein et al. Mar 2005 A1
20050075081 Catreux-Erceg et al. Apr 2005 A1
20050078742 Cairns et al. Apr 2005 A1
20050198199 Dowling Sep 2005 A1
20050255808 Ahmed et al. Nov 2005 A1
20050259627 Song et al. Nov 2005 A1
20050265275 Howard et al. Dec 2005 A1
20050265293 Ro et al. Dec 2005 A1
20050270968 Feng et al. Dec 2005 A1
20050286476 Crosswy et al. Dec 2005 A1
20060023803 Perlman et al. Feb 2006 A1
20060057958 Ngo et al. Mar 2006 A1
20060153283 Scharf et al. Jul 2006 A1
20060262870 Khan Nov 2006 A1
20070041311 Baum et al. Feb 2007 A1
20070041404 Palanki et al. Feb 2007 A1
20070071125 Tan et al. Mar 2007 A1
20070081580 Breiling Apr 2007 A1
20070078924 Hassan et al. May 2007 A1
20070140102 Oh et al. Jun 2007 A1
20070160014 Larsson Jul 2007 A1
20070177681 Choi et al. Aug 2007 A1
20070183386 Muharemovic et al. Aug 2007 A1
20070211807 Han et al. Sep 2007 A1
20080095121 Shattil Apr 2008 A1
20080151743 Tong et al. Jun 2008 A1
20080298502 Xu et al. Dec 2008 A1
20080310484 Shattil Dec 2008 A1
20090092182 Shin et al. Apr 2009 A1
20090110033 Shattil Apr 2009 A1
20090147870 Lin et al. Jun 2009 A1
20090156252 Harris Jun 2009 A1
20090274103 Yang et al. Nov 2009 A1
20090304108 Kwon et al. Dec 2009 A1
20100039928 Noh et al. Feb 2010 A1
20100041350 Zhang et al. Feb 2010 A1
20100056200 Tolonen Mar 2010 A1
20100080112 Bertrand et al. Apr 2010 A1
20100091919 Xu et al. Apr 2010 A1
20100098042 Dent Apr 2010 A1
20100110875 No et al. May 2010 A1
20100165829 Narasimha et al. Jul 2010 A1
20100184369 Cho et al. Jul 2010 A1
20100185541 Hassan et al. Jul 2010 A1
20100254484 Hamaguchi et al. Oct 2010 A1
20100254497 To et al. Oct 2010 A1
20100317343 Krishnamurthy et al. Dec 2010 A1
20110041021 Khoshnevis et al. Feb 2011 A1
20110096658 Yang et al. Apr 2011 A1
20110135016 Ahn et al. Jun 2011 A1
20110206207 Priotti Aug 2011 A1
20110228878 Sorrentino Sep 2011 A1
20110281534 Liao et al. Nov 2011 A1
20120014392 Bhushan et al. Jan 2012 A1
20120057660 Nguyen et al. Mar 2012 A1
20120087393 Jeong et al. Apr 2012 A1
20120113816 Bhattad et al. May 2012 A1
20120188994 Palanki et al. Jul 2012 A1
20120213054 Hamaguchi et al. Aug 2012 A1
20120224517 Yun et al. Sep 2012 A1
20120250740 Ling Oct 2012 A1
20120252387 Haskins et al. Oct 2012 A1
20120269285 Jeong et al. Oct 2012 A1
20120294346 Kolze Nov 2012 A1
20130058239 Wang et al. Mar 2013 A1
20130077508 Axmon et al. Mar 2013 A1
20130142275 Baik et al. Jun 2013 A1
20130315211 Balan et al. Nov 2013 A1
20140064392 Jonsson et al. Mar 2014 A1
20140086186 Hamaguchi et al. Mar 2014 A1
20140140360 Nikopour et al. May 2014 A1
20140198863 Terry Jul 2014 A1
20140348253 Mobasher et al. Nov 2014 A1
20150009971 Han et al. Jan 2015 A1
20150043540 Nikopour et al. Feb 2015 A1
20150103723 Kim et al. Apr 2015 A1
20150195840 Ahn et al. Jul 2015 A1
20150271000 Yang et al. Sep 2015 A1
20150282185 Nikopour et al. Oct 2015 A1
20150304153 Moffatt et al. Oct 2015 A1
20150358190 Kruglick et al. Dec 2015 A1
20160006594 Persson et al. Jan 2016 A1
20160050039 Ma et al. Feb 2016 A1
20160050096 DelMarco Feb 2016 A1
20160050099 Siohan et al. Feb 2016 A1
20160119073 Vilaipornsawai et al. Apr 2016 A1
20160134400 Yi et al. May 2016 A1
20160191216 Ma et al. Jun 2016 A1
20160197756 Mestdagh et al. Jul 2016 A1
20160254889 Shattil Sep 2016 A1
20160254937 Bayesteh et al. Sep 2016 A1
20160269083 Porat et al. Sep 2016 A1
20160270042 Nikopour et al. Sep 2016 A1
20160277156 Bayesteh et al. Sep 2016 A1
20160286529 Ma et al. Sep 2016 A1
20160295589 Nikopour et al. Oct 2016 A1
20160353446 Abdoli et al. Dec 2016 A1
20170019222 Ge et al. Jan 2017 A1
20170019284 Ankarali et al. Jan 2017 A1
20170026218 Shattil Jan 2017 A1
20170034845 Liu et al. Feb 2017 A1
20170054480 Shattil Feb 2017 A1
20170126454 Huan et al. May 2017 A1
20170126455 Vilaipornsa et al. May 2017 A1
20170126458 Shattil May 2017 A1
20170127423 Boroujeni et al. May 2017 A1
20170134202 Baligh et al. May 2017 A1
20170134235 Wu et al. May 2017 A1
20170201406 Wu et al. Jul 2017 A1
20170244535 Islam et al. Aug 2017 A1
20170250848 Lee et al. Aug 2017 A1
20170251479 Abdoli et al. Aug 2017 A1
20170257204 Shi et al. Sep 2017 A1
20170264474 He et al. Sep 2017 A1
20170272210 Zhang Sep 2017 A1
20170279648 Song et al. Sep 2017 A1
20170289920 Liu et al. Oct 2017 A1
20170289984 Baligh et al. Oct 2017 A1
20170295000 Yoo et al. Oct 2017 A1
20170295500 Sun et al. Oct 2017 A1
20170302500 Lu et al. Oct 2017 A1
20170317799 Yi et al. Nov 2017 A1
20170353340 Raphaeli et al. Dec 2017 A1
20180013526 Bayesteh et al. Jan 2018 A1
20180048349 Sun et al. Feb 2018 A1
20180054334 Sun et al. Feb 2018 A1
20180062904 Hwang et al. Mar 2018 A1
20180091338 Mayer et al. Mar 2018 A1
20180092086 Nammi et al. Mar 2018 A1
20180109408 Sandell et al. Apr 2018 A1
20180123763 Yu May 2018 A1
20180124715 Xu et al. May 2018 A1
20180145790 Xu et al. May 2018 A1
20180167244 Cheng et al. Jun 2018 A1
20180191543 Park et al. Jul 2018 A1
20180192439 Tang et al. Jul 2018 A1
20180205591 Wang et al. Jul 2018 A1
20180212809 Bakulin et al. Jul 2018 A1
20180212810 Park et al. Jul 2018 A1
20180288809 Delfeld et al. Oct 2018 A1
20180309609 Zhu et al. Oct 2018 A1
20190020520 Bakulin et al. Jan 2019 A1
20190036657 Zhao et al. Jan 2019 A1
20190158338 Herath May 2019 A1
20190173556 Zhou et al. Jun 2019 A1
20190182307 Abdoli et al. Jun 2019 A1
20190190753 Bayesteh Jun 2019 A1
20200052820 Chen et al. Feb 2020 A1
20200053789 Lee et al. Feb 2020 A1
20200127715 Sheng et al. Apr 2020 A1
20200153570 Peng et al. May 2020 A1
Foreign Referenced Citations (6)
Number Date Country
2763321 Aug 2014 EP
2449690 Jan 2016 EP
H08331093 Dec 1996 JP
2012-100323 May 2012 JP
10-2010-0019974 Feb 2010 KR
0237771 May 2002 WO
Non-Patent Literature Citations (90)
Entry
H. Prakash, C.D.Suriyakala; “PAPR Reduction in MIMO SC-FDMA-A Survey”; Int. J Rec. Adv. Sci. Tech., 2015; 2(2):11-19.
E. Hajlaoui, M. Abdellaoui; “SOCP Approach for Reducing PAPR for MIMO-OFDM Via Tone Reservation”; International Journal of Distributed and Parallel Systems (IJDPS) vol. 2, No. 3, May 2011.
J. Shin, B. Seo; “PAPR Reduction Scheme for MISO and MIMO OFDM Systems with Limited Feedback”; WSEAS Transactions on Communications 13:355-362—Jan. 2014.
D. Sinanovic, et al.; “Low PAPR Spatial Modulation for SC-FDMA”; IEEE Transactions on Vehicular Technology; vol. 66, Issue: 1, Jan. 2017.
G.H. Karande, et al.; “Peak-to-Average Power Reduction in MIMO-OFDM Systems using SLM technique”; IPASJ International Journal of Electronics & Communication (IIJEC); vol. 2, Issue 8, Aug. 2014.
M. Lieberei, U. Zolzer; “Time Domain PAPR Reduction in MIMO-OFDM Spatial Multiplexing Systems”; in Proceedings of the 14th International OFDM-Workshop (InOWo'09), S. 218-222, 2009.
M. Vu, A. Paulraj; “MIMO Wireless Linear Precoding”; IEEE Signal Processing Magazine. Submitted Feb. 2006, revised Nov. 2006 and Dec. 2006.
H.G. Myung, et al.; “Peak Power Characteristics of Single Carrier FDMA MIMO Precoding System”; 2007 IEEE 66th Vehicular Technology Conference, Sep. 30-Oct. 3, 2007.
B. Naik, et al.; “Reduction of PAPR in MIMO-OFDM/A System Using Polyphase Complementary Modulation”; International Journal of Innovative Research in Computer and Communication Engineering; vol. 2, Issue 5, May 2014.
A.S. Parihar, A. Rai; “A Review: PAPR Reduction Techniques in MIMO OFDM System”; International Journal of Engineering and Innovative Technology (IJEIT); vol. 4, Issue 12, Jun. 2015.
B. Rihawi, Y.Louet; “PAPR Reduction Scheme with SOCP for MIMO-OFDM Systems”; I. J. Communications, Network and System Sciences. 2008; 1: 1-103; Published Online Feb. 2008 in SciRes (http://www.SRPublishing.org/journal/ijcns/).
C.A. Devlin, et al.; “Peak to Average Power Ratio Reduction Technique for OFDM Using Pilot Tones and Unused Carriers”; 2008 IEEE Radio and Wireless Symposium; Year: 2008; pp. 33-36.
K Mhatre, U.P. Khot; “Efficient Selective Mapping PAPR Reduction Technique”; International Conference on Advanced Computing Technologies and Applications (ICACTA-2015); Procedia Computer Science 45 ( 2015 ) 620-627.
K. Srinivasarao, et al.; “Peak-to-Average Power Reduction in MIMO-OFDM Systems Using Sub-optimal Algorithm”; International Journal of Distributed and Parallel Systems (IJDPS) vol. 3, No. 3, May 2012.
K. Xu, et al.; “Beamforming MISO-OFDM PAPR Reduction: A Space-User Perspective”; 2007 IEEE International Conference on Acoustics, Speech and Signal Processing—ICASSP '07, Apr. 15-20, 2007.
H. Zhang, D.L. Goeckel; “Peak Power Reduction in Closed-Loop MIMO-OFDM, Systems via Mode Reservation”; IEEE Communications Letters, vol. 11, No. 7, Jul. 2007.
C.L. Wang, Y. Ouyang; “Low-Complexity Selected Mapping Schemes for Peak-to-Average Power Ratio Reduction in OFDM Systems”; IEEE Transactions on Signal Processing, vol. 53, No. 12, Dec. 2005.
P. Sindhu, G. Krishnareddy; “Peak and Average Power Reduction in OFDM System with Trellis Shaping Method”; International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering; vol. 6, Issue 7, Jul. 2017.
H-B Jeon, et al.; “Bit-Based SLM Schemes for PAPR Reduction in QAM Modulated OFDM Signals”; IEEE Transactions on Broadcasting, vol. 55, No. 3, Sep. 2009.
H-B Jeon, et al.; “A Low-Complexity SLM Scheme Using Additive Mapping Sequences for PAPR Reduction of OFDM Signals”; IEEE Transactions on Broadcasting, vol. 57, No. 4, Dec. 2011.
S-J Heo, et al.; “A Modified SLM Scheme With Low Complexity for PAPR Reduction of OFDM Systems”; IEEE Transactions on Broadcasting, vol. 53, No. 4, Dec. 2007.
M.I. Abdullah, et al.; “Comparative Study of PAPR Reduction Techniques in OFDM”; ARPN Journal of Systems and Software; vol. 1, No. 8, Nov. 2011.
E. Abdullah, et al.; “Modified selective mapping scheme with low complexity for minimizing high peakaverage power ratio in orthogonal frequency division multiplexing system”; AIP Conference Proceedings 1774, 050005 (2016).
S.T. O'Hara, J.R. Periard; “Orthogonal-Coded Selective Mapping (OCSM) for OFDM Peakto-Average Power Reduction Without Side Information”; Proceeding of the SDR 04 Technical Conference and Product Exposition 2004, Syracuse, NY, Technology Center—Syracuse Research Corporation. 2004.
P. Sharma, S. Verma; “PAPR Reduction of OFDM Signals Using Selective Mapping With Turbo Codes”; International Journal of Wireless & Mobile Networks (IJWMN) vol. 3, No. 4, Aug. 2011.
D. Wiegandt et al., “Overcoming peak-to-average power ratio issues in OFDM via carrier-interferometry codes”, VTC 2001 Fall. IEEE VTS 54th Vehicular Technology Conference, 2001, vol. 2, pp. 660-663, Oct. 7-11, 2001.
B. Natarajan, et al. “Crest factor considerations in MC-CDMA with carrier interferometry codes”, PACRIM. 2001 IEEE Communications Pacific Rim Conference on Computers and signal Processing, 2001, vol. 2, pp. 445-448 Aug. 26-28, 2001.
C.R. Nassar et al., “High-Performance Broadband DS-CDMA via Carrier Interferometry Chip Shaping,” 2000 Int'l Symposium on Advanced Radio Technologies, Boulder, CO, Sep. 6-8, 2000.
C.R. Nassar, B. Natarajan, S. Shattil, “Introduction of carrier interference to spread spectrum multiple access,” Wireless Communications and Systems, 1999 Emerging Technologies Symposium Apr. 12-13, 1999 pp. 4.1-4.5.
B. Natarajan, C.R. Nassar, S. Shattil, M. Michelini, and Z. Wu; “High-Performance MC-CDMA Via Carrier Interferometry Codes,” Vehicular Technology, IEEE Transactions on; vol. 50, Issue 6, Nov. 2001, pp. 1344-1353.
Z. Wu, B. Natarajan, C.R. Nassar, S. Shattil; “High-performance, high-capacity MC-CDMA via carrier interferometry,” Personal, Indoor and Mobile Radio Communications, 2001 12th IEEE International Symposium on; vol. 2, Sep. 30-Oct. 3, 2001 pp. G-11-G-16.
S.A. Zekavat, C.R. Nassar, S. Shattil; “The merger of a single oscillating-beam smart antenna and MC-CDMA: transmit diversity, frequency diversity and directionality,” Broadband Communications for the Internet Era Symposium digest, 2001 IEEE Emerging Technologies Symposium on Sep. 10-11, 2001 pp. 107-112.
B. Natarajan, C.R. Nassar, S. Shattil; “Enhanced Bluetooth and IEEE 802.11 (FH) via multi-carrier implementation of the physical layer,” Broadband Communications for the Internet Era Symposium digest, 2001 IEEE Emerging Technologies Symposium on; Sep. 10-11, 2001 pp. 129-133.
Z. Wu; C.R. Nassar, S. Shattil; “Ultra wideband DS-CDMA via innovations in chip shaping,” Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th; vol. 4, Oct. 7-11, 2001 pp. 2470-2474.
B. Natarajan, C.R. Nassar, S. Shattil; “Innovative pulse shaping for high-performance wireless TDMA,” Communications Letters, IEEE vol. 5, Issue 9, Sep. 2001 pp. 372-374.
B. Natarajan, C.R. Nassar and S.Shattil; “Throughput Enhancement in TDMA through Carrier Interference Pulse Shaping,” IEEE Vehicular technology Conference Proceedings, vol. 4, Fall 2000, Boston, Sep. 24-28, 2000, pp. 1799-1803.
V. Thippavajjula, B.Natarajan; “Parallel Interference Cancellation Techniques for Synchronous Carrier Interferometry/MC-CDMA Uplink”; IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. Sep. 26-29, 2004.
A. Serener, et al.; “Performance of Spread OFDM with LDPC Coding in Outdoor Environments”; 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No. 03CH37484), Oct. 6-9, 2003.
LTE: Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (3GPP TS 36.212 version 8.8.0 Release 8), Jan. 2010.
LTE: Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (3GPP TS 36.211 version 8.7.0 Release 8), Jun. 2009.
B. Natarajan, C.R. Nassar and S.Shattil; “CI/FSK: Bandwidth-Efficient Multicarrier FSK for High Performance, High Throughput, and Enhanced Applicability”; IEEE Transactions on Communications, vol. 52, No. 3, Mar. 2004.
G. Wunder, K.G. Paterson; “Crest-Factor Analysis of Carrier Interferometry MC-CDMA and OFDM systems”; International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Jun. 27-Jul. 2, 2004.
B.Natarajan, C.R. Nassar “Crest Factor Reduction in MC-CDMA Employing Carrier Interferometry Codes”; EURSAP Journal on Wireless Comm. and Networking 2004:2, 374-379.
A.J. Best, B.Natarajan; “The Effect of Jamming on the Performance of Carrier Interferometry/OFDM”; WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005. Aug. 22-24, 2005.
S. Hijazi, et al.; “Enabling FCC's Proposed Spectral Policy via Carrier Interferometry”; 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat No. 04TH8733). Mar. 21-25, 2004.
Z. Wu, et al.; “FD-MC-CDMA: A Frequency-based Multiple Access Architecture for High Performance Wireless Communication”; Proceedings RAWCON 2001. 2001 IEEE Radio and Wireless Conference (Cat.No. 01EX514). Aug. 19-22, 2001.
P. Barbosa, et al.; “High-Performance MIMO-OFDM via Carrier Interferometry”; GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No. 03CH37489). Dec. 1-5, 2003.
D.A. Wiegandt, C.R. Nassar; “High-Throughput, High-Performance OFDM via Pseudo-Orthogonal Carrier Interferometry”; 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No. 01TH8598) Oct. 3-Sep. 30, 2001.
D.A. Wiegandt, C.R. Nassar; “High-Throughput, High-Performance OFDM via Pseudo-Orthogonal Carrier Interferometry Type 2”; The 5th International Symposium on Wireless Personal Multimedia Communications. Oct. 27-30, 2002.
D.A. Wiegandt, C.R. Nassar; “High-Throughput, High-Performance OFDM via Pseudo-Orthogonal Carrier Interferometry Spreading Codes”; IEEE Transactions on Communications, vol. 51, No. 7, pp. 1123-1134. Jul. 2003.
T. Dias, R.C. de Lamare; “Study of Unique-Word Based GFDM Transmission Systems”; https://arxiv.org/pdf/1805.10702.pdf, May 27, 2018.
R. Ferdian, et al.; “Efficient Equalization Hardware Architecture for SC-FDMA Systems without Cyclic Prefix”; 2012 International Symposium on Communications and Information Technologies (ISCIT): pp. 936-941, Oct. 2012.
M. Au, et al.; “Joint Code-Frequency Index Modulation for IoT and Multi-User Communications”; IEEE Journal of Selected Topics in Signal Processing (vol. 13, Issue: 6, Oct. 2019).
D.A. Wiegandt, C.R. Nassar; “Higher-Speed, Higher-Performance 802.11a Wireless LAN via Carrier-Interferometry Orthogonal Frequency Division Multiplexing”; 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat No. 02CH37333). Apr. 28-May 2, 2002.
Z. Wu, et al.; “High-Performance 64-QAM OFDM via Carrier Interferometry Spreading Codes”; 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No. 03CH37484). Oct. 6-9, 2003
B.Natarajan, C.R. Nassar and S.Shattil; “High-Throughput High-Performance TDMA Through Pseudo-Orthogonal Carrier Interferometry Pulse Shaping”; IEEE Transactions on Wireless Communications, vol. 3, No. 3, May 2004.
B.Natarajan, C.R. Nassar; “Introducing Novel FDD and FDM in MC-CDMA to Enhance Performance”; RAWCON 2000. 2000 IEEE Radio and Wireless Conference (Cat. No. 00EX404). 13-13 Sep. 2000.
B.Natarajan, Z Wu, C.R. Nassar and S.Shattil; “Large Set of CI Spreading Codes for High-Capacity MC-CDMA”; IEEE Transactions on Communications, vol. 52, No. 11, Nov. 2004.
B.Natarajan, C.R. Nassar, Z Wu; “Multi-carrier platform for wireless communications. Part 1: High-performance, high-throughput TDMA and DS-CDMA via multi-carrier implementations”; Wireless Communications and Mobile Computing; Wirel. Commun. Mob. Comput. 2002; 2:357-379 (DOI: 10.1002/wcm.51) Jun. 18, 2002.
S.A. Zekavat, C.R. Nassar and S.Shattil; “Merging Multicarrier CDMA and Oscillating-Beam Smart Antenna Arrays: Exploiting Directionality, Transmit Diversity, and Frequency Diversity”; IEEE Transactions on Communications, vol. 52, No. 1, pp. 110-119, Jan. 2004.
C.R. Nassar, B.Natarajan, Z. Wu, D. Wiegandt, and S.Shattil; Multi-Carrier Technologies for Wireless Communication; Kluwer Academic Publishers 2002.
B.Natarajan, C.R. Nassar, S. Shattil; “Novel Multi-Carrier Implementation of FSK for Bandwidth Efficient, High Performance Wireless Systems”; 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No. 02CH37333) Apr. 28-May 2, 2002.
D.A. Wiegandt, C.R. Nassar, Z. Wu; “Overcoming Peak-to-Average Power Ratio Issues in OFDM via Carrier-Interferometry Codes”; IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No. 01CH37211), Oct. 7-11, 2001.
D.A. Wiegandt, C.R. Nassar; “Peak-to-Average Power Reduction in High-Performance, High-Throughput OFDM via Pseudo-Orthogonal Carrier-Interferometry Coding”; PACRIM. 2001 IEEE Pacific Rim Conference on, vol. 2, Feb. 2001.
X. Lin, et al.; “5G New Radio: Unveiling the Essentials of the Next Generation Wireless Access Technology”; IEEE Communications Standards Magazine ( vol. 3 , Issue: 3 , Sep. 2019 ) pp. 30-37. Dec. 6, 2019.
“D2.2 Architecture, system and interface definitions of a 5G for Remote Area network”; Project website: http://5g-range.eu; Version 1 date Apr. 26, 2018.
R. Rani, et al.; “Peak-to-Average Power Ratio Analysis of SCFDMA Signal by Hybrid Technique”; International Journal of Computer Applications (0975-8887) vol. 69—No. 15, May 2013.
H. Kim, et al.; “Multiple Access for 5G New Radio: Categorization, Evaluation, and Challenges”; arXiv:1703.09042 [cs.IT], Mar. 27, 2017.
A. Anand, et al.; “Joint Scheduling of URLLC and eMBB Traffic in 5G Wireless Networks”; IEEE INFOCOM 2018—IEEE Conference on Computer Communications; Apr. 16-19, 2018.
M. Bennis, et al.; “Ultra-Reliable and Low-Latency Wireless Communication: Tail, Risk and Scale”; Proceedings of the IEEE ( vol. 106 , Issue: 10 , Oct. 2018 ).
B.G. Agee; “Efficient Allocation of RF Transceiver Resources in Spatially Adaptable Communication Networks”; SDR Forum/MPRG Workshop on Advanced in Smart Antennas for Software Radios, At Virginia Polytechnic Institute, Blacksburg, VA.
C.A. Azurdia-Meza, et al.; “PAPR reduction in SC-FDMA by pulse shaping using parametric linear combination pulses”; IEEE Communications Letters, vol. 16, No. 12, Dec. 2012.
C.A. Azurdia-Meza, et al.; “PAPR Reduction in Single Carrier FDMA Uplink by Pulse Shaping Using a β-α Filter”; Wireless Pers Commun 71, 23-44 (2013). https://doi.org/10.1007/s11277-012-0794-0; Aug. 9, 2012.
A Hamed, et al.; “Bandwidth and Power efficiency analysis of fading communication link”; 2016 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS); Jul. 24-27, 2016.
Y. Akhtman, L Hanzo; “Power Versus Bandwidth Efficiency in Wireless Communications: from Economic Sustainability to Green Radio”; China Communications 7(2)   Apr. 2010.
L. Militano, et al.; “Device-to-Device Communications for 5G Internet of Things”; EAI Endorsed Transactions on Internet of Things; Ghent vol. 1, Iss. 1, (Oct. 2015).
M. Vergara, et al.; “Multicarrier Chip Pulse Shape Design With Low PAPR”; 21st European Signal Processing Conference (EUSIPCO 2013); Sep. 9-13, 2013.
C. Liu, et al.; “Experimental demonstration of high spectral efficient 4 x 4 MIMO SCMA-OFDM/OQAM radio over multi-core fiber system”; Optics Express 18431, vol. 25, No. 15 | Jul. 24, 2017.
F. Wei, et al.; “Message-Passing Receiver Design for Joint Channel Estimation and Data Decoding in Uplink Grant-Free SCMA Systems”; IEEE Transactions on Communications, vol. 18 , Issue: 1 , Jan. 2019: Nov. 6, 2018.
H. Jiang, et al.; “Distributed Layered Grant-Free Non-Orthogonal Multiple Access for Massive MTC”; 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC); Sep. 9-12, 2018.
S. Sengar, P.B. Bhattacharya; “Performance Improvement in OFDM System by PAPR Reduction Using Pulse Shaping Technique”; International Journal of Emerging Technology and Advanced Engineering, vol. 2, Issue 12, Dec. 2012.
B.H. Alhassoun; “Peak-To-Average-Power-Ratio (PAPR) Reduction Techniques For Orthogonal-Frequency-Division-Multiplexing (OFDM) Transmission”; Thesis, University of Denver, Jun. 1, 2012.
A. Boonkajay, et al.; “Performance Evaluation of Low-PAPR Transmit Filter for Single-Carrier Transmission”; 2012 18th Asia-Pacific Conference on Communications (APCC); Oct. 15-17, 2012.
D. Das; “Peak to Average Power Ratio Reduction in OFDM Using Pulse Shaping Technique”; Computer Engineering and Applications vol. 5, No. 2, ISSN: 2252-5459 (Online) Jun. 2016.
D. Wulich, et al.; “Peak to Average Power Ratio in Digital Communications”; https://www.academia.edu/6222108/Peak_to_Average_Power_Ratio_in_Digital_Communications 2005.
S. Singh, et al.; “Analysis of Roll-Off-Factor to Reduce the PAPR in SC-FDMA System”; International Journal of Computational Intelligence Techniques, ISSN: 0976-0466 & E-ISSN: 0976-0474, vol. 3, Issue 2, 2012, pp. 76-78.
M. Mahlouji, T. Mahmoodi; “Analysis of Uplink Scheduling for Haptic Communications”; arXiv:1809.09837 [cs.NI], Sep. 26, 2018.
K. Au, et al.; “Uplink Contention Based SCMA for 5G Radio Access”; 2014 IEEE Globecom Workshops (GC Wkshps), Dec. 8-12, 2014.
S. Shah, A.R. Patel; “LTE-Single Carrier Frequency Division Multiple Access”; Jan. 1, 2010.
S.L. Ariyavisitakul, et al.; “Frequency Domain Equalization for Single-Carrier Broadband Wireless Systems”; IEEE Communications Magazine ( vol. 40 , Issue: 4 , Apr. 2002 ); pp. 58-66, Aug. 7, 2002.
Related Publications (1)
Number Date Country
20200374054 A1 Nov 2020 US
Provisional Applications (1)
Number Date Country
62853051 May 2019 US