TTI storage method and device, electronic equipment and computer readable storage medium

Abstract

The embodiment of the invention provides a TTI (Transmission Time Interval) storage method and device, electronic equipment and a computer readable storage medium. The method comprises the following steps: acquiring a plurality of storage units with continuous index numbers; each storage unit comprises a first storage space and a second storage space; obtaining a target TTI from absolute transmission time slots TTI in the to-be-stored resource pool; the absolute TTI refers to any TTI in the resource pool; sequentially storing the absolute TTIs into first storage spaces of a plurality of storage units according to a sequence in a system frame number (SNF) period; the first storage space comprises a plurality of bits, and each bit represents a TTI (Transmission Time Interval); each bit indicates a target TTI or a non-target TTI through a bit identifier; counting the total number of target TTIs in all storage units before the index number corresponding to each storage unit; and storing the total number of the target TTIs in the second storage space of the corresponding storage unit. Through the scheme of the embodiment of the invention, the storage space is greatly reduced.

Description

Technical Field

[0001] The present disclosure relates to the field of vehicle communication technology, and in particular to a TTI storage method, device, electronic device, and computer-readable storage medium. Background Art

[0002] In order to avoid interference between sidelink transmission and cellular network transmission, a resource pool is introduced. Terminals working in the autonomous transmission resource selection mode can only select sidelink transmission resources from the resource pool. The resource pool indicates the available TTI (Transmission Time Interval) within a SFN (System Frame Number) cycle. In LTE-V2X (LTE: Long Term Evolution, long-term evolution; V2X: Vehicle To Everything, the vehicle exchanges all information with the outside world), the minimum time domain resource TTI is the subframe, and in NR-V2X (NR: New Radio, new wireless / new air interface), it is the slot.

[0003] Since the number of TTIs in a resource pool SFN cycle is huge and the upper layer sends multiple resource pools, a lot of memory space will be occupied. Summary of the invention

[0004] The present disclosure provides a TTI storage method, device, electronic device and computer-readable storage medium.

[0005] In a first aspect, an embodiment of the present disclosure provides a TTI storage method, the method comprising:

[0006] Acquire multiple storage units with consecutive index numbers; each storage unit includes a first storage space and a second storage space;

[0007] Obtaining a target TTI from an absolute transmission time interval TTI in a resource pool to be stored; the absolute TTI refers to any TTI contained in the resource pool;

[0008] The absolute TTIs are sequentially stored in the first storage space of the multiple storage units according to the order of the absolute TTIs in the system frame number SNF period; wherein the first storage space contains multiple bits, each bit represents a TTI; each bit indicates that the bit represents a target TTI or a non-target TTI through a preset bit identifier;

[0009] Counting the total number of the target TTIs stored in all storage units before the index number corresponding to each storage unit;

[0010] The total number of the target TTIs counted for each storage unit is stored in the second storage space of the corresponding storage unit.

[0011] In a second aspect, an embodiment of the present disclosure provides a TTI storage device, including:

[0012] A first acquisition module is used to acquire a plurality of storage units with consecutive index numbers; each storage unit includes a first storage space and a second storage space;

[0013] A second acquisition module is used to acquire a target TTI from an absolute transmission time interval TTI in a resource pool to be stored; the absolute TTI refers to any TTI contained in the resource pool;

[0014] A first storage module, configured to sequentially store the absolute TTIs in the first storage space of the plurality of storage units according to the order of the absolute TTIs in the system frame number SNF period; wherein the first storage space comprises a plurality of bits, each bit representing a TTI; and each bit indicates, through a preset bit identifier, that the bit represents a target TTI or a non-target TTI;

[0015] A statistical module, used to count the total number of the target TTIs stored in all storage units before the index number corresponding to each storage unit;

[0016] The second storage module is used to store the total number of the target TTIs counted for each storage unit into the second storage space of the corresponding storage unit.

[0017] In a third aspect, an embodiment of the present disclosure provides an electronic device, the electronic device comprising:

[0018] one or more processors;

[0019] A memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the TTI storage method;

[0020] One or more input / output I / O interfaces are connected between the processor and the memory and are configured to implement information interaction between the processor and the memory.

[0021] In a fourth aspect, an embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the TTI storage method described in the first aspect when executed by a processor.

[0022] The disclosed embodiment stores the absolute TTI in the resource pool to be stored by bits, which greatly reduces the storage space, and marks whether each absolute TTI is a target subframe by the first bit, and saves the total number of target subframes in stages, which facilitates the search of target subframes and the conversion between the stored absolute TTI and the target TTI. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] In the accompanying drawings of the embodiments of the present disclosure:

[0024] Figure 1 A schematic diagram of an array of LTE-V2X logical subframe numbers in the related art;

[0025] Figure 2 A schematic diagram of the NR-V2X logical slot number array in the related art;

[0026] Figure 3 A flow chart of a TTI storage method provided in an embodiment of the present disclosure;

[0027] Figure 4 A flow chart of a method for obtaining a plurality of storage units with consecutive index numbers provided in an embodiment of the present disclosure;

[0028] Figure 5 A schematic diagram of an array provided for an embodiment of the present disclosure;

[0029] Figure 6 It is a schematic diagram of TDD subframe ratio in the related art;

[0030] Figure 7 It is a schematic diagram of a logical subframe of a SFN cycle in the related art;

[0031] Figure 8 Schematic diagram of available subframes in NR-V2X SFN period in related art;

[0032] Fig. 9 A schematic diagram of time slots within a TDD configuration cycle in the related art;

[0033] Fig.10 A flow chart of a method for detecting whether a logical TTI corresponding to an arbitrary logical TTI number is an available subframe according to an arbitrary logical TTI number and second bit identifiers in a plurality of third storage spaces provided in an embodiment of the present disclosure;

[0034] Fig.11 A flow chart of a method for determining an absolute TTI number corresponding to any logical TTI according to the logical TTI number of any logical TTI and the index number of the storage unit where the logical TTI is located, provided in an embodiment of the present disclosure;

[0035] Fig.12A flow chart of a method for determining a logical TTI number corresponding to any logical TTI according to an absolute TTI number corresponding to any logical TTI and a bit capacity set in a first storage space provided in an embodiment of the present disclosure;

[0036] Fig.13 A flow chart of a method for detecting whether an absolute TTI corresponding to an absolute TTI number is a logical TTI according to an absolute TTI number, an index number, and a second modulo result provided in an embodiment of the present disclosure;

[0037] Fig.14 A block diagram of the composition of a TTI storage device provided in an embodiment of the present disclosure;

[0038] Fig.15 A block diagram of the electronic device provided in the embodiment of the present disclosure;

[0039] Fig.16 A block diagram of the computer-readable storage medium provided for an embodiment of the present disclosure. DETAILED DESCRIPTION

[0040] In order to enable those skilled in the art to better understand the technical solution of the present disclosure, the communication perception data processing method and computer-readable storage medium provided by the embodiments of the present disclosure are described in detail below in conjunction with the accompanying drawings.

[0041] The present disclosure will be described more fully below with reference to the accompanying drawings, but the embodiments shown may be embodied in different forms, and the present disclosure should not be construed as being limited to the embodiments set forth below. On the contrary, the purpose of providing these embodiments is to make the present disclosure thorough and complete, and will enable those skilled in the art to fully understand the scope of the present disclosure.

[0042] The accompanying drawings of the embodiments of the present disclosure are used to provide a further understanding of the embodiments of the present disclosure, and constitute a part of the specification, and are used together with the detailed embodiments to explain the present disclosure, and do not constitute a limitation of the present disclosure. By describing the detailed embodiments with reference to the accompanying drawings, the above and other features and advantages will become more apparent to those skilled in the art.

[0043] In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.

[0044] The terms used in the present disclosure are only used to describe specific embodiments and are not intended to limit the present disclosure. The term "and / or" as used in the present disclosure includes any and all combinations of one or more related enumerated items. The singular forms "one" and "the" as used in the present disclosure are also intended to include plural forms, unless the context clearly indicates otherwise. The terms "including", "made of..." as used in the present disclosure specify the presence of the features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or groups thereof.

[0045] Unless otherwise defined, all terms (including technical and scientific terms) used in this disclosure have the same meaning as commonly understood by those of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning unless explicitly defined in this disclosure.

