# US 2019/0245725 A1 · Reference Signal-Free Transmission for Wireless Systems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0245725 A1
- Document ID: US20190245725A1
- Status: Published application
- Kind: A1
- Application number: 16/337,746
- Filed: 2017-09-19
- Published: 2019-08-08
- Earliest claimed: 2016-09-28
- Assignees: IDAC Holdings, Inc.
- Applicants: IDAC Holdings, Inc.
- Inventors: Alphan Sahin; Erdem Bala; Rui Yang; Mihaela C. Beluri; Moon-il Lee; Janet A. Stern-Berkowitz
- Web page: https://patentgrep.com/patent/US20190245725A1

## CPC

- H04L 27/261: {Details of reference signals}
- H04L 1/08: by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)}
- H04L 5/0007: {the frequencies being orthogonal, e.g. OFDM(A) or DMT}
- H04L 25/03127: {using only passive components (H04L25/03121 takes precedence)}
- H04L 25/03133: {with a non-recursive structure (H04L25/03127 takes precedence)}
- H04L 27/26132: {using repetition}
- H04L 27/2626: {Arrangements specific to the transmitter only}
- H04L 27/2636: {with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Systems, methods, and instrumentalities are disclosed for separating a channel and data without the use of reference signals. For example, a wireless transmit/receive unit (WTRU) may determine a first orthogonal frequency-division multiplexing (OFDM) symbol based on a data vector. The WTRU may determine a second OFDM symbol by applying a circular time-inverse operation and a conjugate operation to the first OFDM symbol. The WTRU may send the first OFDM symbol and the second OFDM symbol. The first and the second OFDM symbols may be sent to consecutively. Discrete Fourier Transform (DFT)-spread and nonlinear preprocessing (exponential transformation at the transmitter) may be used and/or peak-to-average power ratio (PAPR) may be reduced via randomizer block at the receiver.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A wireless transmit/receive unit (WTRU), the WTRU comprising:
a memory; and
a processor, the processor being configured to:
determine a data vector to be sent;
generate a padded data vector by attaching one or more zeros to two ends of the data vector;
generate a preprocessed data vector by performing a Discrete Fourier Transform (DFT)-spread operation on the padded data vector;
generate a processed data vector by performing an exponential precoder operation and a point-to-point multiplication with one or more random coefficients on the preprocessed data vector; and
send the processed data vector.

### Claim 22 (depends on 21)

The WTRU of claim 21, wherein the processor is further configured to perform a permutation operation on the data vector.

### Claim 23 (depends on 21)

The WTRU of claim 21, wherein performing the point-to-point multiplication with one or more random coefficients on the preprocessed data vector reduces a peak to average power ratio (PAPR).

### Claim 24 (depends on 21)

The WTRU of claim 21, wherein the one or more random coefficients are based on at least a predefined criterion.

### Claim 25 (depends on 21)

The WTRU of claim 21, wherein attaching one or more zeros to two ends of the data vector prevents damage to a data symbol after a littering operation.

### Claim 26 (depends on 21)

The WTRU of claim 21, wherein the processor is further configured to add one or more guard subcarriers to the processed data vector.

### Claim 27 (depends on 21)

The WTRU of claim 21, wherein the processor is further configured to add one or more guard subcarriers to the one or more random coefficients.

### Claim 28 (depends on 21)

The WTRU of claim 21, wherein the processor is further configured to perform a Fourier matrix with a Hermitian operation upon the one or more random coefficients.

### Claim 29 (depends on 21)

The WTRU of claim 21, wherein the processor is further configured to perform a cyclic prefix (CP) operation on the processed data vector.

### Claim 30

A method for sending a processed data vector, the method comprising:
determining, at a wireless transmit/receive unit (WTRU), a data vector to be sent;
generating, at the WTRU, a padded data vector by attaching one or more zeros to two ends of the data vector;
generating, at the WTRU, a preprocessed data vector by performing a Discrete Fourier Transform (DFT)-spread operation on the padded data vector;
generating, at the WTRU, a processed data vector by performing an exponential precoder operation and a point-to-point multiplication with one or more random coefficients on the preprocessed data vector; and
sending, by the WTRU, the processed data vector.

### Claim 31 (depends on 30)

The method of claim 30, further comprising performing a permutation operation on the data vector.

### Claim 32 (depends on 30)

The method of claim 30, wherein performing the point-to-point multiplication with one or more random coefficients on the preprocessed data vector reduces a peak to average power ratio (PAPR).

### Claim 33 (depends on 30)

The method of claim 30, wherein the one or more random coefficients are based on at least a predefined criterion.

### Claim 34 (depends on 30)

The method of claim 30, wherein attaching one or more zeros to two ends of the data vector prevents damage to a data symbol after a liftering operation.

### Claim 35 (depends on 30)

The method of claim 30, further comprising adding one or more guard subcarriers to the processed data vector.

### Claim 36 (depends on 30)

The method of claim 30, further comprising adding one or more guard subcarriers to the one or more random coefficients.

### Claim 37 (depends on 30)

The method of claim 30, further comprising performing a Fourier matrix with a Hermitian operation upon the one or more random coefficients.

### Claim 38 (depends on 30)

The method of claim 30, further comprising performing a cyclic prefix (CP) operation on the processed data vector.
