IP Library › Granted Patent US 12,438,637
Granted Patent B2
US 12,438,637 · App. 18/377,984 · Granted Oct 7, 2025

Methods and apparatus for lattice-based signal modulation using a generalization of polar codes

Inventors: Matthew Brandon Robinson (Millersville, MD); Stephen Douglas Mackes (Crofton, MD)
Assignee: Rampart Communications, Inc.
H04L1/0057H04L27/366H03M13/13
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,438,637
App. No.
18/377,984
Granted
Oct 7, 2025
Kind
B2
Abstract

A method includes receiving a bit string at a processor, performing an error correction, and causing transmission of a modulated signal. The error correction includes identifying a set of binary strings based on the bit string, mapping each binary string from the set of binary strings to a first abelian group element from a set of first abelian group elements, and applying a generalization of polar codes to the set of first abelian group elements to produce a set of second abelian group elements. The error correction also includes mapping each of the second abelian group elements to an in-phase/quadrature (I/Q) point from a set of I/Q points and identifying real-valued points based on the set of I/Q points, each of the real-valued points representing an I/Q point from the set of I/Q points. The modulated signal has a modulation that is based on the real-valued points.

Claims (44)

1. A non-transitory, processor-readable medium storing instructions that, when executed by a processor, cause the processor to:

receive a bit string;

perform an error correction by:

identifying a plurality of binary strings based on the bit string,

mapping each binary string from the plurality of binary strings to a first abelian group element from a plurality of first abelian group elements,

applying a generalization of polar codes to the plurality of first abelian group elements to produce a plurality of second abelian group elements,

mapping each second abelian group element from the plurality of second abelian group elements to an in-phase/quadrature (I/Q) point from a plurality of I/Q points; and

identifying a plurality of real-valued points based on the plurality of I/Q points, each real-valued point from the plurality of real-valued points representing an I/Q point from the plurality of I/Q points; and

cause transmission of a signal having a modulation based on the plurality of real-valued points.

2. The non-transitory, processor-readable medium of claim 1 , wherein the plurality of I/Q points is included in a lattice-based signal constellation.

3. The non-transitory, processor-readable medium of claim 1 , wherein the modulation is a Quadrature Amplitude Modulation (QAM).

4. The non-transitory, processor-readable medium of claim 1 , further storing instructions to cause the processor to apply at least one of a permutation or a bijection to each binary string from the plurality of binary strings prior to performing the mapping of the second abelian group elements to the plurality of I/Q points.

5. The non-transitory, processor-readable medium of claim 4 , wherein the at least one of the permutation or the bijection includes at least one of a gray code or a reverse gray code.

6. The non-transitory, processor-readable medium of claim 1 , wherein the plurality of I/Q points is a lattice-based signal constellation, the non-transitory, processor-readable medium further storing instructions to cause the processor to reduce an order of an effective constellation associated with the lattice-based signal constellation to a subgroup using partial freezing of at least one binary string from the plurality of binary strings.

7. The non-transitory, processor-readable medium of claim 1 , wherein the generalization of polar codes includes a systematic code.

8. The non-transitory, processor-readable medium of claim 1 , wherein the plurality of first abelian group elements is associated with a first bit length and the plurality of second abelian group elements is associated with a second bit length different than the first bit length.

9. A method comprising:

receiving a bit string;

identifying a plurality of binary strings based on the bit string;

mapping each binary string from the plurality of binary strings to a first abelian group element from a plurality of first abelian group elements;

applying a generalization of polar codes to the plurality of first abelian group elements to produce a plurality of second abelian group elements;

mapping each second abelian group element from the plurality of second abelian group elements to an in-phase/quadrature (I/Q) point from a plurality of I/Q points;

identifying a plurality of real-valued points based on the plurality of I/Q points, each real-valued point from the plurality of real-valued points representing an I/Q point from the plurality of I/Q points; and

transmitting a signal having a modulation based on the plurality of real-valued points.

10. The method of claim 9 , wherein the plurality of I/Q points is included in a lattice-based signal constellation.

11. The method of claim 9 , further comprising applying at least one of a permutation or a bijection to each binary string from the plurality of binary strings prior to performing the mapping of the second abelian group elements to the plurality of I/Q points.

12. The method of claim 11 , wherein the at least one of the permutation or the bijection includes at least one of a gray code or a reverse gray code.

