A time slot allocation method and a communication device

Abstract

The application provides a time slot allocation method and a communication device. The time slot sequence is determined by the total number of time slots to identify each time slot in a service transmission channel. A time slot allocation request sent by a terminal device is received. The target time slot number required by a target service signal is determined according to the indication information. The target identification is determined according to the remaining time slot number in the service transmission channel and the target time slot number. In the time slot identification corresponding to the remaining time slots in the service transmission channel, the same time slot identification as the target identification is searched. The target service signal is allocated to the time slot corresponding to the searched time slot identification for transmission. The time slot allocation method provided by the application can realize more flexible and uniform allocation of time slots in vehicle networking communication, thereby solving the problems of large vehicle networking communication resource consumption and long configuration and delivery time in the prior art.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, in particular to a time slot allocation method and a communication device. BACKGROUND

[0002] Vehicle to X (V2X) refers to that vehicles can communicate with external devices. With the proposal of intelligent networked vehicle development plan, V2X technology is greatly supported and developed, and vehicle networking technology is also promoted on a large scale by various vehicle manufacturers. The promotion and application of vehicle networking technology complement each other with the technology of mobile communication system platform, and how to use network slicing technology to provide better services for vehicle networking is the focus of the industry.

[0003] With the proposal of Ethernet hard private line technology, on the basis of automotive slicing network (ASN) / flex Ethernet (FlexE) technology, smaller bandwidth granularity (10 Mbps) and wider bandwidth distribution (1-10*N Mbps) can be provided. ASN provides the needs of deterministic low latency, low jitter, and hard isolation for vehicle deterministic network scenarios. ASN is based on small-granularity Ethernet hard private line technology, and the bearing pipe thereof can be various physical Ethernet ports. The minimum granularity of the service is 10 Mbps, and the maximum bandwidth is 96% of the bandwidth of the bearing pipe. For example, for a 5Gbps Ethernet pipe, 10Mbps-480*10Mbps service bandwidth distribution can be divided.

[0004] Correspondingly, for the reasonable allocation and scheduling of the service flow with fine-granularity bandwidth, both scheduling fairness and control of scheduling delay jitter become problems to be solved.

[0005] If a mathematical algorithm (for example, sigma-delta algorithm) is used to perform uniform configuration of time slots, complex software calculation and CPU configuration are required. Therefore, the time slot allocation method completely needs to rely on the execution of software, needs to know the service bandwidth of the time slots to be allocated, needs to calculate the time slot configuration table in real time, and needs to recalculate the time slot configuration table based on the change of the number of service time slots. The time-consuming is long, the allocation is not flexible enough, and the application requirements of vehicle networking cannot be met. Therefore, a time slot allocation method with more flexible and uniform allocation and less resource occupation needs to be proposed. SUMMARY

[0006] The present application provides a time slot allocation method and device to realize more flexible and uniform allocation of time slots in vehicle networking communication, and less resource occupation, so as to better meet the application requirements of vehicle networking.

[0007] In a first aspect, the application provides a time slot allocation method, which comprises: receiving a time slot allocation request sent by a terminal device, the time slot allocation request comprising indication information of a target time slot number required by the terminal device for transmitting a target service signal; determining the target time slot number required for transmitting the target service signal according to the indication information; determining a representation mode of a first type number according to a remaining time slot number in a service transmission channel, and determining a first type number representation of the target time slot number by using the representation mode of the first type number; determining a bit number corresponding to a code bit with a set number on a number code bit in the first type number representation of the target time slot number as a target identifier; searching for a time slot identifier identical to the target identifier in time slot identifiers corresponding to the remaining time slots in the service transmission channel; wherein the time slot identifiers corresponding to the respective time slots in the service transmission channel are represented based on respective sequence elements included in a time slot sequence, and the respective sequence elements in the time slot sequence are determined according to a second type number representation mode and a total bit number included in a second type number; the representation mode of the first type number and the representation mode of the second type number are both binary arrays represented by using two numbers 0 and 1 respectively; and allocating the target service signal to a time slot corresponding to the searched time slot identifier for transmission.

[0008] By using the time slot allocation method provided by the application, more flexible and uniform allocation of time slots in vehicle networking communication can be achieved. First, the representation mode of the second type number is determined according to the total number of time slots in the service transmission channel, so as to determine the time slot sequence, thereby achieving uniform identification of each time slot in the service channel. After uniform identification, the representation mode of the first type number is determined according to the time slot number of the remaining time slots, and the first type number representation of the target time slot number required for transmitting the to-be-transmitted service is determined by using the representation mode of the first type number, so as to find the target identifier corresponding to the target service signal on the first type number representation corresponding to the target time slot number, and search for an identifier identical to the target identifier from the identifiers on each time slot in the remaining time slots, determine the time slot corresponding to the identifier as the target time slot, and allocate the target service signal to the target time slot for transmission. Therefore, the allocation is more flexible and occupies less resources.

[0009] As a possible implementation, the determination of the representation mode of the first type number according to the remaining time slot number in the service transmission channel comprises:

[0010] Suppose that the total bit number of the first type number is N, and N satisfies the following formula:

[0011] 2 N-1 ≤M<2 N ;

[0012] wherein M is the total time slot number included in the service transmission channel.

[0013] Each bit of the first type number corresponds to a bit weight β N , β N-1 , … β1 N , β N-1 , … β1 N respectively, and satisfy the following formula:

[0014]

[0015] Wherein, P is the remaining time slot number.

[0016] As a possible implementation, using the representation of the first type number, the first type number representation of the target time slot number is determined, including:

[0017] The first type number representation of the target time slot number Q satisfies the following formula:

[0018] {A N , … A2, A1}, Q = A N * β N + … A2* β2 + A1* β1, A1… A N is 0 or 1.

[0019] Because of the representation of the first type number, there is a case that the same number corresponds to different representations of the first type number, as a possible implementation, the first type number representation of the target time slot number is also determined, including:

[0020] Judge whether the target time slot number Q is greater than or equal to β N , if greater than or equal to, A N is set to 1, otherwise A N is set to 0;

[0021] Judge whether Q-β N * A N is greater than or equal to β N-1 , if greater than or equal to, A N-1 is set to 1, otherwise A N-1 is set to 0;

[0022] In this way, judge whether Q-β N * A N … - β N * A2 is greater than or equal to β1, if greater than or equal to, A1 is set to 1, otherwise A1 is set to 0.

[0023] Through the representation of the first type number in the above formula, the target time slot number can correspond to a unique first type number representation.

[0024] As a possible implementation, according to the total time slot number included in the service transmission channel and the total bit number included in the second type number, the time slot sequence is determined, including:

[0025] According to the total number of time slots M included in the service transmission channel, the representation of the second type number is determined, wherein the total number of bits of the second type number is N, N satisfies the following formula:

[0026] 2 N-1 ≤M<2 N ;

[0027] The second type number from 0 to M is represented as follows, and M second type numbers are obtained:

