WO2022057456A1

WO2022057456A1 - Slot updating method, electronic device, and storage medium

Info

Publication number: WO2022057456A1
Application number: PCT/CN2021/109014
Authority: WO
Inventors: 张烨
Original assignee: Oppo广东移动通信有限公司
Priority date: 2020-09-15
Filing date: 2021-07-28
Publication date: 2022-03-24
Also published as: CN114268898B; CN114268898A

Abstract

Disclosed are a slot updating method, an electronic device, and a storage medium, applicable in a base station X, the base station X being any base station in a positioning service system, the positioning service system comprising K base stations. The method comprises: the base station X, by listening for data frames pertinent to neighboring base stations of the base station X in the positioning service system to acquire slot occupancy tables, produces multiple slot occupancy tables, each base station corresponding to one slot occupancy table, and each slot occupancy table expressing a slot state of each base station among the K base stations; a first slot occupancy table of the base station X is acquired, a second slot occupancy table is produced by computing on the basis of the multiple slot occupancy tables and of the first slot occupancy table; and a slot number of the base station X is updated on the basis of the second slot occupancy table. The embodiments of the present application provide a flexible positioning service solution.

Description

Time slot update method, electronic device and storage medium

technical field

The present application relates to the technical field of electronic devices, and in particular, to a time slot update method, an electronic device and a storage medium.

Background technique

At present, in the indoor positioning technology based on ultra wideband (UWB), several fixed-position anchor devices (also known as base stations) are generally set up in the space where the user moves by wire. Tag device, the base station performs signaling interaction with each user's tag device to measure the distance between the local end and the tag device, and reports the distance and the identity information of the tag device to the location server. The distance information of a tag device calculates the current location of the user, so as to realize the location service. Among them, the new base station needs to interact with the positioning server to realize time slot configuration and position calibration, and the deactivation of the base station needs to interact with the positioning server to release time slot resources and update the topology of the positioning service system. Therefore, the current technical solutions lack flexibility.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a time slot update method, electronic equipment, and storage medium, so as to provide a flexible positioning service solution. The space division multiplexing of slots can realize unlimited base station capacity under the limited number of time slots.

In the first aspect, an embodiment of the present application provides a time slot update method, which is applied to a base station X, where the base station X is any base station in a positioning service system, and the positioning service system includes K base stations, and the K is greater than an integer of 1, the method includes:

The base station X obtains a time slot occupancy table by listening to the data frames of the neighboring base stations belonging to the base station X in the positioning service system, and obtains a plurality of time slot occupancy tables, each base station corresponds to a time slot occupancy table, and each time slot occupancy table. A slot occupancy table representing the slot status of each of the K base stations;

obtaining the first time slot occupancy table of the base station X;

performing an operation according to the multiple timeslot occupancy tables and the first timeslot occupancy table to obtain a second timeslot occupancy table;

The time slot number of the base station X is updated according to the second time slot occupation table.

In a second aspect, an embodiment of the present application provides a base station X, where the base station X is any base station in a positioning service system, and the positioning service system includes K base stations, where K is an integer greater than 1, and the base station X includes a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs including for performing the following Instructions for steps in a method:

obtaining the first time slot occupancy table of the base station X;

In a third aspect, embodiments of the present application provide an electronic device, including a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory and configured to be processed by the above-mentioned processing The above program includes instructions for executing the steps in the method in the first aspect of the embodiment of the present application.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program for electronic data exchange, wherein the computer program causes a computer to execute the computer program as described in the first embodiment of the present application. Some or all of the steps described in an aspect.

In a fifth aspect, an embodiment of the present application provides a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to execute as implemented in the present application. Examples include some or all of the steps described in the first aspect. The computer program product may be a software installation package.

Description of drawings

In order to illustrate the technical solutions in the embodiments of the present application more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only for the present application. In some embodiments, for those of ordinary skill in the art, other drawings can also be obtained according to these drawings without any creative effort.

1A is a schematic diagram of an application scenario based on UWB technology positioning provided by an embodiment of the present application;

FIG. 1B is a schematic diagram of an SS-TWR ranging signal interaction provided by an embodiment of the present application;

1C is a schematic diagram of the interaction of ranging signals of a DS TWR provided by an embodiment of the present application;

1D is a schematic diagram of one-to-many interaction between a tag and a base station provided by an embodiment of the present application;

1E is a schematic diagram of obtaining final coordinates by computing TDoA according to an embodiment of the present application;

1F is a schematic structural diagram of a super frame provided by an embodiment of the present application;

1G is a schematic structural diagram of a super frame added to a beacon frame provided by an embodiment of the present application;

FIG. 1H is a schematic structural diagram of a positioning service system 10 provided by an embodiment of the present application;

FIG. 1I is an exemplary diagram of the composition of a base station 200 provided by an embodiment of the present application;

2A is a schematic flowchart of a time slot update method provided by an embodiment of the present application;

2B is a schematic diagram of a time slot configuration process provided by an embodiment of the present application;

FIG. 2C is an example diagram of a base station location provided by an embodiment of the present application;

2D is a schematic diagram of a base station signal coverage provided by an embodiment of the present application;

3 is a schematic structural diagram of an electronic device provided by an embodiment of the present application;

FIG. 4 is a block diagram of functional units of a time slot updating apparatus provided by an embodiment of the present application.

detailed description

In order to make those skilled in the art better understand the solutions of the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only It is a part of the embodiments of the present application, but not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative work fall within the protection scope of the present application.

The terms "first", "second" and the like in the description and claims of the present application and the above drawings are used to distinguish different objects, rather than to describe a specific order. Furthermore, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but optionally also includes unlisted steps or units, or optionally also includes For other steps or units inherent to these processes, methods, products or devices.

Reference herein to an "embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the present application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor a separate or alternative embodiment that is mutually exclusive of other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

In this application, electronic devices may include devices with various ultra wide band (UWB) modules, such as smart phones, in-vehicle devices, wearable devices, charging devices (such as power banks), smart watches, smart glasses, wireless Bluetooth headsets, computing devices or other processing devices connected to wireless modems, and various forms of User Equipment (UE), Mobile Station (MS), virtual reality/augmented reality devices, terminal devices ) and so on, the electronic device may also be a base station or a device or server having the function of a base station.

The electronic devices may also include smart home devices, and the smart home devices may be at least one of the following: smart speakers, smart cameras, smart rice cookers, smart wheelchairs, smart massage chairs, smart furniture, smart dishwashers, smart TVs, smart refrigerators, Smart fans, smart heaters, smart drying racks, smart lights, smart routers, smart switches, smart switch panels, smart humidifiers, smart air conditioners, smart doors, smart windows, smart cooktops, smart disinfection cabinets, smart toilets, floor sweeping Robots, etc., are not limited here.

In order to better understand the solutions of the embodiments of the present application, related terms and concepts that may be involved in the embodiments of the present application are first introduced below.

(1) Ultra-wideband UWB is an unloaded communication technology. According to the standards of the Federal Communications Commission of the United States, the operating frequency band of UWB is 3.1-10.6GHz, and the ratio of -10dB bandwidth to the center frequency of the system Greater than 20%, the system bandwidth is at least 500MHz. Data is transmitted using narrow, non-sinusoidal pulses in nanoseconds to microseconds. The traditional ultra-wideband UWB technology positioning is used in industrial places such as mines and warehouses. Its main application scenario is to monitor the real-time position of employees and goods indoors. The base stations have been calibrated in indoor locations, and are connected to each other through wired or Wi-Fi for synchronization. In the example application scenario shown in Figure 1A, A is a base station that supports UWB technology positioning, CLE PC is a location server (also known as a location server, such as a location computing device), and Ethernet LAN-TCP/IP refers to the communication between base stations. Supports the transmission control protocol/Internet protocol of the Ethernet local area network, and realizes the position monitoring of the user wearing the tag device by setting at least one base station in each area.

