IP Library › Granted Patent US 11,356,119
Granted Patent B2
US 11,356,119 · App. 17/247,211 · Granted Jun 7, 2022

Noncoherent wireless communication using modified Reed Muller codes

Inventors: Wei Yang (San Diego, CA); Peter Gaal (San Diego, CA); Yi Huang (San Diego, CA); Krishna Kiran Mukkavilli (San Diego, CA); Tingfang Ji (San Diego, CA)
Assignee: QUALCOMM Incorporated
H03M13/136H03M13/27H04L1/0003H04L27/2082H04L27/2613
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 11,356,119
App. No.
17/247,211
Granted
Jun 7, 2022
Kind
B2
Abstract

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a wireless communication device may generate a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits. The wireless communication device may remove, from the Reed Muller generating matrix, a row vector consisting of all 1-values to form a modified Reed Muller generating matrix. The wireless communication device may encode the information bit vector using the modified Reed Muller generating matrix to form a codeword. The wireless communication device may transmit the codeword without transmitting a pilot signal or demodulation reference signal for the codeword. Numerous other aspects are provided.

Claims (90)

1. A method of wireless communication performed by a wireless communication device, comprising:

generating a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits;

removing, from the Reed Muller generating matrix, a row vector consisting of all 1-values to form a modified Reed Muller generating matrix;

encoding the information bit vector using the modified Reed Muller generating matrix to form a codeword; and

transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

2. The method of claim 1 , wherein transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword comprises:

determining that a coding rate to be used for the information bit vector satisfies a coding rate threshold; and

transmitting, based at least in part on determining that the coding rate satisfies the coding rate threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

3. The method of claim 1 , wherein transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword comprises:

determining that a quantity of bits included in the information bit vector satisfies a quantity threshold; and

transmitting, based at least in part on determining that the quantity of bits satisfies the quantity threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

4. The method of claim 1 , wherein encoding the information bit vector using the modified Reed Muller generating matrix to form the codeword comprises:

determining a largest value for a dimension m of the codeword such that 2 m is less than or equal to a block length n of the information bit vector;

generating a 2 m -length codeword; and

cyclically repeating the 2 m -length codeword to form an n-length codeword.

5. The method of claim 4 , wherein determining a largest value for the dimension m of the codeword comprises:

determining a largest value for the dimension m of the codeword based at least in part on an upper limit for an order of the codeword.

6. The method of claim 1 , further comprising:

modulating the codeword using π/2 binary phase shift keying (BPSK) modulation or quadrature phase-shift keying (QPSK) modulation.

7. The method of claim 1 , wherein generating the Reed Muller generating matrix comprises:

generating the Reed Muller generating matrix using an order that satisfies an order threshold.

8. A method of wireless communication performed by a wireless communication device, comprising:

prepending a fixed-value bit to an information bit vector that includes a plurality of information bits;

generating a Reed Muller generating matrix for the information bit vector;

encoding, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword; and

transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

9. The method of claim 8 , wherein transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword comprises:

determining that a coding rate to be used for the information bit vector satisfies a coding rate threshold; and

transmitting, based at least in part on determining that the coding rate satisfies the coding rate threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

10. The method of claim 8 , wherein transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword comprises:

determining that a quantity of bits included in the information bit vector satisfies a quantity threshold; and

transmitting, based at least in part on determining that the quantity of bits satisfies the quantity threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

11. The method of claim 8 , wherein encoding the information bit vector using the Reed Muller generating matrix to form the codeword comprises:

determining a largest value for a dimension m of the codeword such that 2 m is less than or equal to a block length n of the information bit vector;

generating a 2 m -length codeword; and

cyclically repeating the 2 m -length codeword to form an n-length codeword.

12. The method of claim 11 , wherein determining a largest value for the dimension m of the codeword comprises:

determining a largest value for the dimension m of the codeword based at least in part on an upper limit for an order of the codeword.

13. The method of claim 8 , further comprising:

modulating the codeword using π/2 binary phase shift keying (BPSK) modulation or quadrature phase-shift keying (QPSK) modulation.

14. The method of claim 8 , wherein generating the Reed Muller generating matrix comprises:

generating the Reed Muller generating matrix using an order that satisfies an order threshold.