[0028] {a N ,…a2,a1},M=a N *2 N-1 +…a2*2 1 +a1*2 0

[0029] The time slot sequence includes M sequence elements, and the time slot sequence satisfies the following formula:

[0030] {N-Y0,N-Y1,N-Y2…N-Y M-1};

[0031] Wherein Y0...Y M-1 is the carry bit number when the second type number is accumulated from 0 to M, wherein Y0 is the carry bit number when the second type number is accumulated from 0 to 1, and Y M-1 is the carry bit number when the second type number is accumulated from M-1 to M. If the carry occurs in the third bit, the carry bit number is 3, and so on. In addition, in this application, because the total number of time slots included in the service channel is constant, the time slot sequence can be repeatedly used by each time slot.

[0032] As a possible implementation, based on each sequence element included in the time slot sequence, each time slot in the service transmission channel corresponds to a time slot identifier, including:

[0033] Each time slot in the service transmission channel is identified by using the sequence element in the time slot sequence.

[0034] In some scenarios, the number of time slots in the service transmission channel may not be sufficient to transmit the target service signal. As a possible implementation, the method further comprises: when it is determined that the target time slot number required to transmit the target service signal is greater than the remaining time slot number in the service transmission channel, returning an indication message of insufficient bandwidth of the service transmission channel to the terminal device.

[0035] In a second aspect, the application provides a communication device, comprising a transceiver and a processing unit, wherein the transceiver is configured to receive a time slot allocation request sent by a terminal device, the time slot allocation request comprising indication information of a target time slot number required by the terminal device for transmitting a target service signal; and the processing unit is configured to:

[0036] determine the target time slot number according to the indication information; determine a first type number representation mode according to a remaining time slot number in a service transmission channel; determine a first type number representation of the target time slot number by using the first type number representation mode; determine a target identifier in the first type number representation of the target time slot number, wherein the target identifier is a bit number corresponding to a code bit with a preset number on a code bit; find a time slot identifier identical to the target identifier in time slot identifiers corresponding to the remaining time slot in the service transmission channel, wherein the time slot identifiers corresponding to the respective time slots in the service transmission channel are represented based on respective sequence elements included in a time slot sequence, and the respective sequence elements in the time slot sequence are determined according to a second type number representation mode and a total bit number included in a second type number; the first type number representation mode and the second type number representation mode are both binary arrays represented by using two numbers 0 and 1 respectively; and the target service signal is allocated to a time slot corresponding to the found time slot identifier for transmission by the transceiver.

[0037] As a possible implementation, the processing unit can be configured to determine the first type number representation mode according to the remaining time slot number in the service transmission channel in the following manner.

[0038] Suppose that a total bit number of the first type number is N, and N satisfies the following formula:

[0039] 2 N-1 ≤M<2 N ;

[0040] M is a total time slot number included in the service transmission channel;

[0041] a bit weight corresponding to each bit code in the first type number is β N , β N-1 , … β1, β N , β N-1 , … β1 respectively, which satisfy the following formula:

[0042]

[0043] wherein P is the remaining time slot number.

[0044] As a possible implementation, the processing unit can be configured to determine the first type number representation of the target time slot number by using the first type number representation mode in the following manner.

[0045] The first type number representation of the target time slot quantity Q satisfies the following formula:

[0046] {A N , …A2, A1}, Q = A N *β N +…A2*β2+A1*β1, A1…A N is 0 or 1.

[0047] As a possible implementation, if the first type number representation is used, and there are multiple types of the first type number representation of the target time slot quantity, the processing unit, when determining the first type number representation of the target time slot quantity, is further configured to determine whether the target time slot quantity Q is greater than or equal to β N , if greater than or equal to, A N is set to 1, otherwise A N is set to 0; determine whether Q-β N ×A N is greater than or equal to β N-1 , if greater than or equal to, A N-1 is set to 1, otherwise A N-1 is set to 0; and so on, determine whether Q-β N ×A N …-β N ×A2 is greater than or equal to β1, if greater than or equal to, A1 is set to 1, otherwise A1 is set to 0.

[0048] As a possible implementation, when the processing unit determines the time slot sequence based on the total time slot quantity included in the service transmission channel and the total bit quantity included in the second type number, the processing unit can be specifically configured to:

[0049] determine the representation of the second type number based on the total time slot quantity M included in the service transmission channel, wherein the total bit quantity of the second type number is N, and N satisfies the following formula:

[0050] 2 N-1 ≤M<2 N ;

[0051] use the following second type number to represent 0 to M respectively to obtain M second type numbers:

[0052] {a N , …a2, a1}, M = a N *2 N-1 +…a2*2 1 +a1*2 0

[0053] The time slot sequence includes M sequence elements, and the time slot sequence satisfies the following formula:

[0054] {N-Y0, N-Y1, N-Y2…N-Y M-1};

[0055] wherein Y0...Y M-1 is the carry bit number when 0 represented based on the second type of number is accumulated to 1 represented based on the second type of number, and so on, Y M-1 is the carry bit number when M-1 represented based on the second type of number is accumulated to M represented based on the second type of number.

[0056] As a possible implementation, when the processing unit is configured to represent the time slot identifiers corresponding to each time slot in the service transmission channel based on the sequence elements included in the time slot sequence, the processing unit is specifically configured to: identify each time slot in the service transmission channel by using the sequence elements in the time slot sequence.

[0057] As a possible implementation, the transceiving unit is further configured to return an indication message of insufficient bandwidth of the service transmission channel to the terminal device when the number of target time slots required by the terminal device to transmit the target service signal is greater than the number of remaining time slots in the service transmission channel.

[0058] In a third aspect, the present application further provides a communication device, which comprises a processor and a memory. The memory can be arranged inside the communication device or outside the communication device. The processor is configured to execute a computer program stored in the memory, so that any possible design of the first aspect is realized.

[0059] In a fourth aspect, the present application further provides a computer readable storage medium, which comprises computer program instructions. When the computer program instructions are executed by a computer, any possible design of the first aspect is realized.

[0060] In a fifth aspect, the present application further provides a computer program. When the computer program is executed by a computer, any possible design of the first aspect is realized.

[0061] The technical effects achieved by any of the second aspect to the fifth aspect are the same as those achieved by any possible design of the first aspect, and will not be described here. BRIEF DESCRIPTION OF DRAWINGS

[0062] Figure 1 FIG. 1 is a schematic structural diagram of a vehicle-mounted slicing network system;

[0063] Figure 2 FIG. 7 is a schematic diagram of steps of a time slot allocation method;

[0064] Figure 3 This is a schematic diagram of a time slot allocation;

[0065] Figure 4 This is a schematic diagram of a time slot allocation configuration table;

[0066] Figure 5 This is a schematic diagram of the structure of a communication device;

[0067] Figure 6 This is a schematic diagram of the structure of a communication device. Detailed Implementation

