Ranging operation method in wireless communication
By generating a one-to-many initiator report containing a resolvable private address hash calculated with the responder's identity resolution key, and using indicator bits to indicate the integrity of the PSDU, the problems of inaccurate ranging and failed report decompression in wireless communication are solved, achieving more accurate ranging and report decompression.
Patent Information
- Application Number
- CN202510958311.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2025-07-08
- Filing Date
- 2025-07-11
- Publication Date
- 2026-01-13
AI Technical Summary
In wireless communication, existing technologies cannot effectively identify the winner among multiple responders, resulting in inaccurate ranging and the inability to determine the complete or partial reception report in the channel impulse response report, leading to decompression failure.
This problem is solved by generating and sending a one-to-many initiator report containing a resolvable private address hash calculated from the responder's identity resolution key, using indicator bits to indicate whether the PSDU contains the complete received report or a portion thereof.
It achieves accurate ranging and complete reception report decompression, improving the accuracy and reliability of ranging and reporting in wireless communication.
Smart Images

Figure CN121334699A_ABST
Abstract
Description
[0001] Cross-references
[0002] This disclosure is part of a non-provisional patent application that claims priority to U.S. Provisional Patent Application No. 63 / 669,743 (filed July 11, 2024), the entire contents of which are incorporated herein by reference. Technical Field
[0003] This disclosure generally relates to wireless communications, and more specifically, to enhancements in ranging and reporting in wireless communications. Background Technology
[0004] Unless otherwise stated herein, the methods described in this section are not prior art to the following claims and are not recognized as prior art by way of inclusion in this section.
[0005] In wireless communications, such as Bluetooth, Zigbee, Ultra-Wideband (UWB), Wireless Body Area Networks (WBANs), and Low-Rate Wireless Personal Area Networks (LR-WPANs), according to the Institute of Electrical and Electronics Engineers (IEEE) 802.15 specification, in the context of contention-based one-to-many multi-millisecond (MMS) ranging, when the initiator uses a one-to-many polling compact frame with a message control field value of 0x60 in the first ranging sub-round, the transmission order in subsequent sub-rounds is reversed (i.e., the responder sends first). Each responder competes for access to the transmission medium by randomly selecting a ranging sub-round to attempt a response. If this is not the first sub-round, the responders compete to transmit a one-to-many response compact frame, while the initiator sends its one-to-many polling compact frame as a reply. However, in this scenario, the initiator cannot identify the responder who wins the competition among multiple responders.
[0006] On the other hand, in the context of compressed fragmentation, the current Channel Impulse Response Report (CIR) taps are compressed based on transmit (Tx) / receive (Rx) antenna pairs (antenna, segment), which allows for decompression on a per-receive report basis. A given receive report (RR) can be divided into two segments / parts (e.g., RR-2(1), RR-2(2)) to be carried in two Physical Layer Service Data Units (PSDUs) (e.g., 1st report segment, 2nd report segment). The 1st report segment (e.g., RR-2(1)) has a Receive Report Description (RRD), while the 2nd report segment (e.g., RR-2(2)) does not. However, if the receiver does not receive the earlier segment, it will be unable to determine whether the 1st RR of the subsequently received segment / PSDU is a complete RR (e.g., RR-16) or a segment of an RR (e.g., RR-2(2)). Without this information, the remaining information in the PSDU cannot be parsed or decompressed. Furthermore, if the receiver does not receive a later segment, it will be unable to determine whether the final RR is a complete RR in order to begin decompression.
[0007] Therefore, a solution is needed to enhance ranging and reporting in wireless communications. Summary of the Invention
[0008] The following summary is for illustrative purposes only and is not intended to be limiting in any way. That is, the following summary aims to introduce the concepts, highlights, benefits, and advantages of the novel and non-obvious techniques described herein. Selected embodiments will be further illustrated in the detailed description below. Therefore, the following summary is not intended to identify the essential features of the claimed subject matter, nor is it intended to determine the scope of the claimed subject matter.
[0009] The objective of this disclosure is to provide schemes, concepts, designs, techniques, methods, and apparatus related to ranging and reporting enhancement in wireless communications. It is believed that the various solutions presented herein can solve or mitigate the aforementioned problems.
[0010] In one aspect, one approach may involve an initiator performing a one-to-many contention-based ranging operation by: (a) generating a one-to-many initiator report; and (b) sending the one-to-many initiator report to one or more responders. The one-to-many initiator report may contain a resolvable private address (RPA) hash computed using the identity resolution keys (IRKs) of one or more responders.
[0011] In another aspect, one approach might involve a responder performing a one-to-many contention-based ranging operation by: (a) receiving a one-to-many poll from an initiator; (b) responding to the one-to-many poll by sending a response to the initiator; and (c) receiving a one-to-many initiator report. This one-to-many initiator report might contain an RPA hash computed using the responder's or other responders' IRKs.
[0012] In another aspect, one approach may involve a device receiving a PSDU as part of a CIR, wherein the CIR reporting tap is compressed for decompression on a per RR basis. The approach may also involve a device determining, based on indications contained in the PSDU, whether the PSDU contains a complete RR or a portion thereof.
[0013] It is worth noting that while the descriptions provided herein may be within the context of certain wireless access technologies, networks, and network topologies, such as IEEE 802.15 compliant wireless networks, the proposed concepts, schemes, and any variations / derivatives thereof can be implemented in other types of wireless access technologies, networks, and network topologies, such as, but not limited to, Wi-Fi under IEEE 802.11, 5th generation (5G) / New Radio (NR), 6th generation (6G), Long Term Evolution (LTE), LTE-Advanced, LTE-Advanced Pro, Internet of Things (IoT), Industrial Internet of Things (IIoT), and Narrowband Internet of Things (NB-IoT). Therefore, the scope of this disclosure is not limited to the examples described herein. Attached Figure Description
[0014] The accompanying drawings are included to provide a further understanding of the present disclosure and form part of this disclosure. The drawings illustrate embodiments of the present disclosure and, together with the description, serve to explain the principles of the present disclosure. It will be understood that the drawings are not necessarily drawn to scale, as some components may be shown out of proportion to their actual dimensions in order to clearly illustrate the concepts of the present disclosure.
[0015] Figure 1 This is a schematic diagram of an example network environment in which various schemes according to this disclosure can be implemented.
[0016] Figure 2 This is a schematic diagram of an example design based on the proposed scheme of this disclosure.
[0017] Figure 3 This is a schematic diagram of an example design based on the proposed scheme of this disclosure.
[0018] Figure 4 This is a block diagram of an example communication system based on the proposed solution of this disclosure.
[0019] Figure 5This is a flowchart of an example process based on the proposed scheme of this disclosure.
[0020] Figure 6 This is a flowchart of an example process based on the proposed scheme of this disclosure.
[0021] Figure 7 This is a flowchart of an example process based on the proposed scheme of this disclosure. Detailed Implementation
[0022] Detailed embodiments and implementations of the claimed subject matter are disclosed herein. However, it should be understood that the disclosed embodiments and implementations are merely illustrative of the claimed subject matter, which can be embodied in various forms. This disclosure may be embodied in many different forms and should not be construed as being limited to the exemplary embodiments and implementations set forth herein. Rather, these exemplary embodiments and implementations are provided to make the description of this disclosure comprehensive and complete, and to fully convey the scope of this disclosure to those skilled in the art. Details of well-known features and techniques may be omitted in the following description to avoid unnecessarily obscuring the presented embodiments and implementations.
[0023] Overview
[0024] The implementations disclosed herein relate to various techniques, methods, schemes, and / or solutions related to enhancements in ranging and reporting in wireless communications. According to this disclosure, many possible solutions can be implemented individually or in combination. That is, although these possible solutions may be described individually below, two or more of these possible solutions may be implemented in one or another combination.
[0025] Figure 1 An example network environment 100 is shown, in which various solutions and schemes can be implemented according to this disclosure. Figures 1 to 7 Examples of implementations of various proposed schemes in network environment 100 according to this disclosure are shown. The following descriptions of the various proposed schemes are for reference only. Figures 1 to 7 Provided.
[0026] See Figure 1 Network environment 100 may include at least a first device (STA 110) and a second device (STA 120). Either STA 110 or STA 120 may be the initiator, and the other may be the responder. Although other devices may be involved in network environment 100 under one or more of the scenarios proposed herein, for simplicity, Figure 1Only two devices (STA 110 and STA 120) are shown in this document; however, other devices may be involved. Each STA 110 and STA 120 can be configured to implement various proposed schemes according to this disclosure, as described below. For example, in some implementations, STA 110 may act as an initiator and STA 120 as a responder, and vice versa. It is worth noting that although the various proposed schemes may be described individually or separately below, in actual implementations, some or all of the proposed schemes may be used in combination or otherwise implemented. Of course, each proposed scheme may be used individually or separately or otherwise implemented.
[0027] In the context of wireless communication, CIR report taps are a key concept for understanding and modeling signal propagation. CIR describes how a wireless channel responds to impulse signals, typically short, high-energy signals. It captures the effects of multipath propagation, where signals reflect off objects and arrive at the receiver at different times, amplitudes, and phases. To simulate the effects of multipath fading, wireless communication systems often use models that include delay line “tap”. In this context, a tap is a point on a delay line corresponding to a specific delay. The signals from each tap, combined, represent the composite signal actually received by the receiver; each tap in the model corresponds to a specific path the signal travels, characterized by its amplitude and delay. CIR report taps can be used for channel modeling, simulation, and RAKE receiver design.
[0028] In the aforementioned scenario of contention-based one-to-many MMS ranging, only the initiator calculates the distance between itself and each responder. However, each responder is also allowed to calculate the distance by receiving one-to-many initiator reports during the reporting phase. According to the current IEEE 802.15 specification, the resolvable private address (RPA) hash of this reporting message is calculated using the initiator's identity resolution key (IRK). If two or more responders each send a response frame in the same sub-round, and one of these response frames is decoded by the initiator (e.g., Frame Sequence Check (FCS)), this means that the responder who sent the decoded response frame is very close (or closer to) the initiator, rather than other responders. It is assumed that other responders farther from the initiator (referred to here as "far responders") will interpret the one-to-many initiator report as being directed at themselves, leading to incorrect calculations by the far responders.
[0029] Figure 2An example design 200 based on the proposed scheme disclosed herein is shown. In a contention-based one-to-many MMS ranging operation, the initiator can send one-to-many polling (e.g., one-to-many polling compact frames) during the control phase of the one-to-many MMS ranging. This facilitates carrier coherent transmission from the initiator to one or more responder devices and also allows the communication of short-term operational parameters (e.g., from the initiator to the responder devices). The compact frame content field of the one-to-many polling compact frame can be as follows: Figure 2 The format is shown in section (A). One-to-many polling can be sent before or after receiving a response frame (which indicates / contains the IRK of the respective response device) from one or more responding devices. Subsequently, the initiator and one or more responders enter the ranging phase for sending and receiving UWB MMS. After the ranging phase ends, the initiator can send a one-to-many initiator briefing frame during the one-to-many MMS ranging reporting phase. The compact frame content field of the one-to-many initiator report compact frame can be as follows: Figure 2 The format is shown in section (B).
[0030] According to the proposed scheme, a one-to-many initiator report (e.g., a one-to-many initiator report compact frame) can include a responder RPA hash (instead of an initiator RPA hash), which can be calculated using the responder's IRK (e.g., a response frame from one of the multiple responders decoded by the initiator) instead of the initiator's IRK, thus solving the aforementioned problem. For example, the initiator can first obtain (or assign) each responder's IRK through a previous setup or out-of-band procedure (e.g., from each responder's response frame), then calculate the one-to-many initiator report's RPA hash based on the responder's IRK and the RPArand from a previously sent one-to-many polling briefing frame, and then send the calculated RPA hash along with the one-to-many initiator report. Among the multiple responders receiving this one-to-many initiator report, only the responder whose IRK was used to calculate the RPA hash can correctly calculate its distance from the initiator.
[0031] According to another scheme for compressed segmentation disclosed herein, an indication can be used to indicate whether a given Physical Layer Service Data Unit (PSDU) contains a complete Receive Report (RR) or a portion / segment of an RR. For example, such an indication can be provided using one or two bits at the beginning of the PSDU. Figure 3 An example design 300 based on the scheme disclosed herein is shown. Figure 3 Part (A) shows an example of a PSDU containing the second part of the RR, where the additional information in the RRD carried in the first part of the RR is omitted. Figure 3Part (B) shows another example, in which the 0th and 1st bits at the beginning of the PSDU are used to indicate whether the PSDU contains the complete RR, contains the first part of the RR and the RRD contains additional information (such as timing offset, normalization factor, etc.), or contains the second part of the RR. Figure 3 Section (C) illustrates example interpretations of the values of bits 0-1 used for the indication. For example, a decimal value "0" can indicate that the PSDU contains the complete RR. A decimal value "1" can indicate that the PSDU contains the 1st part of the RR. A decimal value "2" can indicate that the PSDU contains the 2nd part of the RR. The meaning of the decimal value "3" may be reserved. In the proposed scheme, such indications (e.g., bits 0-1) can be located in the Report Identity Control (RIC) field of the PSDU. Alternatively, such indications can be located in the Receive Report Control (RRC) field of the PSDU. Alternatively, such indications can be located in the Receive Report Description (RRD) field contained in a segment of the RR. For example, the RRD bits can be rearranged so that currently reserved bits can be moved to the front to serve as such an indication. As another example, the RRD field may be shorter if the indication indicates that it is the second segment of the RR contained in the PSDU. In any case, one or more indicator bits can be used to indicate whether the RR is complete, or the 1st part or the 2nd part of the RR, and the RRD field (or RRC field or RIC field) containing the indicator bits can be included in each part of the RR.
[0032] As an example of implementation, the RRC field can exist in all RRs, and the CIR tap length field can exist in all RRs if the report is segmented or compressed. When an RR is split into two parts and carried in two different CIR report information elements, the RRC field (including the CIR tap length field) can exist completely in each part of the RR. That is, the RRC field may not span two CIR report information elements.
[0033] Example Implementation
[0034] Figure 4 An example system 400 is shown, having at least one example device 410 and one example device 420, according to an embodiment of this disclosure. Each of devices 410 and 420 can perform various functions to implement the schemes, techniques, processes, and methods described herein for enhancing ranging and reporting in wireless communications, including the various schemes described above for various proposed designs, concepts, schemes, systems, and methods, as well as the processes described below. For example, device 410 may be implemented in STA 110, and device 420 may be implemented in STA 120, and vice versa.
[0035] Each of devices 410 and 420 can be part of an electronic device, such as a portable or mobile device, a wearable device, a wireless communication device, or a computing device. When implemented in a STA, each of devices 410 and 420 can be implemented in a smartphone, smartwatch, personal digital assistant, digital camera, or computing device (such as a tablet, laptop, or notebook computer). Each of devices 410 and 420 can also be part of a machine-type device, which could be an Internet of Things (IoT) device, such as a fixed or stationary device, a home appliance, a wired communication device, or a computing device. For example, each of devices 410 and 420 can be implemented in a smart thermostat, a smart refrigerator, a smart door lock, a wireless speaker, or a home control center.
[0036] In some embodiments, each of devices 410 and 420 may be implemented as one or more integrated circuit (IC) chips, such as, but not limited to, one or more single-core processors, one or more multi-core processors, one or more Reduced Instruction Set Computing (RISC) processors, or one or more Complex Instruction Set Computing (CISC) processors. In the various embodiments described above, each of devices 410 and 420 may be implemented as a controller / initiator or a controlled object / responder. Each of devices 410 and 420 may include... Figure 4 At least some of the components shown are, for example, processors 412 and 422. Each of devices 410 and 420 may also include one or more other components (e.g., internal power supply, display device, and / or user interface device) unrelated to the proposed solutions of this disclosure; therefore, these components of devices 410 and 420 are not... Figure 4 This is shown in the text and not described below, in order to keep it concise.
[0037] In one aspect, each of processors 412 and 422 may be implemented as one or more single-core processors, one or more multi-core processors, one or more RISC processors, or one or more CISC processors. That is, although the singular term "processor" is used herein to refer to processors 412 and 422, in some embodiments each of processors 412 and 422 may include multiple processors, while in other embodiments a single processor, according to this disclosure. In another aspect, each of processors 412 and 422 may be implemented in hardware (and optionally firmware) comprising, for example, but not limited to, one or more transistors, one or more diodes, one or more capacitors, one or more resistors, one or more inductors, one or more memristors, and / or one or more varactor diodes, these electronic components being configured and arranged to achieve a specific purpose according to this disclosure. In other words, in at least some embodiments, each of processors 412 and 422 is a dedicated machine specifically designed, arranged, and configured to perform specific tasks, including those related to ranging and reporting enhancements in wireless communications according to various embodiments of this disclosure.
[0038] In some implementations, device 410 may further include a transceiver 416 connected to processor 412. Transceiver 416 may include a transmitter capable of wirelessly transmitting data and a receiver capable of wirelessly receiving data. In some implementations, device 420 may further include a transceiver 426 connected to processor 422. Transceiver 426 may include a transmitter capable of wirelessly transmitting data and a receiver capable of wirelessly receiving data. It is worth noting that although transceivers 416 and 426 are illustrated as separate from and independent of processors 412 and 422, respectively, in some implementations, transceiver 416 may be an integral part of processor 412 as a system-on-a-chip (SoC), and / or transceiver 426 may be an integral part of processor 422 as a SoC.
[0039] In some implementations, device 410 may further include a memory 414 connected to and accessible by processor 412, and storing data therein. In some implementations, device 420 may further include a memory 424 connected to and accessible by processor 422, and storing data therein. Each of memory 414 and memory 424 may include a random access memory (RAM), such as dynamic RAM (DRAM), static RAM (SRAM), thyristor RAM (T-RAM), and / or zero-capacitance RAM (Z-RAM). Alternatively, each of memory 414 and memory 424 may include a read-only memory (ROM), such as a mask ROM, programmable ROM (PROM), erasable programmable ROM (EPROM), and / or electrically erasable programmable ROM (EEPROM). Alternatively, each of memory 414 and memory 424 may include a non-volatile random access memory (NVRAM), such as flash memory, solid-state memory, ferroelectric RAM (FeRAM), magnetoresistive RAM (MRAM), and / or phase-change memory.
[0040] Each of devices 410 and 420 may be a communication entity capable of communicating with each other using the various proposed schemes of this disclosure. For illustrative purposes and without limitation, the capabilities of device 410 or device 420 are described below in the context of example procedures 500, 600, and 700, respectively, as STA 110 and STA 120. It is worth noting that although a detailed description of the capabilities, functions, and / or technical features of either device 410 or device 420 is provided below, the same description may be applied to the other of device 410 and device 420, although its detailed description is not provided only for the sake of brevity.
[0041] Example process
[0042] Figure 5 An example process 500 according to an implementation of this disclosure is shown. Process 500 may represent one aspect of implementing the various proposed designs, concepts, schemes, systems, and methods described above. More specifically, process 500 may represent one aspect of proposed concepts and schemes related to ranging and reporting enhancements in wireless communication. Process 500 may include one or more operations, actions, or functions, as shown in one or more blocks / sub-blocks. Although illustrated as discrete blocks, the individual blocks of process 500 may be divided into additional blocks, merged into fewer blocks, or eliminated, depending on the desired implementation. Furthermore, the blocks / sub-blocks of process 500 may be arranged in... Figure 5The execution sequence shown may be different, or alternatively, executed in a different order. Furthermore, one or more blocks / subblocks of process 500 may be executed repeatedly or iteratively. Process 500 may be implemented by or in devices 410 and 420, and any variations thereof. For illustrative purposes only and without limitation, process 500 is described in the following context as implemented by device 410 as or as STA 110 and device 420 as or as STA 120 in network environment 100, or vice versa, conforming to one or more IEEE 802.15 standards. Process 500 may begin at block 510.
[0043] At 510, process 500 may include processor 412 of device 410 (as initiator) performing one-to-many contention-based ranging via transceiver 416. One-to-many contention-based ranging may involve operations represented by 512 and 514.
[0044] At 512, process 500 may involve processor 412 generating a one-to-many initiator report. Process 500 can proceed from 512 to 514.
[0045] At 514, process 500 may involve processor 412 sending a one-to-many initiator report to a responder via transceiver 416. The one-to-many initiator report may contain an RPA hash computed using the IRK of a responder.
[0046] In some implementations, when performing a one-to-many contention-based ranging operation, process 500 may further involve processor 412 performing certain operations before generating and sending a one-to-many initiator report. For example, process 500 may involve processor 412 sending a one-to-many poll to one or more responders via transceiver 416. Furthermore, process 500 may also include processor 412 receiving a response from at least one of the one or more responders immediately before or after sending the one-to-many poll via transceiver 416.
[0047] In some implementations, when generating a one-to-many initiator report, process 500 may involve processor 412 performing certain operations. For example, process 500 may involve processor 412 decoding responses from the at least one responder. Furthermore, process 500 may involve processor 412 calculating RPA hashes using the corresponding IRK of the at least one responder when generating the one-to-many initiator report.
[0048] In some implementations, when performing a one-to-many contention-based ranging operation, process 500 may involve processor 412 performing a contention-based one-to-many MMS ranging operation.
[0049] Figure 6An example process 600 according to an implementation of this disclosure is shown. Process 600 may represent one aspect of implementing the various proposed designs, concepts, schemes, systems, and methods described above. More specifically, process 600 may represent one aspect of proposed concepts and schemes related to ranging and reporting enhancements in wireless communication. Process 600 may include one or more operations, actions, or functions, as shown in one or more blocks / sub-blocks. Although illustrated as discrete blocks, the individual blocks of process 600 may be divided into additional blocks, merged into fewer blocks, or eliminated, depending on the desired implementation. Furthermore, the blocks / sub-blocks of process 600 may be arranged in... Figure 6 The execution sequence shown may be different, or alternatively, executed in a different order. Furthermore, one or more blocks / subblocks of process 600 may be executed repeatedly or iteratively. Process 600 may be implemented by or in devices 410 and 420, and any variations thereof. For illustrative purposes only and without limitation, process 600 is described in the following context as implemented by or as STA 110 in network environment 60 and as STA 120 in network environment 60, or vice versa, conforming to one or more IEEE 802.15 standards. Process 600 may begin at block 610.
[0050] At 610, process 600 may include processor 422 of device 420 (as a responder) performing a one-to-many contention-based ranging operation via transceiver 426. This one-to-many contention-based ranging may involve operations represented by 612, 614, and 616.
[0051] At 612, process 600 may involve processor 422 receiving one-to-many polls from an initiator (e.g., device 410) via transceiver 426. Process 600 can proceed from 612 to 614.
[0052] At 614, process 600 may involve processor 422 sending a response to the initiator in response to receiving the one-to-many poll via transceiver 426. Process 600 can proceed from 614 to 616.
[0053] At 616, process 600 may involve processor 422 receiving a one-to-many initiator report via transceiver 426. This one-to-many initiator report may contain an RPA hash computed using the IRK of a responder or other responders.
[0054] In some implementations, when performing a one-to-many contention-based ranging operation, process 600 may further involve processor 422 determining the distance between the responder and the initiator based on the one-to-many initiator report.
[0055] In some implementations, when performing a one-to-many contention-based ranging operation, process 600 may involve processor 422 performing a contention-based one-to-many MMS ranging operation.
[0056] Figure 7 An example process 700 according to an implementation of this disclosure is shown. Process 700 may represent one aspect of implementing the various proposed designs, concepts, schemes, systems, and methods described above. More specifically, process 700 may represent one aspect of proposed concepts and schemes related to ranging and reporting enhancements in wireless communication. Process 700 may include one or more operations, actions, or functions represented by one or more blocks / sub-blocks. Although shown as discrete blocks, the individual blocks of process 700 may be divided into more blocks, merged into fewer blocks, or omitted, depending on the desired implementation. Furthermore, the blocks / sub-blocks of process 700 may be arranged in... Figure 7 The process can be executed in the order shown, or in a different order. Furthermore, one or more blocks / subblocks of process 700 can be executed repeatedly or iteratively. Process 700 can be implemented by or in devices 410 and 420, and any variations thereof. For illustrative purposes only and without limitation, process 700 is described below as implemented as STA110 in the context of device 410 and STA120 in network environment 70, or vice versa, conforming to one or more IEEE 802.15 standards. Process 700 may begin at block 710.
[0057] At 710, process 700 may include the processor 412 of device 410 receiving a PSDU as part of a CIR via transceiver 416, wherein the CIR report taps are compressed for decompression on a per RR basis. Process 700 may proceed from 710 to 720.
[0058] In 720, process 700 may involve processor 412 determining, based on the indication contained in the PSDU, whether the PSDU contains a complete RR or a portion of a complete RR.
[0059] In some implementations, this instruction may include two bits at the beginning of the PSDU.
[0060] In some implementations, this instruction may indicate whether the PSDU contains the complete RR, the first part of the RR, or the second part of the RR.
[0061] In some implementations, this instruction may be located in the RIC field carried in the PSDU.
[0062] In some implementations, this instruction may be located in the RRC field carried in the PSDU.
[0063] In some implementations, the indicator may be located in the RRD field within a segment of the RR. In some implementations, the RRD bits may be rearranged, shifting one or more reserved bits before the RR to serve as the indicator. In some implementations, the length of the RRD field may be relatively short if the indicator indicates that the PSDU contains a second segment of the RR, while the length of the RRD field may be relatively long if the indicator indicates that the PSDU contains the complete RR or the first segment of the RR.
[0064] Additional Notes
[0065] The topics described herein sometimes demonstrate different components contained within or connected to different other components. It should be understood that the architectures depicted are merely examples, and many other architectures can actually be implemented to achieve the same functionality. Conceptually, any arrangement of components to achieve the same functionality is effectively “associated” to achieve the desired function. Therefore, any two components combined in this document to achieve a particular function can be considered “associated” together to achieve the desired function, regardless of the architecture or intermediate components. Similarly, any two components so associated can also be considered “operably connected” or “operably coupled” together to achieve the desired function, and any two components that can be so associated can also be considered “operably coupled” together to achieve the desired function. Specific examples of operational coupling include, but are not limited to, physically matable and / or physically interactive components and / or wirelessly interactive components and / or logically interactive and / or logically interactive components.
[0066] Furthermore, regarding the use of virtually any plural and / or singular terms in this document, a person with technical skills may appropriately translate from plural to singular and / or from singular to plural depending on the context and / or application. For clarity, various singular / plural permutations may be explicitly listed in this document.
[0067] Furthermore, those skilled in the art will understand that, in general, the terms used herein, particularly in appended claims, such as the body of an appended claim, are often considered "open" terms; for example, the term "comprising" should be interpreted as "comprising but not limited to," the term "having" should be interpreted as "having at least," and the term "including" should be interpreted as "including but not limited to," etc. Those skilled in the art will also understand that if a particular quantity introduced in a claim is intentional, this intention will be explicitly stated in the claim; if no such statement is given, then no such intention exists. For example, to aid understanding, the appended claims below may contain statements introducing the claim using the introductory phrases "at least one" and "one or more." However, the use of these phrases should not be construed as implying that a claim statement introduced by the indefinite article "a" or "an" limits any particular claim containing such an introductory claim statement to containing only one such statement, even if the same claim includes the introductory phrase "one or more" or "at least one" and indefinite articles such as "a" or "an," for example, "a" and / or "an" should be interpreted as "at least one" or "one or more"; the same applies to definite articles used to introduce claim statements. Furthermore, even when a specific number of claims is explicitly stated, those skilled in the art will recognize that such a statement should be interpreted as at least the stated number; for example, the single statement "two statements," without any other modifier, means at least two statements, or two or more statements. Additionally, when using conventions such as "at least one A, B, and C, etc.", generally, this structure is interpreted in the manner understood by those skilled in the art, for example, "a system having at least one A, B, and C" includes, but is not limited to, systems having only A, only B, only C, A and B together, A and C together, B and C together, and / or systems having A, B, and C together, etc. Similarly, when using conventions such as "at least one A, B, or C, etc.", generally, this structure is interpreted in the manner understood by those skilled in the art, for example, "a system having at least one A, B, or C" includes, but is not limited to, systems having only A, only B, only C, A and B together, A and C together, B and C together, and / or systems having A, B, and C together, etc. Those skilled in the art will also understand that virtually any extractive word and / or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to include the possibility of containing one term, either term, or both terms. For example, the phrase "A or B" will be understood to include the possibility of "A" or "B" or "A and B". In summary, it is understood that various embodiments of this disclosure have been described herein for illustrative purposes and various modifications may be made without departing from the scope and spirit of this disclosure. Therefore, the various embodiments disclosed herein are not intended to be limiting, and their true scope and spirit are indicated by the claims.
Claims
1. A ranging operation method in wireless communication, comprising: The processor of the initiating device performs a one-to-many contention-based ranging operation, including: The processor generates a one-to-many initiator report; and The processor sends the one-to-many initiator report to one of the multiple responders. The one-to-many initiator report contains a resolvable private address RPA hash calculated using the identity resolution key IRK of one of the multiple responders.
2. The method of claim 1, wherein the one-to-many competition-based ranging operation further comprises, before generating and sending the one-to-many initiator report: The processor sends a one-to-many poll to the one or more responders; and The processor receives responses from at least one of the one or more responders in response to sending the one-to-many poll.
3. The method of claim 2, wherein generating the one-to-many initiator report comprises: Decode the response from at least one responder; and The RPA hash is calculated using the corresponding IRK of at least one responder when generating the one-to-many initiator report.
4. The method of claim 1, wherein performing the one-to-many contention-based ranging operation includes performing a contention-based one-to-many multi-millisecond (MMS) ranging operation.
5. A ranging operation method in wireless communication, comprising: The processor of the device acting as the responder performs a one-to-many contention-based ranging operation, including: The processor receives one-to-many polls from the initiator; and The processor sends a response to the initiator immediately before or after receiving a one-to-many poll; The processor and the initiator perform the sending and receiving operations of ultra-wideband (UWB) data packets; and The processor receives one-to-many initiator reports. The one-to-many initiator report contains a resolvable private address RPA hash calculated using the identity resolution key IRK of the responder or other responders.
6. The method of claim 5, wherein the one-to-many competition-based ranging operation further comprises: The processor determines the distance between the responder and the initiator based on the one-to-many initiator report.
7. The method of claim 5, wherein performing the one-to-many contention-based ranging operation includes performing a contention-based one-to-many multi-millisecond (MMS) ranging operation.
8. A method comprising: The device's processor receives Physical Layer Service Data Units (PSDUs) as part of the Channel Impulse Response Report (CIR), where the CIR report taps are compressed for decompression on a per-receiver report (RR); and The processor determines whether the PSDU contains the complete RR or a portion of the complete RR based on the indication contained in the PSDU.
9. The method of claim 8, wherein the indication includes two bits at the beginning of the PSDU.
10. The method of claim 8, wherein the indication indicates whether the PSDU contains the complete RR, a first portion of the RR, or a second portion of the RR.
11. The method of claim 8, wherein the indication is located in the Report Identity Control (RIC) field carried in the PSDU.
12. The method of claim 8, wherein the indication is located in the Receive Report Control (RRC) field carried in the PSDU.
13. The method of claim 8, wherein the indication is located in the Receive Report Description (RRD) field contained in a segment of the RR.
14. The method of claim 13, wherein the RRD bits are rearranged, and one or more reserved bits are shifted to the front of the RR as an indication.
15. The method of claim 13, wherein the length of the RRD field is relatively short when the indication indicates that the PSDU contains a second segment of the complete RR, and wherein the length of the RRD field is relatively long when the indication indicates that the PSDU contains a first segment of the complete RR or RR.
