IP Library Granted Patent US 12,255,724
Granted Patent B2
US 12,255,724 · App. 17/411,015 · Granted Mar 18, 2025

System architecture and method for duplexing with high mobility networks including air based nodes and computing devices

Inventors: Omar Bakr (Santa Clara, CA); Dale Branlund (Santa Clara, CA)
Assignee: Tarana Wireless, Inc.
H04B7/18504H04B7/0408H04B7/0417H04B7/0695H04B7/18506H04B7/18515H04B7/2041H04L5/14H04L12/2854H04L12/4625H04W4/06H04W16/24H04W36/304H04W48/16H04W84/06
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,255,724
App. No.
17/411,015
Granted
Mar 18, 2025
Kind
B2
Abstract

A wireless communication network and wireless communication method are disclosed. The network has a plurality of transceivers forming a wireless communication network in which the plurality of transceivers include one or more central nodes and each end node capable of connecting to the one or more central nodes and forming a link. At least some of the transceivers of the network having a plurality of antennas and an array processing element coupled to the plurality of antennas and at least some of the transceivers are housed in an aerial communication node that may be a mini-satellite, a balloon or a drone.

Claims (50)

1. A method comprising:

creating a wireless link between a computing device and an air-based communication node of a plurality of air-based communication nodes;

providing, using the air-based communication node, a first time division duplex (TDD) link at a first frequency or band and a second TDD link at a second frequency or band, each of the TDD links having an uplink portion and a downlink portion; and

communicating, using the air-based communication node, such that there is an overlap between a portion of the downlink portion of the first TDD link and a portion of the uplink portion of the second TDD link, wherein a communication latency is based at least in part on the overlap.

2. The method of claim 1 , wherein the communicating further comprises overlapping a first length of the downlink of the first TDD link with a second length of the uplink of the second TDD link.

3. The method of claim 2 , wherein the first length of the downlink of the first TDD link and the second length of the uplink of the second TDD link are identical in length.

4. The method of claim 1 , wherein the first TDD link, the second TDD link, or combinations thereof, each comprise one or more time guards.

5. The method of claim 4 , wherein a length of the communication latency and a length of each of the one or more time guards is identical.

6. The method of claim 5 , wherein the communication latency is independent of a first TDD link frame rate, a second TDD link frame rate, or combinations thereof.

7. The method of claim 1 , further comprising increasing the downlink of the first TDD link, the uplink of the second TDD link, or combinations thereof, to increase a time-bandwidth product.

8. The method of claim 1 , further comprising configuring the downlink of the first TDD link, the uplink of the second TDD link, or combinations thereof, to set an overhead of a time guard, a frame control data, or combinations thereof.

9. The method of claim 1 , further comprising sliding the first TDD link at the first frequency or band relative to the second TDD link at the second frequency.

10. The method of claim 1 , wherein the first frequency or band is different from the second frequency or band.

11. The method of claim 1 , wherein the downlink portion of the first TDD link and the uplink portion of the second TDD link are asymmetric.

12. The method of claim 1 further comprising:

providing, using the air-based communication node, a third TDD link at a third frequency or band, the third TDD link having an uplink portion and a downlink portion; and

controlling a ratio capacity of the uplink and the downlink portions of the third TDD link by changing a ratio of the uplink and the downlink portions of the third TDD link at the third frequency or band.

13. The method of claim 1 , wherein a size of a bandwidth of the first frequency or band of the first TDD link is different from a size of a bandwidth of the second frequency or band of the second TDD link.

14. A high-mobility aerial network comprising:

an air-based communication node of a plurality of air-based communication nodes; and

a computing device configured to communicate using the air-based communication node, the communicating based at least on creating a wireless link between the at least one air-based communication node and the computing device,

wherein the air-based communication node is further configured to provide a first time division duplex (TDD) link at a first frequency or band and a second TDD link at a second frequency or band, each of the TDD links having an uplink portion, a downlink portion, and one or more time guards, and

wherein the air-based communication node is further configured to communicate such that there is an overlap between a portion of the downlink portion of the first TDD link and a portion of the uplink portion of the second TDD link, and wherein a communication latency is based at least in part on the overlap.

15. The high-mobility aerial network of claim 14 , wherein the air-based communication node is further configured to communicate such that there is an overlap between a first length of the downlink portion of the first TDD link with a second length of the uplink portion of the second TDD link.

16. The high-mobility aerial network of claim 15 , wherein the first length of the downlink portion of the first TDD link and the second length of the uplink portion of the second TDD link are identical in length.