[0046] V2X is the abbreviation of Cellular-V2X, that is, V2X based on cellular network. V2X stands for "Vehicle to Everything", that is, data communication between cars and between cars and other devices. It can be used in a series of application scenarios, including: road safety, autonomous driving, advanced driver assistance systems, road state perception, mobility services, etc. These road applications put forward strict requirements on the underlying wireless communication system for high reliability, delay tolerance, and high-speed movement. While meeting these requirements, we must also consider costs and optimize the storage space of hardware.

[0047] LTE-V2X and NR-V2X are the sideline communication standards currently developed by 3GPP (3rd Generation Partnership Project) to support two V2X services. There is a resource pool configuration in both LTE-V2X and NR-V2X. The resource pool limits the time-frequency resource range for sideline communication (in some communication systems, signaling and data can be transmitted between terminal devices through the sidelink. This transmission method through the sidelink can be called sideline transmission. The terminal device senses and selects resources from the resource pool pre-configured by the network device to obtain a candidate resource set, and selects resources from the candidate resource set for sideline transmission). There are two ways to allocate resources for sideline communication: a resource allocation method based on network scheduling and a resource allocation method selected autonomously by the terminal.

[0048] When working within the coverage of a cellular network and in a connected state, a network-scheduled resource allocation method is adopted: all terminals accessing the network are uniformly deployed by the base station, and the terminal receives the authorization PUCCH (Physical Uplink Control Channel) sent by the network, which indicates the uplink transmission resources of the terminal.

[0049] When working within the coverage of the cellular network and in the RRC-Idle (RRC: Radio Resource Control, wireless resource control; Idle: idle) state, or working outside the coverage of the cellular network, there is no base station to schedule resources. At this time, the terminal autonomously selects the resource allocation method, and the terminal is required to autonomously select the sidelink transmission resource in the uplink time slot. The network cannot obtain the sidelink transmission resource autonomously selected by the terminal. If the network schedules the transmission resource to a certain terminal for uplink transmission at this time, it will cause a transmission conflict. In order to avoid interference between sidelink data transmission and cellular network transmission, the network divides an area in the uplink time slot, namely the resource pool, for sidelink transmission. Terminals working in the autonomous selection of transmission resources mode can only select sidelink transmission resources from the resource pool, and the network will not schedule the resources in the resource pool to the terminal for uplink data transmission, thereby avoiding interference between sidelink transmission and cellular network transmission.

[0050] In order to avoid interference introduced into the resource pool (Resource Pool, as the name implies, is a collection of resources used to determine the time and frequency resources for side transmission), the terminal can only send and receive data through the available TTI (Transmission Time Interval) in the resource pool. The high-level layer configures the parameters of the resource pool, and the physical layer calculates the parameters to obtain the time and frequency position of the available TTI. In LTE-V2X, the minimum time domain granularity TTI configured by the resource pool is 1 subframe, one frame is 10ms (milliseconds), one frame has 10 subframes, one subframe is 1ms, and in NR-V2X it is a time slot. The following takes LTE-V2X as an example to illustrate that the available TTI is the available subframe.

[0051] The calculation process of LTE-V2X available subframes is as follows:

[0052] 1. In the SFN (system frame number) period, subframes that do not belong to the resource pool are removed, including synchronization subframes and downlink subframes and special subframes of the TDD (Time Division Duplexing) system, and the remaining subframes constitute a remaining subframe set.

[0053] 2. Determine the number of reserved subframes and the corresponding time domain positions.

[0054] 3. Remove the reserved subframes from the remaining subframe set, and the remaining subframes constitute a logical subframe set.

[0055] 4. Determine the available subframes in the logical subframe set that belong to the resource pool according to the bitmap. Usually, in the bitmap, 1 indicates an available subframe, and 0 indicates an unavailable subframe.

[0056] The above steps can indicate the available subframes within the SFN cycle. The NR-V2X time slot calculation process is similar to LTE-V2X, except that the subframe is replaced by slot. One SFN cycle is 10240ms, which is 10240 subframes in LTE-V2X and 10240*2 in NR-V2X. u (u is a natural number) slots, the memory consumed by the above-mentioned TTI indication method will be very large.

[0057] In some related technologies, in order to more flexibly indicate the available subframe information of the resource pool, a bitmap is used in LTE-V2X to indicate the subframe of the resource pool, and each bit in the bitmap corresponds to a subframe. The following introduces a conventional linear array storage method based on the bitmap:

[0058] When determining the available subframes of the resource pool, the bitmap is repeated periodically within the SFN cycle (one SFN cycle includes 10240 subframes), so that the subframe information belonging to the resource pool within one SFN cycle can be determined. After removing the synchronization subframe within an SFN cycle, if the remaining subframes cannot be divided by the bitmap length bitstrlen (the bitstrlen is determined according to the parameters carried by the received information), the subframe positions belonging to the resource pool in different SFN cycles will be different. When the terminal receives the resource pool configuration information in different SFN cycles, the time domain position of the resource pool determined will also be different, resulting in inconsistent understanding of the resource pool between terminals. In order to avoid this problem, it is necessary to ensure that the time domain resource position determined according to the resource pool configuration information is the same in different SFN cycles. Therefore, reserved subframes are introduced in LTE-V2X. The reserved subframes are not used for side transmission. Their function is to make the logical subframes obtained by removing the synchronization subframes, downlink subframes, special subframes and reserved subframes in an SFN cycle be divisible by the length of the bitmap bitstrlen, so that the time domain resources belonging to the resource pool in different SFN cycles are the same.

[0059] After excluding reserved subframes, the remaining subframes are logical subframes. Logical subframes are passed as parameters during DMRS (demodulation reference signal) sequence generation, scrambling, synchronization, etc., and the mapping relationship with absolute subframes must be saved locally. If the linear storage method is used, the logical subframes within one SFN cycle are saved. 10240 subframes must be reserved in LTE-V2X, and 10240*2 in NR-V2X. u Here we take the time slot granularity subframe in LTE-V2X as an example to illustrate.

[0060] To configure a resource pool, you need to indicate the availability of 10240 subframes. Set an array Pool

[10240] , where the index of the array is the absolute subframe number, that is, the absolute time number in the time domain. The array stores the logical subframe number in bytes, starting from 0. The default value of the non-logical subframe number is 65535. The maximum absolute subframe number of LTE-V2X is 10240, which is larger than the maximum storage range of 1 byte and smaller than the maximum storage range of 2 bytes, so Pool[x] is stored in 16 bits, such as Figure 1 shown.

[0061] Since NR-V2X supports multiple SCS (subcarrier spacing), the maximum number of slots in 1SFN cycle is 10240*2 u , u takes the value [0,4]. Considering that the maximum logical slot number exceeds the storage capacity of 2 bytes, 4 bytes are used to store the logical slot number. The size of the array space opened is as follows: Figure 2 shown.

[0062] The above content is a conventional linear array storage method, which uses bytes to store 10240 logical subframe numbers, which consumes a lot of storage space. Basically, the space occupied by each LTE-V2X resource pool is 10240*2byte (bytes), and the space occupied by the NR-V2X resource pool is 10240*2 u *4byte. Considering that there are a maximum of 25 sending and receiving resource pools, the storage of a single resource pool will consume megabytes of memory space.

[0063] In the scenario where the available TTI (such as available subframe) in the resource pool is stored and frequently queried, the embodiment of the present disclosure proposes a memory optimization and query mode, which stores TTI in segments in the form of bits and does not directly store each logical subframe number, thereby greatly reducing memory consumption, improving TTI query time, and alleviating memory pressure on embedded hardware. The embodiment of the present disclosure is described in detail below.

[0064] The present disclosure provides a TTI storage method, such as Figure 3 As shown, the method includes steps S11-S15:

[0065] S11, obtaining a plurality of storage units with consecutive index numbers; each storage unit includes a first storage space and a second storage space;

[0066] S12, obtaining a target TTI from an absolute transmission time interval TTI in a resource pool to be stored; the absolute TTI refers to any TTI contained in the resource pool;

[0067] S13, storing the absolute TTIs in the first storage space of the plurality of storage units in sequence according to the order of the absolute TTIs in the system frame number SNF period; wherein the first storage space comprises a plurality of bits, each bit representing a TTI; each bit indicating the bit represents a target TTI or a non-target TTI through a preset bit identifier;

[0068] S14, counting the total number of target TTIs stored in all storage units before the index number corresponding to each storage unit;