15. The method of claim 8 , wherein the fixed-value bit is a 0-value bit.

16. The method of claim 8 , wherein the fixed-value bit is a 1-value bit.

17. A wireless communication device for wireless communication, comprising:

a memory; and

one or more processors operatively coupled to the memory, the memory and the one or more processors configured to:

generate a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits;

remove, from the Reed Muller generating matrix, a row vector consisting of all 1-values to form a modified Reed Muller generating matrix;

encode the information bit vector using the modified Reed Muller generating matrix to form a codeword; and

transmit the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

18. The wireless communication device of claim 17 , wherein the one or more processors, when transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, are to:

determine that a coding rate to be used for the information bit vector satisfies a coding rate threshold; and

transmit, based at least in part on determining that the coding rate satisfies the coding rate threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

19. The wireless communication device of claim 17 , wherein the one or more processors, when transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, are to:

determine that a quantity of bits included in the information bit vector satisfies a quantity threshold; and

transmit, based at least in part on determining that the quantity of bits satisfies the quantity threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

20. The wireless communication device of claim 17 , wherein the one or more processors, when encoding the information bit vector using the modified Reed Muller generating matrix to form the codeword, are to:

determine a largest value for a dimension m of the codeword such that 2 m is less than or equal to a block length n of the information bit vector;

generate a 2 m -length codeword; and

cyclically repeat the 2 m -length codeword to form an n-length codeword.

21. The wireless communication device of claim 20 , wherein the one or more processors, when determining a largest value for the dimension m of the codeword are to:

determine a largest value for the dimension m of the codeword based at least in part on an upper limit for an order of the codeword.

22. The wireless communication device of claim 17 , wherein the one or more processors are further configured to:

modulate the codeword using π/2 binary phase shift keying (BPSK) modulation or quadrature phase-shift keying (QPSK) modulation.

23. The wireless communication device of claim 17 wherein the one or more processors, when generating the Reed Muller generating matrix comprises:

generate the Reed Muller generating matrix using an order that satisfies an order threshold.

24. A wireless communication device for wireless communication, comprising:

a memory; and

one or more processors operatively coupled to the memory, the memory and the one or more processors configured to:

prepend a fixed-value bit to an information bit vector that includes a plurality of information bits;

generate a Reed Muller generating matrix for the information bit vector;

encode, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword; and

transmit the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

25. The wireless communication device of claim 24 , wherein the one or more processors, when transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, are to:

determine that a coding rate to be used for the information bit vector satisfies a coding rate threshold; and

transmit, based at least in part on determining that the coding rate satisfies the coding rate threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

26. The wireless communication device of claim 24 , wherein the one or more processors, when transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, are to:

determine that a quantity of bits included in the information bit vector satisfies a quantity threshold; and

transmit, based at least in part on determining that the quantity of bits satisfies the quantity threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

27. The wireless communication device of claim 24 , wherein the one or more processors, when encoding the information bit vector using the Reed Muller generating matrix to form the codeword, are to:

determine a largest value for a dimension m of the codeword such that 2 m is less than or equal to a block length n of the information bit vector;

generate a 2 m -length codeword; and

cyclically repeat the 2 m -length codeword to form an n-length codeword.

28. The wireless communication device of claim 27 , wherein the one or more processors, when determining a largest value for the dimension m of the codeword, are to:

determine a largest value for the dimension m of the codeword based at least in part on an upper limit for an order of the codeword.

29. The wireless communication device of claim 24 , wherein the one or more processors are further configured to:

modulate the codeword using π/2 binary phase shift keying (BPSK) modulation or quadrature phase-shift keying (QPSK) modulation.

30. The wireless communication device of claim 24 , wherein the one or more processors, when generating the Reed Muller generating matrix, are to:

generate the Reed Muller generating matrix using an order that satisfies an order threshold.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2021
From: YANG, WEI; GAAL, PETER; HUANG, YI; MUKKAVILLI, KRISHNA KIRAN; JI, TINGFANG
To: QUALCOMM INCORPORATED
Reel/Frame 054930/0068 →
Continuity (2)
Provisional Application 62949329 · Dec 17, 2019
Related Publication 20210184697A1 · Jun 17, 2021