This disclosure pertains to multi-device communication, and more particularly, but not by way of limitation, to systems and methods that utilize multi-address data packets to communicate with multiple devices.
In one embodiment, the present disclosure is directed to a method comprising generating a nested data packet comprising a first access address and a first payload, the first payload comprising a first target payload and a first payload nesting section, the first access address being assigned to a first device, a second access address and a second payload placed into the first payload nesting section, the second access address being assigned to a second device, and transmitting the nested data packet to the first device and the second device.
In one embodiment, the present disclosure is directed to a system comprising a transmitter encoder comprising a processor executing instructions in memory to: generate a nested data packet comprising a first access address and a first payload, the first payload comprising a first target payload and a first payload nesting section, the first access address being assigned to a first device, a second access address and a second payload placed into the first payload nesting section; and transmit the nested data packet to the first device and the second device.
In one embodiment, the present disclosure is directed to a method comprising determining a unique target payload for each of a plurality of devices; determining a unique access address for each of the plurality of devices; assembling a nested data packet that comprises at least a synchronization sequence and the unique target payload for each of the plurality of devices; and transmitting the nested data packet to each of the plurality of devices, each of the plurality of devices being configured to detect the unique access address and the unique target payload.
In one embodiment, the present disclosure is directed to a method comprising receiving a nested data packet comprising a plurality of unique access addresses and target payloads, which are arranged in a nested configuration; detecting one of the plurality of unique access addresses; performing a hamming distance calculation for the access address relative to a threshold and an assigned access address; determining if the one of the plurality of unique access addresses is an assigned access address; and obtaining a target payload appearing immediately after the one of the plurality of unique access addresses when the one of the plurality of unique access addresses matches the assigned access address.
Exemplary embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements.
The methods and systems disclosed herein pertain to telecommunications, and more specifically, but not by way of limitation, to systems and methods for communicating with multiple devices. In some embodiments, these communication methods and systems pertain to short-range wireless networks and protocols such as BLUETOOTH, Near-Field Communications (NFC), and the like. To be sure, the multi-device communications disclosed herein are not limited to only short-range wireless communications.
Generally, the methods and systems disclosed herein allow for generating nested data packets that include a data packets intended for a plurality of devices (e.g., user equipment). For example, a first data packet can be nested into the payload of a second data packet. The second data packet can be nested into the payload of a first data packet. Any number of data packets can be combined into a nested data packet. This process is generally referred to as multi-access addressing.
The first data packet 308 includes a first preamble 312, a first access address 314, a first header 316, a first payload 318, and a first CRC 320. The first preamble 312, first access address 314, and first header 316 may be referred to generally as a first synchronization sequence. The first payload can be separated into a first target payload 319 and a first payload nesting section 321.
A second data packet 310 can be nested within the first payload nesting section 321 of the first data packet 308. For example, the second data packet 310 can be nested into the first payload nesting section 321 of the first data packet 308. The first target payload 319 includes data destined for the first receiver/decoder 106.
As noted above, the synchronization sequence is what a receiver can use to identify a data packet and lock onto the data packet. If the receiver does not detect or acquire the data packet then the data is lost and packet errors are realized.
The second data packet 310 can be nested within the first payload nesting section 321 of the first data packet 308. For example, the second data packet 310 can be nested into the first payload nesting section 321 of the first data packet 308. The first target payload 319 includes data destined for the first receiver/decoder 106.
The second data packet 310 can also include a second preamble 324, a second access address 326, a second header 328, a second payload 330, and a second CRC 332. The second payload 330 can be separated into a second target payload 323 and a second payload nesting section 325. The second target payload 323 includes data destined for the second receiver/decoder 110, and the second payload nesting section 325 includes space for a third data packet 334, as discussed below. The second preamble 324, second access address 326, and second header 328 form a second synchronization sequence.
A third data packet 334 can be nested into the second payload nesting section 325 of the second payload 330 of the second data packet 310 as well. The third data packet 334 has its own payload (third payload 336). To be sure, since the third data packet 334 is the last of the nested packets, the third payload 336 need not be subdivided into a target section and a nesting section.
Structurally, the first synchronization sequence of the first data packet 308 and the first target payload 319 are positioned in front of the second synchronization sequence and second target payload 323 of the second data packet 310. A third synchronization sequence and third payload 336 of the third data packet 334 are located behind the second synchronization sequence and second target payload 323 of the second data packet 310.
The first target payload 319 can be addressed specifically to the first receiver/decoder 106. The second target payload 323 can be addressed specifically to the second receiver/decoder 110, and the third payload 336 can be addressed specifically to the third receiver/decoder 114. That is, the access address information for each packet in the multi-AA packet 306 can designate a unique device. As long as the devices know about each other, they can detect the presence of the other access address to extract their intended payload. Each of the receiver/decoders can receive the entire multi-AA packet and extract only the payload that is addressed to the particular receiver/decoder.
When in a multi-connect mode of operation, a transmitter/encoder can assemble a multi-AA packet based on the number of end point devices. For example, a multi-AA packet can be used to address three devices (first receiver/decoder 106, second receiver/decoder 110, and third receiver/decoder 114) and send each of these devices their intended payload (first target payload 319, second target payload 323, and third payload 336).
In one use case, the first receiver/decoder 106 can receive the packet related to AA_1, which is PL_1+PL_next. However, since PL_next starts with P+AA_2 and since Device_1 knows P and AA_2, it can extract its corresponding payload (PL_1) using a procedure similar to that of
Referring back to
Detection_1 event can occur when the first receiver/decoder 106 detects the first preamble 312 and the first access address 314. Again, these are known bit sequences to the first receiver/decoder 106. That is, the first preamble 312 and the first access address 314 can include information that is known to the first receiver/decoder 106. When the second receiver/decoder 110 receives the multi-AA packet 306, the second receiver/decoder 110 can bypass or ignore the first preamble 312 and the first access address 314 and acquire the second access address 326 and the second header 328. If found the payload extracted by the second receiver/decoder 110 would include the second target payload 323. Although not shown, a third detection event can be performed by the third receiver/decoder 114.
The method can include a step 502 of generating a nested data packet comprising a first access address and a first payload, the first payload comprising a first target payload and a first payload nesting section, the first access address being assigned to a first device, a second access address and a second payload placed into the first payload nesting section. While this example involves only two decoder/receiver devices, the nested data packet can include data for more than two devices.
The first access address is a unique access address that is known to the first device. In some instances, the transmitter/encoder can share this first access address with the first device prior to transmission of the nested data packet. Likewise, the second access address is a unique access address that is known to the second device. In some instances, the transmitter/encoder can share this second access address with the second device prior to transmission of the nested data packet.
The method can include a step 504 of transmitting the nested data packet to the first device and the second device. That is, both the first and second devices each receive the complete, nested data packet. Each of the decoder/receiver devices can be configured to identify or detect their specific or unique access address in the nested data packet. As noted above, this can be accomplished using a hamming distance calculation. Thus, both the first and second devices can compare (using hamming calculations as an example) their known unique access address to the plurality of access addresses in the nested data packet. When their unique access address is found, prior or upstream data in the nested data packet can be discarded (e.g., access address(es) not belonging to the particular receiver/decoder device) and the unique payload intended for the device can be extracted.
The method can include a step 506 of receiving the nested data packet by the first device, as well as a step 508 of detecting, by the first device, the first access address. The method can also include a step 510 of extracting, by the first device, the first target payload.
The method may include a similar process for the second device. Thus, the method can include a step 512 of receiving the nested data packet by the second device, as well as a step 514 of detecting, by the second device, the second access address. The method can also include a step 516 of extracting, by the second device, the second target payload. Additionally, the method can include bypassing or ignoring, by the second device, the first access address by the second device. As illustrated, the first and second devices can process the nested data packet in parallel (can be done is series as well).
In some embodiments, the method includes a step 606 of assembling a nested data packet that comprises at least a synchronization sequence and the unique target payload for each of the plurality of devices. The method also includes a step 608 of transmitting the nested data packet to each of the plurality of devices, each of the plurality of devices being configured to detect the unique access address and the unique target payload.
In one use case, an example encoder/transmitter could include a Smartphone or other similar device that is configured to transmit media, such as audio or video to a receiver/decoder. As noted, the encoder can transmit data on a link to the decoder, where the link is a short-range wireless connection (other connections, including long-range wireless or wired connections can also be used). The decoder can include a pair of wireless earbuds. Each of the wireless earbuds can be assigned a particular access address by the encoder. These access addresses can be exchanged when the earbuds are paired with the Smartphone.
The encoder can generate a nested data packet with first payload destined for a first one of the earbuds and a second payload destined for a second one of the earbuds. The encoder transmits the nested data packet to each of the earbuds. Using the methods disclosed herein, the earbuds can identify their unique access address and associated target payload. In one example, the first payload could include a first music track and the second payload could include a second music track that is different from the first music track. A first user could wear the first earbud and a second user could wear the second earbud, allowing a single pair of earbuds to be used by two different users. Each of the users can listen to a different track. That is, the first user can listen to the first music track on the first earbud and the second user can listen to the second music track on the second earbud. To be sure, this is non-limiting example, however, the present disclosure contemplates being able to send multiple distinct payloads to multiple distinct devices using a single, nested data packet or stream of nested data packets.
The computer system 1 includes a processor or multiple processor(s) 5 (e.g., a central processing unit (CPU), a graphics processing unit (GPU), or both), and a main memory 10 and static memory 15, which communicate with each other via a bus 20. The computer system 1 may further include a video display 35 (e.g., a liquid crystal display (LCD)). The computer system 1 may also include an alpha-numeric input device(s) 30 (e.g., a keyboard), a cursor control device (e.g., a mouse), a voice recognition or biometric verification unit (not shown), a drive unit 37 (also referred to as disk drive unit), a signal generation device 40 (e.g., a speaker), and a network interface device 45. The computer system 1 may further include a data encryption module (not shown) to encrypt data.
The drive unit 37 includes a computer or machine-readable medium 50 on which is stored one or more sets of instructions and data structures (e.g., instructions 55) embodying or utilizing any one or more of the methodologies or functions described herein. The instructions 55 may also reside, completely or at least partially, within the main memory 10 and/or within the processor(s) 5 during execution thereof by the computer system 1. The main memory 10 and the processor(s) 5 may also constitute machine-readable media.
The instructions 55 may further be transmitted or received over a network via the network interface device 45 utilizing any one of a number of well-known transfer protocols (e.g., Hyper Text Transfer Protocol (HTTP)). While the machine-readable medium 50 is shown in an example embodiment to be a single medium, the term “computer-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database and/or associated caches and servers) that store the one or more sets of instructions. The term “computer-readable medium” shall also be taken to include any medium that is capable of storing, encoding, or carrying a set of instructions for execution by the machine and that causes the machine to perform any one or more of the methodologies of the present application, or that is capable of storing, encoding, or carrying data structures utilized by or associated with such a set of instructions. The term “computer-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media, and carrier wave signals. Such media may also include, without limitation, hard disks, floppy disks, flash memory cards, digital video disks, random access memory (RAM), read only memory (ROM), and the like. The example embodiments described herein may be implemented in an operating environment comprising software installed on a computer, in hardware, or in a combination of software and hardware.
One skilled in the art will recognize that the Internet service may be configured to provide Internet access to one or more computing devices that are coupled to the Internet service, and that the computing devices may include one or more processors, buses, memory devices, display devices, input/output devices, and the like. Furthermore, those skilled in the art may appreciate that the Internet service may be coupled to one or more databases, repositories, servers, and the like, which may be utilized in order to implement any of the embodiments of the disclosure as described herein.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present technology has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the present technology in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the present technology. Exemplary embodiments were chosen and described in order to best explain the principles of the present technology and its practical application, and to enable others of ordinary skill in the art to understand the present technology for various embodiments with various modifications as are suited to the particular use contemplated.
If any disclosures are incorporated herein by reference and such incorporated disclosures conflict in part and/or in whole with the present disclosure, then to the extent of conflict, and/or broader disclosure, and/or broader definition of terms, the present disclosure controls. If such incorporated disclosures conflict in part and/or in whole with one another, then to the extent of conflict, the later-dated disclosure controls.
Aspects of the present technology are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the present technology. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
In this description, for purposes of explanation and not limitation, specific details are set forth, such as particular embodiments, procedures, techniques, etc. in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details.
Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” or “according to one embodiment” (or other phrases having similar import) at various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. Furthermore, depending on the context of discussion herein, a singular term may include its plural forms and a plural term may include its singular form. Similarly, a hyphenated term (e.g., “on-demand”) may be occasionally interchangeably used with its non-hyphenated version (e.g., “on demand”), a capitalized entry (e.g., “Software”) may be interchangeably used with its non-capitalized version (e.g., “software”), a plural term may be indicated with or without an apostrophe (e.g., PE's or PEs), and an italicized term (e.g., “N+1”) may be interchangeably used with its non-italicized version (e.g., “N+1”). Such occasional interchangeable uses shall not be considered inconsistent with each other.
Also, some embodiments may be described in terms of “means for” performing a task or set of tasks. It will be understood that a “means for” may be expressed herein in terms of a structure, such as a processor, a memory, an I/O device such as a camera, or combinations thereof. Alternatively, the “means for” may include an algorithm that is descriptive of a function or method step, while in yet other embodiments the “means for” is expressed in terms of a mathematical formula, prose, or as a flow chart or signal diagram.
This application claims the benefit and priority of U.S. Patent Application Ser. No. 63/131,236, filed on Dec. 28, 2020, which is hereby incorporated by reference herein in its entirety, including all references and appendices cited therein.
Number | Name | Date | Kind |
---|---|---|---|
5657325 | Lou | Aug 1997 | A |
5910182 | Dent | Jun 1999 | A |
5968197 | Doiron | Oct 1999 | A |
6418549 | Ramchandran | Jul 2002 | B1 |
6505253 | Chiu | Jan 2003 | B1 |
6523068 | Beser | Feb 2003 | B1 |
7016658 | Kim et al. | Mar 2006 | B2 |
7124205 | Craft et al. | Oct 2006 | B2 |
7447234 | Colas et al. | Nov 2008 | B2 |
7664883 | Craft et al. | Feb 2010 | B2 |
7848350 | Inamdar | Dec 2010 | B1 |
7971131 | Ordentilch | Jun 2011 | B1 |
8223643 | Wolfgang | Jul 2012 | B1 |
8305963 | Breau | Nov 2012 | B1 |
8327232 | Budampati et al. | Dec 2012 | B2 |
8352830 | Landschaft et al. | Jan 2013 | B2 |
8437267 | Amir et al. | May 2013 | B2 |
8473821 | Taghavi Nasrabadi et al. | Jun 2013 | B2 |
8693406 | Ahmadi | Apr 2014 | B2 |
8990663 | Liu et al. | Mar 2015 | B2 |
10270564 | Djuklc et al. | Apr 2019 | B2 |
10491569 | Powell | Nov 2019 | B1 |
10749594 | O'Shea et al. | Aug 2020 | B1 |
11088784 | Gopalan et al. | Aug 2021 | B1 |
11191049 | Chandrasekher et al. | Nov 2021 | B1 |
20010030954 | Hameleers | Oct 2001 | A1 |
20020026523 | Mallory et al. | Feb 2002 | A1 |
20020054608 | Wan | May 2002 | A1 |
20020122510 | Yakhnich et al. | Sep 2002 | A1 |
20030215029 | Limberg | Nov 2003 | A1 |
20040170120 | Reunamaki et al. | Sep 2004 | A1 |
20050094561 | Raaf | May 2005 | A1 |
20050208897 | Lyons | Sep 2005 | A1 |
20060021040 | Boulanger | Jan 2006 | A1 |
20060047862 | Shearer et al. | Mar 2006 | A1 |
20060268996 | Sethi et al. | Nov 2006 | A1 |
20070168197 | Vasilache | Jul 2007 | A1 |
20080002688 | Kim et al. | Jan 2008 | A1 |
20080002790 | Itoh | Jan 2008 | A1 |
20080126824 | Lee et al. | May 2008 | A1 |
20080225735 | Qiu | Sep 2008 | A1 |
20080250299 | Maillet et al. | Oct 2008 | A1 |
20090086711 | Capretta et al. | Apr 2009 | A1 |
20090119566 | Hiromitsu | May 2009 | A1 |
20090276686 | Liu et al. | Nov 2009 | A1 |
20100037270 | Bennet | Feb 2010 | A1 |
20100165868 | Gersemsky | Jul 2010 | A1 |
20100192175 | Bachet | Jul 2010 | A1 |
20100202416 | Wilhelmsson et al. | Aug 2010 | A1 |
20100262885 | Cheng | Oct 2010 | A1 |
20110131461 | Schulz | Jun 2011 | A1 |
20110206019 | Zhai et al. | Aug 2011 | A1 |
20110206065 | Kim et al. | Aug 2011 | A1 |
20110216787 | Ai et al. | Sep 2011 | A1 |
20120300642 | Abel et al. | Nov 2012 | A1 |
20130018889 | Jagmohan | Jan 2013 | A1 |
20130132786 | Tanigawa et al. | May 2013 | A1 |
20130223203 | Bai | Aug 2013 | A1 |
20130250179 | Lida | Sep 2013 | A1 |
20130339036 | Baeckstroem et al. | Dec 2013 | A1 |
20140140342 | Narad | May 2014 | A1 |
20140241309 | Hilton et al. | Aug 2014 | A1 |
20150009902 | Emmanuel | Jan 2015 | A1 |
20160006842 | Tahir | Jan 2016 | A1 |
20160062954 | Ruff | Mar 2016 | A1 |
20160254881 | Meylan | Sep 2016 | A1 |
20160261375 | Roethig | Sep 2016 | A1 |
20170006616 | Singh et al. | Jan 2017 | A1 |
20170012799 | Jiang | Jan 2017 | A1 |
20170269876 | Mukhopadhyay et al. | Sep 2017 | A1 |
20180013808 | Petry et al. | Jan 2018 | A1 |
20180048567 | Ignatchenko | Feb 2018 | A1 |
20180101957 | Talathi | Apr 2018 | A1 |
20180267850 | Froelich et al. | Sep 2018 | A1 |
20180288198 | Pope et al. | Oct 2018 | A1 |
20180314985 | O'Shea | Nov 2018 | A1 |
20180359811 | Verzun et al. | Dec 2018 | A1 |
20190028237 | Pan et al. | Jan 2019 | A1 |
20190037052 | Deshpande | Jan 2019 | A1 |
20190097680 | O'Brien | Mar 2019 | A1 |
20190097914 | Zhong et al. | Mar 2019 | A1 |
20190392266 | Zhong et al. | Dec 2019 | A1 |
20190393903 | Mandt et al. | Dec 2019 | A1 |
20200128279 | Han et al. | Apr 2020 | A1 |
20200177418 | Hoydis et al. | Jun 2020 | A1 |
20200213152 | Choquette | Jul 2020 | A1 |
20200320371 | Baker | Oct 2020 | A1 |
20200383169 | Takahashi et al. | Dec 2020 | A1 |
20210014939 | Verzun et al. | Jan 2021 | A1 |
20210034846 | Ko et al. | Feb 2021 | A1 |
20210056058 | Lee et al. | Feb 2021 | A1 |
20210120440 | Reimann et al. | Apr 2021 | A1 |
20210319286 | Gunduz | Oct 2021 | A1 |
20210392033 | Haartsen | Dec 2021 | A1 |
20220045696 | Boussard | Feb 2022 | A1 |
20220114436 | Gopalan et al. | Apr 2022 | A1 |
Number | Date | Country |
---|---|---|
106487610 | Mar 2017 | CN |
2493081 | Jan 2013 | GB |
Entry |
---|
Kim et al., “Deepcode: Feedback Codes via Deep Learning,” [online] Jul. 2, 2018 [retrieved on Apr. 17, 2020], Retrieved from the Internet: < URL:https://arxiv.org/abs/1807.00801v1>, 24 pages. |
Gopalan et al., “Systems and Methods for Artificial Intelligence Discovered Codes”, U.S. Appl. No. 17/069,794, filed Oct. 13, 2020, Specification, Claims, Abstract, and Drawings, 43 pages. |
Goutay et al., “Deep reinforcement learning autoencoder with noisy feedback.” 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT). IEEE, Jun. 24, 2019, 6 pages. |
Yamamoto et al., “Application of Yamamoto-Itoh coding scheme to discrete memoryless broadcast channels.” 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017, 5 pages. |
Aoudia et al., “End-to-end learning of communications systems without a channel model.” 2018 52nd Asilomar Conference on Signals, Systems, and Computers. IEEE, Dec. 5, 2018, 6 pages. |
Duman et al., “On optimal power allocation for turbo codes.” Proceedings of IEEE International Symposium on Information Theory. IEEE, Jun. 29-Jul. 4, 1997, 1 page. |
Arvinte et al., “Deep log-likelihood ratio quantization.” 2019 27th European Signal Processing Conference (EUSIPCO). IEEE, 2019, 5 pages. |
“International Search Report” and “Written Opinion”, Patent Cooperation Treaty Application No. PCT/US2021/054265, dated Nov. 24, 2021, 24 pages. |
“International Search Report” and “Written Opinion”, Patent Cooperation Treaty Application No. PCT/US2021/0063356, dated Jan. 14, 2022, 9 pages. |
Henze, Martin, “A Machine-Learning Packet-Classification Tool for Processing Corrupted Packets on End Hosts”, Diploma Thesis, Chair of Communication and Distributed Systems, RWTH Aachen University, Mar. 2011, 103 pages. |
Kötter et al., “Coding for Errors and Erasures in Random Network Coding”, IEEE Transactions on Information Theory 54.8; 3579-3591. Mar. 25, 2008; Retrieved on Feb. 19, 2022 (Feb. 19, 2022) from <https://arxiv.org/pdf/cs/0703061.pdf> entire document; 30 pages. |
Grcar, Joseph, “How ordinary elimination became Gaussian elimination”, Historia Mathematica vol. 38 Issue 2, May 2011; Available online Sep. 28, 2010; pp. 163-218. |
Number | Date | Country | |
---|---|---|---|
20220209909 A1 | Jun 2022 | US |
Number | Date | Country | |
---|---|---|---|
63131236 | Dec 2020 | US |