The one-to-one interaction between the tag and the base station has two modes: SS-TWR and DSTWR.

The first, unilateral two-way ranging (single-sided two-way ranging, SS-TWR)

SS-TWR is a simple measurement of the time of a single round-trip message. Device A actively sends data to device B, and device B responds to device A with data. As shown in Figure 1B, Device A (Device A) actively sends (TX) data (corresponding to the TX time node to the starting point of Tround time in the figure), and records the sending timestamp at the same time, and Device B (Device B) records it after receiving (RX) Reception timestamp, RMARKER indicates the time node when the data is transmitted (received or sent); after the delay Treply, device B sends the data and records the sending timestamp, while device A receives the data and records the receiving timestamp.

Therefore, two time difference data can be obtained, the time difference Tround of device A (the time difference between sending data and receiving data) and the time difference Treply of device B, and finally the flight time of the wireless signal is obtained.

as follows:

The two difference times are calculated based on the local clock. The local clock error can be offset, but there will be a slight clock offset between different devices. Assume that the clock offsets of device A and device B are eA and eB, respectively. Therefore, the resulting flight time will increase with increasing Treply, and the equation of the ranging error error is as follows:

Among them, Tprop is the actual flight time of the wireless signal.

The second, bilateral two-way ranging (double-sided two-way Ranging, DS TWR)

DS TWR obtains two round-trip delays based on 3 message transfers between the initiating node and the responding node, and measures the distance at the responding end. As shown in Figure 1C, when device A receives the data, it returns the data immediately, and finally the following four time differences can be obtained:

①The first time difference Tround1 of device A (the time difference between sending data and receiving data)

② Delay Treply1 after device B receives data for the first time (delay after receiving the first data)

③The time difference Tround2 of device B (the time difference between sending data and receiving data)

④ Delay Treply2 after device A receives data for the first time (delay after receiving the second data)

Use the following formula to calculate the flight time of the wireless signal

Time-of-flight error analysis of bilateral two-way ranging: The above ranging mechanisms are all asymmetric ranging methods because they do not require the same response time. Even with a 20ppm crystal, the clock error is in the ps level. The error formula is as follows:

where k _a and k _b are the ratios of the actual frequency of the crystal oscillator to the nominal frequency, so k _a and k _b are very close to 1.

One-to-many interaction between tags and base stations

Each employee or cargo has a tag with a unique identification, which regularly broadcasts signals to the surrounding base stations. As shown in Figure 1D, after the tag (Tag in the figure) broadcasts the signal (pol in the figure), RMARKER indicates the time node when the data is transmitted (received or sent); the three surrounding base stations (Anchor A, Anchor B, Anchor C) receives the signal, and sends a response signal to the tag in turn according to the synchronization information between the base stations (RespA, RespB, RespC in the figure). When the tag receives the reply signals from three or more base stations, it sends a broadcast signal to the outside world (Final in the figure). Therefore, each base station can use the DS TWR mechanism to exchange signals to calculate the flight time of the wireless signal at its own node after the three base stations hear the final packet respectively.

Among them, TpropA is the flight time of the wireless signal between base station A and the tag, TpropB is the flight time of the wireless signal between base station B and the tag, TpropC is the flight time of the wireless signal between base station C and the tag, and Ground1A is the tag. The time difference between sending data and receiving data from base station A, Ground1B is the time difference between the tag sending data and receiving data from base station B, Ground1C is the time difference between the tag sending data and receiving data from base station C, Treply1A is the delay of base station A, and Treply1B is the delay of base station B. , Treply1C is the delay of base station C, Treply2A is the delay of the tag receiving the signal of base station A to sending the final signal, Treply2B is the delay of the tag receiving the signal of base station B to sending the final signal, Treply2C is the delay of the tag receiving the signal of base station C Delay to send Final signal.

Each base station uploads the calculation results to the main server. As shown in Figure 1E, the three-dimensional operation TDoA is performed on the main server to obtain the final coordinates. X1, X2, and X3 correspond to the positions of Anchor A, Anchor B, and Anchor C, and the circle corresponds to the distance determined by the flight time of the wireless signal as the radius. range, Xu is the position of the label.

(2) Super frame

In an indoor scene with multiple tags, a superframe needs to be set up for non-stop repetition across the entire timeline. Each tag needs to be allocated a time slot, and its position is calculated in its own slot and uploaded to the base station.

The schematic structure of the super frame shown in Figure 1F, interval represents the time interval, scheduling interval represents the scheduled time interval, Tag I slot represents the time slot of the tag i, Poll TX represents the tag sending signal, Resp-X RX represents the tag receiving base station The signal of X, Resp-Y RX means that the tag receives the signal of base station Y, Resp-Z RX means that the tag receives the signal of base station Z, and Final TX means that the tag sends the final signal.

If the synchronization between the base stations is also realized wirelessly through the ultra-wideband UWB technology, it is necessary to add a beacon frame (BeaCoN, BCN) time slot before the time slot for the interaction between the tag and the base station. Order. As shown in Figure 1G, Superframe(n) represents superframe n, Idle Time is idle time, BCN is the time slot that carries the beacon frame, SVC represents the reserved time slot, and TWR Slot represents the time slot that carries the bidirectional ranging signal. wake up is the wake-up time slot, sleep is the sleep time slot, and RX represents the receiving state.

The above traditional toB ultra-wideband UWB technology scenarios can be summarized as the following features:

The number of tags is limited, and the slot address of each tag has been allocated.

The base station needs to be calibrated in advance, and the signal is synchronized by connecting by wire or in a way different from the ultra-wideband UWB technology.

Both the base station and the tag need to send and receive signals.

The base station side calculates the indoor coordinates of the tag and returns it to the server. The tag itself does not know its own coordinates.

The tag only wakes up in its own slot cycle.

Based on the problems existing in the current UWB positioning technology, the present application proposes a time slot update method and system, which will be described in detail below.

Referring to FIG. 1H , an embodiment of the present application provides a positioning service system 10 , which includes a tag device 100 and a base station 200 , wherein the base station 200 and the tag device 100 exchange UWB signals, and the base station 200 is a server device supporting UWB technology. For example, a UWB base station, a UWB anchor device, etc., the tag device 200 is a client device supporting UWB technology, such as but not limited to a wireless communication device 110, an ingress transponder device 120, a home device 130, and a tethered tag 140. Other UWB devices (which are not shown in Figure 1H for simplicity) may include other computing devices, including but not limited to laptops, desktops, tablets, personal assistants, routers, monitors, televisions, printers and electrical appliances.

FIG. 1I is a diagram showing an example composition of a base station 200 provided by an embodiment of the present application. The base station 200 may include a core processing unit 201, a UWB transceiver 202, a communication unit 203, a general interface unit 204, and a power supply unit 205. The communication unit 203 may specifically include, but is not limited to, one of Bluetooth, Wi-Fi, and cellular communication modules. Or more, the general interface unit 204 is used to access various sensors, including but not limited to indicator lights, vibration sensors and other sensors, and the power supply unit 205 may include, but is not limited to, batteries, DC-to-DC DC-DC modules, filter circuit and undervoltage detection circuit, etc.

The core processing unit 201 may include a processor and a memory, and the processor may include one or more processing cores. The processor uses various interfaces and lines to connect various parts of the entire base station 200, and executes the various functions of the base station 200 by running or executing the instructions, programs, code sets or instruction sets stored in the memory, and calling the data stored in the memory. functions and processing data. The processor may include one or more processing units, for example, the processor may include a central processing unit (Central Processing Unit, CPU), an application processor (application processor, AP), a modem processor, a graphics processor (graphics processing unit) unit, GPU), image signal processor (ISP), controller, video codec, digital signal processor (DSP), baseband processor, and/or neural network processor (neural) -network processing unit, NPU), etc. The controller may be the nerve center and command center of the base station 200 . The controller can generate an operation control signal according to the instruction operation code and timing signal, and complete the control of fetching and executing instructions.