[0069] S15. Store the total number of target TTIs counted for each storage unit into the second storage space of the corresponding storage unit.

[0070] The storage method of the embodiment of the present disclosure can be applied to but not limited to TTI storage of LTE-V2X and NR-V2X, and is not limited to TTI storage. It can be applied to the storage of any information. Any storage solution implemented based on the storage concept of the embodiment of the present disclosure is within the scope of protection of the content of the present disclosure.

[0071] The TTI storage method of the embodiment of the present disclosure can be executed by any electronic device that needs to store information, such as a terminal device or a server. The terminal device may include but is not limited to: vehicle-mounted equipment, user equipment (UE), mobile equipment, computing equipment, wearable devices, etc., for example, including but not limited to cellular phones, cordless phones, personal digital assistants (PDA), portable computers, etc. The TTI storage method can be implemented by a processor calling computer-readable program instructions stored in a memory, or can be implemented by a server.

[0072] In the embodiments of the present disclosure, the above storage solution can be applied to the storage of absolute TTI in a single resource pool, and is also applicable to multiple resource pools. The storage solutions in two application scenarios are introduced below.

[0073] 1. First, the detailed TTI storage solution applied to a single resource pool scenario is introduced.

[0074] In an embodiment of the present disclosure, when applied to a single resource pool, the target TTI is a logical TTI; the logical TTI refers to an absolute TTI that can be used to transmit uplink data; the bit identifier includes a first bit identifier, the first bit identifier includes a first identifier and a second identifier, the first identifier indicates that the bit represents a logical subframe TTI, and the second identifier indicates that the bit represents a non-logical TTI.

[0075] In an embodiment of the present disclosure, a TTI storage method in a single resource pool scenario may include:

[0076] Acquire multiple storage units with consecutive index numbers; each storage unit includes a first storage space and a second storage space;

[0077] Identifying a logical TTI from the absolute transmission time intervals TTI in the resource pool to be stored;

[0078] The absolute TTI is stored in the first storage space of multiple storage units in sequence according to the order of the absolute TTI in the system frame number SNF period; wherein the first storage space contains multiple bits, each bit represents a TTI; each bit indicates that the bit represents a logical TTI or a non-logical TTI through a preset first bit mark

[0079] Counting the total number of logical TTIs stored in all storage units before the index number corresponding to each storage unit;

[0080] The total number of logical TTIs counted for each storage unit is stored in the second storage space of the corresponding storage unit.

[0081] In LTE-V2X, the TTI in the time domain resources of PSCCH (Physical Sidelink Control Channel) and PSSCH (Physical Sidelink Shared Channel) is based on the granularity of subframes, while in NR-V2X, the TTI is based on the granularity of time slots.

[0082] The time domain is infinite. The embodiment of the present disclosure uses an absolute TTI storage method in an SFN cycle to map to the entire time domain to illustrate the TTI storage method in the time domain. One SFN cycle is 10240ms (milliseconds), which is 10240 subframes in LTE-V2X and 10240*2 in NR-V2X. u slots.

[0083] To configure a resource pool, it is necessary to indicate the availability of absolute TTIs (e.g., 10240 subframes) in the resource pool. The embodiment of the present disclosure may use an array to store the absolute TTIs in an SFN cycle of the resource pool, and indicate the logical TTIs in the absolute TTIs, and calculate which logical TTI is an available TTI based on the indicated logical TTIs.

[0084] The only difference between LTE-V2X and NR-V2X is the granularity of TTI, while the storage method and calculation method are the same. Here, the TTI (i.e., subframe) storage method in LTE-V2X is used to illustrate the embodiment of the present disclosure.

[0085] In an embodiment of the present disclosure, the absolute TTI of the resource pool may include but is not limited to being stored in an array Pool[x], which may include x (x is 0 and a positive integer) storage nodes, each storage node as a storage unit, x as the index number of each storage unit, and the index numbers of multiple storage units are continuous. Each storage unit may include a first storage space and a second storage space, the first storage space and the second storage space may refer to two storage variables of each storage node in the array, the first storage space is used to store the total number of logical TTIs, and the second storage space is used to store the absolute TTI in the resource pool in bit form, and each bit indicates whether each stored absolute TTI is a logical TTI through a preset first bit identifier.

[0086] In the embodiments of the present disclosure, Figure 4 As shown, obtaining multiple storage units with consecutive index numbers may include steps S21-S25:

[0087] S21. Obtain a predetermined bit capacity of a first storage space.

[0088] In the embodiment of the present disclosure, the space sizes of the first storage space and the second storage space may be the same or different. To facilitate computer calculation, the space sizes of the first storage space and the second storage space may be set to be the same.

[0089] In the embodiment of the present disclosure, since the first storage space is used to store a plurality of bits (which may be referred to as a bit stream), the space size of the first storage space is represented by the bit capacity.

[0090] In the disclosed embodiment, the bit capacity (or length) of the first storage space may include but is not limited to 16 bits, 32 bits, etc., and may be set accordingly according to the computer processing capability. For LTE-V2X, 16 bits is more appropriate.

[0091] S22. Calculate the required number of storage units according to the total number of absolute TTIs included in the SNF period and the bit capacity.

[0092] In the embodiment of the present disclosure, for LTE-V2X, one SNF cycle includes 10240 subframes. When the bit capacity of the first storage space is 16, the number of storage units is 10240 / 16=640.

[0093] S23. Create a first storage space and a second storage space according to the bit capacity to form a storage unit.

[0094] In the disclosed embodiment, the first storage space may be represented by wPhySFrmBitmap, which may be used to store a bitstream. The 16 bits in wPhySFrmBitmap represent 16 subframes, and each bit is identified by a corresponding first bit position to indicate whether the absolute subframe of the bit position is a logical subframe or a non-logical subframe. The first bit position identification may include a first identification and a second identification. For example, the first identification may be 1, and the second identification may be 0. 1 may be used to indicate a logical subframe, and 0 may be used to indicate a non-logical frame. The second storage space may be represented by wLogicSFrmNum, which may be used to store decimal values. Pool[x].wLogicSFrmNum represents the total number of logical subframes in the 16*x subframes stored in the x-1 storage units preceding the x-th storage unit.

[0095] In the embodiment of the present disclosure, for example: Pool[0].wLogicSFrmNum=0.

[0096] In the disclosed embodiment, Pool[x].wLogicSFrmNum=Pool[x-1].wLogicSFrmNum+Calc1Bit(Pool[x-1].wPhySFrmBitmap);

[0097] Calc1Bit(bitmap) indicates the number of bits with bit position identification of 1 in the bitmap code stream.

[0098] S24. Create a corresponding plurality of storage units according to the number of the plurality of storage units.

[0099] In the embodiment of the present disclosure, one SFN cycle includes 10240 subframes. According to the above calculation results, 640 storage units can be created.

[0100] S25. Set an index number for each storage unit, and make the index numbers of multiple storage units continuous, so as to obtain multiple storage units with continuous index numbers.

[0101] In the disclosed embodiment, for 640 storage units, the index number can be set starting from 0, and the index numbers are arranged consecutively in sequence, so the maximum index number that can be set is 639, thereby obtaining an array of storage node index numbers from 0 to 639.

[0102] In the embodiment of the present disclosure, a simple example of an array created by the embodiment of the present disclosure can be as follows: Figure 5 shown.

[0103] In the embodiment of the present disclosure, after the array is created, the absolute TTI (e.g., absolute subframe) of the resource pool can be stored in sequence in the wPhySFrmBitmap variables of 640 storage units, and 1 or 0 can be used in the bit stream of each wPhySFrmBitmap variable to indicate whether the corresponding absolute TTI is a logical TTI (e.g., a logical subframe), providing a basis for obtaining available TTIs.

[0104] In the embodiment of the present disclosure, in order to indicate the logical TTI in wPhySFrmBitmap, it is necessary to identify the logical TTI from the absolute TTI of the resource pool in advance. The identification method is described in detail below.

[0105] In order to more flexibly indicate the subframe information available in the resource pool, a bitmap is used in LTE-V2X to indicate the subframe of the resource pool, and each bit in the bitmap corresponds to a subframe. When determining the absolute subframe of the resource pool, the bitmap is repeated periodically within the SFN cycle (an SFN cycle includes 10240 subframes), so that the absolute subframe information belonging to the resource pool within an SFN cycle can be determined.