13. The method of claim 9 , wherein the plurality of I/Q points is a lattice-based signal constellation, the method further comprising reducing an order of an effective constellation associated with the lattice-based signal constellation to a subgroup using partial freezing of at least one binary string from the plurality of binary strings.

14. The method of claim 9 , wherein the plurality of first abelian group elements is associated with a first bit length and the plurality of second abelian group elements is associated with a second bit length different than the first bit length.

15. An apparatus comprising:

a communication interface configured to transmit and receive wireless signals; and

a processor configured to:

receive a bit string;

identify a plurality of binary strings based on the bit string,

map each binary string from the plurality of binary strings to a first abelian group element from a plurality of first abelian group elements,

apply a generalization of polar codes to the plurality of first abelian group elements to produce a plurality of second abelian group elements,

map each second abelian group element from the plurality of second abelian group elements to an in-phase/quadrature (I/Q) point from a plurality of I/Q points;

identify a plurality of real-valued points based on the plurality of I/Q points, each real-valued point from the plurality of real-valued points representing an I/Q point from the plurality of I/Q points; and

cause the communication interface to transmit a signal having a modulation based on the plurality of real-valued points.

16. The apparatus of claim 15 , wherein the plurality of I/Q points is included in a lattice-based signal constellation.

17. The apparatus of claim 15 , wherein the processor is further configured to apply at least one of a permutation or a bijection to each binary string from the plurality of binary strings prior to performing the mapping of the second abelian group elements to the plurality of I/Q points.

18. The apparatus of claim 17 , wherein the at least one of the permutation or the bijection includes at least one of a gray code or a reverse gray code.

19. The apparatus of claim 15 , wherein the plurality of I/Q points is a lattice-based signal constellation, the processor further configured to reduce an order of an effective constellation associated with the lattice-based signal constellation to a subgroup using partial freezing of at least one binary string from the plurality of binary strings.

