IP Library › Granted Patent US 12,348,286
Granted Patent B2
US 12,348,286 · App. 18/518,083 · Granted Jul 1, 2025

Determining a precoder for wireless communications

Inventors: Razvan-Andrei Stoica (Essen, DE); Seyedomid Taghizadeh Motlagh (Oberursel, DE); Vijay Nangia (Woodridge, IL); Ali Ramadan Ali (Munich, DE)
Assignee: Lenovo (Singapore) Pte. Ltd.
H04B7/0456
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,348,286
App. No.
18/518,083
Granted
Jul 1, 2025
Kind
B2
Abstract

Apparatuses, methods, and systems are disclosed for determining a precoder for wireless communications. An apparatus is configured to determine a precoder for a set of modulation symbols representing at least two distinct multiplexed streams of information. The precoder includes a plurality of codewords and is configured to reduce an ensemble interference and a pairwise interference for the plurality of codewords. The apparatus is configured to precode the set of modulation symbols based on the precoder and map the precoded set of modulation symbols to a set of resources. The apparatus is configured to generate a non-orthogonal multiplexed channel for access to the resources by overloading the set of modulation symbols at a transmission rate that is greater than a Nyquist rate and transmit an indication of the precoder and the set of resources.

Claims (64)

1. A network equipment (NE) for wireless communication, comprising:

at least one memory; and

at least one processor coupled with the at least one memory and configured to cause the NE to:

determine a precoder for a set of modulation symbols, the set of modulation symbols representing at least two distinct multiplexed streams of information, the precoder comprising a plurality of codewords and configured to reduce an ensemble interference and a pairwise interference for the plurality of codewords;

precode the set of modulation symbols based on the precoder;

map the precoded set of modulation symbols to a set of resources, wherein a number of modulation symbols of the set of modulation symbols is greater than a number of resources in the set of resources;

generate a non-orthogonal multiplexed channel for access to the set of resources by overloading the set of modulation symbols at a transmission rate that is greater than a Nyquist rate; and

transmit an indication of the precoder and the set of resources.

2. The NE of claim 1 , wherein the precoder compresses the set of modulation symbols, superpositions the set of modulation symbols, or combines the set of modulation symbols, or a combination thereof.

3. The NE of claim 1 , wherein the precoder comprises a codebook of N codewords selected on a surface of a complex unit M-sphere, where M is the number of resources and M<N.

4. The NE of claim 3 , wherein the codebook is based on a set of discrete harmonics on the surface of the complex unit M-sphere given by an N-th root of unity and the codebook comprises an M×N truncated N-Discrete Fourier Transform (N-DFT) linear codebook.

5. The NE of claim 4 , wherein the at least one processor is configured to cause the NE to:

select M harmonics of the set of discrete harmonics for a compressed representation of a precoded signal space of the set of modulation symbols based on a criteria, wherein the criteria comprise at least one of:

an ensemble interference magnitude and a pairwise interference magnitude for an entire search space of available discrete set of N harmonics;

partially to the ensemble interference magnitude upon the selection of any M harmonics out of the available discrete set of N harmonics; or

the ensemble interference magnitude and the pairwise interference magnitude for all possible harmonic and non-harmonic spherical codebook realizations by selecting any M harmonics of an available set of N=M+1 harmonics.

6. The NE of claim 5 , wherein a configuration of the codebook is based on a dimensionality and indices of at least one of the selected M harmonics and a pruned N−M set of discrete harmonics.

7. The NE of claim 6 , wherein the at least one processor is configured to cause the NE to:

determine the M×N truncated N-DFT linear codebook based on storage of a tabulated codebook entry comprising the set of M harmonics and at least two codebook dimension parameters selected from the group comprising M, N,

N

M

,

N−M, or any combination thereof; and

transmit a second indication of a codebook index corresponding to the tabulated codebook entry of the precoder.

8. The NE of claim 6 , wherein the at least one processor is configured to cause the NE to:

a rate, a latency, and a reliability of at least a portion of the set of modulation symbols;

channel state information (“CSI”) comprising at least a channel quality indicator (“CQI”); or

a channel coder type and a modulation and coding scheme (“MCS”).

9. The NE of claim 1 , wherein the precoder comprises a codebook of N codewords based on complex-valued approximate spherical codes that reduce the ensemble interference and pairwise codeword interference magnitude yielding an M×N linear precoding codebook, the N codewords positioned on a unit M-sphere.

10. The NE of claim 9 , wherein the at least one processor is configured to cause the NE to determine an M×N configuration of the M×N linear precoding codebook based on an indexed codebook entry, the indexed codebook entry derived on at least one of a non-decreasing index counter and a hash function representation of the M×N linear precoding codebook.

11. The NE of claim 9 , wherein to determine the precoder is further based on at least one of:

a rate, a latency, and a reliability of at least a portion of the set of modulation symbols;

channel state information (“CSI”) comprising at least a channel quality indicator (“CQI”); or

a channel coder type and a modulation and coding scheme (“MCS”).