[0106] In the disclosed embodiments, both LTE-V2X and NR-V2X can operate on the ITS (Intelligent Transport System) dedicated spectrum. At the same time, in order to expand the application scope of V2X technology, both LTE-V2X and NR-V2X can coexist with LTE Uu (air interface) or NR Uu on the authorized frequency band. In order to avoid affecting the downlink receiving end, LTE-V2X and NR-V2X can only operate on the uplink carrier or uplink time domain resources. Therefore, it is necessary to delete the downlink subframes and special subframes of the TDD system within the SFN period in LTE-V2X. The ratio of the TDD system subframe is flexible and changeable, and the specific configuration is determined by the high-level layer, such as Figure 6 A simple example is shown.

[0107] Since PSBCH (Physical Sidelink Broadcast Channel) synchronization signals need to be broadcast and received periodically, the synchronization subframe needs to be deleted.

[0108] For LTE-V2X, after removing the synchronization subframe in an SFN cycle, if the remaining subframes cannot be divided by the bitmap length bitstrlen (the bitstrlen is determined according to the parameters carried by the received information), this will cause the subframe positions belonging to the resource pool to be different in different SFN cycles. When the terminal receives the resource pool configuration information in different SFN cycles, the time domain position of the determined resource pool is also different, resulting in inconsistent understanding of the resource pool between terminals. In order to avoid this problem, it is necessary to ensure that the time domain resource position determined according to the resource pool configuration information is the same in different SFN cycles. Therefore, for LTE-V2X, a reserved subframe is introduced. The reserved subframe is not used for side transmission. Its function is to make the number of subframes in an SFN cycle minus the synchronization subframe and the downlink subframe be divisible by the length of the bitmap bitstrlen, so that the time domain resources belonging to the resource pool in different SFN cycles are the same.

[0109] After excluding the reserved subframes, the remaining subframes are logical subframes. Logical subframes are passed as parameters during DMRS sequence generation, scrambling, synchronization, etc. The mapping relationship with absolute subframes must be saved locally and numbered. Figure 7 shown.

[0110] Bitmap is a mapping based on logical subframes, used to indicate whether a logical subframe is an available subframe. The length of bitmap is bitstlen. The arrangement of available subframes is shown in the following example: Figure 8 shown.

[0111] Although data can only be sent and received on available subframes, the available subframes do not need to be numbered. The available subframes can be determined by taking the modulo bitstlen of the logical subframe number and querying whether the corresponding bit is 1 based on the modulo result to determine the available subframe (detailed description will be given in the subsequent content).

[0112] NR-V2X is more flexible than LTE-V2X. NR-V2X supports multiple subcarrier spacings. The number of symbols in a single slot is the same for different subcarrier spacings, which is 14. The larger the subcarrier spacing, the shorter the unit time corresponding to the slot. The number of slots in one SFN is 10240*2 u, u takes the value [0,4], which is determined by the subcarrier spacing. The NR system adopts a flexible time slot structure, that is, a time slot includes both uplink symbols and downlink symbols. The number of uplink symbols used for side transmission can be less than 14, so that more flexible scheduling can be achieved. The uplink available resources are still determined by the TDD pattern, but the Period (period, time) cycle is flexible and changeable and is configured by the high-level layer. The schematic diagram of the time slot in TDD configuration 1 cycle is as follows Fig. 9 As shown in the figure, there may be three types of symbols in the middle time slot. As long as the number of uplink symbols meets the time slot transmission requirement, the time slot can still be used as a logical slot.

[0113] The method of obtaining logical TTI in NR-V2X is basically the same as that in LTE-V2X. When excluding the synchronous TTI, the synchronization period is also flexibly configured by the high layer. In general, the logical slot calculation process of NR-V2X is similar to that of LTE-V2X, so I will not go into details here.

[0114] In the embodiment of the present disclosure, after identifying the logical TTI from the absolute transmission time interval TTI in the resource pool to be stored, the method further includes:

[0115] Get the number of each logical TTI in the SNF cycle, and record it as the absolute TTI number of each logical TTI;

[0116] The logical TTIs are renumbered consecutively according to the order of each logical TTI before and after the SNF cycle to obtain a logical TTI number corresponding to each logical TTI.

[0117] In the embodiment of the present disclosure, the absolute TTI number and the logical TTI number of each logical TTI may be acquired in advance, and the absolute TTI number and the logical TTI number of the same logical TTI may be stored correspondingly to prepare for subsequent calculations.

[0118] In the embodiment of the present disclosure, counting the total number of logical TTIs stored in all storage units before the index number corresponding to each storage unit may include:

[0119] Obtaining a logical TTI number corresponding to a logical TTI stored in a previous storage unit of each storage unit;

[0120] Selecting the maximum logical TTI number from the acquired logical TTI numbers;

[0121] The numerical value corresponding to the maximum logical TTI number is used as the total number of logical TTIs stored in all storage units before the index number corresponding to each storage unit.

[0122] In the embodiment of the present disclosure, based on the set logical TTI number, the total number of logical TTIs stored in all storage units before each storage unit can be determined, and can be stored in wLogicSFrmNum of the storage unit.

[0123] In the disclosed embodiment, after the absolute TTI is stored in multiple wPhySFrmBitmaps, the TTI bit streams in one SFN period of the resource pool in the wPhySFrmBitmap can be initialized to all 1, and the total number of logical TTIs in the wLogicSFrmNum can be initialized to 0. After the total number of logical TTIs corresponding to each wLogicSFrmNum is counted, the total number of logical TTIs is stored in the corresponding wLogicSFrmNum, and the bit flag corresponding to the logical TTI in the wPhySFrmBitmap is retained as 1 according to the identified logical TTI, and the bit flag of the non-logical TTI is modified to 0.

[0124] In the embodiment of the present disclosure, available TTIs may be acquired based on the set logical TTI number.

[0125] In the embodiment of the present disclosure, the storage unit further includes a third storage space, and both the first storage space and the third storage space may be bitmaps.

[0126] In the embodiment of the present disclosure, after storing the total number of logical TTIs corresponding to each storage unit in the second storage space of each storage unit, the method further includes:

[0127] storing the logical subframes in sequence into a plurality of third storage spaces according to the logical TTI numbering sequence;

[0128] The bit capacity of each third storage space is a preset bit length, and each bit in the third storage space represents a logical TTI; each bit indicates that the bit represents an available TTI or an unavailable TTI through a preset second bit identifier.

[0129] In an embodiment of the present disclosure, the second bit identifier may include a third identifier and a fourth identifier, the third identifier indicating the bit represents an available TTI, and the fourth identifier indicating the bit represents an unavailable TTI; for example, the third identifier may be 1, and the fourth identifier may be 0, 1 may be used to represent an available subframe, and 0 may be used to represent an unavailable frame.

[0130] In the embodiment of the present disclosure, the method may further include:

[0131] According to any logical TTI number and the second bit identifiers in the plurality of third storage spaces, it is detected whether the logical TTI corresponding to any logical TTI number is an available subframe.

[0132] In the embodiments of the present disclosure, Fig.10 As shown, according to any logical TTI number and the second bit identifiers in the plurality of third storage spaces, detecting whether the logical TTI corresponding to any logical TTI number is an available subframe includes S31-S36:

[0133] S31, determining, according to the logical TTI number, a third storage space where the logical TTI corresponding to the logical TTI number is located;

[0134] S32, taking a modulus of the logical TTI number and the bit length to obtain a first modulus result;

[0135] S33, determining an offset of the logical TTI number in the third storage space where the logical TTI is located according to the first modulo result;

[0136] S34, finding the bit corresponding to the logical TTI according to the offset;

[0137] S35, detecting that the second bit position identifier of the bit position corresponding to the logical TTI is the third identifier or the fourth identifier;

[0138] S36. When the second bit identifier is the third identifier, determine that the logical TTI corresponding to the logical TTI number is an available TTI; when the second bit identifier is the fourth identifier, determine that the logical TTI corresponding to the logical TTI number is a non-available TTI.

[0139] In the embodiment of the present disclosure, through the above solution, it is possible to find out from the third storage space whether any logical TTI is an available TTI according to the logical TTI number of the logical TTI.

[0140] In the embodiment of the present disclosure, after storing the total number of logical TTIs corresponding to each storage unit in the second storage space of each storage unit, the method further includes:

[0141] Determine an absolute TTI number corresponding to any logical TTI according to the logical TTI number of any logical TTI and the index number of the storage unit where the logical TTI is located; and / or,

[0142] The logical TTI number corresponding to any logical TTI is determined according to the absolute TTI number corresponding to any logical TTI and the bit capacity set in the first storage space.

[0143] In the embodiments of the present disclosure, Fig.11 As shown, according to the logical TTI number of any logical TTI and the index number of the storage unit where the logical TTI is located, determining the absolute TTI number corresponding to any logical TTI includes steps S41-S47:

[0144] S41, comparing the logical TTI number of any logical TTI with the total number of logical TTIs stored in each storage unit, and obtaining the total number of logical TTIs greater than the logical TTI number;

[0145] S42, obtaining the total number of logical TTIs with the smallest value from the total number of logical TTIs greater than the logical TTI number;

[0146] S43, taking the storage unit corresponding to the total number of logical TTIs with the smallest value as the storage unit where the logical TTI corresponding to the logical TTI number is located, and obtaining the index number corresponding to the storage unit where the logical TTI is located;

[0147] S44, subtract the logical TTI number from the total number of logical TTIs stored in the storage unit where the logical TTI is located, to obtain the ranking of the logical TTI in the logical TTIs stored in the storage unit where the logical TTI is located;

[0148] S45, obtaining a bit position of the logical TTI in the first storage space of the storage unit where the logical TTI is located according to the ranking;

[0149] S46, counting the sequence numbers of the bits in the first storage space according to the arrangement order of the absolute TTIs of the resource pool when they are stored in the first storage space;

[0150] S47. Multiply the index number corresponding to the storage unit where the logical TTI is located by the bit capacity set in the first storage space to obtain a product value, and add the sorting number to the product value to obtain an absolute subframe number corresponding to any logical subframe.

[0151] In the disclosed embodiment, TTI is still used as a subframe for explanation. An absolute subframe is not necessarily a logical subframe, but a logical subframe is definitely an absolute subframe. To find the absolute subframe corresponding to a logical subframe is to find the index number of the storage unit where the logical subframe is located and the offset of the bit in the first storage space of the storage unit according to the logical subframe number of the logical subframe. Although the logical subframe number is not directly stored in the resource pool Pool[x], it is stored periodically and indirectly in the form of the total number of logical subframes, but the logical subframe numbers are arranged in ascending order. Based on this rule, the absolute subframe number corresponding to each logical subframe number can be obtained.

[0152] In the embodiment of the present disclosure, a second-order search method is used here to obtain the absolute subframe number corresponding to the logical subframe number. First, the index number of Pool[x] is determined in the total number of stored logical subframes by using a binary search method, that is, steps S41-S43, that is, finding the index number of Pool[x] that satisfies the following expression:

[0153] Pool[x].wLogicSFrmNum≤LogicSFrm(logical subframe number)<

[0154] Pool[x+1].wLogicSFrmNum;

[0155] Among them, when LogicSFrm (logical subframe number) is greater than the maximum index number of the storage unit, the maximum index number of the storage unit can be obtained as 10240 / Total(Pool[x].wPhySFrmBitmap)-1, Total(bitmap) represents the number of bits in the bitmap code stream, Total(Pool[x].wPhySFrmBitmap) represents the number of bits in the bit stream stored in Pool[x].wPhySFrmBitmap, Pool[x].wPhySFrmBitmap is the number of bits in each storage unit (ie, the bit capacity), for example, 16 bits, 10240 / Total(Pool[x].wPhySFrmBitmap) is the number of storage units, minus 1 is because the index number starts from 0.

[0156] In the embodiment of the present disclosure, the bit position in the bit code stream stored in the first storage space of each storage unit of the logical subframe number LogicSFrm may be calculated next, that is, the corresponding Pool[x].wPhySFrmBitmap bit position y.

[0157] Then the absolute subframe number corresponding to the logical subframe number LogicSFrm is, that is, step S47:

[0158] AbsSFrm (absolute subframe number) = x (storage unit index number obtained in the previous step) * Total (Pool [x]. wPhySFrmBitmap) (bit capacity of a storage unit) + y.

[0159] In the embodiment of the present disclosure, before obtaining the bit position y, it is necessary to first obtain the ranking of the logical subframe in the logical subframe stored in the storage unit where the logical subframe is located (i.e., step S44), which can be obtained by the following calculation formula:

[0160] LogicSFrm-Pool[x].wLogicSFrmNum=Calc1BitLow(Pool[x].wPhySFrmBitmap,y);

[0161] Among them, Calc1BitLow(bitmap,m) means calculating the number of first bits marked as 1 between the first bit to the mth bit (m is a positive integer) in the bitmap code stream (that is, the ranking of the logical subframe in the logical subframe stored in the storage unit where the logical subframe is located). In the above expression, Calc1BitLow(Pool[x].wPhySFrmBitmap,y) means calculating the number of first bits marked as 1 between the first bit to the yth bit in the Pool[x].wPhySFrmBitmap code stream according to the storage order of the absolute subframes. This number is equal to the logical subframe number minus the total number of logical subframes stored in the storage unit corresponding to the storage unit index number obtained in the previous step.

[0162] In the embodiment of the present disclosure, the ranking calculated in the above steps is only the ranking calculated based on the stored logical subframe, and it is also necessary to determine the number of all bits from the first bit to the bit corresponding to the ranking based on the ranking, which is the arrangement order of the absolute subframe corresponding to the logical subframe in the storage unit, that is, the sorting number described in step S46, which is y in the above calculation formula.

[0163] In the embodiment of the present disclosure, after y is calculated, the absolute subframe number can be obtained according to AbsSFrm (absolute subframe number) = x (storage unit index number obtained in the previous step) * Total (Pool [x]. wPhySFrmBitmap) (bit capacity of a storage unit) + y.

[0164] In the embodiments of the present disclosure, Fig.12 As shown, according to the absolute TTI number corresponding to any logical TTI and the bit capacity set in the first storage space, determining the logical TTI number corresponding to any logical TTI includes steps S51-S57:

[0165] S51, dividing the absolute TTI number by the bit capacity and rounding the result to obtain the index number of the storage unit where the logical TTI corresponding to the absolute TTI number is located;

[0166] S52, taking a modulus of the absolute TTI number and the bit capacity to obtain a second modulus result;

[0167] S53, detecting whether the absolute TTI corresponding to the absolute TTI number is a logical TTI according to the absolute TTI number, the index number and the second modulo result;

[0168] S54, when the absolute TTI corresponding to the absolute TTI number is a logical TTI, storing the second modulo result as the absolute TTI in the first storage space as a sorting number of the logical TTI corresponding to the absolute TTI number in the first storage space;

[0169] S55. Determine from the first storage space the number of logical TTIs included in the absolute TTI whose sorting number is less than or equal to the sorting number of the logical TTI;

[0170] S56. Obtain the total number of logical TTIs stored in the corresponding storage unit according to the index number;

[0171] S57. Add the total number of logical TTIs obtained according to the index number to the determined number of logical TTIs to obtain the logical TTI number of the logical TTI corresponding to the absolute TTI number.

[0172] In the embodiments of the present disclosure, TTI is still used as a subframe for illustration.

[0173] In the embodiment of the present disclosure, obtaining the logical subframe number is substantially to query the corresponding logical subframe bit y in the resource pool Pool[x].wPhySFrmBitmap according to the absolute subframe number AbsSFrm.

[0174] In the embodiment of the present disclosure, the index number of the storage unit where the corresponding absolute subframe is located can be first obtained according to the absolute subframe number (ie, step S51), and the following expression can be used:

[0175] x (index number of the storage unit) = AbsSFrm (absolute subframe number) / Total (Pool [x]. wPhySFrmBitmap);

[0176] Wherein, Total(Pool[x].wPhySFrmBitmap) represents the number of bits in the bit stream stored in Pool[x].wPhySFrmBitmap, for example, 16 bits.

[0177] In the embodiment of the present disclosure, after obtaining the index number of the storage unit where the absolute subframe is located, it is possible to first determine whether the corresponding absolute subframe is a logical subframe based on the index number and the absolute subframe number. If it is a logical subframe, the corresponding logical subframe number can be determined. If it is not a logical subframe, there is no need to determine the logical subframe number.