20. The apparatus of claim 15 , wherein the plurality of first abelian group elements is associated with a first bit length and the plurality of second abelian group elements is associated with a second bit length different than the first bit length.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 18, 2023
From: ROBINSON, MATTHEW BRANDON; MACKES, STEPHEN DOUGLAS
To: RAMPART COMMUNICATIONS, INC.
Reel/Frame 065270/0945 →
Continuity (2)
Provisional Application 63414666 · Oct 10, 2022
Related Publication 20240146452A1 · May 2, 2024
References Cited (42)
US 7036071B2 · Shany et al. · 2006 [cited by applicant]
US 7606320B2 · Chae et al. · 2009 [cited by applicant]
US 8660208B2 · Brillant · 2014 [cited by examiner]
US 8989283B1 · Dabiri · 2015 [cited by applicant]
US 9172578B1 · Dabiri · 2015 [cited by applicant]
US 9692456B1 · Dabiri · 2017 [cited by applicant]
US 10523489B1 · Sharpe · 2019 [cited by examiner]
US 11121808B2 · Chatterjee · 2021 [cited by examiner]
US 12184306B2 · Iqbal · 2024 [cited by examiner]
US 20120082023A1 · Higuchi · 2012 [cited by examiner]
US 20190258936A1 · Shamir · 2019 [cited by examiner]
US 20230291632A1 · Robinson et al. · 2023 [cited by applicant]
US 20240146334A1 · Niu · 2024 [cited by examiner]
EP 1608081A2 · 2005 [cited by applicant]
WO WO2023164435A1 · 2023 [cited by applicant]
Chen et al., A New Construction of Nonbinary Polar Codes with Two-stage Polarization, Jan. 24, 2018, 5 pages, https://arxiv.org/pdf/1801.08059v1 (Year: 2018). [cited by examiner]
Şaşoǧlu, E., et al., “Polarization for arbitrary discrete memoryless channels”, 2009 IEEE Information Theory Workshop, IEEE (2009); 1-12. [cited by applicant]
Şaşoǧlu, E., “Polar codes for discrete alphabets”, 2012 IEEE International Symposium on Information Theory Proceedings, IEEE, (2012); 2137-2141. [cited by applicant]
Blake, I. F., “The Leech lattice as a code for the Gaussian channel”, Information and Control (1971); 19(1): 66-74. [cited by applicant]
Choi, J., et al., “Spatial lattice modulation for MIMO systems” ,IEEE Transactions on Signal Processing (Jun. 15, 2018); 66(12): 3185-3198. [cited by applicant]
Conway, J., et al., “A fast encoding method for lattice codes and quantizers”, IEEE Transactions on Information Theory (Nov. 1983); IT-29(6): 820-824. [cited by applicant]
Conway, J., et al., “Fast quantizing and decoding and algorithms for lattice quantizers and codes”, IEEE Transactions on Information Theory (Mar. 1982); IT-28(2): 227-232. [cited by applicant]
Costello, D. J., et al., “Channel coding: The road to channel capacity”, Proceedings of the IEEE (2007); 95(6): 1150-1177. [cited by applicant]
Forney, G. D., “A bounded-distance decoding algorithm for the Leech lattice, with generalizations”, IEEE Transactions on Information Theory (Jul./Aug. 1989); 35(4): 906-909. [cited by applicant]
Forney, G. D., “Coset codes. I. Introduction and geometrical classification”, IEEE Transactions on Information Theory (Sep. 1988); 34(5): 1123-1151. [cited by applicant]
Forney, G. D., “Coset codes. II. Binary lattices and related codes”, IEEE Transactions on Information Theory (Sep. 1988); 34(5): 1152-1187. [cited by applicant]
Forney, G. D., et al., “Efficient modulation for band-limited channels”, IEEE Journal On Selected Areas In Communications (Sep. 1984); SAC-2(5): 632-647. [cited by applicant]
Forney, G. D., et al., “Modulation and coding for linear Gaussian channels”, IEEE Transactions on Information Theory (Oct. 1998); 44(6): 2384-2415. [cited by applicant]
Forney, G. D., et al., “Multidimensional constellations—Part 1: Introduction, figures of merit, and generalized cross constellations”, IEEE Journal on Selected Areas in Communications (1989); 7(6): 877-892. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2023/062953, mailed on Jun. 7, 2023, 17 pages. [cited by applicant]
Khandani, A. K., et al., “An efficient block-based addressing scheme for the nearly optimum shaping of multidimensional signal spaces”, IEEE Transactions on Information Theory (Nov. 1995); 41(6): 2026-2031. [cited by applicant]
Khandani, A. K., et al., “Shaping multidimensional signal spaces. I. Optimum shaping, shell mapping”, IEEE Transactions on Information Theory (Nov. 1993); 39(6): 1799-1808. [cited by applicant]
Khandani, A. K., et al., “Shaping multidimensional signal spaces. II. Shell-addressed constellations.” IEEE Transactions on Information Theory (Nov. 1993); 39(6): 1809-1819. [cited by applicant]
Lang, G. R., et al., “A Leech lattice modem”, IEEE Journal on Selected Areas in Communications (Aug. 1989); 7(6): 968-973. [cited by applicant]
Mirani, A., et al., “Low-complexity geometric shaping”, Journal of Lightwave Technology (2020); 39(2): 363-371. [cited by applicant]
Sahebi, A. G., et al., “Multilevel polarization of polar codes over arbitrary discrete memoryless channels”, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE (2011); 1-41. [cited by applicant]
Shannon, C. E., “Probability of error for optimal codes in a Gaussian channel”, Bell System Technical Journal (May 1959); 38(3): 611-656. [cited by applicant]
Stern, S., et al., “Lattice-reduction-aided precoding for coded modulation over algebraic signal constellations”, WSA 2016; 20th International ITG Workshop on Smart Antennas, VDE, Munich, Germany (Mar. 9-11, 2016); 8 pa… [cited by applicant]
Ungerboeck, G., “Channel coding with multilevel/phase signals”, IEEE transactions on Information Theory (Jan. 1982); IT-28(1): 55-67. [cited by applicant]
Wachsmann, U., et al., “Multilevel codes: Theoretical concepts and practical design rules”, IEEE Transactions on Information Theory (Jul. 1999); 45(5): 1361-1391. [cited by applicant]
Wu, H., et al., “A lattice based approach to the construction of multi-dimensional signal constellations”, Acta Electronica Sinica (Sep. 2014); 42(9): 1672-1679 with English Abstract. [cited by applicant]
Zamir, R., “Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory”, Cambridge University Press (2014); 1-21; 39 pages. [cited by applicant]
Cited By (1)
US 12,699,627