[0068] To make the objectives, technical solutions, and advantages of this application clearer, a further detailed description of this application will be provided below in conjunction with the accompanying drawings. However, the exemplary embodiments can be implemented in various forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided to make this application more comprehensive and complete, and to fully convey the concept of the exemplary embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar structures, and therefore repeated descriptions of them will be omitted. Terms describing position and direction as described in this application are illustrative based on the accompanying drawings, but changes may be made as needed, and all such changes are included within the scope of protection of this application. The accompanying drawings of this application are for illustrating relative positional relationships only and do not represent actual scale.

[0069] In the context of vehicular network slicing, it is necessary to reasonably allocate and schedule service flows with fine-grained bandwidth to ensure both scheduling fairness and control scheduling latency jitter, which has become an urgent problem to be solved.

[0070] The time slot allocation method provided in this application is mainly applied to the vehicular slice network (ASN) system. (See attached document.) Figure 1 As shown, Figure 1 This is a schematic diagram of an in-vehicle slicing network system; wherein the in-vehicle slicing network includes an ASN controller, an ASN encoding (MAP) unit, an ASN decoding (DeMAP) unit, an ASN time slot mapping (Switch) unit, and an ASN reconstruction (RSM) unit.

[0071] The ASN controller is used to allocate and configure time slots for service signals transmitted on the ASN system.

[0072] The ASN encoding unit is used to receive service signals sent by the terminal device, slice the application data contained in the service signals sent by the terminal device to obtain multiple application data slices, and encode the data packets corresponding to the multiple application data slices according to the set encoding format.

[0073] An ASN decoding unit is configured to receive a service signal transmitted by the Ethernet interface, slice the Ethernet data contained in the service signal transmitted by the Ethernet interface to obtain a plurality of Ethernet data slices, and decode data packets corresponding to the plurality of Ethernet data slices according to a set decoding format.

[0074] An ASN time slot mapping unit is configured to receive a time slot allocation result issued by the ASN controller, map the encoded or decoded data slices to corresponding time slots according to the time slot allocation result, and transmit the encoded or decoded data slices on the mapped time slots through the Ethernet interface.

[0075] An ASN recombination unit is configured to recombine the Ethernet data slices belonging to the same service signal after decoding, and transmit the service signal containing the Ethernet data obtained after recombination to a terminal device.