The memory may include random access memory (Random Access Memory, RAM), or may include read-only memory (Read-Only Memory). Optionally, the memory includes a non-transitory computer-readable storage medium. Memory may be used to store instructions, programs, codes, sets of codes, or sets of instructions. The memory may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for implementing at least one function (such as a touch function, a sound playback function, an image playback function, etc.), Instructions for implementing the following method embodiments, etc., the operating system can be an Android (Android) system (including a system based on the deep development of the Android system), an IOS system developed by Apple (including a system based on the deep development of the IOS system) or other systems. The storage data area may also store data created by the base station 200 during use (such as calibrated location data) and the like.

It should be noted that the above-mentioned schematic structural diagram of the base station 200 is only an example, and the specific components may be more or less, which is not limited here.

Please refer to FIG. 2A. FIG. 2A is a schematic flowchart of a method for updating a time slot provided by an embodiment of the present application, which is applied to a base station X to be added to a positioning service system. The base station X is any base station in the positioning service system. The positioning service system includes K base stations, where K is an integer greater than 1. As shown in the figure, this time slot update method includes the following operations.

201. The base station X obtains a time slot occupancy table by listening to data frames of neighboring base stations belonging to the base station X in the positioning service system, and obtains a plurality of time slot occupancy tables, and each base station corresponds to a time slot occupancy table , and each time slot occupancy table represents the time slot state of each base station in the K base stations.

Wherein, the data frame may be a beacon frame, and the beacon frame may carry valid information of the base station (eg, its own device number, time slot number, location information, signal transmission start time stamp, etc.). Different base stations occupy different beacon frames. When the time slot of a beacon frame is occupied by a base station, the frequency domain resources of the beacon frame will carry the effective information of the base station, such as base station identification, location coordinates and other information. Domain resources, confirm that the beacon frame carrying valid information is occupied. The base station numbers of adjacent base stations of any base station in the positioning service system may be different. The neighboring base stations of a certain base station can be understood as the base stations that can receive the data frames of the base station. For example, the neighboring base stations of the base station X can be understood as the base stations that can receive the data frames of the base station X.

In a possible example, the number of neighboring base stations of the base station X is within a preset range.

The preset range may be set by the user or the system defaults.

In a possible example, the preset range includes a lower threshold and an upper threshold, the lower threshold is smaller than the upper threshold, the lower threshold is 4, and the upper threshold is 6.

Among them, in this embodiment of the present application, the preset range may include a lower threshold and an upper threshold. Since the number of base station interactions will directly affect the time length of the entire super frame, it is stipulated that any base station indoors can hear the proximity of the base station. The number of base stations must be less than N, that is, the upper threshold (normally N<=6). When a base station can hear the information sent by N or more base stations, the base station enters a sleep state and wakes up after a random duration to monitor the time slot information again. If N=6, poll every 6 base stations. There is a guard interval slot after the polling and proceed to the next superframe. And because of the need to realize automatic mapping, the lower threshold of N is 4.

In a possible example, the positioning service system further includes base station Y, base station J, and base station W; in step 201, by listening to data frames of neighboring base stations belonging to the base station X in the positioning service system to obtain the time Before obtaining the slot occupancy table, the following steps may also be included:

A1. The base station X listens to the data frame within a preset time period, and listens to the data frame Y of the base station Y, the data frame J of the base station J, and the data frame W of the base station W, and the The preset time period is a continuous preset number of positioning service periods, and the positioning service period is the working period of the positioning service system;

A2. The base station X configures its own time slot number according to the time slot occupation of the data frame Y, the data frame J and the data frame W.

In a specific implementation, the base station X may configure its own time slot number by listening to the data frame of at least one base station of the positioning service system. The specific manner in which the base station X implements the configuration of its own time slot number may be various, and is not limited here.

For example, the positioning service system may further include base station Y, base station J, and base station W; base station X realizes the configuration of its own time slot number by listening to the data frame of at least one base station of the positioning service system, including: Suppose that the data frame is listened to within the time period, and the data frame Y of base station Y, the data frame J of base station J, and the data frame W of base station W are detected, and the preset time period is a continuous preset number of positioning service cycles. The period is the working period of the positioning service system; the base station X configures its own time slot number according to the time slot occupation of data frame Y, data frame J and data frame W.

Among them, the purpose of channel listening is to obtain the actual occupancy of the channel in the current space as accurately as possible. If the listening time is too short, the listening accuracy will be affected. If the listening time is too long, the network initialization efficiency will be affected. Therefore, the preset time The segment can be any reasonable preset duration, such as 10 to 100 times the sending time interval, which is not uniquely limited here. For example, if the sending time interval of the positioning service system is 15 ms, the preset time segment can be Any value from 150ms to 1500ms.

In specific implementation, base station X can determine the time slots occupied by base station Y, base station J, and base station W through data frame listening, so as to select one time slot except for unoccupied time slots, such as sequential selection or random selection.

In addition, the base station X can configure the equipment number while configuring the time slot according to the unified equipment numbering rule. If the change is made according to the digital numbering mechanism, the base station X determines the number of the occupied base station according to the data frame; the base station X according to the occupied base station number; The base station number of the device determines its own device number. For example, assuming that base station X hears base stations with device numbers 2, 4, and 5, it can configure its own device number as 3.

The time slot configuration process of the above steps can be described by the schematic flow chart shown in FIG. 2B , wherein, INIT corresponds to the initial power-on state, HAVE_ID corresponds to the state that the base station configures the device number for itself, NO_ID corresponds to the state that the device number is not configured, NO_ID_REVC corresponds to the status of data reception performed by the base station with no device number configured.

Specifically, first, the base station switches to the power-on state;

If the local end is directly set as the seed node (that is, the first base station in the current space), it directly occupies the first address (that is, the transmission resource composed of the slot address + the working frequency band) and starts to work;

If the local end is not set as a seed node, the base station will unconditionally receive 10 cycles for network listening. If this address is not reported in the received frame (each module reports the address of the received frame)), the time slot configuration is performed according to the idle address;

Then, it continuously listens for 10 cycles. If there is no response within the 10 cycles, it is confirmed that the local machine is not a seed node. No response means that the data frame cannot be received, or the local machine is not reported in the received frame. address.

It can be seen that in this example, base station X implements a reasonable configuration of its own time slot resources by listening to data frames, avoids resource configuration conflicts, does not need to send signaling to other base stations, and has no impact on the states of other base stations.

In addition, in this example, the positioning service system may further include a base station Z; the method further includes: the base station X receives the data frame Z of the base station Z, and determines its own time slot number and the data frame The time slot numbers carried by the frame Z are the same; the base station X deletes its own time slot number, and triggers the reconfiguration process through preset conditions.

The deletion means that the base station X no longer occupies the time slot resource.

The preset condition may be a timer timeout, etc., and the timing duration of the timer may be any preset value or an empirical value, etc., which is not uniquely limited here.

Wherein, the base station Z may be a base station co-located with base station X in a similar time period, base station X releases the time slot resource, and base station Z may also detect the conflict synchronously and release the time slot resource, and then randomly select an idle time slot Perform configuration, or, base station X and base station Z mutually confirm complementary and conflicting time slot configurations.

It can be seen that, in this example, when base station X detects a time slot configuration conflict, it can perform configuration rollback by deleting its own time slot number, thereby realizing conflict resolution.

Alternatively, the method further includes: the base station X broadcasts a collision test request message according to its own time slot number, and listens to a collision test response message, where the collision test response message is used to indicate that the time slot of the base station X is the same as the time slot of the base station X. The time slot of a certain base station in the positioning service system collides; if a collision test response message is detected, the time slot number of the base station is deleted, and the reconfiguration process is triggered by preset conditions.