[0178] In the disclosed embodiment, before determining whether it is a logical subframe, the absolute TTI number and the bit capacity are modulo to obtain a second modulo result (ie, step S52), and the second modulo result is required to be used when determining whether it is a logical subframe.

[0179] In the embodiment of the present disclosure, the absolute TTI number and the bit capacity are modulo, and the second modulo result can be expressed as: AbsSFrm%Total(Pool[x].wPhySFrmBitmap);

[0180] Among them, % is the modulo symbol, and Total(Pool[x].wPhySFrmBitmap) can be 16.

[0181] In the embodiment of the present disclosure, the absolute subframe number may be modulo 16 to obtain a second modulo result.

[0182] In the embodiments of the present disclosure, Fig.13 As shown, detecting whether the absolute TTI corresponding to the absolute TTI number is a logical TTI according to the absolute TTI number, the index number and the second modulo result includes steps S61-S66:

[0183] S61, determining the storage unit where the absolute TTI corresponding to the absolute TTI number is located according to the index number;

[0184] S62, shifting the second modulo result in the direction of increasing absolute subframe number from the bit positions of the absolute TTI stored in the storage unit where the absolute TTI is located, to obtain a corresponding bit position;

[0185] S63, obtaining a first bit identifier of a corresponding bit;

[0186] S64, performing an AND operation on the first bit identifier obtained and the first bit identifier of each bit in the first bit code stream corresponding to all bits stored in the first storage space of the storage unit where the absolute TTI is located, to obtain a second bit code stream;

[0187] S65. When the value corresponding to the second bit stream is 0, determine that the absolute TTI corresponding to the absolute TTI number is not a logical TTI;

[0188] S66: When the value corresponding to the second bit code stream is not 0, determine that the absolute TTI corresponding to the absolute TTI number is a logical TTI.

[0189] In the embodiments of the present disclosure, TTI is still used as a subframe for illustration.

[0190] In the embodiment of the present disclosure, the index number (for example, 36) determined according to the aforementioned scheme can be used to obtain the storage unit where the absolute subframe corresponding to the absolute subframe number is located. The first bit, that is, the bit with the smallest absolute subframe number, can be determined from the 36th storage unit according to the order in which the absolute subframes are stored. Starting from the bit with the smallest absolute subframe number, the absolute subframe number is shifted in the direction of increasing (that is, shifted according to the absolute subframe storage order), and the second modulo result bit is shifted. For example, if the second modulo result is 3, the shift is 3 bits, and then the shift can be shifted to the 4th bit. At this time, the first bit identifier corresponding to the 4th bit in the bit code stream (which can be referred to as bit code stream 1) stored in the first storage space of the 36th storage unit can be obtained. The first bit identifier may be 1 or 0.

[0191] In the embodiment of the present disclosure, the expression for performing bit shifting may be:

[0192] 1<<(AbsSFrm%Total(Pool[x].wPhySFrmBitmap));

[0193] Among them, AbsSFrm%Total(Pool[x].wPhySFrmBitmap) represents the second modulo result, "<<" is a left offset symbol (in the disclosed embodiment, it may include but is not limited to using a left offset symbol, or a right offset symbol, and a suitable offset sequence number may be selected according to requirements and a preset search order), and "1" means offsetting from the first bit of bit stream 1 (generally starting from the rightmost bit of the bit stream, which is not limited here and can be defined according to requirements), offset (AbsSFrm%Total(Pool[x].wPhySFrmBitmap)) bits.

[0194] In the embodiment of the present disclosure, the first bit identifier of each bit in the bit code stream 1 can be ANDed with the first bit identifier of the fourth bit to obtain a second bit code stream (which can be referred to as bit code stream 2 for short), which can be expressed as follows:

[0195] Pool[x].wPhySFrmBitmap (here refers to the bit stream 1) & (1<<(AbsSFrm%Total(Pool[x].wPhySFrmBitmap))).

[0196] In the embodiment of the present disclosure, if every bit in the bit stream 2 is 0, the value corresponding to the bit stream 2 is 0; if any bit in the bit stream 2 is not 0, the value corresponding to the bit stream 2 is not 0.

[0197] In the embodiment of the present disclosure, when the value corresponding to the bit code stream 2 is 0, it is determined that the absolute subframe corresponding to the absolute subframe number is not a logical subframe; when the value corresponding to the bit code stream 2 is not 0, it is determined that the absolute subframe corresponding to the absolute subframe number is a logical subframe.

[0198] In the embodiment of the present disclosure, when it is determined that the absolute subframe corresponding to the absolute subframe number is a logical subframe, the logical subframe number corresponding to the absolute subframe number may be further acquired.

[0199] In the embodiment of the present disclosure, since the second modulo result is the remainder obtained by dividing the absolute subframe number by the bit capacity, the remainder is the storage sequence number (i.e., the sorting number) of the corresponding absolute subframe in the first storage space of the storage unit. Therefore, the second modulo result can be used as the sorting number of the logical TTI corresponding to the absolute TTI number in the first storage space when the absolute TTI is stored in the first storage space (i.e., step S54).

[0200] In the embodiment of the present disclosure, after obtaining the sorting number of the absolute subframe in the first storage space, it is possible to further determine which logical subframe the sorting number is, thereby determining the sorting number of the corresponding logical subframe in the first storage space, and the number of logical subframes contained in the absolute subframe whose sorting number is less than or equal to the sorting number of the logical subframe can be determined from the first storage space, and the sum of this number and the total number of logical subframes stored in the storage unit corresponding to the determined index number is the logical subframe number corresponding to the absolute subframe number (i.e., steps S56-S57).

[0201] In the disclosed embodiment, LogicSFrm (logical subframe number) = Pool[x].wLogicSFrmNum+Calc1BitLow(Pool[x].wPhySFrmBitmap, AbsSFrm%Total(Pool[x].wPhySFrmBitmap));

[0202] Wherein, Pool[x].wLogicSFrmNum is the total number of logical subframes stored in the storage unit corresponding to the determined index number;

[0203] Calc1BitLow(Pool[x].wPhySFrmBitmap,AbsSFrm%Total(Pool[x].wPhySFrmBitmap)) means calculating the number of bits that are 1 in the bit stream stored in Pool[x].wPhySFrmBitmap, from the first bit to the AbsSFrm%Total(Pool[x].wPhySFrmBitmap)th bit, that is, the number of logical subframes.

[0204] 2. The following introduces the detailed TTI storage solution applied to multiple resource pool scenarios.

[0205] In the embodiment of the present disclosure, the TTI here can also be a subframe or a time slot, which will not be repeated here.

[0206] In the disclosed embodiment, in LTE-V2X, if a 16-bit first storage space is used to store data, the memory of a single resource pool can be compressed 8 times, and the compressed single resource pool occupies 5k (kilo) bytes. Considering that LTE-V2X has a maximum of 25 resource pools, the total cost is still very large. It is possible to consider storing high-level configured resource pools in a linked list to reduce unnecessary waste. It is also possible to use a multi-resource pool multiplexing method to store the absolute TTI (reserved TTI) portion after deleting the synchronous TTI, downlink TTI, and special TTI from multiple resource pools in a common resource pool. The difference in calculating logical subframes between single resource pools includes the reserved subframes determined according to the bit length bitstrlen. A single resource pool can save the data before the reserved subframe is deleted and record the bitstrlen value, so that the number of reserved subframes to be deleted can be calculated according to the prior art to obtain the logical subframe. It is known that the deletion of reserved subframes is clearly stipulated by the protocol and there is a formula to follow, which will not be repeated here.

[0207] In the embodiment of the present disclosure, the resource pool is a plurality of resource pools; the target TTI is a logical TTI and a reserved TTI included in the plurality of resource pools; the target TTI is placed in a preset public resource pool;

[0208] After acquiring the target TTI from the absolute transmission time interval TTI in the resource pool to be stored, the method further includes:

[0209] The logical TTIs and reserved TTIs are renumbered consecutively according to the sequence of each logical TTI and reserved TTI in the public resource pool to obtain virtual numbers corresponding to each logical TTI and reserved TTI.

[0210] In an embodiment of the present disclosure, the method further includes:

[0211] Determine whether a target TTI corresponding to an arbitrary virtual number is a logical TTI according to an arbitrary virtual number, the total number of virtual numbers, the total number of reserved TTIs and a first calculation formula;