[0076] It should be noted that the ASN controller can be a central processing unit (CPU), a general processor, a digital signal processing (DSP), an application specific integrated circuits (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logical blocks, modules and circuits described in combination with the disclosure.

[0077] In the embodiments of the present application, the terminal device can include but is not limited to mobile telephones, phones, tablets, portable equipment, vehicle-mounted devices, telematics boxes (TBOX) and other devices that need to transmit service signals.

[0078] Currently, the prior art usually adopts a triangular integral algorithm to implement the service signal time slot uniformization configuration in the ASN system. This time slot allocation method needs to know the service bandwidth of the time slot to be allocated, and needs to calculate the time slot configuration table in real time, and needs to recalculate the time slot configuration table based on the continuous change of the service time slot number. Therefore, this method takes a long time and is not flexible enough in allocation, and cannot meet the application requirements of vehicle networking.

[0079] Therefore, the application provides a time slot allocation method, which is used for more flexible and uniform allocation of time slots in vehicle networking communication, thereby solving the problems of large vehicle networking communication resource consumption and long time slot configuration in the prior art.

[0080] The time slot allocation method provided by the application can be applied to the ASN controller shown in Figure 1 The time slot allocation method provided by the application can be applied to the ASN controller shown in

[0081] It should be noted that the first type number and the second type number mentioned in the embodiments of the application are binary numbers represented by 0 and 1, and each digit in the binary number corresponds to a bit weight defined according to a specific rule. The bit weight is the unit value corresponding to each fixed position.

[0082] Referring to Figure 2 , Figure 2 A step schematic diagram of the time slot allocation method provided by the embodiments of the application is shown in

[0083] Step S101: Determine the total number M of time slots in the service transmission channel for transmitting service signals, and the total number of time slots in the service transmission channel meets the following formula:

[0084]

[0085] For example, if the total bandwidth of the service transmission channel for transmitting service signals is 300 Mbps, and the bandwidth of a single time slot in the vehicle slice network is 10 Mbps, then the total number of time slots in the service transmission channel is 30, and the following embodiments are all exemplified with the total number of time slots M being 30.

[0086] Step S102: Determine the time slot sequence according to the total number M of time slots in the service transmission channel for transmitting service signals, and use the sequence elements in the time slot sequence to identify each time slot in the remaining time slots in the service transmission channel. This process can be implemented through the following steps S1021 to S1023.

[0087] Step S1021: Determine the representation of the second type number according to the total number M of time slots in the service transmission channel for transmitting service signals, wherein the second type number is a binary number represented by 0 and 1, and the total number of bits of the second type number is N, which meets the following formula: 2 N-1 ≤M<2 N If M is 30, it can be seen that N should be 5.

[0088] The method for representing M in the second type number is:

[0089] M is expanded as follows: M=a N *2 N-1 +…a2*2 1 +a1*2 0 .

[0090] {a N , …a2, a1} is the second type number representation of M.

[0091] For example, Table 1 below is a comparison table of the second type number representation of M from 0 to 30.

[0092] Table 1

[0093] M Second type of number representation 0 {0，0，0，0，0} 1 {0，0，0，0，1} … … 28 {1，1，1，0，0} 29 {1，1，1，0，1} 30 {1，1，1，1，0}

[0094] From Table 1 above, if M is 30 and N is 5, the second type number representation of M is {1, 1, 1, 1, 0}.

[0095] Step S1022: The time slot sequence includes M sequence elements, and the time slot sequence satisfies the following formula: {N-Y0, N-Y1, N-Y2…N-Y M-1}.

[0096] Y0...Y M-1 is the representation based on the second type number, accumulated from 0 to M (accumulation according to the second type number representation), and the carry bit number at the time of accumulation, wherein Y0 is the carry bit number when accumulated from 0 to 1, Y M-1 is the carry bit number when accumulated from M-1 to M. When accumulated from 0 to M, if no carry occurs, the carry bit number is 0. If the carry occurs at the i-th bit, the carry bit number is the value of the i-th bit, for example, if the carry occurs at the third bit, the carry bit number is 3, and so on.

[0097] For example, when accumulated from the second type number representation {0, 0, 0, 0, 0} corresponding to 0 to the second type number representation {0, 0, 0, 0, 1} corresponding to 1, no carry occurs, so Y0 is 0; when accumulated from the second type number representation {0, 0, 0, 0, 1} corresponding to 1 to the second type number representation {0, 0, 0, 1, 0} corresponding to 2, the carry occurs at the first bit, so Y1 is 1; when accumulated from the second type number representation {0, 0, 1, 1, 1} corresponding to 7 to the second type number representation {0, 1, 0, 0, 0} corresponding to 8, the carry occurs at the third bit, so Y7 is 3.

[0098] Based on the above principle, when M is 30, the resulting time slot sequence is {5, 4, 5, 3, 5, 4, 5, 2, 5, 4, 5, 3, 5, 4, 5, 1, 5, 4, 5, 3, 5, 4, 5, 2, 5, 4, 5, 3, 5, 4}.

[0099] Step S1023: Identify each time slot in the service transmission channel using the sequence elements in the time slot sequence. Assuming a total of 30 time slots, i.e., when all time slots in the service transmission channel are currently unoccupied, use the 30 sequence elements {5, 4, 5, 3, 5, 4, 5, 2, 5, 4, 5, 3, 5, 4, 5, 1, 5, 4, 5, 3, 5, 4, 5, 2, 5, 4, 5, 3, 5, 4} to sequentially identify each of the 30 time slots, thus obtaining the following time slot identification table 2.

[0100] Time slot identification table 2

[0101]

[0102] Step S103: Based on the identifier on each time slot in the remaining time slots and the number of target time slots Q required by the target service signal to be allocated, the target service signal is allocated to the target time slots in the remaining time slots for transmission.

[0103] The number of target time slots Q required for the target service signal to be allocated can be determined in the following way:

[0104] The terminal device receives a time slot allocation request, which includes an indication of the number of target time slots required for the terminal device to transmit the target service signal; and determines the number of target time slots required for transmitting the target service signal based on the indication.

[0105] Then, based on the identifier on each time slot in the remaining time slots and the number of target time slots Q required by the target service signal to be allocated, the target service signal is allocated to the target time slots in the remaining time slots for transmission. The implementation process of this step S103 can be specifically achieved through the following steps S1031 to S1033.

[0106] Step S1031: Based on the number of remaining time slots P, determine the representation method of the first type number, and use the representation method of the first type number to determine the first type number representation of the target number of time slots Q.

[0107] The first type of number is a binary array represented by two numbers, 0 and 1. The total number of bits in the first type of number is N, and the bit weight of each bit in the first type of number is β. N ,β N-1 , …β1, where βN , β N-1 ,... β1are values related to the number of time slots P of the remaining time slots respectively.

[0108] β N , β N-1 ,... β1respectively satisfy the following formulas:

[0109]

[0110]

[0111]

[0112] ...

[0113]

[0114] wherein the method for representing the target number of time slots Q by the first type of numbers is:

[0115] Q is expanded according to the following formula: Q = A N * β N +... A2* β2+ A1* β1.

[0116] {A N ,... A2, A1} are the first type of numbers representing Q.

[0117] For example, if the number of time slots P of the remaining time slots is 30, then the bit weight corresponding to each digit in the first type of numbers is:

[0118] The bit weight corresponding to the fifth digit:

[0119] The bit weight corresponding to the fourth digit:

[0120] The bit weight corresponding to the third digit:

[0121] The bit weight corresponding to the second digit:

[0122] The bit weight corresponding to the first digit:

[0123] For example, taking the target number of time slots Q as 10, Table 3 below is a comparison table of the first type of numbers representing Q from 0 to 10.

[0124] Table 3

[0125] Q First type of number representation 0 {0，0，0，0，0} 1 {0，0，0，0，1} 2 {0，0，0，1，0} 3 {0，0，0，1，1} 4 {0，0，1，0，0} 5 {0，0，1，0，1} 6 {0，0，1，1，0} 7 {0，0，1，1，1} 8 {0，1，0，0，0} 9 {0，1，0，0，1} 10 {0，1，0，1，0}

[0126] It should be noted that for the above first type number representation, there are cases where the same number corresponds to different first type number representations. For example, according to the above principle, when P is 12, the bit weight corresponding to each digit code in the first type number is respectively:

[0127] The bit weight corresponding to the fifth digit code is:

[0128] The bit weight corresponding to the fourth digit code is:

[0129] The bit weight corresponding to the third digit code is:

[0130] The bit weight corresponding to the second digit code is:

[0131] The bit weight corresponding to the first digit code is:

[0132] When Q=9, if the above first type number representation corresponding to the bit weight is used to determine the first type number representation of Q=9, it can be found that {1, 1, 0, 0, 0} (β5*1+β4*1+β3*0+β2*0+β1*0=9), {1, 0, 1, 1, 0} (β5*1+β4*0+β3*1+β2*1+β1*0=9) and {1, 0, 1, 0, 1} (β5*1+β4*0+β3*1+β2*0+β1*1=9) can all represent the case of Q=9.

[0133] From the above representation, a fixed method needs to be selected to correspond to a unique first type number representation of the target time slot quantity Q.

[0134] If the first type number representation corresponding to the target time slot quantity Q is {A N , A N-1 , …, A1}, then the process of making the target time slot quantity Q correspond to a unique first type number representation can be implemented by the following steps S10311 to S1031N. Wherein, A N is the first bit in the first type number representation corresponding to the target time slot quantity Q, and A1 is the Nth bit in the first type number representation corresponding to the target time slot quantity Q.

[0135] Step S10311: Determine whether the target time slot quantity Q is greater than or equal to β N If it is greater than or equal to, A N is set to 1, otherwise A N is set to 0;

[0136] Step S10312: Determine whether Q-β N ×AN whether greater than or equal to β N-1 A is set to 1, otherwise A N-1 is set to 1, otherwise A N-1 is set to 0.

[0137] Similarly, step S1031N: judging whether Q-β N x A N ...-β N x A2 is greater than or equal to β1, if greater than or equal to, then A1 is set to 1, otherwise A1 is set to 0.

[0138] For example, if the time slot number P of the remaining time slots is 30, and the target time slot number Q is 10, then the step of determining the first type number of the target time slot number Q is represented as {A5, A4, A3, A2, A1}:

[0139] Since Q (10) is less than β5 (15), A5 is set to 0;

[0140] Since (Q (10) - β5 (15) * 0) is greater than β4 (8), A4 is set to 1;

[0141] Since (Q (10) - β5 (15) * 0 - β4 (8) * 1) is less than β3 (4), A3 is set to 0;

[0142] Since (Q (10) - β5 (15) * 0 - β4 (8) * 1 - β3 (4) * 0) is equal to β2 (2), A2 is set to 1;

[0143] Since (Q (10) - β5 (15) * 0 - β4 (8) * 1 - β3 (4) * 0 - β2 (2) * 1) is less than β1 (1), A1 is set to 0.

[0144] Therefore, the first type number of the target time slot number Q (10) is determined as {0, 1, 0, 1, 0}.

[0145] Step S1032: in the first type number of the target time slot number Q, the bit number corresponding to the code bit with the set number on the code bit is the target identification.

[0146] For example, if the first type number corresponding to the target time slot number Q (10) is {0, 1, 0, 1, 0}, and the set number is 1, since the number on the second code bit and the fourth code bit is 1, the target identification is determined as 2 and 4, where the order of the code bits is from right to left of the first type number.

[0147] Step S1033: From the identifiers on each of the remaining time slots, find the identifier that is the same as the target identifier, determine the time slot corresponding to the identifier as the target time slot, and allocate the target service signal to the target time slot for transmission.

[0148] For example, when the target number of time slots Q is 10 and the remaining number of time slots is 30, the target time slots determined from the remaining time slots are shown in Table 4 below. In Table 4, the time slots corresponding to the shaded parts are the target time slots, that is, the time slots marked as 2 and 4 in the time slot identifiers represented by the second type number are the target time slots, so that the target service signal is transmitted in the following 10 target time slots.

[0149] Table 4

[0150]

[0151] The above describes the complete process of allocating a time slot for a target service signal according to an embodiment of this application. In some scenarios, the terminal device may send signal transmission requests for multiple target service signals to be allocated. (See also...) Figure 3 As shown, Figure 3 This is a schematic diagram of time slot allocation according to an embodiment of this application; a queue of target service signals to be allocated time slots is provided by the terminal device, the queue including multiple target service signals to be allocated time slots and their corresponding number of target time slots. For example, Figure 3 The queue can include target service signals from the first to the fifth, corresponding to target timeslot numbers of 10, 7, 4, 2, and 1, respectively. Using the target timeslot numbers corresponding to the queues of target service signals, and employing the scheme described above, the target identifier can be determined. Each remaining timeslot in the service transmission channel can be identified using sequence elements in the timeslot sequence. An identifier matching the target identifier is found in each timeslot, and the timeslot corresponding to that identifier is determined as the target timeslot. The target service signal is then allocated to the target timeslot for transmission, thereby achieving flexible and uniform timeslot allocation.

[0152] The following embodiment uses the example of allocating time slots from the second target service signal (with a corresponding target time slot quantity Q' of 7) after the first target service signal has been allocated the corresponding time slots in accordance with the above embodiment. The allocation process includes the following steps:

[0153] Since the total number of time slots in the service transmission channel is still 30, the implementation of steps S201 to S2022 in this process is the same as that of steps S101 to S1022 in the above embodiment, and will not be described in detail here.

[0154] Step S2023: Identify each time slot in the remaining time slots of the service transmission channel using the sequence elements in the time slot sequence.

[0155] Since the total number of time slots M in the service transmission channel is 30, and 10 time slots have been occupied, the remaining time slots P' is 30-10=20. The first 20 sequence elements {5, 4, 5, 3, 5, 4, 5, 2, 5, 4, 5, 3, 5, 4, 5, 1, 5, 4, 5, 3} in the time slot sequence are used to sequentially identify each of the remaining time slots, and the following time slot identification table 5 is obtained. In the time slot identification table 5, the black part is the time slot that has been occupied in the service transmission channel.

[0156] Time slot identification table 5

[0157]

[0158] Step S203: Based on the identification of each time slot in the remaining time slots, and according to the target time slot number Q' required by the target service signal to be allocated, the target service signal is allocated to the target time slot in the remaining time slots for transmission. (Taking the target time slot number Q' as 7 as an example), the process of this step can be realized through the following steps S2031 to S2033.

[0159] Step S2031: According to the time slot number P' of the remaining time slots, the representation of the first type number is re-determined, and the first type number representation of the target time slot number Q' is determined by using the re-determined first type number representation. The first type number is a binary number represented by 0 and 1, and each digit code in the re-determined first type number corresponds to a bit weight β N ', β N-1 ', … β1'.

[0160] β N ', β N-1 ', … β1'.

[0161]

[0162]

[0163]

[0164] …

[0165]

[0166] For example, if the time slot number P' of the remaining time slots is 20, then each digit code in the first type number corresponds to a bit weight of:

[0167] When the time slot number P' is 20, the bit weight corresponding to the fifth digit code is:

[0168] The bit weight corresponding to the fourth bit code:

[0169] The bit weight corresponding to the third bit code:

[0170] The bit weight corresponding to the second bit code:

[0171] The bit weight corresponding to the first bit code:

[0172] For example, Table 6 below is a reference table of the first type number representation corresponding to Q' from 0 to 7 when P' is 20.

[0173] Table 6

[0174] Q First type of number representation 0 {0，0，0，0，0} 1 {0，0，0，0，1} 2 {0，0，0，1，1} 3 {0，0，1，0，0} 4 {0，0，1，1，0} 5 {0，1，0，0，0} 6 {0，1，0，1，0} 7 {0，1，0，1，1}

[0175] If the first type number representation corresponding to the target time slot number Q' is {A N ', A N-1 ',..., A1'}, the process of determining the first type number representation of the target time slot number Q' can be implemented through the following steps S20311 to S2031N. The A N ' is the first bit in the first type number representation corresponding to the target time slot number Q', and the A1' is the Nth bit in the first type number representation corresponding to the target time slot number Q'.