It can be seen that, in this example, whether there is a conflict is determined through message interaction with other base stations, and the real-time performance is better.

For another example, the base station X implements the configuration of its own time slot number by listening to the data frame of at least one base station of the positioning service system, including: the base station X receiving the data frame of the at least one base station; The base station X extracts the time slot number report of each data frame in the data frames of the at least one base station, and the time slot number report includes the corresponding relationship between the device number of the base station and the time slot number; the base station X according to the At least one slot number report of at least one base station determines its own slot number.

Wherein, the time slot number report may be the time slot numbers of all base stations directly heard by the current base station and its own time slot numbers.

It can be seen that, in this example, the base station X can more comprehensively learn the time slot occupancy status of other base stations in the current system through the time slot number, and provide the time slot configuration accuracy.

In a possible example, the following steps may also be included:

The base station X performs data interaction with at least three base stations of the positioning service system to realize automatic mapping of its own position.

The self-position may specifically be the coordinate information of the base station X, or the position indication information corresponding to a specific space, such as room number, house number, security door, elevator number, and so on.

It can be understood that the specific implementation manners for the base station X to realize its own location mapping can be various, such as the SS TWR algorithm, the DS TWR algorithm, the RTDoA algorithm, etc., which are not uniquely limited here.

For example, the base station X performs data interaction with at least three base stations of the positioning service system to realize automatic mapping of its own position, including: the base station X communicates with the positioning service system according to the reverse time difference of arrival RTDOA algorithm. At least three base stations perform data exchange to realize automatic mapping of their own positions.

In this example, the base station X performs data interaction with at least three base stations of the positioning service system according to the reverse time difference of arrival RTDOA algorithm to realize automatic mapping of its own position, including: the base station X performs steps A, B, At least two of C, to obtain at least two distance differences;

A. The base station X obtains the time slot number of the data frame Y carried by the data frame Y and the position of the base station Y, and obtains the time slot number of the data frame J carried by the data frame J and the own position of the base station J, and calculate the signal flight time between the base station Y and the base station J according to the own position of the base station Y and the own position of the base station J, and according to the data frame Y The time slot number of the data frame J and the time slot number of the data frame J determine the signal transmission delay of the base station Y and the base station J, and according to the signal flight time between the base station Y and the base station J and the The signal transmission delay of base station Y and base station J determines the data frame transmission time difference between base station Y and base station J, and the local end is determined according to the time of receiving the data frame Y and the time of receiving the data frame J The data frame X receiving time difference of the device, and the distance difference between the first distance and the second distance is determined according to the data frame X receiving time difference and the data frame sending time difference between the base station Y and the base station J. The first distance The distance is the distance between the base station X and the base station Y, and the second distance is the distance between the base station X and the base station J;

B. The base station X obtains the time slot number of the data frame Y carried by the data frame Y and the position of the base station Y, and obtains the time slot number of the data frame K carried by the data frame K and the own position of the base station K, and calculate the signal flight time between the base station Y and the base station K according to the own position of the base station Y and the own position of the base station K, and according to the data frame Y The time slot number of the data frame K and the time slot number of the data frame K determine the signal transmission delay of the base station Y and the base station K, and according to the signal flight time between the base station Y and the base station K and the The signal transmission delay of base station Y and base station K determines the data frame transmission time difference between base station Y and base station K, and the local end is determined according to the time of receiving the data frame Y and the time of receiving the data frame K The data frame Y receiving time difference of the device, and the distance difference between the first distance and the third distance is determined according to the data frame Y receiving time difference and the data frame sending time difference between the base station Y and the base station K, and the The third distance is the distance between the base station X and the base station K;

C. The base station X obtains the time slot number of the data frame J carried by the data frame J and the position of the base station J, and obtains the time slot number of the data frame K carried by the data frame K and the own position of the base station K, and calculate the signal flight time between the base station J and the base station K according to the own position of the base station J and the own position of the base station K, and according to the data frame J The time slot number of the data frame K and the time slot number of the data frame K determine the signal transmission delay of the base station J and the base station K, and according to the signal flight time between the base station J and the base station K and the The signal transmission delay of base station J and base station K determines the data frame transmission time difference between base station J and base station K, and the local end is determined according to the time of receiving the data frame J and the time of receiving the data frame K The data frame J receiving time difference of the device, and the distance difference between the second distance and the third distance is determined according to the data frame J receiving time difference and the data frame sending time difference between the base station J and the base station K;

The base station X determines the own position of the base station X according to the at least two distance differences, the own position of the base station Y, the own position of the base station J, and the own position of the base station K.

It can be seen that in this example, base station X can accurately calculate its own position through the RTDOA algorithm, can use UWB technology, does not need to configure additional positioning technology, and does not need to send signaling to other base stations, improving positioning efficiency.

For another example, the base station X performs data interaction with at least three base stations of the positioning service system to realize automatic mapping of its own position, including: the base station X according to a preset unilateral two-way ranging SS-TWR algorithm It performs data interaction with at least three base stations of the positioning service system to realize automatic mapping of its own position.

In this example, the base station X performs data interaction with at least three base stations of the positioning service system according to a preset unilateral two-way ranging SS-TWR algorithm to realize automatic mapping of its own position, including:

The base station X broadcasts the first ranging message, and simultaneously records the sending time of the first ranging message;

The base station X receives the second ranging message from the base station Y, the third ranging message from the base station J, and the fourth ranging message from the base station K, the second ranging message includes the base station The time when Y receives the first ranging message and the time when the second ranging message is sent, and the third ranging message includes the time when the base station J receives the first ranging message and sends the first ranging message. The time of three ranging messages, the fourth ranging message includes the time when the base station K receives the first ranging message and the time when the fourth ranging message is sent;

The base station X is based on the time when the first ranging message is sent, the time when the base station Y receives the first ranging message and the time when the second ranging message is sent in the second ranging message, the time at which the base station X receives the second ranging message, to determine the distance between the base station X and the base station Y;

The base station X is based on the time when the first ranging message is sent, the time when the base station J receives the first ranging message and the time when the third ranging message is sent in the third ranging message, the time when the base station X receives the third ranging message, and determines the distance between the base station X and the base station J;

The base station X according to the sending time of the first ranging message, the time when the base station K receives the first ranging message and the time when the fourth ranging message is sent in the fourth ranging message, the time at which the base station X receives the fourth ranging message, to determine the distance between the base station X and the base station K;

The base station X calculates its own position according to the distance between the local device and the base station Y, the distance between the local device and the base station J, and the distance between the local device and the base station K.

It can be seen that in this example, the base station X can accurately calculate its own position through the SS-TWR algorithm, and can use the UWB technology without additionally configuring the positioning technology, which reduces the complexity of implementation and improves the convenience of positioning.

Further, the following steps may also be included:

The base station X broadcasts the data frame X according to its own time slot number and its own position to join the positioning service system, and the positioning service refers to the data broadcast by the target device by receiving any M base stations of the positioning service system. frame to determine its own position, the target device is a base station or a tag device, and M is an integer greater than or equal to 3.

Wherein, when M is 3, two-dimensional coordinate positioning can be realized, and when M is 4, three-dimensional coordinate positioning can be realized.

In the specific implementation, the base station X implements the hot-swap function, and the tag device can be converted into a base station for use in some cases.

In a possible example, the positioning service system further includes a base station L, the signal coverage of the base station X and the signal coverage of the base station L are independent of each other, and the time slot number of the base station X and the base station L The configuration of the same time slot number is supported.

In a specific implementation, the signal coverage of the ranging service is expanded by adding base stations.

In the specific implementation, when a base station is expanded, if the base station needs to automatically map its own position, it needs to ensure that at least three base stations with calibrated positions and the new base station are reachable, so that accurate positioning can be achieved.