17. The high-mobility aerial network of claim 14 , wherein a length of the communication latency and a length of each of the one or more time guards is identical.

18. The high-mobility aerial network of claim 17 , wherein the communication latency is independent of a first TDD link frame rate, a second TDD link frame rate, or combinations thereof.

19. The high-mobility aerial network of claim 14 , wherein the air-based communication node is further configured to set the downlink portion of the first TDD link, the uplink portion of the second TDD link, or combinations thereof based on a desired time-bandwidth product, overhead of the one or more time guards, frame control data, or combinations thereof.

20. The high-mobility aerial network of claim 14 , wherein the air-based communication node is further configured to slide the first TDD link at the first frequency or band relative to the second TDD link at the second frequency.

21. The high-mobility aerial network of claim 14 , wherein the first frequency or band is different from the second frequency or band.

22. The high-mobility aerial network of claim 14 , wherein the downlink portion of the first TDD link and the uplink portion of the second TDD link are asymmetric.

23. The high-mobility aerial network of claim 14 , wherein the air-based communication node is further configured to:

provide a third TDD link at a third frequency or band, the third TDD link having an uplink portion and a downlink portion; and

control a ratio capacity of the uplink and the downlink portions of the third TDD link by changing a ratio of the uplink and the downlink portions of the third TDD link at the third frequency or band.

24. The high-mobility aerial network of claim 14 , wherein a size of a bandwidth of the first frequency or band of the first TDD link is different from a size of a bandwidth of the second frequency or band of the second TDD link.

25. A non-transitory computer readable storage medium including instructions that, when executed by at least one processor of a computing system, cause the computing system to perform a method comprising creating a wireless link for communication between an air-based communication node and a computing device, wherein the creating is based at least on:

providing a first time division duplex (TDD) link at a first frequency or band and a second TDD link at a second frequency or band, each TDD link having an uplink portion, a downlink portion, and one or more time guards; and

providing an overlap between a portion of the downlink portion of the first TDD link and a portion of the uplink portion of the second TDD link, wherein a communication latency is based at least in part on the overlap.

26. The non-transitory computer readable storage medium of claim 25 , wherein the method further comprises communicating such that there is an overlap between a first length of the downlink portion of the first TDD link with a second length of the uplink portion of the second TDD link.

27. The non-transitory computer readable storage medium of claim 26 , wherein the first length of the downlink portion of the first TDD link and the second length of the uplink portion of the second TDD link are the same length.

28. The non-transitory computer readable storage medium of claim 25 , wherein a length of the communication latency and a length of each of the one or more time guards is identical.

29. The non-transitory computer readable storage medium of claim 28 , wherein the communication latency is independent of a first TDD link frame rate, a second TDD link frame rate, or combinations thereof.

30. The non-transitory computer readable storage medium of claim 25 , wherein the method further comprises configuring the downlink portion of the first TDD link, the uplink portion of the second TDD link, or combinations thereof, to set a time-bandwidth product, an overhead of the one or more time guards, a frame control data, or combinations thereof.

31. The transitory computer readable storage medium of claim 25 , wherein the creating is further based on sliding the first TDD link at the first frequency or band relative to the second TDD link at the second frequency.

32. The non-transitory computer readable storage medium of claim 25 , wherein the first frequency or band is different from the second frequency or band.

33. The non-transitory computer readable storage medium of claim 25 , wherein the downlink portion of the first TDD link and the uplink portion of the second TDD link are asymmetric.

34. The non-transitory computer readable storage medium of claim 25 , wherein the method further comprises:

providing a third TDD link at a third frequency or band, the third TDD link having an uplink portion and a downlink portion; and

controlling a ratio capacity of the uplink and the downlink portions of the third TDD link by changing a ratio of the uplink and the downlink portions of the third TDD link at the third frequency or band.

35. The non-transitory computer readable storage medium of claim 25 , wherein a size of a bandwidth of the first frequency or band of the first TDD link is different from a size of a bandwidth of the second frequency or band of the second TDD link.