[0176] Step S20311: Determine whether the target time slot number Q' is greater than or equal to β N ', if greater than or equal to, set A N ' to 1, otherwise set A N ' to 0;

[0177] Step S20312: Determine whether Q' - β N ' × A N ' is greater than or equal to β N-1 ', if greater than or equal to, set A N-1 ' to 1, otherwise set A N-1 ' to 0;

[0178] Similarly, step S20311N: Determine whether Q' - β N ' × A N '... - β N ' × A2' is greater than or equal to β1', if greater than or equal to, set A1' to 1, otherwise set A1' to 0.

[0179] For example, if the number P' of the remaining time slots is 20 and the target number Q' of time slots is 7, the first type number of the target number Q' of time slots is determined as {A5', A4', A3', A2', A1'}.

[0180] Since Q'(7) is less than β5'(10), A5' is set to 0;

[0181] Since (Q'(7)-β5'(10)*0) is greater than β4'(5), A4' is set to 1;

[0182] Since (Q'(7)-β5'(10)*0-β4'(5)) is less than β3'(3), A3' is set to 0;

[0183] Since (Q'(7)-β5'(10)*0-β4'(5)*1-β3'(3)*0) is greater than β2'(1), A2' is set to 1;

[0184] Since (Q'(7)-β5'(10)*0-β4'(8)*1-β3'(4)*0-β2'(1)*1) is equal to β1'(1), A1' is 1; therefore, the first type number corresponding to the target number Q'(7) of time slots is determined as {0, 1, 0, 1, 1}.

[0185] In step S2032, the target identification is determined as the bit number corresponding to the bit with the set number in the first type number corresponding to the target number Q' of time slots.

[0186] For example, if the first type number corresponding to the target number Q'(7) of time slots is {0, 1, 0, 1, 1} and the set number is 1, the target identification is 1, 2 and 4 according to the order of the bit from right to left in the first type number.

[0187] In step S2033, the target time slot is determined as the time slot corresponding to the same identification as the target identification from the time slot identification of the remaining time slots, and the target service signal is transmitted in the target time slot.

[0188] For example, when the target number Q' of time slots is 7 and the number of the remaining time slots is 20, the target time slot determined from the remaining time slots is shown in Table 7 below. In Table 7, the time slots corresponding to the shaded part are the target time slots, i.e. the time slots with the identification 1, 2 and 4 in the time slot identification represented by the second type number are the target time slots, so that the second target service signal is transmitted in the following 7 target time slots.

[0189] Table 7

[0190]

[0191] The subsequent steps of time slot allocation for other target service signals in the queue of target service signals to be allocated are the same as the above-described embodiments, and will not be described here.

[0192] For example, referring to Figure 4 , Figure 4 A time slot allocation configuration table is provided, and the above-described Figure 3 each target service signal (the first target service signal (10), the second target service signal (7), the third target service signal (4), the fourth target service signal (2), and the fifth target service signal (1)) in the queue of each target service signal of the above-described Figure 4 The time slot allocation configuration table is as shown in Figure 4 , the time slots corresponding to C1 are the time slots allocated to the first target service signal, that is, 10; the time slots corresponding to C2 are the time slots allocated to the second target service signal, that is, 7; the time slots corresponding to C3 are the time slots allocated to the third target service signal, that is, 4; the time slots corresponding to C4 are the time slots allocated to the fourth target service signal, that is, 2; and the time slots corresponding to C5 are the time slots allocated to the fifth target service signal, that is, 1. As can be seen from the example shown in Figure 4 , the first target service signal, the second target service signal, the third target service signal, the fourth target service signal, and the fifth target service signal can uniformly and flexibly occupy the transmission time slots, are well spaced from each other, and can well avoid interference between the target service signals.

[0193] The time slot allocation method provided by the present application can achieve more flexible and uniform allocation of time slots in vehicle networking communication. First, the representation of the second type number is determined by using the total number of time slots in the service transmission channel, so as to determine the time slot sequence, thereby achieving uniform identification of each time slot in the remaining time slots. After uniform identification, the representation of the first type number is determined according to the number of time slots in the remaining time slots, and the first type number representation of the target time slot number is determined by using the representation of the first type number, so as to find the target identifier corresponding to the target service signal on the first type number representation corresponding to the target time slot number, and find the same identifier as the target identifier on the identifier of each time slot in the remaining time slots. The time slot corresponding to the identifier is determined as the target time slot, and the target service signal is allocated to the target time slot for transmission. In this way, since the total number of time slots is unchanged, the time slot sequence can be reused, and each time the time slot is allocated, only the target identifier needs to be determined according to the number of time slots in the remaining time slots and the target time slot number, so as to allocate the target service signal to the target time slot for transmission, and thus the allocation is more flexible and the resource occupation is more uniform.

[0194] Based on the same concept, the embodiment of the present application provides a communication device, referring to Figure 5 as shown in the figure, Figure 5 a structural schematic diagram of a communication device provided by the present application; the communication device 500 comprises a transceiver unit 501 and a processing unit 502:

[0195] The transceiver unit 501 is used for receiving a time slot allocation request sent by a terminal device, wherein the time slot allocation request comprises indication information of a target time slot number required by the terminal device for transmitting a target service signal.

[0196] The processing unit 502 is used for determining the target time slot number required by the terminal device for transmitting the target service signal according to the indication information; determining a first type number representation mode according to a remaining time slot number in a service transmission channel; determining a first type number representation of the target time slot number by using the first type number representation mode; determining a target identification in a code bit on a number bit in the first type number representation of the target time slot number; searching for a time slot identification same as the target identification in time slot identifications respectively corresponding to the remaining time slots in the service transmission channel; wherein the time slot identifications respectively corresponding to each time slot in the service transmission channel are represented based on each sequence element included in a time slot sequence, each sequence element in the time slot sequence is determined according to a second type number representation mode and a total bit number included in a second type number; the first type number representation mode and the second type number representation mode are both binary arrays represented by using two numbers 0 and 1 respectively; and the transceiver unit 501 transmits the target service signal on a time slot corresponding to the searched time slot identification.

[0197] The transceiver unit 501 can also be referred to as a transceiver module, a transceiver, a transceiver, or a transceiver device. The processing unit 502 can also be referred to as a processor, a processing board, a processing module, or a processing device. Optionally, the transceiver unit 501 is used for executing the sending operation and the receiving operation in the above method, the device in the transceiver unit 501 for realizing the receiving function can be regarded as a receiving unit, and the device in the transceiver unit 501 for realizing the sending function can be regarded as a sending unit, that is, the transceiver unit 501 comprises a receiving unit and a sending unit.

[0198] It should be noted that the transceiving unit 501 and / or the processing unit 502 can be implemented by a virtual module, for example, the transceiving unit 501 can be implemented by a software function or a virtual device, and the processing unit 502 can be implemented by a software function unit or a virtual device. Alternatively, the transceiving unit 501 and / or the processing unit 502 can also be implemented by an entity device, for example, if the communication device 500 is implemented by a chip / chip circuit, the transceiving unit 501 can be an input / output circuit and / or a communication interface, which performs an input operation (corresponding to the aforementioned receiving operation) and an output operation (corresponding to the aforementioned sending operation); and the processing unit 502 is an integrated processor or a microprocessor or an integrated circuit.

[0199] The division of units in the embodiments of the present application is illustrative, and is only a logical functional division. In actual implementation, another division manner can be used. In addition, each functional unit in each embodiment of the present application can be integrated in one processor, or can be physically separated, or two or more units can be integrated in one unit. The integrated unit can be implemented in the form of hardware or in the form of a software functional unit.

[0200] As a possible implementation, when the processing unit 502 determines the representation manner of the first type number according to the number of remaining time slots in the service transmission channel, the processing unit 502 is specifically configured to:

[0201] Suppose that the total number of bits of the first type number is N, and the N satisfies the following formula:

[0202] 2 N-1 ≤M<2 N ;

[0203] The M is the total number of time slots included in the service transmission channel;

[0204] The bit weight corresponding to each bit number in the first type number is β N , β N-1 , … β1, respectively, and the β N , β N-1 , … β1 respectively satisfy the following formula:

[0205]

[0206] Wherein, P is the number of remaining time slots.

[0207] As a possible implementation, when the processing unit 502 determines the first type number representation of the target time slot number by using the representation manner of the first type number, the processing unit 502 is specifically configured to:

[0208] The first type number representation of the target time slot number Q satisfies the following formula:

[0209] {A N ,..., A2, A1}, the Q=A N *β N +... A2*β2 + A1*β1, the A1...A N is 0 or 1.

[0210] As a possible implementation, if the representation of the first type number is used, and it is determined that the first type number representing the target time slot quantity exists multiple times, when determining the first type number representing the target time slot quantity, it is also used for:

[0211] determining whether the target time slot quantity Q is greater than or equal to β N , if greater than or equal to, A N is set to 1, otherwise A N is set to 0;

[0212] determining whether Q-β N ×A N is greater than or equal to β N-1 , if greater than or equal to, A N-1 is set to 1, otherwise A N-1 is set to 0;

[0213] In this way, it is determined whether Q-β N ×A N ...-β N ×A2 is greater than or equal to β1, if greater than or equal to, A1 is set to 1, otherwise A1 is set to 0.

[0214] As a possible implementation, when the processing unit 502 determines the time slot sequence according to the total time slot quantity included in the service transmission channel and the total bit quantity included in the second type number, it is specifically used for:

[0215] determining the representation of the second type number according to the total time slot quantity M included in the service transmission channel, wherein the total bit quantity of the second type number is N, and the N satisfies the following formula:

[0216] 2 N-1 ≤M<2 N ;

[0217] using the following second type number to represent 0 to the M respectively, to obtain M second type numbers:

[0218] {a N ,...a2, a1}, M=a N *2 N-1 +...a2*2 1 +a1*2 0

[0219] The time slot sequence includes M sequence elements, and the time slot sequence satisfies the following formula:

[0220] {N-Y0, N-Y1, N-Y2…N-Y M-1};

[0221] Wherein, the Y0...Y M-1 is a carry bit number when 0 represented based on the second type of number is accumulated to 1 represented based on the second type of number, and so on, the Y M-1 is a carry bit number when M-1 represented based on the second type of number is accumulated to M represented based on the second type of number.

[0222] As a possible implementation, when the processing unit 502 represents that each time slot in the service transmission channel corresponds to a time slot identifier based on each sequence element included in the time slot sequence, the processing unit 502 is specifically configured to:

[0223] Identify each time slot in the service transmission channel by using the sequence element in the time slot sequence.

[0224] As a possible implementation, the transceiver unit 501 is further configured to return an indication message of insufficient bandwidth of the service transmission channel to the terminal device when the target time slot number required by the terminal device to transmit the target service signal is greater than the remaining time slot number in the service transmission channel.

[0225] Based on the same idea, the embodiment of the present application further provides a communication device 600, which can include at least one processor 610 coupled with a memory 620. Optionally, the memory 620 can be located in the communication device 600, and can be integrated with the processor 610 or located outside the communication device 600. For example, the communication device 600 can further include at least one memory 620. The memory 620 stores necessary computer programs, computer programs or instructions and / or data in any of the above embodiments; the processor 610 can execute the computer programs stored in the memory 620 to complete any of the above embodiments.

[0226] The communication device 600 may also include a communication interface 630, through which the communication device 600 can interact with other devices. For example, the communication interface 630 may be a transceiver, circuit, bus, module, pin, or other type of communication interface. When the communication device 600 is a chip-based device or circuit, the communication interface 630 may also be an input / output circuit, capable of inputting information (or receiving information) and outputting information (or sending information). The processor may be an integrated processor, microprocessor, integrated circuit, or logic circuit, and the processor can determine the output information based on the input information.

[0227] The coupling in this embodiment is an indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processor 610 may operate in conjunction with the memory 620 and the communication interface 630. This embodiment does not limit the specific connection medium between the processor 610, the memory 620, and the communication interface 630.

[0228] Optional, see Figure 6 The processor 610, the memory 620, and the communication interface 630 are interconnected via a bus 640. The bus 640 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 6 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0229] In the embodiments of this application, the processor 610 may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processor, or executed by a combination of hardware and software modules within the processor.

[0230] In the embodiments of the present application, the memory 620 can be a non-volatile memory such as a hard disk drive (HDD) or a solid-state drive (SSD), and can also be a volatile memory such as a random-access memory (RAM). The memory can be any other medium capable of carrying or storing desired program codes in the form of instructions or data structures and capable of being accessed by a computer, but is not limited to this. The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing a storage function, for storing program instructions and / or data.

[0231] Based on the same idea, the embodiments of the present application further provide a computer readable storage medium, comprising computer program instructions, when the computer program instructions are executed by a computer, to cause any of the above-mentioned Figures 2 to 4 embodiments to be implemented.

[0232] Based on the same idea, the embodiments of the present application further provide a computer program, when the computer program is executed by a computer, to cause any of the above-mentioned Figures 2 to 4 embodiments to be implemented.

[0233] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROMs, optical storage media, etc.) containing computer-usable program code.

