IP Library › Granted Patent US 12,609,856
Granted Patent B2
US 12,609,856 · App. 18/724,314 · Granted Apr 21, 2026

Multi-carrier connection design via intelligent exploitation of multi-user diversity in delay-doppler domain

Inventors: Armed Tusha (Beykoz, TR); Hüseyin Arslan (Beykoz, TR)
H04L27/2639H04L27/263
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,609,856
App. No.
18/724,314
Granted
Apr 21, 2026
Kind
B2
Abstract

Disclosed is a multicarrier (MC) connection design via an intelligent exploitation of the multi-user diversity in delay-Doppler domain. Overall, the technology can play a key role as an enabler technology toward 5G and beyond communications systems with applications of NR-Lite, mMTC, eMBB, URLLC and SURLLC.

Claims (10)

1 . A method for a multicarrier connection design in a system with a single orthogonal time frequency space (OTFS) with active users that are served by one base station in a downlink transmission and in which a scheduling of user equipments is organized on a slot-by-slot basis, a queue of packets being stored at the base station for each user equipment of the user equipments, the method comprising:

employing an algorithm having an objective function of max(Pu), u∈[1, 2, 3, . . . , Nu], wherein Nu is a number of the user equipments and Pu is a number of channel taps of a given user equipment, the algorithm assigning priority for transmission to the user equipment with a maximum number of channel taps;

applying an inverse symplectic Fast Fourier Transform (ISFFT) to data symbols selected by the algorithm, wherein the ISFFT converts the selected data symbols into a time-frequency domain by applying an N-point inverse Fast Fourier Transform (IFFT) to rows of the selected data symbols and applying an M-point FFT to columns of the selected data symbols;

performing a Heisenberg transform to the converted data symbols by using an M-point inverse Fast Fourier Transform over the time-frequency data symbols;

adding a cyclic prefix of a length L to the Heisenberg transformed converted data symbols, where L is a number of channel paths to a transmission of an OTFS signal;

removing the cyclic prefix after receiving the transmitted OTFS signal;

preforming a Wigner transform to the cyclic prefix removed transmitted OTFS signal to recover a time-frequency representation of the received cyclic prefix removed transmitted OTFS signal;

performing a symplectic Fast Fourier Transform to the received cyclic prefix removed transmitted OTFS signals so as to move the received signals into a delay-Doppler domain; and

mapping the delay-Doppler domain received signals into received data symbols after performing channel equalization.

2 . The method of claim 1 , wherein the method is used in a wireless system.

Priority Claims (1)
TR 2021/021038 · Dec 26, 2021 · national
Continuity (1)
Related Publication 20250007767A1 · Jan 2, 2025
References Cited (57)
US 8913676B2 · Cariou · 2014 [cited by examiner]
US 9893922B2 · Rakib · 2018 [cited by examiner]
US 10020882B2 · Uysal · 2018 [cited by examiner]
US 11616676B1 · Patchava · 2023 [cited by examiner]
US 12155593B2 · Patchava · 2024 [cited by examiner]
US 12184468B2 · Hadani · 2024 [cited by examiner]
US 12355686B2 · Sakhnini · 2025 [cited by examiner]
US 12388680B2 · Priya · 2025 [cited by examiner]
US 12519685B2 · Tusha · 2026 [cited by examiner]
US 20090052577A1 · Wang · 2009 [cited by examiner]
US 20170012749A1 · Rakib · 2017 [cited by examiner]
US 20170012810A1 · Rakib · 2017 [cited by examiner]
US 20170033899A1 · Rakib · 2017 [cited by examiner]
US 20170099122A1 · Hadani · 2017 [cited by examiner]
US 20170099607A1 · Hadani · 2017 [cited by examiner]
US 20170149594A1 · Rakib · 2017 [cited by examiner]
US 20170149595A1 · Rakib · 2017 [cited by examiner]
US 20170288710A1 · Delfeld · 2017 [cited by examiner]
US 20180227159A1 · Rakib · 2018 [cited by examiner]
US 20180262306A1 · Hadani · 2018 [cited by examiner]
US 20190182083A1 · Ashrafi · 2019 [cited by examiner]
US 20190238189A1 · Delfeld · 2019 [cited by examiner]
US 20200204410A1 · Hadani · 2020 [cited by examiner]
US 20200259692A1 · Hadani · 2020 [cited by examiner]
US 20200389268A1 · Sathyanarayan · 2020 [cited by examiner]
US 20210250138A1 · Ibars Casas · 2021 [cited by examiner]
US 20210351880A1 · Hadani · 2021 [cited by examiner]
US 20220045890A1 · Hadani · 2022 [cited by examiner]
US 20220085928A1 · Sathyanarayan · 2022 [cited by examiner]
US 20220182265A1 · Xu · 2022 [cited by examiner]
US 20220303163A1 · Ait Aoudia · 2022 [cited by examiner]
US 20230164013A1 · Kons · 2023 [cited by examiner]
US 20230336399A1 · Hadani · 2023 [cited by examiner]
US 20230379194A1 · Priya · 2023 [cited by examiner]
US 20230412443A1 · Pfadler · 2023 [cited by examiner]
US 20240056343A1 · Sathyanarayan · 2024 [cited by examiner]
US 20240118432A1 · Pfadler · 2024 [cited by examiner]
US 20240163140A1 · Wang · 2024 [cited by examiner]
US 20240187298A1 · Hadani · 2024 [cited by examiner]
US 20240195547A1 · Sakhnini · 2024 [cited by examiner]
US 20240235915A1 · Lin · 2024 [cited by examiner]
US 20240267171A1 · Patchava · 2024 [cited by examiner]
US 20240333574A1 · Ryu · 2024 [cited by examiner]
US 20240364447A1 · Hadani · 2024 [cited by examiner]
US 20240422046A1 · Tusha · 2024 [cited by examiner]
US 20250007767A1 · Tusha · 2025 [cited by examiner]
US 20250047430A1 · Tusha · 2025 [cited by examiner]
US 20250055729A1 · Zegrar · 2025 [cited by examiner]
US 20250142413A1 · Aygül · 2025 [cited by examiner]
US 20250144660A1 · Sezer · 2025 [cited by examiner]
US 20250158972A1 · Madni · 2025 [cited by examiner]
US 20250240157A1 · Aygül · 2025 [cited by examiner]
CN 108770382A · 2018 [cited by applicant]
EP 3378187A1 · 2018 [cited by applicant]
WO 2019113046A1 · 2019 [cited by applicant]
International Search Report for corresponding PCT/TR2021/051586, dated Jul. 27, 2022. [cited by applicant]
Written Opinion of the International Searching Authority for corresponding PCT/TR2021/051586, dated Jul. 27, 2022. [cited by applicant]