Assignments (7)
TERMINATION AND RELEASE OF INTELLECTUAL PROPERTY SECURITY AGREEMENT AT REEL/FRAME NO. 68667/0768 Recorded Mar 23, 2026
From: TRINITY CAPITAL INC., AS AGENT
To: TARANA WIRELESS, INC.
Reel/Frame 075175/0070 →
RELEASE OF SECURITY INTEREST Recorded Mar 23, 2026
From: BANC OF CALIFORNIA
To: TARANA WIRELESS, INC.
Reel/Frame 074155/0612 →
SECURITY INTEREST Recorded Mar 20, 2026
From: TARANA WIRELESS, INC.
To: HERCULES CAPITAL, INC., AS AGENT
Reel/Frame 074141/0066 →
SECURITY INTEREST Recorded Mar 20, 2026
From: TARANA WIRELESS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 074141/0940 →
SECURITY INTEREST Recorded Sep 26, 2024
From: TARANA WIRELESS, INC.
To: BANC OF CALIFORNIA
Reel/Frame 068709/0140 →
SECURITY INTEREST Recorded Sep 23, 2024
From: TARANA WIRELESS, INC.
To: TRINITY CAPITAL INC.
Reel/Frame 068667/0768 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 25, 2021
From: BAKR, OMAR; BRANLUND, DALE
To: TARANA WIRELESS, INC.
Reel/Frame 057284/0041 →
Continuity (6)
Division 16505650 · Jul 8, 2019
Continuation 14968700 · Dec 14, 2015
Continuation In Part 14214229 · Mar 14, 2014
Provisional Application 62091266 · Dec 12, 2014
Related Publication 20220029697A1 · Jan 27, 2022
Related Publication 20240204861A9 · Jun 20, 2024
References Cited (200)
US 5889814A · Simmons · 1999 [cited by applicant]
US 6122260A · Liu et al. · 2000 [cited by applicant]
US 6219561B1 · Raleigh · 2001 [cited by applicant]
US 6289062B1 · Wang et al. · 2001 [cited by applicant]
US 6580328B2 · Tan et al. · 2003 [cited by applicant]
US 6771985B1 · Iinuma · 2004 [cited by applicant]
US 6795424B1 · Kapoor et al. · 2004 [cited by applicant]
US 6865169B1 · Quayle et al. · 2005 [cited by applicant]
US 7003310B1 · Youssefmir et al. · 2006 [cited by applicant]
US 7054292B2 · Hall et al. · 2006 [cited by applicant]
US 7155183B2 · Abraham · 2006 [cited by applicant]
US 7187723B1 · Kawanabe · 2007 [cited by applicant]
US 7333455B1 · Bolt et al. · 2008 [cited by applicant]
US 7340279B2 · Chen et al. · 2008 [cited by applicant]
US 7366120B2 · Handforth et al. · 2008 [cited by applicant]
US 7469152B2 · Cetiner et al. · 2008 [cited by applicant]
US 7493129B1 · Mostafa et al. · 2009 [cited by applicant]
US 7502355B2 · Bednekoff et al. · 2009 [cited by applicant]
US 7567543B2 · Cao et al. · 2009 [cited by applicant]
US 7603081B2 · Karabinis · 2009 [cited by applicant]
US 7636552B2 · Monk · 2009 [cited by applicant]
US 7640020B2 · Gutowski · 2009 [cited by applicant]
US 7646752B1 · Periyalwar et al. · 2010 [cited by applicant]
US 7688739B2 · Frei et al. · 2010 [cited by applicant]
US 7693482B2 · Eade · 2010 [cited by applicant]
US 7720444B2 · Darabi et al. · 2010 [cited by applicant]
US 7839856B2 · Sinha et al. · 2010 [cited by applicant]
US 7953389B2 · Coleman et al. · 2011 [cited by applicant]
US 8195224B2 · Saban et al. · 2012 [cited by applicant]
US 8238318B1 · Megus · 2012 [cited by applicant]
US 8340235B2 · Maddah-Ali et al. · 2012 [cited by applicant]
US 8416872B2 · Higuchi et al. · 2013 [cited by applicant]
US 8488728B2 · Maddah-All et al. · 2013 [cited by applicant]
US 8502733B1 · Negus et al. · 2013 [cited by applicant]
US 8531471B2 · Chen et al. · 2013 [cited by applicant]
US 8654815B1 · Forenza et al. · 2014 [cited by applicant]
US 8670390B2 · Shattil · 2014 [cited by applicant]
US 8811348B2 · Rangan et al. · 2014 [cited by applicant]
US 8837305B2 · Nanda et al. · 2014 [cited by applicant]
US 9124381B2 · Karabinis · 2015 [cited by applicant]
US 9131529B1 · Ayyagari et al. · 2015 [cited by applicant]
US 9252908B1 · Branlund · 2016 [cited by applicant]
US 9325409B1 · Branlund · 2016 [cited by applicant]
US 9332465B2 · Valliappan et al. · 2016 [cited by applicant]
US 9356358B2 · Chang et al. · 2016 [cited by applicant]
US 9363847B2 · Charbit · 2016 [cited by examiner]
US 9386465B2 · Forenza et al. · 2016 [cited by applicant]
US 9456354B2 · Branlund · 2016 [cited by applicant]
US 9502022B2 · Chang et al. · 2016 [cited by applicant]
US 9735940B1 · Bakr et al. · 2017 [cited by applicant]
US 9819083B1 · Chen et al. · 2017 [cited by applicant]
US 9853668B2 · Corbalis et al. · 2017 [cited by applicant]
US 9854408B2 · Suthar et al. · 2017 [cited by applicant]
US 9923657B2 · Forenza et al. · 2018 [cited by applicant]
US 9973246B2 · Forenza et al. · 2018 [cited by applicant]
US 10056963B1 · Au · 2018 [cited by applicant]
US 10164698B2 · Forenza et al. · 2018 [cited by applicant]
US 10181330B2 · Han et al. · 2019 [cited by applicant]
US 10348394B1 · Bakr et al. · 2019 [cited by applicant]
US 10432275B2 · Branlund · 2019 [cited by applicant]
US 11025394B1 · Bakr et al. · 2021 [cited by applicant]
US 11115111B1 · Bakr et al. · 2021 [cited by applicant]
US 20010028675A1 · Bierly et al. · 2001 [cited by applicant]
US 20020042290A1 · Williams et al. · 2002 [cited by applicant]
US 20020154687A1 · Bierly et al. · 2002 [cited by applicant]
US 20030035468A1 · Corbaton et al. · 2003 [cited by applicant]
US 20030228887A1 · Kishigami et al. · 2003 [cited by applicant]
US 20040087275A1 · Sugar et al. · 2004 [cited by applicant]
US 20040142701A1 · Abraham · 2004 [cited by applicant]
US 20040192199A1 · Eade · 2004 [cited by applicant]
US 20040264393A1 · Desgagne · 2004 [cited by examiner]
US 20050078038A1 · Takaki et al. · 2005 [cited by applicant]
US 20050141624A1 · Lakshmipathi et al. · 2005 [cited by applicant]
US 20050245192A1 · Karabinis et al. · 2005 [cited by applicant]
US 20050265273A1 · Karabinis · 2005 [cited by examiner]
US 20060040615A1 · Mohamadi · 2006 [cited by applicant]
US 20060119440A1 · Isobe et al. · 2006 [cited by applicant]
US 20060135070A1 · Karabinis · 2006 [cited by applicant]
US 20060268769A1 · Pan et al. · 2006 [cited by applicant]
US 20060280116A1 · Ji et al. · 2006 [cited by applicant]
US 20060292990A1 · Karabinis et al. · 2006 [cited by applicant]
US 20070052353A1 · Yang · 2007 [cited by examiner]
US 20070058584A1 · Sutskover · 2007 [cited by examiner]
US 20070081489A1 · Anderson · 2007 [cited by examiner]
US 20070087690A1 · Karabinis · 2007 [cited by applicant]
US 20070082142A1 · Classon et al. · 2007 [cited by applicant]
US 20080076477A1 · Hedayat et al. · 2008 [cited by applicant]
US 20080117101A1 · Pan · 2008 [cited by applicant]
US 20080130496A1 · Kuo et al. · 2008 [cited by applicant]
US 20080214196A1 · Sambhwani · 2008 [cited by applicant]
US 20080214218A1 · Lakshmanan · 2008 [cited by applicant]
US 20080233967A1 · Montojo et al. · 2008 [cited by applicant]
US 20080247388A1 · Horn · 2008 [cited by applicant]
US 20080261602A1 · Livneh · 2008 [cited by applicant]
US 20080278394A1 · Koh et al. · 2008 [cited by applicant]
US 20080317014A1 · Veselinovic et al. · 2008 [cited by applicant]
US 20090052353A1 · D'Amico · 2009 [cited by examiner]
US 20090110033A1 · Shattil · 2009 [cited by applicant]
US 20090147742A1 · Tsai · 2009 [cited by examiner]
US 20090185632A1 · Cai · 2009 [cited by examiner]
US 20090310693A1 · Baker et al. · 2009 [cited by applicant]
US 20090316675A1 · Malladl · 2009 [cited by applicant]
US 20100035620A1 · Naden et al. · 2010 [cited by applicant]
US 20100046595A1 · Sikri et al. · 2010 [cited by applicant]
US 20100048217A1 · Deshpande et al. · 2010 [cited by applicant]
US 20100056059A1 · Lakshmanan et al. · 2010 [cited by applicant]
US 20100067476A1 · Periyalwar et al. · 2010 [cited by applicant]
US 20100087149A1 · Srinivasan et al. · 2010 [cited by applicant]
US 20100093391A1 · Saban et al. · 2010 [cited by applicant]
US 20100124183A1 · Sorond · 2010 [cited by examiner]
US 20100195619A1 · Bonneville et al. · 2010 [cited by applicant]
US 20100215032A1 · Jalloul et al. · 2010 [cited by applicant]
US 20100248644A1 · Kishi et al. · 2010 [cited by applicant]
US 20100254295A1 · Ahn et al. · 2010 [cited by applicant]
US 20100296459A1 · Miki et al. · 2010 [cited by applicant]
US 20110034200A1 · Leabman · 2011 [cited by applicant]
US 20110039509A1 · Bruchner · 2011 [cited by applicant]
US 20110051731A1 · Mang et al. · 2011 [cited by applicant]
US 20110075601A1 · Zheng · 2011 [cited by applicant]
US 20110105054A1 · Cavin et al. · 2011 [cited by applicant]
US 20110142025A1 · Agee et al. · 2011 [cited by applicant]
US 20110211615A1 · Hamamura · 2011 [cited by applicant]
US 20110269410A1 · Tsujimoto et al. · 2011 [cited by applicant]
US 20110274032A1 · Leng et al. · 2011 [cited by applicant]
US 20120094679A1 · Rao · 2012 [cited by applicant]
US 20120108257A1 · Kwon et al. · 2012 [cited by applicant]
US 20120129539A1 · Arad et al. · 2012 [cited by applicant]
US 20120136670A1 · Ishikawa et al. · 2012 [cited by applicant]
US 20120202546A1 · Nakayama · 2012 [cited by applicant]
US 20120257551A1 · Diao · 2012 [cited by examiner]
US 20120294203A1 · Koorapaty et al. · 2012 [cited by applicant]
US 20120319844A1 · van Doorn et al. · 2012 [cited by applicant]
US 20130044028A1 · Lea et al. · 2013 [cited by applicant]
US 20130094522A1 · Moshfeghi · 2013 [cited by applicant]
US 20130095747A1 · Moshfeghi · 2013 [cited by applicant]
US 20130109372A1 · Ekici · 2013 [cited by applicant]
US 20130142136A1 · Pi et al. · 2013 [cited by applicant]
US 20130207841A1 · Negus et al. · 2013 [cited by applicant]
US 20130237261A1 · Bazzi · 2013 [cited by applicant]
US 20130259113A1 · KumaR · 2013 [cited by applicant]
US 20130272132A1 · Heo et al. · 2013 [cited by applicant]
US 20130343356A1 · Bai · 2013 [cited by examiner]
US 20140036742A1 · Charbit et al. · 2014 [cited by applicant]
US 20140162667A1 · Mueck · 2014 [cited by applicant]
US 20140185496A1 · Wolf · 2014 [cited by examiner]
US 20140206367A1 · Agee et al. · 2014 [cited by applicant]
US 20140269492A1 · Forenza et al. · 2014 [cited by applicant]
US 20140269502A1 · Forenza et al. · 2014 [cited by applicant]
US 20140328423A1 · Agee et al. · 2014 [cited by applicant]
US 20150085713A1 · He · 2015 [cited by examiner]
US 20150103702A1 · Lahetkangas · 2015 [cited by examiner]
US 20150124713A1 · Salhov et al. · 2015 [cited by applicant]
US 20150244458A1 · Erkmen · 2015 [cited by applicant]
US 20150326380A1 · Verbin · 2015 [cited by examiner]
US 20160119052A1 · Frerking · 2016 [cited by applicant]
US 20160134337A1 · Branlund · 2016 [cited by applicant]
US 20160135060A1 · Branlund · 2016 [cited by applicant]
US 20160255605A1 · Kyeong et al. · 2016 [cited by applicant]
US 20160301458A1 · Petersson et al. · 2016 [cited by applicant]
US 20160323894A1 · Shen et al. · 2016 [cited by applicant]
US 20170013476A1 · Suthar et al. · 2017 [cited by applicant]
US 20170163325A1 · Kang et al. · 2017 [cited by applicant]
US 20180249453A1 · Nagaraja et al. · 2018 [cited by applicant]
US 20180262936A1 · Zhou et al. · 2018 [cited by applicant]
US 20180279316A1 · Mueck et al. · 2018 [cited by applicant]
US 20180287833A1 · Kennedy · 2018 [cited by applicant]
US 20190068235A1 · Branlund et al. · 2019 [cited by applicant]
US 20190349992A1 · Zhang · 2019 [cited by examiner]
US 20200106499A1 · Branlund · 2020 [cited by applicant]
EP 2071745B1 · 2011 [cited by applicant]
EP 1865642A1 · 2017 [cited by applicant]
GB 2350265B · 2000 [cited by applicant]
JP 2010522516 · 2010 [cited by applicant]
JP 2010522516B2 · 2010 [cited by applicant]
JP 2010525678A · 2010 [cited by applicant]
JP 2010183573A · 2010 [cited by applicant]
PT 1858175E · 2012 [cited by applicant]
WO 9820633A2 · 1998 [cited by applicant]
WO 199820633A2 · 1998 [cited by applicant]
WO 0205493A2 · 2002 [cited by applicant]
WO 02063896A1 · 2002 [cited by applicant]
WO 2005101882A1 · 2005 [cited by applicant]
WO 2007082142A2 · 2007 [cited by applicant]
WO 2008033369A2 · 2008 [cited by applicant]
WO 2009119463A2 · 2009 [cited by applicant]
WO 2010003509A1 · 2010 [cited by applicant]
WO 2010013245A1 · 2010 [cited by applicant]
WO 2012037643A1 · 2012 [cited by applicant]
Clark;, V. Martin, “Adaptive Frequency-Domain Equalization and Diversity Combining for Broadband Wireless Communications”, IEEE Journal vol. 16 No. 8, Oct. 1998, pp. 1385-1395. [cited by applicant]
Gong, Michelle X., “Load- and Interference-Aware Channel Assignment for Dual-Radio Mesh Backhauls”, IEEE Communications Society, 2008, pp. 1-6. [cited by applicant]
Nasr, Karim M., et al., “Echo Cancellation and Channel Estimation for On-Channel Repeaters in DVB-T/H Networks”, Brunel University, Jan. 2006, pp. 1-6. [cited by applicant]
Savvides, Andreas , et al., “The Bits and Flops of the N-hop Multilateration Primitive for Node Localization Problems”, UCLA, Sep. 28, 2002, pp. 1-10S. [cited by applicant]
Winters, Jack H., “Signal Acquisition and Tracking with Adaptive Arrays in the Digital Mobile Radio System IS-54 with Flat Fading”, IEEE Transactions, Nov. 4, 1993, pp. 377-384. [cited by applicant]
Clark;, Martin V. , “Adaptive Frequency-Domain Equalization and Diversity Combining for Broadband Wireless Communications”, IEEE Journal on Selected Areas in Communications vol. 16, Issue: 8 DOI: 10.1109/49.730448, Oct.… [cited by applicant]
Gong, Michelle X. , “Load- and Interference-Aware Channel Assignment for Dual-Radio Mesh Backhauls”, IEEE Communications Society doi: 10.1109/GLOCOM.2008.ECP.967., 2008, pp. 1-6. [cited by applicant]
Mesecher, David , “A physical layer open architecture for communications systems integration: common baseband processor with multiple-access adaptively steered antenna array”, IEEE, 2008, doi: 10.1109/LISAT.2008.4638943… [cited by applicant]
Nasr, Karim M. et al., “Echo Cancellation and Channel Estimation for On-Channel Repeaters in DVB-T/H Networks”, Brunel University doi: 10.1109/ISTMWC.2007.4299046., Jan. 2006, pp. 1-6. [cited by applicant]
Savvides, Andreas et al., “The Bits and Flops of the N-hop Multilateration Primitive for Node Localization Problems”, UCLA https://doi.org/10.1145/570738.570755, Sep. 28, 2002, pp. 112-121. [cited by applicant]
Winters, Jack H. , “Signal Acquisition and Tracking with Adaptive Arrays in the Digital Mobile Radio System IS-54 with Flat Fading”, IEEE Transactions on Vehicular Technology vol. 42, No. 4, Nov. 4, 1993, pp. 377-384. [cited by applicant]
EP Examination Report for EP Application 16153704.8 dated Jul. 30, 2024, pp. 6. [cited by applicant]