[0234] The present application is described with reference to the flowcharts and / or block diagrams of the method, device (system), and computer program product according to the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing apparatus to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing apparatus produce a device that implements the functions specified in the flowcharts and / or block diagrams. Figure 1 The functions specified in a flow or multiple flows and / or blocks Figure 1 The functions specified in a flow or multiple flows and / or blocks

[0235] These computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture including instructions which implement the flow Figure 1 The flow or flows and / or blocks Figure 1 The flow or flows and / or blocks

[0236] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions that execute on the computer or other programmable apparatus provide steps for implementing the flow Figure 1 The flow or flows and / or blocks Figure 1 The flow or flows and / or blocks

[0237] Obviously, numerous modifications and variations of the present application are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims and their equivalents, the application can be practiced otherwise than as specifically described.

Claims

1. A time slot allocation method, characterized in that, The method includes: The terminal device receives a time slot allocation request, which includes an indication of the number of target time slots required by the terminal device to transmit the target service signal. Based on the indicated information, determine the number of target time slots required to transmit the target service signal; Based on the number of remaining time slots in the service transmission channel, determine the representation method of the first type number, and use the representation method of the first type number to determine the first type number representation of the target time slot number; In the first type of number representation that determines the target number of time slots, the number of bits corresponding to the code bits that are set to a certain number on the digital bits is the target identifier; Among the time slot identifiers corresponding to the remaining time slots in the service transmission channel, a time slot identifier that is the same as the target identifier is searched; wherein, the time slot identifier corresponding to each time slot in the service transmission channel is represented based on the sequence elements included in the time slot sequence, and each sequence element in the time slot sequence is determined according to the second type number representation method determined by the total number of time slots included in the service transmission channel, and the total number of bits included in the second type number; the first type number representation method and the second type number representation method are both binary arrays represented by two numbers, 0 and 1, respectively; The target service signal is assigned to the time slot corresponding to the found time slot identifier for transmission.