For example, the example diagram of the base station location shown in FIG. 2C is illustrated. In the figure, X and Y refer to the position coordinate axes, each circle represents a base station, and the connection between the circles indicates that the signals of the two base stations are reachable (that is, the direct communication distance between the base stations is the length of the connection). It is referred to as base station and base station reachable. Assuming that the user initially sets the base station at the coordinates (0,0), (2,0), (0,2), if the base station at the coordinate (1,1) is added, because the base station at (1,1) The base stations at coordinates (0,0), (2,0), and (0,2) are reachable respectively, so the base station at (1,1) can realize position calibration through automatic surveying and mapping.

It can be seen that, in this example, the base station supports hot-plugging to expand the location service network, which is convenient to use.

In this possible example, if the added base station and the target base station in the multiple base stations have the same time slot number, the signal coverage of the added base station and the signal coverage of the target base station are independent of each other .

As shown in Figure 2D, each signal strength indicator on the graph represents a base station, and each ellipse represents the signal coverage of a pair of base stations. As shown in the figure, due to the limitation of signal coverage, for example, base station A1 can hear the information of surrounding A2, A3, and A4, therefore, 4 base stations can be heard at the same time at A1; base station A3 can hear surrounding A1, A2, Information of A4, A5, A6, therefore, 6 base stations can be heard at the same time at A3. For another example, although base station A5 cannot directly hear A1, A5 obviously cannot reuse the time slot of A1. Because A1 and A5 can be heard in turn on the A3 side, if the two share a time slot, it will cause a collision.

Base stations A1 and A2 can only receive base stations A2, A1, A3, and A4, and there are only reports from A1 to A6 in the received data frames, so that A1 and A2 cannot know the existence of A7 and A8. These two pairs of base stations Anchors may be assigned to the same slot number. But this will not cause the signal to interfere. Assuming the base station signal coverage radius is unit 1, if the signals of the two base stations will interfere with each other, the signal coverage of the two base stations overlaps, that is, the distance between the two base stations is less than 2. Obviously, when the distance between the two base stations is less than 1, the base station can If a data frame from another base station is directly received, the two base stations will not be assigned to the same time slot. When the distance between the two base stations is between 1 and 2, the base station cannot directly receive the data frame of the other base station, but the base station may know that another base station exists by receiving the number report in the data frame, thereby avoiding the time slot number. conflict.

Therefore, if any two base stations (called base station 1 and base station 2) are to have a time slot number conflict, the following two conditions must be met:

(a) The distance from base station 1 to base station 2 is between 1 and 2.

(b) There is no base station 3 so that the distances from base station 3 to base station 1 to base station 2 are all <1.

A base station communicates with base stations within its communication range, and it is defined that A and C are reachable: A and C communicate with each other or (the existence of B makes A and B reachable, and B and C are reachable). Then A and C are unreachable <=> A and C are not interoperable and (for any base station B, B and A are not reachable or B and C are not reachable), non-intercommunication is a necessary condition for unreachability, ==> A and C are not reachable Intercommunication and (for any base station B, B and A do not communicate or B and C do not communicate) ==> A and C do not communicate and (there is no base station B, B communicates with A and B communicates with C) ==> the above two These conditions make it possible to ensure that any two base stations are reachable when the base stations are laid out, so that the base stations with the same time slot number will not conflict with each other. Since the signals between base stations will not overlap and cover, there will be no interference. In this way, the time slot space division multiplexing of the network is realized, and the infinite base station capacity under the limited number of time slots can be realized.

Due to the reachable transferability, this can be ensured by ensuring that the new base station communicates with at least one previously deployed base station from the second base station during deployment.

In the specific implementation, in the reverse TDoA mode, the basic timing interaction between the base station and the tag is shown in the following table. The base station can broadcast information to neighboring base stations and tags by polling according to its own time slot number; The mutual ranging information of the base stations and the distance information from the base stations to each base station obtain their own positioning. The following table: Base station label RTDoA timing table:

Since the number of base station interactions directly affects the time length of the entire super frame, it can be specified that any base station indoors, the number of adjacent base stations that the base station can hear must be less than N (usually N<=6). When a base station can hear the information sent by N or more base stations, the base station enters a sleep state and wakes up after a random duration to monitor the time slot information again. If N=6, poll every 6 base stations. There is a guard interval slot after the polling and proceed to the next superframe.

202. Obtain the first time slot occupation table of the base station X.

The first time slot occupancy table includes the time slot states of each base station adjacent to base station X, and the time slot state can be either an idle state or an occupied state. For example, the idle state can be represented by 0, and the occupied state can be represented by 1. In specific implementation, the base station X may determine its corresponding first time slot occupation table based on its own coverage.

203. Perform operations according to the multiple timeslot occupancy tables and the first timeslot occupancy table to obtain a second timeslot occupancy table.

The operation mode may be a logical operation or a physical operation, and the logical operation may be an OR operation.

In a possible example, in the above step 203, an operation is performed according to the multiple timeslot occupancy tables and the first timeslot occupancy table to obtain a second timeslot occupancy table, which can be implemented as follows:

An OR operation is performed according to the plurality of time slot occupation tables and the first time slot occupation table to obtain the second time slot occupation table.

Wherein, multiple timeslot occupancy tables and the first timeslot occupancy table can be ORed together to obtain a second timeslot occupancy table, and the timeslot status of each base station can be queried through the second timeslot occupancy table.

204. Update the time slot number of the base station X according to the second time slot occupation table.

Among them, the time slot status of each base station can be seen in the second time slot occupancy table, the time slot in the idle state can be determined from the second time slot occupancy table, and the time slot number of the base station X can be updated to be in the idle state. The time slot number of the base station corresponding to the time slot in the idle state. If there is no unoccupied time slot in the second time slot occupancy table, the time slot number of the base station X cannot be updated.

In a possible example, the above step 204, updating the time slot number of the base station X according to the second time slot occupancy table, may include the following steps:

41. Determine an unoccupied target time slot in the second time slot occupation table, where the target time slot is any time slot in the unoccupied time slots in the second time slot occupation table;

42. Update the time slot number of the base station X to the time slot number of the target base station corresponding to the target time slot.

Wherein, the second time slot occupancy table may use 0 to represent an idle time slot and 1 to represent an occupied time slot, then the unoccupied target time slot in the second time slot occupation table can be determined, that is, from the second time slot occupation table Find 0, the target time slot is any time slot in the unoccupied time slot in the second time slot occupancy table, and then, the time slot number of the base station X can be updated to the time slot number of the target base station corresponding to the target time slot .

In a possible example, the method further includes:

B1. Detect whether there is an unoccupied time slot in the second time slot occupancy table;

B2. When there is an unoccupied time slot in the second time slot occupation table, the step of determining an unoccupied target time slot in the second time slot occupation table is performed;

B3. When there is no unoccupied time slot in the second time slot occupation table, confirm that the time slot number of the base station X cannot be updated.

In the specific implementation, it can be detected whether there are unoccupied time slots in the second time slot occupation table, that is, 0 is found from the second time slot occupation table, and there are unoccupied time slots in the second time slot occupation table. If it is, step 41 can be executed, otherwise, when there is no unoccupied time slot in the second time slot occupancy table, it is confirmed that the time slot number of the base station X cannot be updated.

In this embodiment of the present application, each base station may also need to upload the time slot occupancy table that it has sensed when broadcasting to the outside world in sequence.

By way of example, as shown in FIG. 2D , the time slot occupation table of each base station in base stations A1 to A8 is provided as follows, and the details are as follows:

The time slot occupancy table on the A1 side is: 1 1 1 1 0 0 0 0

The time slot occupancy table on the A2 side is: 1 1 1 1 0 0 0 0

The time slot occupancy table on the A3 side is: 1 1 1 1 1 1 0 0

The time slot occupancy table on the A4 side is: 1 1 1 1 1 1 0 0

The time slot occupancy table on the A5 side is: 0 0 1 1 1 1 1 1