[0212] When it is determined that the target TTI corresponding to the arbitrary virtual number is a logical TTI, the difference between the arbitrary virtual number and the corresponding logical TTI number is calculated according to the arbitrary virtual number, the total number of virtual numbers, the total number of reserved TTIs and the second calculation formula;

[0213] The logical TTI number corresponding to any virtual number is calculated according to the arbitrary virtual number and the difference.

[0214] In the embodiment of the present disclosure, the key now is that if the current resource pool includes multiple sub-resource pools and a common resource pool, the common resource pool is used to store the TTIs (i.e., logical TTIs and reserved TTIs) after deleting the synchronous TTI, downlink TTI, and special TTI of the multiple resource pools. Each target TTI has a corresponding virtual number in the common resource pool. When the TTIs of the multiple resource pools are stored according to the above embodiment of the present disclosure, it can be determined whether any target TTI is a logical TTI based on the virtual number.

[0215] In the embodiment of the present disclosure, the first calculation formula includes: a%|n / k|; wherein a is a virtual number, n is the total number of virtual numbers, k is the total number of reserved TTIs, % is a modulus, / is a division sign, and |n / k| means rounding n / k;

[0216] In the embodiment of the present disclosure, judging whether a target TTI corresponding to any virtual number is a logical TTI according to any virtual number, the total number of virtual numbers, the total number of reserved TTIs and the first calculation formula includes:

[0217] Substitute any virtual number, the total number of virtual numbers and the total number of reserved TTIs into the first calculation formula;

[0218] When the calculated value of the first calculation formula is 0, it is determined that the target TTI corresponding to any virtual number is not a logical TTI;

[0219] When the calculated value of the first calculation formula is not 0, it is determined that the target TTI corresponding to an arbitrary virtual number is a logical TTI.

[0220] In the embodiment of the present disclosure, after determining that a target TTI corresponding to a certain virtual number is a logical TTI according to the above solution, the logical TTI number of the logical TTI can be determined.

[0221] In the embodiment of the present disclosure, the difference between the virtual number and the corresponding logical TTI number can be calculated according to a preset second calculation formula, and the second calculation formula includes: p=a / |n / k|+1; wherein p is the difference between the virtual number and the corresponding logical TTI number. Then the logical TTI number is equal to the virtual number plus the difference p.

[0222] In the embodiment of the present disclosure, after the difference is obtained, the difference may be saved, and when the logical TTI number of a certain logical TTI is known, the corresponding virtual number may be calculated according to the difference P and the logical TTI number.

[0223] In the disclosed embodiment, the above scheme can reuse resource pools in the same TDD mode. LTE-V2X has a maximum of 25 resource pools, which can be compressed by a maximum of 25 times, saving 100k bytes of space.

[0224] The present disclosure also provides a TTI storage device 100, such as Fig.14 As shown, including:

[0225] A first acquisition module 101 is used to acquire a plurality of storage units with consecutive index numbers; each storage unit includes a first storage space and a second storage space;

[0226] The second acquisition module 102 is used to acquire a target TTI from an absolute transmission time interval TTI in a resource pool to be stored; the absolute TTI refers to any TTI contained in the resource pool;

[0227] The first storage module 103 is used to store the absolute TTI in the first storage space of the plurality of storage units in sequence according to the order of the absolute TTI in the system frame number SNF period; wherein the first storage space contains a plurality of bits, each bit represents a TTI; each bit indicates that the bit represents a target TTI or a non-target TTI through a preset bit identifier;

[0228] A statistics module 104, configured to count the total number of target TTIs stored in all storage units before the index number corresponding to each storage unit;

[0229] The second storage module 105 is used to store the total number of target TTIs counted for each storage unit into the second storage space of the corresponding storage unit.

[0230] The present disclosure also provides an electronic device 200, such as Fig.15 As shown, the electronic device 200 includes:

[0231] One or more processors 201;

[0232] A memory 202, on which one or more programs are stored. When the one or more programs are executed by the one or more processors 201, the one or more processors 201 implement the TTI storage method;

[0233] One or more input / output I / O interfaces 203 are connected between the processor 201 and the memory 202 and are configured to implement information exchange between the processor 201 and the memory 202 .

[0234] Among them, the processor 201 is a device with data processing capabilities, including but not limited to a central processing unit (CPU) and the like; the memory 202 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH); the I / O interface (read-write interface) 203 is connected between the processor 201 and the memory 202, and can realize information interaction between the processor 201 and the memory 202, including but not limited to a data bus (Bus) and the like.

[0235] In some embodiments, the processor 201 , the memory 202 , and the I / O interface 203 are connected to each other via a bus 204 , and further connected to other components of the computing device.

[0236] In a fourth aspect, the present disclosure provides a computer-readable storage medium 300, such as Fig.16 As shown, a computer program is stored thereon, and the computer program implements the TTI storage method when executed by a processor.

[0237] Those skilled in the art will appreciate that all or some of the steps, systems, and functional modules / units in the apparatus disclosed above may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0238] In hardware implementations, the division between functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation.

[0239] Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit (CPU), a digital signal processor or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-temporary medium) and a communication medium (or temporary medium). As known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH) or other disk storage; read-only compact disk (CD-ROM), digital versatile disk (DVD) or other optical disk storage; magnetic cassettes, magnetic tapes, disk storage or other magnetic storage; any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0240] The present disclosure has disclosed example embodiments, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for limiting purposes. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly stated, features, characteristics, and / or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in conjunction with other embodiments. Therefore, those skilled in the art will appreciate that various changes in form and detail may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

1. A TTI storage method, characterized in that: The method comprises: Acquire multiple storage units with consecutive index numbers; each storage unit includes a first storage space and a second storage space; Obtaining a target TTI from an absolute transmission time interval TTI in a resource pool to be stored; the absolute TTI refers to any TTI contained in the resource pool; The absolute TTIs are sequentially stored in the first storage space of the multiple storage units according to the order of the absolute TTIs in the system frame number SNF period; wherein the first storage space contains multiple bits, each bit represents a TTI; each bit indicates that the bit represents a target TTI or a non-target TTI through a preset bit identifier; Counting the total number of the target TTIs stored in all storage units before the index number corresponding to each storage unit; The total number of the target TTIs counted for each storage unit is stored in the second storage space of the corresponding storage unit.

2. The TTI storage method according to claim 1, characterized in that: The resource pool is a single resource pool; the target TTI is a logical TTI; the logical TTI refers to an absolute TTI that can be used to transmit uplink data; The bit position identifier includes a first bit position identifier, the first bit position identifier includes a first identifier and a second identifier, the first identifier indicates that the bit position represents the logical subframe TTI, and the second identifier indicates that the bit position represents a non-logical TTI; After acquiring the target TTI from the absolute transmission time interval TTI in the resource pool to be stored, the method further includes: Obtain the number of each logical TTI in the SNF cycle, and record it as the absolute TTI number of each logical TTI; The logical TTIs are renumbered consecutively according to the order of each logical TTI before and after the SNF cycle to obtain a logical TTI number corresponding to each logical TTI.

3. The TTI storage method according to claim 2, characterized in that: The counting the total number of the target TTIs stored in all storage units before the index number corresponding to each storage unit includes: Obtaining the logical TTI number corresponding to the logical TTI stored in the previous storage unit of each storage unit; Selecting a maximum logical TTI number from the acquired logical TTI numbers; The numerical value corresponding to the maximum logical TTI number is used as the total number of the logical TTIs stored in all the storage units before the index number corresponding to each storage unit.

4. The TTI storage method according to claim 2, characterized in that: The storage unit further includes a third storage space, and the bit identifier further includes a second bit identifier; After storing the total number of the target TTIs counted corresponding to each storage unit in the second storage space of each storage unit, the method further includes: storing the logical subframes in sequence into the plurality of third storage spaces according to the logical TTI numbering sequence; The bit capacity of each of the third storage spaces is a preset bit length, and each bit in the third storage space represents a logical TTI; each bit is indicated by the second bit identifier to indicate whether the bit represents an available TTI or an unavailable TTI.

5. The TTI storage method according to claim 4, characterized in that: The method further comprises: According to any logical TTI number and the second bit identifiers in the plurality of third storage spaces, it is detected whether the logical TTI corresponding to the arbitrary logical TTI number is an available subframe.