2. The method according to claim 1, characterized in that, The representation of the first type of number is determined based on the number of remaining time slots in the service transmission channel, including: Assume the total number of bits in the first type of number is N, where N conforms to the following formula: 2 N-1 ≤M＜2 N ； M represents the total number of time slots included in the service transmission channel; The bit weights corresponding to each digit in the first type of number are β. N ,β N-1 , …β1, the β N ,β N-1 , ..., β1 respectively satisfy the following formulas: Wherein, P is the number of remaining time slots.

3. The method according to claim 2, characterized in that, The first type of number representation used to determine the target number of time slots includes: The first type of numerical representation of the target number of time slots Q conforms to the following formula: {A N ...A2, A1}, where Q = A N *β N +…A2*β2+A1*β1, where A1…A N It can be 0 or 1.

4. The method according to claim 3, characterized in that, If multiple representations of the first type of number are used to determine the target time slot quantity, then determining the first type of number representation of the target time slot quantity further includes: Determine whether the target number of time slots Q is greater than or equal to β. N If it is greater than or equal to, then A N Set to 1, otherwise A N Set to 0; Determine Q-β N ×A N Is it greater than or equal to β? N-1 If it is greater than or equal to, then A N-1 Set to 1, otherwise A N-1 Set to 0; And so on, to determine Q-β N ×A N ...-β N If ×A2 is greater than or equal to β1, then A1 is set to 1; otherwise, A1 is set to 0.