The time slot occupancy table on the A6 side is: 0 0 1 1 1 1 1 1

The time slot occupancy table on the A7 side is: 0 0 0 0 1 1 1 1

The time slot occupancy table on the A8 side is: 0 0 0 0 1 1 1 1

Furthermore, whether any base station can occupy the time slot can be judged through the time slot occupancy table, specifically: the base station obtains the time slot occupancy tables of all surrounding neighboring base stations, and performs an OR logic operation on them.

Let's take another example, for example, the time slot table that needs to be "ORed" on the A5 side of the base station is:

The time slot occupancy table on the A3 side is: 1 1 1 1 1 1 0 0

The time slot occupancy table on the A4 side is: 1 1 1 1 1 1 0 0

The time slot occupancy table on the A5 side is: 0 0 1 1 1 1 1 1

The time slot occupancy table on the A6 side is: 0 0 1 1 1 1 1 1

The time slot occupancy table on the A7 side is: 0 0 0 0 1 1 1 1

The time slot occupancy table on the A8 side is: 0 0 0 0 1 1 1 1

In the specific implementation, the time slot occupancy table of A3, A4, A5, A6, A7 and A8 can be ORed to obtain a new time slot occupancy table: 1 1 1 1 1 1 1 1, it can be seen that, All slots are occupied and the slot number of A5 cannot be updated.

Let's take another example, for example, the time slot table that needs to be "OR" on the A7 side is:

The time slot occupancy table on the A5 side is: 0 0 1 1 1 1 1 1

The time slot occupancy table on the A6 side is: 0 0 1 1 1 1 1 1

The time slot occupancy table on the A7 side is: 0 0 0 0 1 1 1 1

The time slot occupancy table on the A8 side is: 0 0 0 0 1 1 1 1

In the specific implementation, the time slot occupancy table of A5, A6, A7 and A8 can be ORed to obtain a new time slot occupancy table: 0 0 1 1 1 1 1 1, it can be seen that the first two times If the slot is not occupied, the time slot number of A7 can be changed to the time slot number of A1. Similarly, the time slot number of A8 can be changed to the time slot number of A2. This method can ensure that at any point in space, all The numbers of the base stations are not the same, which will not cause time slot conflicts.

In a possible example, before the above step 201, the following steps may be included:

C1. Obtain the target iris image;

C2, performing image quality evaluation on the target iris image to obtain a target image quality evaluation value;

C3, when the target image quality evaluation value is greater than the preset image quality evaluation threshold, matching the target iris image with the preset iris template;

C4. Step 201 is executed when the target iris image is successfully matched with the preset iris template.

The preset image quality evaluation threshold and the preset iris template can be set by the user or the system defaults. In the specific implementation, the target iris image can be obtained through the camera, and at least one image quality evaluation index is used to evaluate the image quality of the target iris image to obtain the target image quality evaluation value. The image quality evaluation index can be at least one of the following: information entropy, Average gradient, edge retention, sharpness, etc., are not limited here. Further, when the target image quality evaluation value is greater than the preset image quality evaluation threshold, the target iris image and the preset iris template may be matched, and when the target iris image and the preset iris template are successfully matched, perform step 201, otherwise, Then, it can prompt to re-collect the iris image, which helps to improve the efficiency of iris recognition.

Further, in the above step C2, image quality evaluation is performed on the target iris image to obtain a target image quality evaluation value, which may include the following steps:

C21, carrying out multi-scale feature decomposition on the target iris image to obtain a low-frequency feature component image and a high-frequency feature component image;

C22. Divide the low-frequency feature component image into multiple regions;

C23. Determine the information entropy corresponding to each area in the multiple areas, and obtain multiple information entropies;

C24. Determine the average information entropy and the target mean square error according to the plurality of information entropies;

C25. Determine the target fine-tuning adjustment coefficient corresponding to the target mean square error;

C26, adjusting the average information entropy according to the target fine-tuning adjustment coefficient to obtain target information entropy;

C27, according to the preset mapping relationship between the information entropy and the evaluation value, determine the first evaluation value corresponding to the target information entropy;

C28, obtain the target first shooting parameter corresponding to the target iris image;

C29, according to the mapping relationship between the preset shooting parameters and the low-frequency weight, determine the target low-frequency weight corresponding to the first shooting parameter of the target, and determine the target high-frequency weight according to the target low-frequency weight;

C30. Determine the distribution density of target feature points according to the high-frequency feature component image;

C31. Determine the second evaluation value corresponding to the distribution density of the target feature points according to the mapping relationship between the preset feature point distribution density and the evaluation value;

C32. Perform a weighting operation according to the first evaluation value, the second evaluation value, the target low frequency weight and the target high frequency weight to obtain a target image quality evaluation value of the target iris image.

In a specific implementation, a multi-scale decomposition algorithm can be used to decompose the target iris image into multi-scale features to obtain a low-frequency feature component image and a high-frequency feature component image. The multi-scale decomposition algorithm can be at least one of the following: pyramid transform algorithm, wavelet transform, Contourlet transform, shearlet transform, etc., are not limited here. In specific implementation, the number of low-frequency feature component images may be one, and the number of high-frequency feature component images may be one or more. Further, the low-frequency feature component image can be divided into multiple regions, and the area of each region is the same or different. The low-frequency feature component image reflects the main features of the image and can occupy the main energy of the image, while the high-frequency feature component image reflects the detailed information of the image.

Further, the information entropy corresponding to each area in the multiple areas can be determined, and multiple information entropies can be obtained, and the average information entropy and the target mean square error can be determined according to the multiple information entropies, and the information entropy can reflect the image information to a certain extent. The mean square error can reflect the stability of image information. The mapping relationship between the preset mean square error and the fine-tuning adjustment coefficient may be pre-stored, and further, the target fine-tuning adjustment coefficient corresponding to the target mean square error may be determined according to the mapping relationship. In the embodiment of the present application, the value range of the fine-tuning adjustment coefficient may be is -0.075 to 0.075.

Further, the average information entropy can be adjusted according to the target fine-tuning adjustment coefficient to obtain the target information entropy, where the target information entropy=(1+target fine-tuning adjustment coefficient)*average information entropy. The preset mapping relationship between the information entropy and the evaluation value may be stored in advance, and further, the first evaluation value corresponding to the target information entropy may be determined according to the preset mapping relationship between the information entropy and the evaluation value.

In addition, the first shooting parameter of the target corresponding to the target iris image may be obtained, and the first shooting parameter of the target can be referred to the above description, which will not be repeated here. The mapping relationship between the preset shooting parameters and the low-frequency weights may also be pre-stored in the . The target low frequency weight determines the target high frequency weight, and the target low frequency weight+target high frequency weight=1.

Further, the distribution density of target feature points can be determined according to the high-frequency feature component image, where the target feature point distribution density=the total number of feature points of the high-frequency feature component image/area area. The preset mapping relationship between the distribution density of feature points and the evaluation value can also be pre-stored, and then, according to the preset mapping relationship between the distribution density of feature points and the evaluation value, the first target feature point distribution density corresponding to the target feature point distribution density can be determined. The second evaluation value, and finally, according to the first evaluation value, the second evaluation value, the target low-frequency weight and the target high-frequency weight, a weighted operation is performed to obtain the target image quality evaluation value of the target iris image, as follows:

Target image quality evaluation value = first evaluation value * target low frequency weight + second evaluation value * target high frequency weight

In this way, the image quality evaluation can be performed based on the two dimensions of the low-frequency component and the high-frequency component of the target iris image, and an evaluation parameter suitable for the shooting environment, that is, the target image quality evaluation value, can be accurately obtained.