12. The NE of claim 1 , wherein the set of modulation symbols comprises an information stream comprising at least one of:

a fixed coding rate and a modulation configuration across a transmission block (“TB”);

a dynamic coding rate and a modulation configuration across the TB; or

an additional non-negative number of information streams with distinct coding rates and modulation configurations for unequal error protection.

13. The NE of claim 1 , wherein the at least two distinct multiplexed streams of information correspond to at least two service data flows comprising services of enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), massive machine-type communications, or a combination thereof.

14. The NE of claim 1 , wherein the at least two distinct multiplexed streams of information comprise heterogeneous requirements associated with at least one of a rate, a latency, or a reliability.

15. The NE of claim 1 , wherein the at least one processor is configured to cause the NE to transmit the indication of the precoder based on one or more reference signals over one or more control channels or data channels.

16. The NE of claim 1 , wherein the at least one processor is configured to cause the NE to transmit at least a portion of a precoder codebook information corresponding to the precoder in response to receiving a second indication of at least one of an unknown or an unverified precoder corresponding to the precoder.

17. The NE of claim 1 , wherein the at least one processor is configured to cause the NE to use one of:

a layer-common precoding with a same determined precoder for each transmission layer; and

a layer-independent precoding with different precoders determined for each transmission layer.

18. A processor for wireless communication, comprising:

at least one controller coupled with at least one memory and configured to cause the processor to:

determine a precoder for a set of modulation symbols, the set of modulation symbols representing at least two distinct multiplexed streams of information, the precoder comprising a plurality of codewords and configured to reduce an ensemble interference and a pairwise interference for the plurality of codewords;

precode the set of modulation symbols based on the precoder;

map the set of modulation symbols to a set of resources, wherein a number of modulation symbols of the set of modulation symbols is greater than a number of resources in the set of resources;

generate a non-orthogonal multiplexed channel for access to the set of resources by overloading the set of modulation symbols at a transmission rate that is greater than a Nyquist rate; and

transmit an indication of the precoder and the set of resources.

19. A method performed by a network equipment (NE), the method comprising:

determining a precoder for a set of modulation symbols, the set of modulation symbols representing at least two distinct multiplexed streams of information, the precoder comprising a plurality of codewords and configured to reduce an ensemble interference and a pairwise interference for the plurality of codewords;

precoding the set of modulation symbols based on the precoder;

mapping the set of modulation symbols to a set of resources, wherein a number of modulation symbols of the set of modulation symbols is greater than a number of resources in the set of resources;

generating a non-orthogonal multiplexed channel for access to the set of resources by overloading the set of modulation symbols at a transmission rate that is greater than a Nyquist rate; and

transmitting an indication of the precoder and the set of resources.

20. A user equipment (UE) for wireless communication, comprising:

at least one memory; and

at least one processor coupled with the at least one memory and configured to cause the UE to:

receive an indication of a precoder for a set of modulation symbols, the set of modulation symbols representing at least two distinct multiplexed streams of information;

receive a set of resources, the set of resources mapped to the set of modulation symbols that are precoded using the precoder, the set of modulation symbols overloaded at a rate that is greater than a Nyquist rate based at least in part on the precoder generating a non-orthogonal multiplexed channel for the set of resources; and