5. The method according to any one of claims 1-4, characterized in that, The time slot sequence is determined based on the total number of time slots included in the service transmission channel and the total number of bits included in the second type, including: Based on the total number M of time slots included in the service transmission channel, the representation method of the second type number is determined, wherein the total number of bits of the second type number is N, and N conforms to the following formula: 2 N-1 ≤M＜2 N ； Representing 0 to M using the following second-type numbers, we obtain M second-type numbers: {a N ,…a2,a1},M=a N *2 N-1 +…a2*2 1 +a1*2 0 The time slot sequence includes M sequence elements, and the time slot sequence conforms to the following formula: {N-Y0,N-Y1,N-Y2…N-Y M-1 }; Wherein, Y0...Y M-1 Based on the representation of the second type of number, the carry-in number is calculated from 0 to M, corresponding to the number of carry-in numbers during accumulation. Here, Y0 represents the carry-in number when accumulating from 0 (represented by the second type of number) to 1 (represented by the second type of number), and so on. M-1 The number of carry-in bits when accumulating from M-1 based on the second type of number representation to M based on the second type of number representation.

6. The method according to any one of claims 1-5, characterized in that, Based on the sequence elements included in the time slot sequence, representing the time slot identifier corresponding to each time slot in the service transmission channel, including: Each time slot in the service transmission channel is identified using the sequence elements in the time slot sequence.

7. The method according to any one of claims 1-6, characterized in that, The method further includes: When it is determined that the number of target time slots required to transmit the target service signal is greater than the number of remaining time slots in the service transmission channel, an indication message indicating insufficient bandwidth of the service transmission channel is returned to the terminal device.

8. A communication device, characterized in that, The device includes a transceiver unit and a processing unit: The transceiver unit is used to receive a time slot allocation request sent by the terminal device. The time slot allocation request includes an indication of the number of target time slots required by the terminal device to transmit the target service signal. The processing unit is used for: Based on the indicated information, determine the target number of time slots required to transmit the target service signal; based on the remaining number of time slots in the service transmission channel, determine the representation method of the first type number; and using the representation method of the first type number, determine the first type number representation of the target number of time slots. In the first type of number representation that determines the target number of time slots, the number of bits corresponding to the code bits that are set to a certain number on the digital bits is the target identifier; Among the time slot identifiers corresponding to the remaining time slots in the service transmission channel, a time slot identifier that is the same as the target identifier is searched; wherein, the time slot identifier corresponding to each time slot in the service transmission channel is represented based on the sequence elements included in the time slot sequence, and each sequence element in the time slot sequence is determined according to the second type number representation method determined by the total number of time slots included in the service transmission channel, and the total number of bits included in the second type number; the first type number representation method and the second type number representation method are both binary arrays represented by two numbers, 0 and 1, respectively; The transceiver unit allocates the target service signal to the time slot corresponding to the found time slot identifier for transmission.

9. The communication device according to claim 8, characterized in that, When the processing unit determines the representation method of the first type number based on the number of remaining time slots in the service transmission channel, it is specifically used for: Assume the total number of bits in the first type of number is N, where N conforms to the following formula: 2 N-1 ≤M＜2 N ； M represents the total number of time slots included in the service transmission channel; The bit weights corresponding to each digit in the first type of number are β. N ,β N-1 , …β1, the β N ,β N-1 , ..., β1 respectively satisfy the following formulas: Wherein, P is the number of remaining time slots.

10. The communication device according to claim 9, characterized in that, When the processing unit determines the first type of number representation of the target time slot quantity using the first type of number representation method, it is specifically used for: The first type of numerical representation of the target number of time slots Q conforms to the following formula: {A N ...A2, A1}, where Q = A N *β N +…A2*β2+A1*β1, where A1…A N It can be 0 or 1.

11. The communication device according to claim 10, characterized in that, If multiple representations of the first type of number exist when determining the target time slot quantity using the representation method of the first type of number, then when the processing unit determines the first type of number representation of the target time slot quantity, it is further configured to: Determine whether the target number of time slots Q is greater than or equal to β. N If it is greater than or equal to, then A N Set to 1, otherwise A N Set to 0; Determine Q-β N ×A N Is it greater than or equal to β? N-1 If it is greater than or equal to, then A N-1 Set to 1, otherwise A N-1 Set to 0; And so on, to determine Q-β N ×A N ...-β N If ×A2 is greater than or equal to β1, then A1 is set to 1; otherwise, A1 is set to 0.

12. The communication device according to any one of claims 8-11, characterized in that, When the processing unit determines the time slot sequence based on the total number of time slots included in the service transmission channel and the total number of bits included in the second type, it is specifically used for: Based on the total number M of time slots included in the service transmission channel, the representation method of the second type number is determined, wherein the total number of bits of the second type number is N, and N conforms to the following formula: 2 N-1 ≤M＜2 N ； Representing 0 to M using the following second-type numbers, we obtain M second-type numbers: {a N ,…a2,a1},M=a N *2 N-1 +…a2*2 1 +a1*2 0 The time slot sequence includes M sequence elements, and the time slot sequence conforms to the following formula: {N-Y0,N-Y1,N-Y2…N-Y M-1 }; Wherein, Y0...Y M-1 Based on the representation of the second type of number, the carry-in number is calculated from 0 to M, corresponding to the number of carry-in numbers during accumulation. Here, Y0 represents the carry-in number when accumulating from 0 (represented by the second type of number) to 1 (represented by the second type of number), and so on. M-1 The number of carry-in bits when accumulating from M-1 based on the second type of number representation to M based on the second type of number representation.

13. The communication device according to any one of claims 8-12, characterized in that, When the processing unit represents the time slot identifier corresponding to each time slot in the service transmission channel based on the sequence elements included in the time slot sequence, it is specifically used for: Each time slot in the service transmission channel is identified using the sequence elements in the time slot sequence.

14. The communication device according to any one of claims 8-13, characterized in that, The transceiver unit is further configured to return an indication message indicating insufficient bandwidth of the service transmission channel to the terminal device when the number of target time slots required by the terminal device to transmit the target service signal is greater than the number of remaining time slots in the service transmission channel.

15. A communication device, characterized in that, Includes a processor, the processor being coupled to a memory for executing a computer program stored in the memory, such that the method as claimed in any one of claims 1 to 7 is implemented.

16. A computer-readable storage medium, characterized in that, It includes computer program instructions, which, when executed by a computer, implement the method as described in any one of claims 1 to 7.

Images