It can be seen that the embodiment of the present application is applied to base station X, base station X is any base station in the positioning service system, the positioning service system includes K base stations, K is an integer greater than 1, and base station X listens to the positioning service system In the data frame of the neighboring base stations belonging to base station X, we can obtain the time slot occupancy table, and obtain multiple time slot occupancy tables. Each base station corresponds to a time slot occupancy table. Slot state, obtain the first time slot occupancy table of base station X, perform operations according to multiple time slot occupancy tables and the first time slot occupancy table, obtain the second time slot occupancy table, and update the base station X according to the second time slot occupancy table. slot number. In this way, by rationally using the dynamic numbering of time slots, on the premise of ensuring that any base station is adjacent to the base station with different numbers, the space division multiplexing of limited time slots in the same space can be realized, and the capacity of unlimited base stations can be realized under the limited number of time slots. .

Consistent with the above-mentioned embodiment, please refer to FIG. 3 , which is a schematic structural diagram of an electronic device provided by an embodiment of the present application. As shown in the figure, the electronic device includes a processor, a memory, a communication interface, and one or more A program, the one or more programs are stored in the memory and are configured to be executed by the processor, the electronic device may be a base station X, and the base station X is any base station in a positioning service system, and the positioning The service system includes K base stations, and the K is an integer greater than 1. In this embodiment of the present application, the above program includes instructions for executing the following steps:

obtaining the first time slot occupancy table of the base station X;

In a possible example, in the aspect of updating the time slot number of the base station X according to the second time slot occupancy table, the above program includes instructions for performing the following steps:

determining an unoccupied target time slot in the second time slot occupation table, where the target time slot is any time slot in the unoccupied time slots in the second time slot occupation table;

The time slot number of the base station X is updated to the time slot number of the target base station corresponding to the target time slot.

In one possible example, the above program further includes instructions for performing the following steps:

Detecting whether there is an unoccupied time slot in the second time slot occupancy table;

When there is an unoccupied time slot in the second time slot occupancy table, performing the step of determining an unoccupied target time slot in the second time slot occupancy table;

When there is no unoccupied time slot in the second time slot occupation table, it is confirmed that the time slot number of the base station X cannot be updated.

In a possible example, in the aspect of obtaining the second time slot occupancy table by performing operations according to the plurality of time slot occupancy tables and the first time slot occupancy table, the above program includes instructions for executing the following steps :

In a possible example, the positioning service system further includes base station Y, base station J, and base station W; in the positioning service system, the time slot is obtained by listening to data frames of neighboring base stations belonging to the base station X in the positioning service system. Before obtaining the occupancy table of multiple time slots, the above program also includes instructions for performing the following steps:

The base station X listens to the data frame within a preset time period, and listens to the data frame Y of the base station Y, the data frame J of the base station J, and the data frame W of the base station W. The time period is a continuous preset number of positioning service periods, and the positioning service period is the working period of the positioning service system;

The base station X configures its own time slot number according to the time slot occupation of the data frame Y, the data frame J and the data frame W.

The foregoing mainly introduces the solutions of the embodiments of the present application from the perspective of the method-side execution process. It can be understood that, in order to realize the above-mentioned functions, the electronic device includes corresponding hardware structures and/or software modules for executing each function. Those skilled in the art should easily realize that the present application can be implemented in hardware or in the form of a combination of hardware and computer software, in combination with the units and algorithm steps of each example described in the embodiments provided herein. Whether a function is performed by hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of this application.

In this embodiment of the present application, the electronic device may be divided into functional units according to the foregoing method examples. For example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units. It should be noted that the division of units in the embodiments of the present application is schematic, and is only a logical function division, and other division methods may be used in actual implementation.

FIG. 4 is a block diagram of functional units of the time slot updating apparatus 400 involved in the embodiment of the present application. The time slot updating apparatus 400 is applied to a base station X, where the base station X is any base station in a positioning service system, and the positioning service system includes K base stations, where K is an integer greater than 1, and the apparatus includes: The listening unit 401, the acquiring unit 402, the arithmetic unit 403 and the updating unit 404, wherein,

The listening unit 401 is configured to obtain a time slot occupancy table by listening to data frames of neighboring base stations belonging to the base station X in the positioning service system, and obtain a plurality of time slot occupancy tables, each base station corresponds to a time slot occupancy table. a slot occupancy table, where each time slot occupancy table includes the time slot status of each of the K base stations;

The obtaining unit 402 is configured to obtain the first time slot occupancy table of the base station X;

The operation unit 403 is configured to perform an operation according to the plurality of time slot occupation tables and the first time slot occupation table to obtain a second time slot occupation table;

The updating unit 404 is configured to realize the time slot number of the base station X according to the second time slot occupation table.

In a possible example, in the aspect of updating the time slot number of the base station X according to the second time slot occupation table, the updating unit 404 is specifically configured to:

In a possible example, the updating unit 404 is further specifically configured to:

In a possible example, in the aspect of obtaining the second time slot occupation table by performing operations according to the multiple time slot occupation tables and the first time slot occupation table, the operation unit 403 is specifically configured to:

In a possible example, the positioning service system further includes base station Y, base station J, and base station W; the apparatus is further configured to implement the following functions:

The listening unit 401 is further configured to listen to the data frame within a preset time period, and to listen to the data frame Y of the base station Y, the data frame J of the base station J, and the data frame of the base station W W, the preset time period is a continuous preset number of positioning service periods, and the positioning service period is the working period of the positioning service system;

The operation unit 403 is further configured to configure its own time slot number according to the time slot occupation of the data frame Y, the data frame J and the data frame W.

It should be noted that, the listening unit 401 , the obtaining unit 402 , the computing unit 403 and the updating unit 404 can all be implemented by a processor.

Embodiments of the present application further provide a computer storage medium, wherein the computer storage medium stores a computer program for electronic data exchange, and the computer program causes the computer to execute part or all of the steps of any method described in the above method embodiments , the above computer includes electronic equipment.

Embodiments of the present application further provide a computer program product, where the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to cause a computer to execute any one of the method embodiments described above. some or all of the steps of the method. The computer program product may be a software installation package, and the computer includes an electronic device.

It should be noted that, for the sake of simple description, the foregoing method embodiments are all expressed as a series of action combinations, but those skilled in the art should know that the present application is not limited by the described action sequence. Because in accordance with the present application, certain steps may be performed in other orders or concurrently. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present application.

In the above-mentioned embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference may be made to the relevant descriptions of other embodiments.

In the several embodiments provided in this application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative, for example, the division of the above-mentioned units is only a logical function division, and other division methods may be used in actual implementation, for example, multiple units or components may be combined or integrated. to another system, or some features can be ignored, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical or other forms.

The above-mentioned units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.

The above-mentioned integrated units, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application can be embodied in the form of a software product in essence, or the part that contributes to the prior art, or all or part of the technical solution, and the computer software product is stored in a memory, Several instructions are included to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the above-mentioned methods in the various embodiments of the present application. The aforementioned memory includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk and other media that can store program codes.

Those of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable memory, and the memory can include: a flash disk , Read-only memory (English: Read-Only Memory, referred to as: ROM), random access device (English: Random Access Memory, referred to as: RAM), magnetic disk or optical disk, etc.

The embodiments of the present application are described in detail above, and specific examples are used in this paper to illustrate the principles and implementations of the present application. The descriptions of the above embodiments are only used to help understand the methods and core ideas of the present application; at the same time, for Persons of ordinary skill in the art, based on the idea of the present application, will have changes in the specific implementation manner and application scope. In summary, the contents of this specification should not be construed as limitations on the present application.

Claims

A time slot update method, characterized in that it is applied to a base station X, where the base station X is any base station in a positioning service system, the positioning service system includes K base stations, the K is an integer greater than 1, and the The methods described include:

The base station X obtains a time slot occupancy table by listening to the data frames of the neighboring base stations belonging to the base station X in the positioning service system, and obtains a plurality of time slot occupancy tables, each base station corresponds to a time slot occupancy table, and each time slot occupancy table. A slot occupancy table representing the slot status of each of the K base stations;