6. The TTI storage method according to claim 5, characterized in that: The second bit identifier includes a third identifier and a fourth identifier; the third identifier indicates that the bit represents the available TTI, and the fourth identifier indicates that the bit represents the unavailable TTI; The detecting, according to any logical TTI number and the second bit identifiers in the plurality of third storage spaces, whether the logical TTI corresponding to the arbitrary logical TTI number is an available subframe includes: Determine, according to the logical TTI number, a third storage space where the logical TTI corresponding to the logical TTI number is located; Taking a modulus of the logical TTI number and the bit length to obtain a first modulo result; Determine, according to the first modulo result, an offset of the logical TTI number in a third storage space where the logical TTI is located; Find the bit corresponding to the logical TTI according to the offset; Detecting that the second bit position identifier of the bit position corresponding to the logical TTI is the third identifier or the fourth identifier; When the second bit identifier is the third identifier, it is determined that the logical TTI corresponding to the logical TTI number is an available TTI; when the second bit identifier is the fourth identifier, it is determined that the logical TTI corresponding to the logical TTI number is a non-available TTI.

7. The TTI storage method according to claim 2, characterized in that: After storing the total number of logical TTIs counted corresponding to each storage unit in the second storage space of each storage unit, the method further includes: Determine the absolute TTI number corresponding to any one logical TTI according to the logical TTI number of any one logical TTI and the index number of the storage unit where the logical TTI is located; and / or, The logical TTI number corresponding to any one logical TTI is determined according to the absolute TTI number corresponding to any one logical TTI and the bit capacity set in the first storage space.

8. The TTI storage method according to claim 7, characterized in that: The determining, according to the logical TTI number of any logical TTI and the index number of the storage unit where the logical TTI is located, the absolute TTI number corresponding to the any logical TTI includes: Compare the logical TTI number of the any one logical TTI with the total number of the logical TTIs stored in each storage unit to obtain the total number of logical TTIs greater than the logical TTI number; Obtaining the total number of logical TTIs with the smallest value from the total number of logical TTIs greater than the logical TTI number; Using the storage unit corresponding to the total number of logical TTIs with the smallest value as the storage unit where the logical TTI corresponding to the logical TTI number is located, and obtaining the index number corresponding to the storage unit where the logical TTI is located; Subtract the logical TTI number from the total number of the logical TTIs stored in the storage unit where the logical TTI is located, to obtain the ranking of the logical TTI in the logical TTIs stored in the storage unit where the logical TTI is located; Obtaining, according to the ranking, a bit position of the logical TTI in a first storage space of a storage unit where the logical TTI is located; According to the arrangement order of the absolute TTIs of the resource pool when stored in the first storage space, counting the sequence numbers of the bits in the first storage space; The index number corresponding to the storage unit where the logical TTI is located is multiplied by the bit capacity set in the first storage space to obtain a product value, and the product value is added to the sorting number to obtain the absolute subframe number corresponding to any one of the logical subframes.

9. The TTI storage method according to claim 7, characterized in that: The determining, according to the absolute TTI number corresponding to any one logical TTI and the bit capacity set in the first storage space, the logical TTI number corresponding to any one logical TTI includes: Divide the absolute TTI number by the bit capacity and round it to an integer to obtain an index number of a storage unit where a logical TTI corresponding to the absolute TTI number is located; Taking a modulus of the absolute TTI number and the bit capacity to obtain a second modulo result; Detecting whether the absolute TTI corresponding to the absolute TTI number is the logical TTI according to the absolute TTI number, the index number and the second modulo result; When the absolute TTI corresponding to the absolute TTI number is the logical TTI, the sorting number of the logical TTI corresponding to the absolute TTI number in the first storage space when the second modulo result is stored as the absolute TTI in the first storage space; Determine from the first storage space the number of the logical TTIs contained in the absolute TTIs whose sorting numbers are less than or equal to the sorting number of the logical TTI; Obtaining the total number of logical TTIs stored in the corresponding storage unit according to the index number; The total number of logical TTIs obtained according to the index number is added to the determined number of logical TTIs to obtain the logical TTI number of the logical TTI corresponding to the absolute TTI number.

10. The TTI storage method according to claim 9, characterized in that: The detecting, according to the absolute TTI number, the index number and the second modulo result, whether the absolute TTI corresponding to the absolute TTI number is the logical TTI includes: Determine, according to the index number, a storage unit where the absolute TTI corresponding to the absolute TTI number is located; offsetting the second modulo result in a direction of increasing absolute subframe number from the bit of the absolute TTI stored in the storage unit where the absolute TTI is located, to obtain a corresponding bit; Obtaining a first bit identifier of the corresponding bit; The first bit identifier performs an AND operation on the first bit identifier of each bit in the first bit code stream corresponding to all bits stored in the first storage space of the storage unit where the absolute TTI is located, to obtain a second bit code stream; When the value corresponding to the second bit stream is 0, determining that the absolute TTI corresponding to the absolute TTI number is not the logical TTI; When the value corresponding to the second bit code stream is not 0, it is determined that the absolute TTI corresponding to the absolute TTI number is the logical TTI.

11. The TTI storage method according to claim 1, characterized in that: The resource pool is a plurality of resource pools; the target TTI is a logical TTI and a reserved TTI included in the plurality of resource pools; the target TTI is placed in a preset public resource pool; After acquiring the target TTI from the absolute transmission time interval TTI in the resource pool to be stored, the method further includes: The logical TTI and the reserved TTI are renumbered consecutively according to the sequence of each logical TTI and the reserved TTI in the public resource pool to obtain a virtual number corresponding to each logical TTI and the reserved TTI.

12. The TTI storage method according to claim 11, characterized in that: The method further comprises: Determine whether the target TTI corresponding to the arbitrary virtual number is the logical TTI according to the arbitrary virtual number, the total number of virtual numbers, the total number of reserved TTIs and the first calculation formula; When it is determined that the target TTI corresponding to the arbitrary virtual number is the logical TTI, a difference between the arbitrary virtual number and the corresponding logical TTI number is calculated according to the arbitrary virtual number, the total number of the virtual numbers, the total number of the reserved TTIs, and a second calculation formula; A logical TTI number corresponding to the arbitrary virtual number is calculated according to the arbitrary virtual number and the difference.

13. The TTI storage method according to claim 12, characterized in that: The first calculation formula includes: a%|n / k|; wherein a is the virtual number, n is the total number of the virtual numbers, k is the total number of the reserved TTIs, % is the modulus, / is the division sign, and |n / k| means rounding n / k; The determining, according to any virtual number, the total number of virtual numbers, the total number of reserved TTIs and a first calculation formula, whether the target TTI corresponding to the arbitrary virtual number is the logical TTI includes: Substituting the arbitrary virtual number, the total number of the virtual numbers and the total number of the reserved TTIs into the first calculation formula; When the calculated value of the first calculation formula is 0, determining that the target TTI corresponding to the arbitrary virtual number is not the logical TTI; When the calculated value of the first calculation formula is not 0, it is determined that the target TTI corresponding to the arbitrary virtual number is the logical TTI.

14. The TTI storage method according to claim 12, characterized in that: The second calculation formula includes: p=a / |n / k|+1; wherein p is the difference.

15. A TTI storage device, characterized in that: include: A first acquisition module is used to acquire a plurality of storage units with consecutive index numbers; Each storage unit includes a first storage space and a second storage space; A second acquisition module is used to acquire a target TTI from an absolute transmission time interval TTI in a resource pool to be stored; Absolute TTI refers to any TTI included in the resource pool; A first storage module, configured to sequentially store the absolute TTIs in the first storage space of the plurality of storage units according to the order of the absolute TTIs in the system frame number SNF period; wherein the first storage space comprises a plurality of bits, each bit representing a TTI; and each bit indicates, through a preset bit identifier, that the bit represents a target TTI or a non-target TTI; A statistical module, used to count the total number of the target TTIs stored in all storage units before the index number corresponding to each storage unit; The second storage module is used to store the total number of the target TTIs counted for each storage unit into the second storage space of the corresponding storage unit.

16. An electronic device, comprising: one or more processors; A memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the TTI storage method according to any one of claims 1 to 14; One or more input / output I / O interfaces are connected between the processor and the memory and are configured to implement information interaction between the processor and the memory.

17. A computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the TTI storage method according to any one of claims 1 to 14.

Images