use the precoder and the set of resources for transmissions.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 16, 2024
From: STOICA, RAZVAN-ANDREI; TAGHIZADEH MOTLAGH, SEYEDOMID; NANGIA, VIJAY; ALI, ALI RAMADAN
To: LENOVO (UNITED STATES) INC.
Reel/Frame 066139/0512 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 16, 2024
From: LENOVO (UNITED STATES) INC.
To: LENOVO (SINGAPORE) PTE. LTD.
Reel/Frame 066139/0528 →
Continuity (2)
Continuation 17508228 · Oct 22, 2021
Related Publication 20240097753A1 · Mar 21, 2024
References Cited (44)
US 7224744B2 · Giannakis et al. · 2007 [cited by applicant]
US 8085819B2 · Kiran et al. · 2011 [cited by applicant]
US 8121235B1 · Sun et al. · 2012 [cited by applicant]
US 8264946B2 · Narasimha et al. · 2012 [cited by applicant]
US 9294175B2 · Noh et al. · 2016 [cited by applicant]
US 9407344B2 · Ryu · 2016 [cited by examiner]
US 9439187B2 · Gresset et al. · 2016 [cited by applicant]
US 9680578B2 · Hwang et al. · 2017 [cited by applicant]
US 9847897B1 · Cheng et al. · 2017 [cited by applicant]
US 9942013B2 · Malladi et al. · 2018 [cited by applicant]
US 10003489B2 · Zheng et al. · 2018 [cited by applicant]
US 10051634B2 · Soriaga et al. · 2018 [cited by applicant]
US 10193715B2 · Hasegawa · 2019 [cited by applicant]
US 20080152003A1 · Oguz · 2008 [cited by applicant]
US 20100039928A1 · Noh et al. · 2010 [cited by applicant]
US 20120219091A1 · Li et al. · 2012 [cited by applicant]
US 20130028068A1 · Park et al. · 2013 [cited by applicant]
US 20130039447A1 · Lee et al. · 2013 [cited by applicant]
US 20140050279A1 · Kishiyama · 2014 [cited by examiner]
US 20160191174A1 · Hwang et al. · 2016 [cited by applicant]
US 20180213591A1 · Kowalski et al. · 2018 [cited by applicant]
US 20210274527A1 · Nakamura et al. · 2021 [cited by applicant]
US 20210360632A1 · Yang et al. · 2021 [cited by applicant]
WO 2017096121A1 · 2017 [cited by applicant]
I. Darwazeh et al., “A Spectrally Efficient Frequency Division Multiplexing Based Communications System”, ResearchGate Conference Paper, https://www.researchgate.net/publication/309373002, Sep. 2003, pp. 1-7. [cited by applicant]
T. Strohmer et al., “Grassmannian frames with applications to coding and communication”, Applied and Computational Harmonic Analysis, vol. 14, Mar. 26, 2003, pp. 257-275. [cited by applicant]
Etsi, “Intelligent Transport Systems (ITS); Vehicular Communications; Basic Set of Applications; Part 2: Specification of Cooperative Awareness Basic Service”, ETSI EN 302 637-2, V1.3.1, Sep. 2014, pp. 1-44. [cited by applicant]
3GPP, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Physical channels and modulation (Release 16)”, 3GPP TS 38.211 V16.2.0, Jun. 2020. [cited by applicant]
3GPP, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Physical layer procedures for data (Release 16)”, 3GPP TS 38.214 V16.2.0, Jun. 2020. [cited by applicant]
Mediatek Inc., “Summary of RAN1 Agreements for Rel-14 DL MUST”, 3GPP TSG RAN WG1 Meeting #87 R1-1613802, Nov. 14-18, 2016, pp. 1-5. [cited by applicant]
ZTE, “Key processing modules at transmitter side for Noma”, 3GPP TSG RAN WG1 Meeting #93 R1-1805840, May 21-May 25, 2018, pp. 1-11. [cited by applicant]
Qualcomm Incorporated, “Transmitter Side Signal Processing Schemes for NOMA”, 3GPP TSG RAN WG1 Meeting #94 R1-1809434, Aug. 20-24, 2018, pp. 1-11. [cited by applicant]
A. Chorti, “Rate Analysis and Deep Neural Network Detectors for SEFDM FTN Systems”, arXiv:2103.02306v1, Mar. 3, 2021, pp. 1-5. [cited by applicant]
H. Iimori, “Robust Symbol Detection in Large-Scale Overloaded NOMA Systems”, IEEE Open Journal of the Communications Society, Mar. 9, 2021, pp. 512-533. [cited by applicant]
Huawei, Hisilicon, Revised WID: Physical Layer Enhancements for NR Ultra-Reliable and Low Latency Communication (URLLC), 3GPP TSG RAN Meeting #84 RP-191584xxxx, Jun. 3-6, 2019, pp. 1-5. [cited by applicant]
T. Xu et al., “Spectrally Efficient FDM: Spectrum Saving Technique for 5G?”, 1st International Conference on 5G for Ubiquitous Connectivity, Feb. 12, 2015, pp. 1-6. [cited by applicant]
3Gpp, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Study on Downlink Multiuser Superposition Transmission (MUST) for LTE (Release 13)”, 3GPP TR 36.859 V13.0.0, Dec. 2015, pp. … [cited by applicant]
3GPP, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Study on New Radio (NR) access technology (Release 16)”, 3GPP TR 38.912 V16.0.0, Jul. 2020. [cited by applicant]
3GPP, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Study on Non-Orthogonal Multiple Access (NOMA) for NR (Release 16)”, 3GPP TR 38.812 V16.0.0, Dec. 2018, pp. 1-134. [cited by applicant]
Z. Kaleem et al., “System-Level Performance Evaluation of the SVD based Codebooks in 3GPP LTE HetNet”, IEEE Xplore, Dec. 15, 2014, pp. 968-969. [cited by applicant]
B.G. Bodmann et al., “A Quantitative Notion of Redundancy for Finite Frames”, arXiv:0910.5904v2, Nov. 19, 2009, pp. 1-19. [cited by applicant]
S.M.Alamouti, “A Simple Transmit Diversity Technique for Wireless Communications”, IEEE Journal on Select Areas in Communications, vol. 16, No. 8, October 1008, pp. 1451-1458. [cited by applicant]
Razvan-Andrei Stoica, “Frame-theoretic Designs for Future Wireless Communications”, Jacobs University, Department of Computer Science & Electrical Engineering, Sep. 3, 2019, pp. 1-226. [cited by applicant]
J.H. Conway, “Packing Lines, Planes, etc.: Packings in Grassmannian Spaces”, Experimental Mathematics, vol. 5, No. 2, 1996, pp. 139-159. [cited by applicant]
Cited By (1)
US 12,464,548