obtaining the first time slot occupancy table of the base station X;

performing an operation according to the multiple timeslot occupancy tables and the first timeslot occupancy table to obtain a second timeslot occupancy table;

The time slot number of the base station X is updated according to the second time slot occupation table.
The method according to claim 1, wherein the method further comprises:

Detecting whether there is an unoccupied time slot in the second time slot occupancy table;

When there is an unoccupied time slot in the second time slot occupancy table, performing the step of determining an unoccupied target time slot in the second time slot occupancy table;

When there is no unoccupied time slot in the second time slot occupation table, it is confirmed that the time slot number of the base station X cannot be updated.
The method according to claim 1 or 2, wherein the updating the time slot number of the base station X according to the second time slot occupancy table comprises:

determining an unoccupied target time slot in the second time slot occupation table, where the target time slot is any time slot in the unoccupied time slots in the second time slot occupation table;

The time slot number of the base station X is updated to the time slot number of the target base station corresponding to the target time slot.
The method according to any one of claims 1-3, wherein the operation is performed according to the multiple timeslot occupancy tables and the first timeslot occupancy table to obtain a second timeslot occupancy table, comprising: :

An OR operation is performed according to the plurality of time slot occupation tables and the first time slot occupation table to obtain the second time slot occupation table.
The method according to any one of claims 1-4, wherein the number of neighboring base stations of the base station X is within a preset range.
The method according to claim 5, wherein the preset range includes a lower threshold and an upper threshold, the lower threshold is smaller than the upper threshold, the lower threshold is 4, and the upper threshold is 6.
The method according to claim 6, wherein the positioning service system further comprises base station Y, base station J and base station W; The data frame is obtained to obtain a time slot occupation table, and before obtaining a plurality of time slot occupation tables, the method further includes:

The base station X listens to the data frame within a preset time period, and listens to the data frame Y of the base station Y, the data frame J of the base station J, and the data frame W of the base station W. The time period is a continuous preset number of positioning service periods, and the positioning service period is the working period of the positioning service system;

The base station X configures its own time slot number according to the time slot occupation of the data frame Y, the data frame J and the data frame W.
The method according to any one of claims 1-7, wherein the method further comprises:

Get the target iris image;

Perform image quality evaluation on the target iris image to obtain a target image quality evaluation value;

When the target image quality evaluation value is greater than a preset image quality evaluation threshold, matching the target iris image with a preset iris template;

When the target iris image is successfully matched with the preset iris template, execute that the base station X obtains the time slot occupancy table by listening to the data frames of the neighboring base stations belonging to the base station X in the positioning service system, and obtains Steps for multiple slot occupancy tables.
The method according to claim 8, wherein the performing image quality evaluation on the target iris image to obtain a target image quality evaluation value, comprising:

Carrying out multi-scale feature decomposition on the target iris image to obtain a low-frequency feature component image and a high-frequency feature component image;

dividing the low-frequency feature component image into a plurality of regions;

Determine the information entropy corresponding to each area in the multiple areas to obtain multiple information entropies;

determining an average information entropy and a target mean square error according to the plurality of information entropies;

determining the target fine-tuning adjustment coefficient corresponding to the target mean square error;

Adjusting the average information entropy according to the target fine-tuning adjustment coefficient to obtain a target information entropy;

According to the preset mapping relationship between the information entropy and the evaluation value, determine the first evaluation value corresponding to the target information entropy;

obtaining the target first shooting parameter corresponding to the target iris image;

According to the mapping relationship between the preset shooting parameters and the low-frequency weight, the target low-frequency weight corresponding to the first shooting parameter of the target is determined, and the target high-frequency weight is determined according to the target low-frequency weight;

determining the distribution density of target feature points according to the high-frequency feature component image;

According to the preset mapping relationship between the distribution density of feature points and the evaluation value, the second evaluation value corresponding to the distribution density of the target feature point is determined;

A weighted operation is performed according to the first evaluation value, the second evaluation value, the target low frequency weight and the target high frequency weight, so as to obtain a target image quality evaluation value of the target iris image.
A base station X, characterized in that the base station X is any base station in a positioning service system, the positioning service system includes K base stations, the K is an integer greater than 1, and the base station X includes a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the program comprising means for performing steps in the following methods instruction:

The base station X obtains a time slot occupancy table by listening to the data frames of the neighboring base stations belonging to the base station X in the positioning service system, and obtains a plurality of time slot occupancy tables, each base station corresponds to a time slot occupancy table, and each time slot occupancy table. A slot occupancy table representing the slot status of each of the K base stations;

obtaining the first time slot occupancy table of the base station X;

performing an operation according to the multiple timeslot occupancy tables and the first timeslot occupancy table to obtain a second timeslot occupancy table;

The time slot number of the base station X is updated according to the second time slot occupation table.
The base station X of claim 10, wherein the program further comprises instructions for performing the steps of the following methods:

Detecting whether there is an unoccupied time slot in the second time slot occupancy table;

When there is an unoccupied time slot in the second time slot occupancy table, performing the step of determining an unoccupied target time slot in the second time slot occupancy table;

When there is no unoccupied time slot in the second time slot occupation table, it is confirmed that the time slot number of the base station X cannot be updated.
The base station X according to claim 10 or 11, wherein, in the aspect of updating the time slot number of the base station X according to the second time slot occupancy table, the program comprises: Instructions for steps:

determining an unoccupied target time slot in the second time slot occupation table, where the target time slot is any time slot in the unoccupied time slots in the second time slot occupation table;

The time slot number of the base station X is updated to the time slot number of the target base station corresponding to the target time slot.
The base station X according to any one of claims 10-12, characterized in that, in the operation according to the multiple timeslot occupancy tables and the first timeslot occupancy table, a second timeslot occupancy table is obtained In an aspect, the program includes instructions for performing steps in the following methods:

An OR operation is performed according to the plurality of time slot occupation tables and the first time slot occupation table to obtain the second time slot occupation table.
The base station X according to any one of claims 10-13, wherein the number of neighboring base stations of the base station X is within a preset range.
The base station X according to claim 14, wherein the preset range includes a lower threshold and an upper threshold, the lower threshold is smaller than the upper threshold, the lower threshold is 4, and the upper threshold is 6.
The base station X according to claim 15, wherein the positioning service system further comprises base station Y, base station J and base station W; The data frame to obtain the time slot occupancy table, before obtaining a plurality of time slot occupancy tables, the program also includes instructions for performing the steps in the following methods:

The base station X listens to the data frame within a preset time period, and listens to the data frame Y of the base station Y, the data frame J of the base station J, and the data frame W of the base station W. The time period is a continuous preset number of positioning service periods, and the positioning service period is the working period of the positioning service system;

The base station X configures its own time slot number according to the time slot occupation of the data frame Y, the data frame J and the data frame W.
The base station X according to any one of claims 10-16, wherein the program further comprises instructions for performing steps in the following methods:

Get the target iris image;

Perform image quality evaluation on the target iris image to obtain a target image quality evaluation value;

When the target image quality evaluation value is greater than a preset image quality evaluation threshold, matching the target iris image with a preset iris template;

When the target iris image is successfully matched with the preset iris template, execute that the base station X obtains the time slot occupancy table by listening to the data frames of the neighboring base stations belonging to the base station X in the positioning service system, and obtains Steps for multiple slot occupancy tables.
An electronic device comprising a processor, a memory, a communication interface, and one or more programs, the one or more programs being stored in the memory and configured to be executed by the processor, The program includes instructions for performing the steps in the method of any of claims 1-9.
A computer-readable storage medium, characterized by storing a computer program for electronic data exchange, wherein the computer program causes a computer to execute the method according to any one of claims 1-9.
A computer program product, characterized in that the computer program product comprises a non-transitory computer-readable storage medium storing a computer program, the computer program being operable to cause a computer to perform the execution as claimed in any one of claims 1-9 method described.