WO2021068758A1

WO2021068758A1 - Shuffle method, apparatus, computer device, and readable storage medium

Info

Publication number: WO2021068758A1
Application number: PCT/CN2020/117564
Authority: WO
Inventors: 张尧; 王秉睿; 何皓源
Original assignee: 安徽寒武纪信息科技有限公司
Priority date: 2019-10-09
Filing date: 2020-09-25
Publication date: 2021-04-15
Also published as: CN112631595B; CN112631595A

Abstract

Provided are a shuffle method, apparatus, computer device, and readable storage medium. The method comprises: according to a first shuffle level, determining at least one first shuffle group corresponding to a data block to be encoded (S501), the first shuffle group containing a plurality of first shuffle units, the first shuffling units containing at least one encoded stream; determining the encoding length of each first shuffle unit (S502); according to the encoding length of each first shuffle unit, determining, in each of the first shuffling units, an output shuffle unit and an input shuffle unit (S503); sending a first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit, and taking same as a first stream block to be encoded in the input shuffle unit, so that the first stream block to be encoded is encoded by means of the input shuffle unit according to a preset encoding algorithm (S504).

Description

Shuffle method, device, computer equipment and readable storage medium

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on October 9, 2019 with the application number 201910954846. 1, titled "Shuffle method, device, computer equipment and readable storage medium", the entire content of which is incorporated by reference Incorporated in this application.

Technical field

This application relates to the field of computer technology, in particular to a shuffling method, device, computer equipment and readable storage medium.

Background technique

At present, in the process of encoding and decoding data in a SOC (System on a Chip), data needs to be complemented, resulting in a high encoding and decoding rate. Therefore, there is an urgent need for a solution that can reduce the codec rate.

Summary of the invention

Based on this, it is necessary to provide a shuffling method, device, computer equipment, and readable storage medium in response to the above technical problems.

In the first aspect, a shuffling method is provided, and the method includes:

According to the first shuffling level, at least one first shuffle group corresponding to the data block to be encoded is determined, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one coded stream ；

Determine the code length of each first shuffling unit;

Determine an output shuffle unit and an input shuffle unit in each of the first shuffle units according to the code length of each of the first shuffle units;

Send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be encoded in the input shuffle unit to pass the input The shuffling unit encodes the first stream block to be encoded according to a preset encoding algorithm.

In a second aspect, a shuffling method is provided, and the method includes:

According to the first shuffle level, determine at least one first shuffle group corresponding to the data block to be decoded, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one decoded stream ；

Determine the code length of each first shuffling unit;

Send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be decoded in the input shuffle unit to pass the input The shuffling unit decodes the first stream block to be decoded according to a preset decoding algorithm.

In a third aspect, a shuffling device is provided, the device comprising:

The first determination module is configured to determine at least one first shuffle group corresponding to the data block to be encoded according to the first shuffle level, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit The washing unit contains at least one coded stream;

The second determining module is used to determine the code length of each first shuffling unit;

A third determining module, configured to determine an output shuffle unit and an input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit;

A sending module, configured to send a first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be coded in the input shuffle unit, The first stream block to be encoded is encoded by the input shuffling unit according to a preset encoding algorithm.

In a fourth aspect, a shuffling device is provided, the device comprising:

The first determining module is configured to determine at least one first shuffle group corresponding to the data block to be decoded according to the first shuffle level, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit The washing unit contains at least one decoding stream;

A sending module, configured to send a first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be decoded in the input shuffle unit, The first stream block to be decoded is decoded by the input shuffling unit according to a preset decoding algorithm.

In a fifth aspect, a computer device is provided, including a memory and a processor, the memory stores a computer program that can run on the processor, and when the processor executes the computer program, any one of the first aspect is implemented. The steps of the method described in item.

In a sixth aspect, a computer-readable storage medium is provided, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the method described in any one of the first aspects.

In a seventh aspect, a chip system is provided, including a processor, the processor is coupled to a memory, the memory stores program instructions, and the first aspect is implemented when the program instructions stored in the memory are executed by the processor Any of the methods.

In an eighth aspect, a computer device is provided, including a memory and a processor, the memory stores a computer program that can run on the processor, and when the processor executes the computer program, any one of the second aspects is implemented. The steps of the method described in item.

In a ninth aspect, a computer-readable storage medium is provided, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any one of the methods in the second aspect.

In a tenth aspect, a chip system is provided, including a processor, the processor is coupled to a memory, the memory stores program instructions, and the second aspect is implemented when the program instructions stored in the memory are executed by the processor Any of the methods.

Description of the drawings

In order to better describe and explain the embodiments and/or examples disclosed herein, one or more drawings may be referred to. The additional details or examples used to describe the drawings should not be considered as limiting the scope of any of the disclosed inventions, the currently described embodiments and/or examples, and the best mode of these inventions currently understood.

FIG. 1 is a schematic structural diagram of a codec provided by an embodiment of the application;

2 is a schematic flowchart of a method for generating an encoded stream provided by an embodiment of the application;

FIG. 3 is a schematic diagram of a source data provided by an embodiment of this application;

FIG. 4A is a schematic diagram of stream block division according to an embodiment of this application;

FIG. 4B is a schematic diagram of a stream block division provided by an embodiment of this application;

FIG. 5 is a schematic flow chart of a shuffling method provided by an embodiment of the application;

FIG. 6 is a schematic flow chart of determining an output/input shuffling unit according to an embodiment of the application;

FIG. 7A is a schematic diagram of a coded stream before shuffling according to an embodiment of the application;

FIG. 7B is a schematic diagram of another coded stream before shuffling according to an embodiment of the application;

FIG. 8A is a schematic diagram of a shuffling process of an encoded stream provided by an embodiment of the application; FIG.

FIG. 8B is a schematic diagram of another shuffling process of an encoded stream provided by an embodiment of the application;

FIG. 9A is a schematic diagram of completion of shuffling of a coded stream provided by an embodiment of the application; FIG.

FIG. 9B is a schematic diagram of completion of shuffling of another coded stream provided by an embodiment of the application; FIG.

FIG. 10 is a schematic diagram of coded data provided by an embodiment of this application;

FIG. 11 is a schematic diagram of a source data sub-block splicing provided by an embodiment of this application;

FIG. 12A is a schematic diagram of splicing coded data sub-blocks according to an embodiment of the application; FIG.

FIG. 12B is a schematic diagram of splicing coded data sub-blocks according to an embodiment of this application;

FIG. 12C is a schematic diagram of splicing coded data sub-blocks according to an embodiment of the application; FIG.

FIG. 12D is a schematic diagram of sub-block splicing of encoded data provided by an embodiment of the application; FIG.

FIG. 13 is a schematic flow chart of a shuffling method provided by an embodiment of the application;

FIG. 14 is a schematic flowchart of determining an output/input shuffling unit according to an embodiment of the application;

15 is a schematic diagram of a decoded stream before shuffling according to an embodiment of the application;

FIG. 16 is a schematic diagram of a decoding stream shuffling process provided by an embodiment of this application;

FIG. 17 is a schematic diagram of completion of shuffling of decoded streams provided by an embodiment of the application; FIG.

FIG. 18 is a schematic diagram of encoding header data provided by an embodiment of this application;

FIG. 19 is a schematic diagram of data division when decoding is provided according to an embodiment of this application;

FIG. 20 is a schematic diagram of data division when decoding is provided according to an embodiment of this application;

FIG. 21 is a schematic structural diagram of a shuffling device provided by an embodiment of the application;

Figure 22 is a schematic structural diagram of a shuffling device provided by an embodiment of the application;

FIG. 23 is a schematic structural diagram of a computer device provided by an embodiment of this application.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present disclosure in conjunction with the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, but not all of the embodiments. Based on the embodiments in this disclosure, all other embodiments obtained by those skilled in the art without creative work fall within the protection scope of this disclosure.

It should be understood that the terms "first", "second", "third" and "fourth" in the claims, specification and drawings of this disclosure are used to distinguish different objects, rather than to describe a specific order . The terms "comprising" and "comprising" used in the specification and claims of this disclosure indicate the existence of the described features, wholes, steps, operations, elements and/or components, but do not exclude one or more other features, wholes The existence or addition of, steps, operations, elements, components, and/or their collections.

It should also be understood that the terms used in this disclosure specification are only for the purpose of describing specific embodiments, and are not intended to limit the disclosure. As used in this disclosure and claims, unless the context clearly indicates other circumstances, the singular forms "a", "an" and "the" are intended to include plural forms. It should be further understood that the term "and/or" used in this disclosure specification and claims refers to any combination of one or more of the items listed in association and all possible combinations, and includes these combinations.

As used in this specification and claims, the term "if" can be interpreted as "when" or "once" or "in response to determination" or "in response to detection" depending on the context. Similarly, the phrase "if determined" or "if detected [described condition or event]" can be interpreted as meaning "once determined" or "in response to determination" or "once detected [described condition or event]" depending on the context ]" or "in response to detection of [condition or event described]".

The embodiment of the present application provides a shuffling method, which can be applied to a codec. FIG. 1 is a system architecture diagram of a codec provided by an embodiment of the application. As shown in Figure 1, the codec includes at least one memory and at least one processor. The at least one memory is used to store computer programs. The at least one processor is used to execute the shuffling method according to the computer program stored in the memory to ensure that the encoding lengths of the encoded streams are similar, so as to avoid excessive complements due to alignment requirements between the encoded streams, thereby reducing the encoding rate . Wherein, the at least one processor may include one or more of IPU (Intelligent Processing Unit), CPU (Central Processing Unit, central processing unit), and GPU (Graphics Processing Unit, graphics processing unit); At least one processor can be a master-slave processor in the CT/LT architecture.

For ease of understanding, the embodiments of the present application give priority to a detailed description of a method for generating a coded stream provided by the embodiments of the present application. As shown in Figure 2, the specific steps are as follows:

Step 201: Obtain source data to be encoded.

In implementation, when the codec needs to encode source data, the codec can obtain pre-stored source data to be encoded. As shown in Figure 3, the format of the source data is a two-dimensional format, the low-dimensional is X, the high-dimensional is Y, the starting address is the data address, and the size of the source data is the low-dimensional data size (data size X) *High-dimensional data size (data size Y), the stride of the source data in the low dimensionality (stride) is the low-dimensional data stride (data X). The source data can be further divided into multiple source data blocks evenly in two dimensions. As shown in Figure 3, each block represents a source data block, and the size of the source data block is the size of the low-dimensional source data block. size X)*High-dimensional source data block size (block size Y), the low-dimensional interval between two adjacent source data blocks is the low-dimensional source data block stride (block stride X), and the high-dimensional interval is the high-dimensional source data block stride (block stride Y).

Step 202: According to the received encoding instruction, determine the encoding area corresponding to the encoding instruction in the source data, the encoding area contains at least one to-be-encoded data block, and the to-be-encoded data block is the source data block or the source data sub-block.

In implementation, after obtaining the source data to be encoded, the codec can determine the encoding region corresponding to the encoding instruction in the source data according to the received encoding instruction. The coding area contains at least one data block to be coded, and the data block to be coded is a source data block or a source data sub-block. As shown in Figure 3, the dashed frame is the coding area. The coding area can be specified by specifying the low-dimensional offset (offset X) in the low-dimensional direction and the high-dimensional offset (offset X) in the high-dimensional direction in the source data. Y) Obtained. Wherein, the coding region includes the number of low-dimensional source data blocks (block num X) source data blocks in the low-dimensional direction, and the high-dimensional source data block number (block num Y) source data blocks in the high-dimensional direction. The start address of the coding area is the address of the start source data block.

After the codec obtains the coding region corresponding to the coding instruction, for the central source data block (ie, the source data block represented by the vertical square in FIG. 3), the codec can directly encode the source data block. For the source data block at the edge (ie the source data block represented by the diagonal square in Figure 3), the codec can specify the top, bottom, left and right four The parameter determines the source data sub-block in the source data block, and encodes the determined source data sub-block.

It should be noted that, except for the encoding area, the data in other areas of the source data does not need to be partitioned, and the size of the data in other areas does not need to be aligned to the size of the source data block, low-dimensional offset, high-dimensional The offset, low-dimensional source data block step size, high-dimensional source data block step size, low-dimensional source data size, high-dimensional source data size, and low-dimensional source data step size do not need to be aligned with the low-dimensional source data block size or the high-dimensional source data block size. That is to say, the codec supports arbitrarily dividing the source data into blocks, and arbitrarily extracting the coding region from the obtained source data block for coding.

Step 203: For each to-be-coded data block in at least one to-be-coded data block, divide the to-be-coded data block into multiple stream blocks, and send the multiple stream blocks to multiple codes corresponding to the to-be-coded data block Stream, as a stream block to be shuffled in multiple encoded streams.

In implementation, in order to improve encoding throughput, the codec can encode the same data block to be encoded in parallel through multiple encoding streams. Similarly, when the codec shuffles, for each data block to be encoded, the codec can divide the data block to be encoded into multiple stream blocks, and send the multiple stream blocks to the data block to be encoded Corresponding multiple coded streams are used as stream blocks to be shuffled in the multiple coded streams. Optionally, the codec may divide the data block to be encoded into multiple row sequences, and each row sequence contains at least one data sub-block to be encoded. Then, for each sub-block of data to be encoded in each row sequence, the codec may divide the sub-block of data to be encoded into multiple stream blocks. In this way, it can be ensured that the number of stream blocks in each coded stream is close. For example, as shown in FIG. 4A, the codec divides the data block to be encoded into 4 line sequences. Among them, the first row sequence includes the data sub-block 1, the data sub-block 2, the data sub-block 3 to be encoded, and the data sub-block 4 to be encoded; the second row sequence contains the data sub-block 5 to be encoded and the data to be encoded. Sub-block 6, to-be-coded data sub-block 7 and to-be-coded data sub-block 8; the third row sequence contains to-be-coded data sub-block 9, to-be-coded data sub-block 10, to-be-coded data sub-block 11 and to-be-coded data sub-block 12 ; The fourth row sequence contains the data sub-block 13 to be encoded, the data sub-block 14 to be encoded, the data sub-block 15 to be encoded and the data sub-block 16 to be encoded. The diagonal squares in each row sequence indicate the non-encoded data in the data block to be encoded . Then, as shown in FIG. 4B, for each sub-block of data to be coded in each row sequence, the codec may divide the sub-block of data to be coded into 4 stream blocks and send them to the coded stream (steam) 1 respectively. To coded stream 4, as the stream block to be shuffled in each coded stream. Among them, coded stream 1 and coded stream 2 include 16 stream blocks to be shuffled, and coded stream 3 and coded stream 4 include 12 stream blocks to be shuffled.

In the following, a shuffling method provided in an embodiment of the present application will be described in detail with reference to specific embodiments, and the shuffling method is applied to the encoding process. As shown in Figure 5, the specific steps are as follows:

Step 501: Determine at least one first shuffling group corresponding to the data block to be encoded according to the first shuffling level. Wherein, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one coded stream.

In an implementation, the codec may select a corresponding shuffling level from the preset shuffling levels according to the difference in the number of stream blocks contained in each coded stream. For example, three shuffle levels can be preset in the codec, shuffle level 1, shuffle level 2, and shuffle level 3. After the codec selects a certain shuffling level (ie, the first shuffling level), it may further determine at least one first shuffling group corresponding to the data block to be encoded according to the first shuffling level. Wherein, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one coded stream.

Optionally, according to the first shuffling level, the codec determines the processing process of at least one first shuffling group corresponding to the data block to be encoded is acquiring multiple encoded streams corresponding to the data block to be encoded. According to the first shuffling level, the multiple encoded streams are divided into multiple first shuffling units, and the multiple first shuffling units are divided into at least one first shuffling group. Wherein, the first shuffle unit includes at least one coded stream, and the first shuffle group includes a plurality of first shuffle units.

In implementation, when the codec needs to determine at least one first shuffling group corresponding to the data block to be encoded according to the first shuffling level, the codec may obtain multiple encoded streams corresponding to the data block to be encoded. Then, the codec may divide the multiple coded streams into multiple first shuffling units according to the first shuffling level, and divide the multiple first shuffling units into at least one first shuffling group. Wherein, the first shuffle unit includes at least one coded stream, and the first shuffle group includes a plurality of first shuffle units. For example, the data block to be coded corresponds to 32 coded streams. When the first shuffle level is shuffle level 1, the codec can divide the 32 coded streams into 32 first shuffle units, and combine the 32 first shuffle units. The shuffling unit is divided into 8 first shuffling groups, that is, every 4 adjacent coded streams are shuffled; when the first shuffling level is shuffle level 2, the codec can divide 32 coded streams Divide into 8 first shuffling units, and divide the 8 first shuffling units into 2 first shuffling groups, that is, 4 coded streams are shuffled in every adjacent 16 coded streams The unit is shuffled; when the first shuffle level is shuffle level 3, the codec can divide 32 encoded streams into 2 first shuffle units, and divide the 2 first shuffle units into 1 The first shuffling group, that is, 16 coded streams among the 32 coded streams are shuffled as a shuffling unit.

Step 502: Determine the code length of each first shuffling unit.

In implementation, after the codec determines the first shuffle group corresponding to the data block to be encoded, for each first shuffle group, the codec can further determine each first shuffle unit in the first shuffle group The length of the encoding. Optionally, for each first shuffling unit in each first shuffling group, the codec may determine the total coding length of the stream block to be coded in the coded stream contained in the first shuffling unit as The code length of the first shuffling unit. For the case that the shuffling process and the encoding process are performed simultaneously, the codec may also determine the total code length of the stream block to be coded and the coded stream block in the coded stream contained in the first shuffling unit as the first shuffling The encoding length of the unit.

Step 503: Determine an output shuffle unit and an input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit.

In implementation, after the codec determines the code length of each first shuffle unit, it can determine the output shuffle unit and the input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit. unit. Among them, as shown in Figure 6, the codec determines the output shuffle unit and the input shuffle unit in each first shuffle unit according to the coding length of each first shuffle unit as follows:

Step 601: Determine the shuffling type of each first shuffling unit according to the code length of each first shuffling unit.

In implementation, after the codec determines the coding length of each first shuffling unit, the codec may determine the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit. Among them, the codec can determine the shuffling type of each first shuffling unit in various ways according to the encoding length of each first shuffling unit. The embodiment of the present application provides two feasible ways, which are specifically as follows :

Manner 1: For each first shuffling unit, the codec can determine the first shuffling unit's encoding length according to the first difference between the encoding length of the first shuffling unit and the encoding lengths of other first shuffling units. Shuffle type. The specific process is as follows:

Step 1: For each first shuffle unit in each first shuffle unit, determine a first difference between the code length of the first shuffle unit and the code lengths of other first shuffle units.

In implementation, after the codec determines the code length of each first shuffle unit, for each first shuffle unit, the codec can further determine the code length of the first shuffle unit and other first shuffle units. The first difference in the coding length of the unit. Example 1, as shown in Fig. 7A, four shuffling units are used as a shuffling group for shuffling, each shuffling unit contains an encoded stream as an example, the encoding length of encoded stream 1 is N+5, and the encoded stream 2 The code length of coded stream 3 is N+9, the coded length of coded stream 3 is N, the coded length of coded stream 4 is N+3, and N is a positive integer, then the first difference corresponding to coded stream 1 is {-4,5, 2}, the first difference corresponding to code stream 2 is {4, 9, 6}, the first difference corresponding to code stream 3 is {-5, -9, -3}, and the first difference corresponding to code stream 4 The value is {-2, -6, 3}.

Example two, as shown in Figure 7B, four shuffle units are used as a shuffle group for shuffling, and each shuffle unit contains one coded stream as an example. The code length of coded stream 1 is N+15, and the coded stream 2 The code length of code stream 3 is N+10, the code length of code stream 3 is N+8, the code length of code stream 4 is N, and N is a positive integer, then the first difference corresponding to code stream 1 is {5,7,15 }, the first difference corresponding to encoded stream 2 is {-5, 2, 10}, the first difference corresponding to encoded stream 3 is {-7, -2, 8}, and the first difference corresponding to encoded stream 4 Is {-15, -10, -8}.

Step 2: Determine the shuffling type of the first shuffling unit according to the first difference corresponding to the first shuffling unit.

In implementation, the first preset difference threshold may be pre-stored in the codec. The first preset difference threshold can be set by a technician based on experience. After the codec obtains the first difference value corresponding to the first shuffle unit, it can determine whether there is a target difference whose absolute value is greater than or equal to the first preset difference threshold in the first difference value corresponding to the first shuffle unit. Value, and whether the target difference is positive. If there is a target difference value in the first difference value corresponding to the first shuffling unit whose absolute value is greater than or equal to the first preset difference value threshold, and the target difference values are all positive numbers, the codec executes step 3. If there is a target difference in the first difference corresponding to the first shuffling unit whose absolute value is greater than or equal to the first preset difference threshold, and there is a negative target difference in the target difference, the codec executes the step four. If there is no target difference value whose absolute value is greater than or equal to the first preset difference value threshold in the first difference value corresponding to the first shuffling unit. Then the codec executes step 5.

Step 3: Determine that the shuffling type of the first shuffling unit is a high coding type.

In implementation, if the first difference corresponding to the first shuffling unit has a target difference whose absolute value is greater than or equal to the first preset difference threshold, and the target difference is all positive, the codec may It is determined that the shuffling type of the first shuffling unit is a high coding type (indicated by H below). For example, in the foregoing example 1, as shown in FIG. 7A, the first preset difference threshold is 7, and the shuffling type of the encoded stream 2 is H. In the foregoing example 2, as shown in FIG. 7B, the first preset If the difference threshold is set to 7, then the shuffling type of coded stream 1 and coded stream 2 is H.

Step 4: Determine that the shuffling type of the first shuffling unit is a low coding type.

In implementation, if the first difference corresponding to the first shuffling unit has a target difference whose absolute value is greater than or equal to the first preset difference threshold, and there is a negative target difference in the target difference, then edit The decoder may determine that the shuffling type of the first shuffling unit is a low coding type (hereinafter denoted by L). For example, in the foregoing example 1, as shown in FIG. 7A, the first preset difference threshold is 7, and the shuffling type of the encoded stream 3 is L. In the foregoing example 2, as shown in FIG. 7B, the first preset If the difference threshold is set to 7, then the shuffling type of coded stream 3 and coded stream 4 is L.

Step 5: Determine that the shuffling type of the first shuffling unit is a medium coding type.

In implementation, if the first difference corresponding to the first shuffling unit does not have a target difference whose absolute value is greater than or equal to the first preset difference threshold, the codec can determine the first difference of the first shuffling unit The shuffling type is the medium encoding type (denoted by M below). For example, in the foregoing example 1, as shown in FIG. 7A, the first preset difference threshold is 7, and the shuffling type of the encoded stream 1 and the encoded stream 4 is M.

Manner 2: For each first shuffling unit, the codec may determine the shuffling type of the first shuffling unit according to the second difference between the code length of the first shuffling unit and the average code length. The specific process is as follows:

Step 1: Determine the average code length according to the code length of each first shuffling unit.

In implementation, after the codec determines the coding length of each first shuffling unit, it can determine the average coding length according to the coding length of each first shuffling unit. Example 3: Taking 4 shuffling units as a shuffling group for shuffling, each shuffling unit contains a coded stream as an example, the code length of coded stream 1 is N+5, and the coded length of coded stream 2 is N+ 9. The coding length of coded stream 3 is N, the coding length of coded stream 4 is N+3, and N is a positive integer, so the average code length is N+4.25.

Example 4, shuffle with 4 shuffle units as a shuffle group, each shuffle unit contains a code stream as an example, the code length of code stream 1 is N+15, and the code length of code stream 2 is N+ 10. The code length of code stream 3 is N+8, and the code length of code stream 4 is N. N is a positive integer, and the average code length is N+8.25.

Step 2: For each first shuffle unit in each first shuffle unit, determine a second difference between the code length of the first shuffle unit and the average code length.

In implementation, after the codec determines the average code length, for each first shuffle unit, the codec may further determine the second difference between the code length of the first shuffle unit and the average code length. For example, in the above example three, the second difference corresponding to code stream 1 is 0.75, the second difference value corresponding to code stream 2 is 4.75, the second difference value corresponding to code stream 3 is -4.25, and the second difference value corresponding to code stream 4 is -4.25. The second difference is -1.25; in the above example four, the second difference corresponding to coded stream 1 is 6.75, the second difference corresponding to coded stream 2 is 1.75, and the second difference corresponding to coded stream 3 is -0.25 , The second difference corresponding to code stream 4 is -8.25.

Step 3: Determine the shuffling type of the first shuffling unit according to the second difference value corresponding to the first shuffling unit.

In implementation, the second preset difference threshold may be pre-stored in the codec. The second preset difference threshold can be set by a technician based on experience. After the codec obtains the second difference value corresponding to the first shuffle unit, it can determine whether the absolute value of the second difference value corresponding to the first shuffle unit is greater than or equal to the second preset difference value threshold, and the second difference value Whether the difference is positive. If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a positive number, the codec executes step 4. If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a negative number, the codec executes step 5. If the absolute value of the second difference corresponding to the first shuffling unit is less than the second preset difference threshold, the codec executes step 6.

Step 4: Determine that the shuffling type of the first shuffling unit is a high coding type.

In implementation, if the absolute value of the second difference value corresponding to the first shuffle unit is greater than or equal to the second preset difference value threshold, and the second difference value is positive, the codec can determine the first shuffle unit The shuffling type of the washing unit is a high coding type (namely H). For example, in the foregoing example three, the second preset difference threshold is 4, and the shuffling type of coded stream 2 is H; in the foregoing example four, the second preset difference threshold is 6, then the shuffle type of coded stream 1 The shuffling type is H.

Step 5: Determine that the shuffling type of the first shuffling unit is a low coding type.

In implementation, if the absolute value of the second difference corresponding to the first shuffle unit is greater than or equal to the second preset difference threshold, and the second difference is a negative number, the codec can determine the first shuffle The shuffling type of the unit is the low coding type (ie L). For example, in the foregoing example three, the second preset difference threshold is 4, and the shuffling type of the encoded stream 3 is L; in the foregoing example four, the second preset difference threshold is 6, then the encoding stream 4 The shuffling type is L.

Step 6, determining that the shuffling type of the first shuffling unit is a medium coding type.

In implementation, if the absolute value of the second difference value corresponding to the first shuffling unit is less than the second preset difference value threshold, the codec can determine that the shuffling type of the first shuffling unit is the medium encoding type ( That is M). For example, in the above example three, the second preset difference threshold is 4, and the shuffling type of coded stream 1 and coded stream 4 is M; in the above example four, the second preset difference threshold is 6, then The shuffling type of coded stream 2 and coded stream 3 is M.

Step 602: Determine an output shuffle unit and an input shuffle unit corresponding to each output shuffle unit in each first shuffle unit according to the shuffle type of each first shuffle unit and a preset shuffle rule.

In implementation, the codec may be pre-stored with shuffling rules. The shuffling rules can be set by technicians based on experience. After the codec obtains the shuffling type of each first shuffling unit, it can further determine the output shuffle in each first shuffling unit according to the shuffling type of each first shuffling unit and preset shuffling rules. Unit and the input shuffle unit corresponding to each output shuffle unit. Among them, the codec determines the output shuffle unit and the input shuffle corresponding to each output shuffle unit in each first shuffle unit according to the shuffle type of each first shuffle unit and preset shuffle rules. The processing of the unit is as follows:

Step 1: If the first number of the first target shuffling units of the high coding type is less than or equal to the second number of the second target shuffling units of the low coding type, the first target shuffling unit is determined as the output shuffling unit , And for each output shuffle unit, in the second target shuffle unit, at least one second target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.

In an implementation, if the first number of the first target shuffling units of the high encoding type is less than or equal to the second number of the second target shuffling units of the low encoding type, the codec may determine the first target shuffling unit It is the output shuffle unit. Then, for each output shuffle unit, the codec may determine at least one second target shuffle unit in the second target shuffle unit as the input shuffle unit corresponding to the output shuffle unit. Wherein, one second target shuffling unit may only be used as an input shuffling unit corresponding to one output shuffling unit, or may be used as an input shuffling unit corresponding to multiple output shuffling units, which is not limited in the embodiment of the present application. For example, taking 4 shuffling units as a shuffling group for shuffling, each shuffling unit contains a coded stream as an example, when the shuffle type of coded stream 1 to coded stream 4 is HMML, the codec can change Coded stream 1 is determined as the output shuffle unit, and coded stream 4 is determined as the input shuffle unit of coded stream 1. When the shuffle type of coded stream 1 to coded stream 4 is HMLL, the codec can change coded stream 1 Determine as the output shuffling unit, and determine the coded stream 3 and coded stream 4 as the input shuffle unit of the coded stream 1. When the shuffle type of the coded stream 1 to the coded stream 4 is HLLL, the codec can change the coded stream 1 is determined as the output shuffle unit, and coded stream 2, coded stream 3, and coded stream 4 are determined as the input shuffle unit of coded stream 1. When the shuffle type of coded stream 1 to coded stream 4 is HHLL, the codec The device can determine the coded stream 1 and coded stream 2 as the output shuffle unit, and the coded stream 3 as the input shuffle unit of the coded stream 1, and the coded stream 4 as the input shuffle unit of the coded stream 2. The encoder can also determine coded stream 3 and coded stream 4 as the input shuffle unit of coded stream 1, and the coded stream 3 and coded stream 4 can be determined as the input shuffle unit of coded stream 2. The codec can also determine the coded stream 3 is determined as the input shuffle unit of coded stream 1, and the sum coded stream 3 and coded stream 4 are determined as the input shuffle unit of coded stream 2.

Step 2: If the first number of the first target shuffling units of the high coding type is greater than the second number of the second target shuffling units of the low coding type, the second number of the first target shuffling units are determined as the output shuffle units. For each output shuffle unit, in the second target shuffle unit, at least one second target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.

In implementation, if the first number of the first target shuffling units of the high encoding type is greater than the second number of the second target shuffling units of the low encoding type, the codec may combine in each first target shuffling unit The second number of first target shuffle units are determined as output shuffle units. Then, for each output shuffle unit, the codec may determine at least one second target shuffle unit in the second target shuffle unit as the input shuffle unit corresponding to the output shuffle unit. Wherein, one second target shuffling unit may only be used as an input shuffling unit corresponding to one output shuffling unit, or may be used as an input shuffling unit corresponding to multiple output shuffling units, which is not limited in the embodiment of the present application. For example, taking 4 shuffling units as a shuffling group for shuffling, each shuffling unit contains a coded stream as an example, when the shuffle type of coded stream 1 to coded stream 4 is HHML, the codec can change Coded stream 2 is determined as the output shuffling unit, and coded stream 4 is determined as the input shuffling unit of coded stream 2. When the shuffle type of coded stream 1 to coded stream 4 is HHHL, the codec can change coded stream 3 It is determined as the output shuffling unit, and the coded stream 4 is determined as the input shuffling unit of the coded stream 1.

It should be noted that if the first number of first target shuffling units of high coding type is greater than the second number of second target shuffling units of low coding type, and each shuffling unit has a third target of medium coding type Shuffle unit, the codec may further determine a number of first target shuffle units other than the output shuffle unit corresponding to the second target shuffle unit (hereinafter referred to as the first output shuffle unit) A first target shuffle unit is used as an output shuffle unit (hereinafter referred to as a second output shuffle unit), and for each second output shuffle unit, the codec can determine at least in the third target shuffle unit A third target shuffle unit is used as the input shuffle unit corresponding to the second output shuffle unit. For example, taking 4 shuffling units as a shuffling group for shuffling, each shuffling unit contains a coded stream as an example, when the shuffle type of coded stream 1 to coded stream 4 is HHML, the codec can change Coded stream 2 is determined as the first output shuffle unit, and coded stream 4 is determined as the input shuffle unit of coded stream 2. At the same time, the codec can also determine coded stream 1 as the second output shuffle unit, and The coded stream 3 is determined as the input shuffling unit of the coded stream 1.

In addition, for the third target shuffle unit of the medium encoding type, for each third target shuffle unit, the codec may determine the third target shuffle unit as the output shuffle unit, and determine itself as the first shuffle unit. The input shuffle unit corresponding to the three-target shuffle unit. For example, taking 4 shuffling units as a shuffling group for shuffling, each shuffling unit contains a coded stream as an example, when the shuffle type of coded stream 1 to coded stream 4 is MMMM, the codec can change The coded stream 1 is determined as the output shuffling unit, and the coded stream 1 is determined as the input shuffling unit of the coded stream 1. The coded stream 2 to the coded stream 4 are similar to them, and will not be repeated here.

Step 504: Send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be coded in the input shuffle unit, so as to pass the input shuffle unit according to the pre-shuffled stream blocks. The assumed encoding algorithm encodes the first stream block to be encoded.

In implementation, the first preset number may be pre-stored in the codec. The first preset number can be set by a technician based on experience. After the codec determines the output shuffle unit and the input shuffle unit, the codec can send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the input shuffle unit The first to-be-coded stream block in the input shuffling unit is used to encode the first to-be-coded stream block according to a preset coding algorithm. Among them, the first preset number may be greater than or equal to the number of input shuffle units; the stream blocks to be shuffled received by each input shuffle unit may be the same or different; for each input shuffle unit, the codec The third preset number of units to be shuffled in the input shuffle unit may also be input to the queue to be coded of the input shuffle unit as the first stream block to be coded of the input shuffle unit.

Optionally, for each output shuffle unit, the second preset number of stream blocks to be shuffled in the output shuffle unit are sent to the input shuffle unit corresponding to the output shuffle unit as the input shuffle unit The first stream block to be encoded in the unit.

In implementation, the second preset number may be pre-stored in the codec. The second preset number can be set by a technician based on experience. For the case where the output shuffle unit corresponds to the input shuffle unit, for each output shuffle unit, the codec may send the second preset number of stream blocks to be shuffled in the output shuffle unit to the output shuffle unit. The input shuffling unit corresponding to the shuffling unit is used as the first stream block to be encoded in the input shuffling unit. The second preset number may be greater than or equal to the number of input shuffle units corresponding to the output shuffle unit, and the number of stream blocks to be shuffled received by each input shuffle unit may be the same or different. In this way, it can be ensured that the code lengths of each shuffling unit are similar. For example, as shown in Figure 8A, four shuffling units are used as a shuffling group for shuffling, and each shuffling unit contains one coded stream as an example. The shuffle type of coded stream 1 to coded stream 4 is MHLM, then Coded stream 2 is the output shuffling unit, and coded stream 3 is the input shuffling unit of coded stream 2, then coded stream 1 can output 1 block to be shuffled to coded stream 1, and coded stream 2 can output 1 to coded stream 3. A stream block to be shuffled, and the encoded stream 4 can output one stream block to be shuffled to the encoded stream 4. Thus, as shown in Figure 9A, after the shuffling is completed, the encoding length of encoded stream 1 is N+8, the encoding length of encoded stream 2 is N+9, the encoding length of encoded stream 3 is N+3, and the encoding of encoded stream 4 is The length is N+6, and the shuffling type of code stream 1 to code stream 4 is MMMM. As another example, as shown in Fig. 8B, four shuffle units are used as a shuffle group for shuffling, and each shuffle unit contains an encoded stream as an example. The shuffle type of encoded stream 1 to encoded stream 4 is HHLL, Then coded stream 1 and coded stream 2 are output shuffle units, coded stream 3 and coded stream 4 are the input shuffle units of coded stream 1, and coded stream 4 is the input shuffle unit of coded stream 2, then coded stream 1 can be separately One stream block to be shuffled is output to the coded stream 3 and the coded stream 4, and the coded stream 2 can output two stream blocks to be shuffled to the coded stream 4. Thus, as shown in Figure 9B, after the shuffling is completed, the encoding length of encoded stream 1 is N+15, the encoding length of encoded stream 2 is N+10, the encoding length of encoded stream 3 is N+11, and the encoding of encoded stream 4 is The length is N+9, and the shuffling type of coded stream 1 to coded stream 4 is MMMM.

As an optional implementation manner, the codec may determine at least one second shuffling group corresponding to the data block to be encoded according to the second shuffling level. Wherein, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one coded stream. Then, the codec may re-shuffle the stream blocks to be coded in each second shuffling unit as the stream blocks to be shuffled, until the coding length of each second shuffling unit meets the preset proximity condition.

In implementation, after the codec shuffles the encoded stream corresponding to the data block to be encoded according to the first shuffling level, the codec may further determine at least one second corresponding to the data block to be encoded according to the second shuffling level. Shuffle group. Wherein, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one coded stream. According to the second shuffling level, the codec determines at least one second shuffling group corresponding to the data block to be encoded. The processing procedure is similar to step 501, and will not be repeated here. Then, the codec may re-shuffle the stream blocks to be coded in each second shuffling unit as the stream blocks to be shuffled, until the coding length of each second shuffling unit meets the preset proximity condition.

It should be noted that after the codec shuffles the coded stream corresponding to the data block to be coded according to the second shuffling level, it may further shuffle the coded stream corresponding to the data block to be coded according to the third shuffling level. For example, the codec can shuffle the encoded stream corresponding to the data block to be coded according to shuffle level 1-shuffle level 2-shuffle level 3, or according to shuffle level 1-shuffle level 3-shuffle level 2 The coded stream corresponding to the data block to be coded is shuffled, and the coded stream corresponding to the data block to be coded can also be shuffled according to shuffle level 2-shuffle level 3-shuffle level 1.

As an optional implementation manner, when the codec detects that the encoding of the first encoded stream in the multiple encoded streams is completed, the third preset number of the unencoded second encoded streams in the multiple encoded streams The stream block to be coded is sent to the first coded stream as the stream block to be coded in the first coded stream.

In the implementation, in order to further balance the encoding length of each encoded stream, the encoding rate when encoding small data blocks is increased. A third preset number may be pre-stored in the codec. The third preset number can be set by a technician based on experience. When the codec detects that the encoding of the first encoded stream of the multiple encoded streams is completed (that is, the first encoded stream outputs the end of the encoded stream (StreamFinish) mark), it can encode the uncompleted second encoding of the multiple encoded streams The third preset number of stream blocks to be coded in the stream are sent to the first coded stream as the stream blocks to be coded in the first coded stream. Wherein, the second coded stream may be all uncoded coded streams among the multiple coded streams, or may be part of the uncoded coded streams of the multiple coded streams.

As an optional implementation manner, the process of encoding the first stream block to be encoded by the codec through the input shuffling unit according to a preset encoding algorithm is as follows:

Step 1: According to the first encoding rule corresponding to the preset characters, the preset characters included in the first stream block to be encoded are encoded to obtain the first encoded data.

In implementation, the first encoding rule corresponding to the preset character may be pre-stored in the codec. The first encoding rule corresponding to the preset character can be set by a technician based on experience. The codec may encode the preset characters contained in the first stream block to be encoded according to the first encoding rule corresponding to the preset characters to obtain the first encoded data. Among them, due to the sparse nature of neural network data, technicians can set several consecutive all-zero characters as preset characters. Table 1 shows the preset characters, as shown in Table 1:

Table I

名称name	描述description
StreamFinishStreamFinish	编码流结束的标志Mark the end of the encoded stream
SingleZeroSingleZero	单个全0数据Single all 0 data
DoubleZeroDoubleZero	连续两个全0数据Two consecutive all 0 data
TripleZeroTripleZero	连续三个全0数据Three consecutive all 0 data
QuadZeroQuadZero	连续四个全0数据Four consecutive all 0 data
LiteralsLiterals	其它8bit字符的编码Encoding of other 8bit characters

Step 2: Encode the first encoded data according to a preset second encoding rule.

In implementation, the second encoding rule may be pre-stored in the codec. The second encoding rule may be a prefix code encoding algorithm or other encoding algorithms, which is not limited in the embodiment of the present application. After the codec obtains the first encoded data, it can perform a step to encode the first encoded data according to the preset second encoding rule.

As an optional implementation manner, the codec encodes the data block to be encoded, and after obtaining the encoded data block, it may generate an encoding header block of the encoded data block corresponding to each data block to be encoded. Wherein, the encoding header block contains the storage address of the encoded data block corresponding to the encoding header block. Then, the codec can store each coded header block, and store each coded data block after each coded header block.

In implementation, for the encoded data block corresponding to the data block to be encoded, as shown in FIG. 10, the codec uses a header-data block mapping form for storage. The mapping form is divided into two parts, namely a header part and a data block part. The start address of the encoding header is the head address; the space occupied by the encoding header is the total number of encoding headers (head total number) the size of encoding header blocks, and the total number of encoding headers can be greater than or equal to the effective encoding The number of header blocks. Among them, the size of each encoding header block is 16 bytes, and each encoding header block stores information such as the starting address and actual size of the encoded data block corresponding to the encoding header block, and each encoding header block is stored in the storage device. In continuous storage. The coded data block is stored next to the end address of the coded header. Each coded data block part contains several coded data blocks, and each coded data block has a one-to-one correspondence with the h coding header block. Among them, the storage format of the coded data block is divided into two types: a packing format and an unpacking format.

Optionally, for the packing format, the encoded data block is composed of encoded data, and the size of the encoded data is equal to the encoded size of the data to be encoded in the data block to be encoded.

In the implementation, as shown in FIG. 10, in the packed format, the coded data blocks are tightly stored, and each coded data block is composed of coded data, and the size of the coded data is equal to the size of the coded data in the data block to be coded. That is, the space occupied by the encoded data block is the actual size of the data block to be encoded after encoding.

Optionally, for the non-packed format, the coded data block consists of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the data block to be coded.

In the implementation, as shown in FIG. 10, in the unpacked format, each coded data block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the data block to be coded. That is, each coded data block occupies the same space and is equal to the size of a complete data block to be coded before coding. Among them, the former part is encoded data, and the latter part is reserved padding data.

As an optional implementation manner, the coded data block is composed of coded data sub-blocks corresponding to multiple source data sub-blocks belonging to the same source data block. In the packed format, the coded data sub-block is composed of coded data, and the size of the coded data is equal to the coded size of the data to be coded in the source data sub-block. In the unpacked format, the coded data sub-block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the source data sub-block.

In implementation, when the codec determines multiple coding regions in the source data according to different coding instructions, it may divide a complete source data block into multiple source data sub-blocks. Among them, the encoding area corresponding to each encoding instruction is on the adjacent side, and either all encode complete source data blocks, and the source data blocks do not overlap each other; or each encode a part of the same source data block (that is, the source data Sub-block), and the boundary of each source data sub-block within the source data block exactly overlaps. As shown in Figure 11, the four coding regions determined by the four coding instructions in the source data divide a part of the source data block (represented by gray diagonal squares) into multiple source data sub-blocks, each of the same source data block The boundaries of the source data sub-blocks exactly overlap. The codec encodes each source data sub-block in the same source data block according to different coding instructions to obtain the coded data sub-block. When the codec stores the coded data sub-blocks corresponding to multiple source data sub-blocks in the same source data block, the coded data sub-blocks may be stored in the same coded data block. In this way, multiple coding instructions can be realized to complete the splicing of specific coding regions. The effect is exactly the same as that of coding through one coding command, and the execution order of these coding commands can be executed arbitrarily or even concurrently, so that in the multi-core source data division and single When the core is divided into blocks for pipeline execution, the coding task can be divided.

As shown in Figure 12A, a source data block is divided into two parts in both low and high dimensions, so that the source data block is divided into 4 source data sub-blocks, namely TL (top-left), TR (top-right), BL (bottom-left) and BR (bottom-right). Among them, the size of each source data sub-block is shown in Figure 12A. The codec can be specified by the four parameters of block left, block right, block top, and block bottom in the source data block. Each source data sub-block can be encoded data or non-encoded data. In the coded data block in the unpacked format, the 4 source data sub-blocks corresponding to the 4 coded data sub-blocks can be stored in a fixed order of TL-TR-BL-BR, and each coded data sub-block is filled with coded data and Data composition, the sum of the size of the encoded data and the size of the padding data is equal to the size of the source data sub-block. That is, the space occupied by each coded data sub-block is the size of the source data sub-block corresponding to the coded data sub-block before coding. In this way, the space of the coded data block is the same as the size of the source data block, thus ensuring that if each source data sub-block of the source data block is coded by a different coding instruction, each coding instruction can be divided according to the information (can be Calculate the address of the sub-block of encoded data in charge by calculating the instruction domain, so as to realize the splicing of the results of multiple encoding instructions.

As shown in FIG. 12A, the codec can convert the coded data block in the non-packed format into the coded data block in the packed format by means such as a code move (Move). In the coded data block in the packed format, each coded data sub-block is composed of coded data, and the size of the coded data is equal to the coded size of the data to be coded in the source data sub-block. Among them, the coded data sub-blocks are tightly stored, and the starting address of each coded data sub-block needs to be accumulated according to the actual size of the previous coded data sub-blocks. The space occupied by the entire coded data block is all the coded data sub-blocks. The sum of the sizes.

As shown in FIG. 12B, a source data block is divided into two parts in a high dimension, so that the source data block is divided into two source data sub-blocks, namely TL and BL, or BL and BR. As shown in FIG. 12C, a source data block is divided into two parts in a low dimension, so that the source data block is divided into two source data sub-blocks, namely TL and TR, or TR and BR.

A source data block is not divided into low-dimensional and high-dimensional. There is only one source data sub-block, and the source data sub-block can be TL, TR, BL, or BR. As shown in Figure 12D, one source data block has only one source data sub-block TL.

In order to support the splicing of different coded regions, the format of the code header corresponding to the coded data block containing multiple coded data sub-blocks is shown in Table 2.

Table II

As an optional implementation manner, if the total coding length of the stream blocks to be coded in each first shuffling group is greater than the original length of the data blocks to be coded, then the coding process of the data blocks to be coded is terminated.

In implementation, in order to ensure that the encoded data block can be stored in a non-packed format, it is necessary to ensure that the size of the encoded data block cannot exceed the size of the data block to be encoded. When the codec performs shuffling processing on the data block to be encoded, if it detects that the total encoding length of the stream block to be encoded in each first shuffling group is greater than the original length of the data block to be encoded, the encoding process of the data block to be encoded is terminated. Then the codec can resend the request to read the data block to be encoded, and the read data block to be encoded does not need to be encoded and stored directly. Optionally, the codec may also terminate the encoding process of the data block to be encoded if it detects that the encoding length output by the encoding process is greater than the size of the data block to be encoded when encoding the data block to be encoded.

The embodiment of the present application provides a shuffling method. The codec determines at least one first shuffling group corresponding to the data block to be encoded according to the first shuffling level. Wherein, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one coded stream. Then, the codec determines the encoding length of each first shuffling unit, and according to the encoding length of each first shuffling unit, in each first shuffling unit, determines the output shuffling unit and the input shuffling unit. After that, the codec sends the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream block to be coded in the input shuffle unit to pass the input shuffle unit The first stream block to be encoded is encoded according to a preset encoding algorithm. In this way, by shuffling each coded stream of the data block to be coded, it is possible to ensure that the coded lengths of the coded streams are similar, thereby avoiding excessive complements due to alignment requirements between the coded streams, thereby reducing the coding rate. At the same time, it can also avoid the deadlock situation between each coded stream.

The embodiment of the present application also provides a shuffling method, which is applied to the decoding process. As shown in Figure 13, the specific steps are as follows:

Step 1301: Determine at least one first shuffling group corresponding to the data block to be decoded according to the first shuffling level. Wherein, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one decoded stream.

Optionally, according to the first shuffling level, the codec determines at least one first shuffling group corresponding to the data block to be decoded as follows: the codec obtains multiple decoding streams corresponding to the data block to be decoded, and according to the first shuffling level, the codec obtains multiple decoding streams corresponding to the data block to be decoded. A shuffling level, dividing the multiple decoded streams into multiple first shuffling units, and dividing the multiple first shuffling units into at least one first shuffling group. Wherein, the first shuffle unit includes at least one decoded stream, and the first shuffle group includes a plurality of first shuffle units.

The processing procedure of step 1301 is similar to the processing procedure of step 501, and will not be repeated here.

Step 1302: Determine the code length of each first shuffling unit.

Optionally, for each first shuffle unit in each first shuffle group, the codec determines the total code length of the stream block to be decoded in the decoded stream contained in the first shuffle unit as the The code length of the first shuffling unit. For the case that the shuffling process and the decoding process are performed simultaneously, the codec may also determine the total code length of the stream block to be decoded and the decoded stream block in the decoded stream contained in the first shuffling unit as the first shuffling The encoding length of the unit.

The processing procedure of step 1302 is similar to the processing procedure of step 502, and will not be repeated here.

Step 1303: Determine an output shuffle unit and an input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit.

The processing procedure of step 1303 is similar to the processing procedure of step 503, and will not be repeated here.

Optionally, as shown in Figure 14, the codec determines the output shuffling unit and the input shuffling unit in each first shuffling unit according to the coding length of each first shuffling unit as follows:

Step 1401: Determine the shuffling type of each first shuffling unit according to the code length of each first shuffling unit. Among them, the codec can determine the shuffling type of each first shuffling unit in various ways according to the encoding length of each first shuffling unit. The embodiment of the present application provides two feasible ways, which are specifically as follows :

Example 5, as shown in Figure 15, shuffle with 4 shuffle units as a shuffle group, each shuffle unit contains a decoded stream as an example, the code length of decoded stream 1 is N+5, and decoded stream 2 The encoding length of decoded stream 3 is N+9, the encoding length of decoded stream 3 is N, the encoding length of decoded stream 4 is N+3, and N is a positive integer, then the first difference corresponding to decoded stream 1 is {-4, 5, 2}, the first difference corresponding to decoded stream 2 is {4, 9, 6}, the first difference corresponding to decoded stream 3 is {-5, -9, -3}, the first difference corresponding to decoded stream 4 The value is {-2, -6, 3}.

Step 3: If there is a target difference value in the first difference value corresponding to the first shuffle unit whose absolute value is greater than or equal to the first preset difference value threshold, and the target difference values are all positive numbers, then the first difference value is determined The shuffling type of the washing unit is a high coding type.

For example, in the fifth example above, as shown in FIG. 15, the first preset difference threshold is 7, and the shuffling type of the decoded stream 2 is H.

Step 4: If there is a target difference in the first difference corresponding to the first shuffle unit whose absolute value is greater than or equal to the first preset difference threshold, and there is a negative target difference in the target difference, then determine the The shuffling type of the first shuffling unit is a low coding type.

For example, in the fifth example above, as shown in FIG. 15, the first preset difference threshold is 7, and the shuffling type of the decoded stream 3 is L.

Step 5. If there is no target difference with an absolute value greater than or equal to the first preset difference threshold in the first difference corresponding to the first shuffle unit, determine that the shuffle type of the first shuffle unit is medium Encoding type.

For example, in the fifth example above, as shown in FIG. 15, the first preset difference threshold is 7, and the shuffling type of the decoded stream 1 and the decoded stream 4 is M.

Step 4: If the absolute value of the second difference corresponding to the first shuffle unit is greater than or equal to the second preset difference threshold, and the second difference is a positive number, then determine the shuffle of the first shuffle unit The type is a high encoding type.

Step 5. If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a negative number, determine the shuffling type of the first shuffling unit It is a low encoding type.

Step 6. If the absolute value of the second difference value corresponding to the first shuffling unit is smaller than the second preset difference value threshold, it is determined that the shuffling type of the first shuffling unit is a medium coding type.

The processing procedure of step 1401 is similar to the processing procedure of step 601, and will not be repeated here.

Step 1402: Determine an output shuffle unit and an input shuffle unit corresponding to each output shuffle unit in each first shuffle unit according to the shuffle type of each first shuffle unit and preset shuffle rules.

Optionally, the codec determines the output shuffle unit and the input corresponding to each output shuffle unit in each first shuffle unit according to the shuffle type of each first shuffle unit and preset shuffle rules. The processing process of the shuffling unit is as follows:

Step 1: If the first number of the first target shuffling units of the high decoding type is greater than the second number of the second target shuffling units of the low decoding type, the second target shuffling unit is determined as the output shuffling unit, and For each output shuffle unit, in the first target shuffle unit, at least one first target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.

Step 2: If the first number of the first target shuffling units of the high decoding type is less than or equal to the second number of the second target shuffling units of the low decoding type, the first number of second target shuffling units are determined as Output shuffle units, and for each output shuffle unit, in the first target shuffle unit, at least one first target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.

The processing procedure of step 1402 is similar to the processing procedure of step 602, and will not be repeated here.

Step 1304: Send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be decoded in the input shuffle unit, so as to pass the input shuffle unit according to the pre-shuffled stream blocks. Suppose the decoding algorithm decodes the first stream block to be decoded.

Optionally, for each output shuffle unit, the second preset number of stream blocks to be shuffled in the output shuffle unit are sent to the input shuffle unit corresponding to the output shuffle unit as the input shuffle unit The first stream block to be decoded in the unit.

For example, as shown in Figure 16, four shuffle units are used as a shuffle group for shuffling, and each shuffle unit contains a decoded stream as an example. The shuffle type of decoded stream 1 to decoded stream 4 is MHLM, then Decoding stream 3 is the output shuffling unit, and decoding stream 2 is the input shuffling unit of decoded stream 3. Then decoded stream 1 can output 1 block to be shuffled to decoded stream 1, and decoded stream 3 can output 1 to decoded stream 2. The decoding stream 4 can output one stream block to be shuffled to the decoding stream 4. Thus, as shown in Figure 17, after the shuffling is completed, the encoding length of decoded stream 1 is N+8, the encoding length of decoded stream 2 is N+9, the encoding length of decoded stream 3 is N+3, and the encoding of decoded stream 4 is N+3. The length is N+6, and the shuffling type from decoded stream 1 to decoded stream 4 is MMMM.

The processing procedure of step 1304 is similar to the processing procedure of step 504, and will not be repeated here.

As an optional implementation manner, the codec determines at least one second shuffling group corresponding to the data block to be decoded according to the second shuffling level. Wherein, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one decoded stream. Then, the codec re-shuffles the stream blocks to be decoded in each second shuffle unit as the stream blocks to be shuffled, until the code length of each second shuffle unit meets the preset proximity condition.

In implementation, after the codec shuffles the decoded stream corresponding to the data block to be decoded according to the first shuffling level, the codec may further determine at least one second corresponding to the data block to be decoded according to the second shuffling level. Shuffle group. Wherein, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one decoded stream. The process of the codec determining at least one second shuffling group corresponding to the data block to be decoded according to the second shuffling level is similar to step 1301, and will not be repeated here. Then, the codec may re-shuffle the stream blocks to be decoded in each second shuffle unit as the stream blocks to be shuffled, until the code length of each second shuffle unit meets the preset proximity condition.

It should be noted that after the codec shuffles the decoded stream corresponding to the data block to be decoded according to the second shuffling level, it may further shuffle the decoded stream corresponding to the data block to be decoded according to the third shuffling level. For example, the codec can shuffle the decoded stream corresponding to the data block to be decoded according to shuffle level 1-shuffle level 2-shuffle level 3, or according to shuffle level 1-shuffle level 3-shuffle level 2 The decoded stream corresponding to the data block to be decoded is shuffled, and the decoded stream corresponding to the data block to be decoded can also be shuffled according to the shuffling level 2-shuffling level 3-shuffling level 1.

As an optional implementation manner, when the codec detects that the decoding of the first decoded stream among the multiple decoded streams is completed, the second preset number of undecoded second decoded streams among the multiple decoded streams The stream block to be decoded is sent to the first decoded stream as the stream block to be decoded in the first decoded stream.

In implementation, in order to further balance the encoding length of each decoded stream, the decoding rate when decoding small data blocks is improved. The third preset number may be pre-stored in the codec. The third preset number can be set by a technician based on experience. When the codec detects that the decoding of the first decoded stream in the multiple decoded streams is completed (that is, the first decoded stream outputs the decoded stream end (StreamFinish) mark), it can decode the uncompleted second decoded in the multiple decoded streams The third preset number of stream blocks to be decoded in the stream are sent to the first decoded stream as the stream blocks to be decoded in the first decoded stream. Wherein, the second decoded stream may be all undecoded decoded streams of the multiple decoded streams, or may be part of the undecoded decoded streams of the multiple decoded streams.

As an optional implementation manner, the processing procedure for the codec to obtain the decoded stream is as follows:

Step 1: Obtain the encoding header data corresponding to the data to be decoded.

In the implementation, for the coded data block, as shown in FIG. 10, the codec uses a header-data block mapping form for storage. When the codec needs to obtain the data to be decoded, the codec needs to first obtain the encoding header data corresponding to the data to be decoded. As shown in Figure 18, the encoding header data format is a two-dimensional format, the low dimension is X, the high dimension Y, and the size of the encoding header data is the low dimension encoding header size (head size X) * high dimension encoding header size (head size Y) ). The encoding header data can be further divided into a plurality of encoding header blocks evenly in two dimensions.

Step 2: According to the received decoding instruction, in the encoding header data, a decoding area containing at least one encoding header block corresponding to the decoding instruction is determined, and at least one to-be-decoded data block corresponding to the at least one encoding header block is obtained. Wherein, the encoding header block contains the storage address of the encoded data block corresponding to the encoding header block.

In implementation, after the codec obtains the coded header data, it can determine the decoding area containing at least one coded header block corresponding to the decoded instruction in the coded header data according to the received decoding instruction. As shown in FIG. 18, the start address of the decoding area is the head start position of the encoding head, which can be obtained by the low-dimensional encoding head offset (head offset X) and the high-dimensional encoding head offset (head offset Y). The decoding area includes the number of low-dimensional encoding headers (head number X) encoding header blocks in the low-dimensional direction, and the number of high-dimensional encoding headers (head number Y) encoding header blocks in the high-dimensional direction. Wherein, the encoding header block contains the storage address of the encoded data block corresponding to the encoding header block. After the codec obtains the decoding area, for each code header block in the decoding area, the codec can obtain the data block to be decoded according to the storage address of the coded data block stored in the code header block.

Step 3: For each data block to be decoded in at least one data block to be decoded, the data block to be decoded is divided into multiple stream blocks, and the multiple stream blocks are sent to multiple decodes corresponding to the data block to be decoded Stream, as a stream block to be shuffled in multiple decoded streams.

In implementation, in order to improve the decoding throughput, the codec can decode the same data block to be decoded in parallel through multiple decoding streams. Similarly, when the codec shuffles, for each data block to be decoded, the codec can divide the data block to be decoded into multiple stream blocks, and send the multiple stream blocks to the data block to be decoded The corresponding multiple decoded streams are used as stream blocks to be shuffled in the multiple decoded streams. Optionally, the codec may divide the data block to be decoded into multiple row sequences, and each row sequence contains at least one data sub-block to be decoded. Then, for each sub-block of data to be decoded in each row sequence, the codec may divide the sub-block of data to be decoded into multiple stream blocks. In this way, it can be ensured that the number of stream blocks in each decoded stream is close.

Optionally, in the packed format, the data block to be decoded is composed of encoded data, and the size of the encoded data is equal to the encoded size of the data to be encoded in the data block to be encoded.

In the implementation, as shown in FIG. 10, in the packed format, the decoded data blocks are tightly stored, and each decoded data block is composed of encoded data, and the size of the encoded data is equal to the encoded size of the data to be encoded in the data block to be encoded. That is, the space occupied by the decoded data block is the actual size of the data block to be encoded after encoding.

Optionally, in the non-packed format, the data block to be decoded is composed of encoded data and padding data, and the sum of the size of the encoded data and the size of the padding data is equal to the size of the data block to be encoded.

In the implementation, as shown in FIG. 10, in the non-packed format, each decoded data block is composed of encoded data and padding data, and the sum of the size of the encoded data and the size of the padding data is equal to the size of the data block to be encoded. That is, each decoded data block occupies the same space and is equal to the size of a complete data block to be encoded before encoding. Among them, the former part is encoded data, and the latter part is reserved padding data.

Optionally, the data block to be decoded is composed of encoded data sub-blocks corresponding to multiple source data sub-blocks belonging to the same source data block. In the packed format, the coded data sub-block is composed of coded data, and the size of the coded data is equal to the coded size of the data to be coded in the source data sub-block. In the unpacked format, the coded data sub-block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the source data sub-block.

Optionally, the data partition during decoding may be different from that during encoding. When the data partition of the decoding instruction is not aligned with the partition of the encoded data block, there will be a boundary data block during encoding. For the boundary data block, if it has only TL Part, then if this part is the unencoded source data form, then you can read only the required part, if it is the encoded encoded data form, then you need to decompress the entire encoded data block, and only write the required part to Destination address. If the boundary data block itself contains four parts and is different from the division during encoding, then there will be another division of the 4 encoded data sub-blocks. As shown in Figure 19, the solid-line frame represents the data division during encoding, and the dashed frame represents the data division during decoding. Their division points are different, so that the data block to be decoded during decoding may be an encoded data block. A part, such as the TL block represented by the left-slashed square, may also be formed by concatenating parts of up to 4 sub-data blocks, such as the BR block represented by the vertical square.

There are four cases of this division as shown in Figure 20, which correspond to the different positional relationship between the intersection of the decoding division and the intersection of the encoding division. Considering that in each case, 4 different data blocks need to be taken when decoding ( TL, TR, BL, BR), there are a total of 16 different data blocks when decoding. Only the most general case is considered here, and the case where other divisions are less than 4 blocks or the divisions during encoding and decoding are aligned can be regarded as special cases of these 4 types of cases.

The embodiment of the present application provides a shuffling method. The codec determines at least one first shuffling group corresponding to the data block to be decoded according to the first shuffling level. Wherein, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one decoded stream. Then, the codec determines the encoding length of each first shuffling unit, and according to the encoding length of each first shuffling unit, in each first shuffling unit, determines the output shuffling unit and the input shuffling unit. After that, the codec sends the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream block to be decoded in the input shuffle unit to pass the input shuffle unit The first stream block to be decoded is decoded according to a preset decoding algorithm. In this way, by shuffling the decoded streams of the data block to be decoded, it is possible to ensure that the encoding lengths of the decoded streams are similar, so as to avoid excessive complements due to alignment requirements between the decoded streams, thereby reducing the decoded stream. At the same time, it can also avoid deadlocks between each decoded stream.

The embodiment of the present application also provides a shuffling device. As shown in FIG. 21, the device includes:

The first determining module 2110 is configured to determine at least one first shuffle group corresponding to the data block to be encoded according to the first shuffle level, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes At least one coded stream;

The second determining module 2120 is configured to determine the code length of each first shuffling unit;

The third determining module 2130 is configured to determine the output shuffle unit and the input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit;

The sending module 2140 is used to send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream block to be coded in the input shuffle unit to pass the input shuffle The unit encodes the first stream block to be encoded according to a preset encoding algorithm.

The embodiment of the present application also provides a shuffling device. As shown in FIG. 22, the device includes:

The first determining module 2210 is configured to determine at least one first shuffle group corresponding to the data block to be decoded according to the first shuffle level, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes At least one decoded stream;

The second determining module 2220 is configured to determine the code length of each first shuffling unit;

The third determining module 2230 is configured to determine the output shuffle unit and the input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit;

The sending module 2240 is used to send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream block to be decoded in the input shuffle unit to pass the input shuffle The unit decodes the first stream block to be decoded according to a preset decoding algorithm.

In one embodiment, a computer device is provided, as shown in FIG. 23, including a memory and a processor, the memory stores a computer program that can run on the processor, and the processor executes the computer program When realizing the above-mentioned shuffling method steps.

In one embodiment, a computer-readable storage medium has a computer program stored thereon, and when the computer program is executed by a processor, the steps of the above-mentioned shuffling method are realized.

In one embodiment, a chip system includes a processor, the processor is coupled to a memory, the memory stores program instructions, and the above shuffling is implemented when the program instructions stored in the memory are executed by the processor method.

It should be noted that for the foregoing method embodiments, for the sake of simple description, they are all expressed as a series of action combinations, but those skilled in the art should know that the present disclosure is not limited by the described sequence of actions. Because according to this disclosure, certain steps can be performed in other order or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all optional embodiments, and the involved actions and modules are not necessarily required by the disclosure.

It should be further noted that although the steps in the flowcharts of FIGS. 2-4 are displayed in sequence as indicated by the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, there is no strict order for the execution of these steps, and these steps can be executed in other orders. Moreover, at least some of the steps in Figures 2-4 may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. These sub-steps or stages The execution order of is not necessarily performed sequentially, but may be performed alternately or alternately with at least a part of other steps or sub-steps or stages of other steps.

It should be understood that the above device embodiments are only illustrative, and the device of the present disclosure may also be implemented in other ways. For example, the division of units/modules in the above-mentioned embodiments is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units, modules or components may be combined or integrated into another system, or some features may be omitted or not implemented.

In addition, unless otherwise specified, the functional units/modules in the various embodiments of the present disclosure may be integrated into one unit/module, or each unit/module may exist alone physically, or two or more units/modules may exist. The modules are integrated together. The above-mentioned integrated unit/module can be implemented in the form of hardware or software program module.

If the integrated unit/module is implemented in the form of hardware, the hardware may be a digital circuit, an analog circuit, and so on. The physical realization of the hardware structure includes but is not limited to transistors, memristors and so on. Unless otherwise specified, the artificial intelligence processor may be any appropriate hardware processor, such as CPU, GPU, FPGA, DSP, ASIC, and so on. Unless otherwise specified, the storage unit may be any suitable magnetic storage medium or magneto-optical storage medium, such as RRAM (Resistive Random Access Memory), DRAM (Dynamic Random Access Memory), Static random access memory SRAM (Static Random-Access Memory), enhanced dynamic random access memory EDRAM (Enhanced Dynamic Random Access Memory), high-bandwidth memory HBM (High-Bandwidth Memory), hybrid storage cube HMC (Hybrid Memory Cube), etc. Wait.

If the integrated unit/module is implemented in the form of a software program module and sold or used as an independent product, it can be stored in a computer readable memory. Based on this understanding, the technical solution of the present disclosure essentially or the part that contributes to the existing technology or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a memory. It contains a number of instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present disclosure. The aforementioned memory includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, magnetic disk or optical disk and other media that can store program codes.

In the above-mentioned embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in an embodiment, reference may be made to related descriptions of other embodiments. The technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the various technical features in the above-mentioned embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should all be combined. It is considered as the range described in this specification.

The foregoing can be better understood according to the following clauses:

Clause A1, corresponding right 1; clause A2, corresponding right 2; clause A3, corresponding right 3; clause A4, corresponding right 4; clause A5, corresponding right 5; clause A6, corresponding right 6; clause A7, corresponding right 7; clause A8, corresponding right 8; clause A9, corresponding right 9; clause A10, corresponding right 10; clause A11, corresponding right 11; clause A12, corresponding right 12; clause A13, corresponding right 13; clause A14, corresponding right 14; clause A15 , Correspondence Rights 15; Clause A16, Correspondence Rights 16; Clause A17, Correspondence Rights 17; Clauses A18, Correspondence Rights 18; Clauses A19, Correspondence Rights 19; Clauses A20, Correspondence Rights 20; Correspondence Rights 22; Clause A23, Correspondence Rights 23; Clauses A24, Correspondence Rights 24; Clauses A25, Correspondence Rights 25; Clauses A26, Correspondence Rights 26; Clauses A27, Correspondence Rights 27; Clauses A28, Correspondence Rights 28; Right 29; Article A30, Corresponding Right 30; Article A31, Corresponding Right 31; Article A32, Corresponding Right 32; Article A33, Corresponding Right 33; Article A34, Corresponding Right 34; Article A35, Corresponding Right 35; Article A36, Corresponding Right 36; Article A37, corresponding right 37; Article A38, corresponding right 38; Article A39, corresponding right 39; Article A40, corresponding right 40; Article A41, corresponding right 41; Article A42, corresponding right 42; Article A43, corresponding right 43 .

For example, clause A1, a shuffling method, the method includes:

Determine the code length of each first shuffling unit;

Clause A2, the method according to clause A1, the determining at least one first shuffling group corresponding to the data block to be encoded according to the first shuffling level includes:

Acquiring multiple coded streams corresponding to the data block to be coded;

According to the first shuffling level, the multiple encoded streams are divided into multiple first shuffling units, and the multiple first shuffling units are divided into at least one first shuffling group. The shuffling unit includes at least one coded stream, and the first shuffling group includes a plurality of first shuffling units.

Clause A3. According to the method of clause A1, the determining the coding length of each first shuffling unit includes:

For each first shuffle unit in each first shuffle group, determine the total code length of the stream block to be coded in the coded stream contained in the first shuffle unit as the code of the first shuffle unit length.

Clause A4. The method according to clause A1, wherein determining an output shuffling unit and an input shuffling unit in each of the first shuffling units according to the coding length of each of the first shuffling units includes:

Determine the shuffling type of each first shuffling unit according to the code length of each first shuffling unit;

According to the shuffling type of each first shuffling unit and preset shuffling rules, in each of the first shuffling units, an output shuffling unit and an input shuffling unit corresponding to each output shuffling unit are determined ；

The sending the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be coded in the input shuffle unit includes:

For each output shuffle unit, the second preset number of stream blocks to be shuffled in the output shuffle unit are sent to the input shuffle unit corresponding to the output shuffle unit as the first in the input shuffle unit. A stream block to be encoded.

Clause A5. The method according to clause A4, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit includes:

For each first shuffling unit in each of the first shuffling units, determine a first difference between the code length of the first shuffling unit and the code lengths of other first shuffling units;

The shuffling type of the first shuffling unit is determined according to the first difference corresponding to the first shuffling unit.

Clause A6. The method according to clause A5, wherein the determining the shuffling type of the first shuffling unit according to the first difference corresponding to the first shuffling unit includes:

If there is a target difference in the first difference corresponding to the first shuffling unit whose absolute value is greater than or equal to the first preset difference threshold, and the target difference is all positive, then the first shuffle is determined The shuffling type of the unit is a high coding type;

If there is a target difference in the first difference corresponding to the first shuffle unit whose absolute value is greater than or equal to the first preset difference threshold, and there is a negative target difference in the target difference, then the first difference is determined The shuffling type of a shuffling unit is a low coding type.

Clause A7. The method according to clause A6, the method further comprising:

If the first difference corresponding to the first shuffling unit does not have a target difference with an absolute value greater than or equal to the first preset difference threshold, it is determined that the shuffling type of the first shuffling unit is a medium coding type.

Clause A8. The method according to clause A4, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit includes:

Determine an average code length according to the code length of each first shuffling unit;

For each first shuffling unit in each of the first shuffling units, determine a second difference between the code length of the first shuffling unit and the average code length;

The shuffling type of the first shuffling unit is determined according to the second difference value corresponding to the first shuffling unit.

Clause A9. The method according to clause A8, wherein the determining the shuffling type of the first shuffling unit according to the second difference value corresponding to the first shuffling unit includes:

If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a positive number, then the shuffling type of the first shuffling unit is determined High coding type;

If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a negative number, it is determined that the shuffling type of the first shuffling unit is Low encoding type.

Clause A10. The method according to clause A9, the method further comprising:

If the absolute value of the second difference value corresponding to the first shuffling unit is smaller than the second preset difference value threshold, it is determined that the shuffling type of the first shuffling unit is a medium coding type.

Clause A11. The method according to clause A4, wherein according to the shuffling type of each first shuffling unit and a preset shuffling rule, in each first shuffling unit, an output shuffling unit is determined And the input shuffle unit corresponding to each output shuffle unit, including:

If the first number of the first target shuffle unit of the high coding type is less than or equal to the second number of the second target shuffle unit of the low coding type, the first target shuffle unit is determined as the output shuffle unit, and the For each output shuffle unit, in the second target shuffle unit, determine at least one second target shuffle unit as the input shuffle unit corresponding to the output shuffle unit;

If the first number of first target shuffle units of the high coding type is greater than the second number of second target shuffle units of the low coding type, then the second number of first target shuffle units are determined as output shuffle units, And for each output shuffle unit, in the second target shuffle unit, at least one second target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.

Clause A12. The method according to clause A1, the method further comprising:

Obtain the source data to be encoded;

According to the received encoding instruction, in the source data, the encoding area corresponding to the encoding instruction is determined, the encoding area includes at least one data block to be encoded, and the data block to be encoded is a source data block or a source data sub Piece;

For each to-be-coded data block in the at least one to-be-coded data block, divide the to-be-coded data block into multiple stream blocks, and send the multiple stream blocks to a plurality of corresponding to the to-be-coded data block The coded stream is used as a stream block to be shuffled in the multiple coded streams.

Clause A13. The method according to clause A1, the method further comprising:

When it is detected that the encoding of the first encoded stream among the plurality of encoded streams is completed, the fourth preset number of to-be-encoded stream blocks in the second encoded streams that have not been encoded in the plurality of encoded streams are sent to the first The coded stream is used as the stream block to be coded in the first coded stream.

Clause A14. The method according to clause A1, the method further comprising:

If the total coding length of the to-be-coded stream blocks in each first shuffle group is greater than the original length of the to-be-coded data block, the coding process of the to-be-coded data block is terminated.

Clause A15. The method according to clause A1, the method comprising:

According to the second shuffle level, determine at least one second shuffle group corresponding to the data block to be encoded, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one coded stream ；

The stream block to be coded in each second shuffling unit is used as the stream block to be shuffled to perform shuffling again until the code length of each second shuffling unit meets the preset proximity condition.

Clause A16. The method according to clause A1, wherein the encoding of the first stream block to be encoded by the input shuffling unit according to a preset encoding algorithm includes:

Encoding the preset characters included in the first stream block to be encoded according to the first encoding rule corresponding to the preset characters to obtain first encoded data;

The first encoded data is encoded according to a preset second encoding rule.

Clause A17. The method according to clause A12, the method further comprising:

Generating an encoding header block of an encoded data block corresponding to each data block to be encoded, where the encoding header block contains the storage address of the encoded data block corresponding to the encoding header block;

Store each encoding header block, and store each encoded data block after each encoding header block.

Clause A18. The method according to clause A17, wherein the coded data block is composed of coded data, and the size of the coded data is equal to the size of the coded data in the data block to be coded; or,

The coded data block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the data block to be coded.

Clause A19. The method according to clause A17, wherein the coded data block is composed of coded data sub-blocks corresponding to multiple source data sub-blocks belonging to the same source data block;

The coded data sub-block is composed of coded data, and the size of the coded data is equal to the coded size of the data to be coded in the source data sub-block; or,

The coded data sub-block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the source data sub-block.

Clause A20. A shuffling method, the method comprising:

Determine the code length of each first shuffling unit;

Clause A21. The method according to clause A20, wherein the determining at least one first shuffling group corresponding to the data block to be decoded according to the first shuffling level includes:

Acquiring multiple decoded streams corresponding to the data block to be decoded;

According to the first shuffling level, the multiple decoded streams are divided into multiple first shuffling units, and the multiple first shuffling units are divided into at least one first shuffling group. The shuffle unit includes at least one decoded stream, and the first shuffle group includes a plurality of first shuffle units.

Clause A22. According to the method of clause A20, the determining the coding length of each first shuffling unit includes:

For each first shuffle unit in each first shuffle group, determine the total code length of the stream block to be decoded in the decoded stream contained in the first shuffle unit as the code of the first shuffle unit length.

Clause A23. The method according to clause A20, wherein determining an output shuffling unit and an input shuffling unit in each of the first shuffling units according to the coding length of each of the first shuffling units includes:

The sending the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be decoded in the input shuffle unit includes:

For each output shuffle unit, the second preset number of stream blocks to be shuffled in the output shuffle unit are sent to the input shuffle unit corresponding to the output shuffle unit as the first in the input shuffle unit. A stream block to be decoded.

Clause A24. The method according to clause A23, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit includes:

Clause A25. The method according to clause A24, wherein the determining the shuffling type of the first shuffling unit according to the first difference corresponding to the first shuffling unit includes:

Clause A26. The method according to clause A25, the method further comprising:

Clause A27. The method according to clause A23, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit includes:

For each first shuffling unit in each of the first shuffling units, determine a second difference between the coding length of the first shuffling unit and the average coding length;

Clause A28. The method according to clause A27, wherein the determining the shuffling type of the first shuffling unit according to the second difference value corresponding to the first shuffling unit includes:

Clause A29. The method according to clause A28, the method further comprising:

Clause A30. The method according to clause A23, wherein according to the shuffling type of each first shuffling unit and a preset shuffling rule, in each first shuffling unit, determining an output shuffling unit And the input shuffle unit corresponding to each output shuffle unit, including:

If the first number of the first target shuffling units of the high decoding type is greater than the second number of the second target shuffling units of the low decoding type, the second target shuffling unit is determined to be the output shuffling unit, and for each An output shuffle unit, in the first target shuffle unit, determining at least one first target shuffle unit as the input shuffle unit corresponding to the output shuffle unit;

If the first number of the first target shuffling units of the high decoding type is less than or equal to the second number of the second target shuffling units of the low decoding type, the first number of second target shuffling units are determined as output shuffling Unit, and for each output shuffle unit, in the first target shuffle unit, at least one first target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.

Clause A31. The method according to clause A20, the method further comprising:

Acquiring encoding header data corresponding to the data to be decoded;

According to the received decoding instruction, in the encoding header data, determining a decoding area containing at least one encoding header block corresponding to the decoding instruction, and obtaining at least one to-be-decoded data block corresponding to the at least one encoding header block, The encoding header block contains the storage address of the encoded data block corresponding to the encoding header block;

For each to-be-decoded data block in the at least one to-be-decoded data block, divide the to-be-decoded data block into multiple stream blocks, and send the multiple stream blocks to multiple corresponding to the to-be-decoded data block The decoded stream is used as the stream block to be shuffled in the multiple decoded streams.

Clause A32. The method according to clause A31, wherein the data block to be decoded is composed of encoded data, and the size of the encoded data is equal to the encoded size of the data to be encoded in the data block to be encoded; or,

The data block to be decoded is composed of encoded data and padding data, and the sum of the size of the encoded data and the size of the padding data is equal to the size of the data block to be encoded.

Clause A33. The method according to clause A31, wherein the data block to be decoded is composed of encoded data sub-blocks corresponding to multiple source data sub-blocks belonging to the same source data block;

Clause A34. The method according to clause A20, the method further comprising:

When it is detected that the decoding of the first decoded stream among the plurality of decoded streams is completed, the second preset number of to-be-decoded stream blocks in the second decoded streams that have not been decoded in the plurality of decoded streams are sent to the first decoded stream. The decoded stream is used as the stream block to be decoded in the first decoded stream.

Clause A35. The method according to clause A20, the method further comprising:

According to the second shuffle level, determine at least one second shuffle group corresponding to the data block to be decoded, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one decoded stream ；

The stream block to be decoded in each second shuffling unit is used as the stream block to be shuffled to perform shuffling again until the code length of each second shuffling unit meets the preset proximity condition.

Clause A36. A shuffling device, said device comprising:

Clause A37. A shuffling device, said device comprising:

Clause A38. A computer device including a memory and a processor, the memory stores a computer program that can run on the processor, and the processor implements any one of clauses A1 to A19 when the computer program is executed The steps of the method.

Clause A39. A computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the steps of the method described in any one of clauses A1 to A19.

Clause A40. A chip system, including a processor, the processor is coupled to a memory, the memory stores program instructions, and when the program instructions stored in the memory are executed by the processor, the claim clauses A1 to are implemented The method described in any one of A19.

Clause A41. A computer device comprising a memory and a processor, the memory stores a computer program that can run on the processor, and the processor implements any of claims A20 to A35 when the computer program is executed. One of the steps of the described method.

Clause A42. A computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the steps of the method described in any one of claims A20 to A35.

Clause A43. A chip system, including a processor, the processor is coupled to a memory, the memory stores program instructions, and when the program instructions stored in the memory are executed by the processor, it implements claim clauses A20 to The method described in any one of A35.

The embodiments of the present disclosure are described in detail above, and specific examples are used in this article to illustrate the principles and implementation manners of the present disclosure. The descriptions of the above embodiments are only used to help understand the methods and core ideas of the present disclosure. At the same time, changes or modifications made by those skilled in the art based on the ideas of this disclosure, the specific implementation and application scope of this disclosure, are all within the protection scope of this disclosure. In summary, the content of this specification should not be construed as a limitation of this disclosure.

Claims

A shuffling method, characterized in that the method comprises:

According to the first shuffling level, at least one first shuffle group corresponding to the data block to be encoded is determined, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one coded stream ；

Determine the code length of each first shuffling unit;

Determine an output shuffle unit and an input shuffle unit in each of the first shuffle units according to the code length of each of the first shuffle units;

Send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be encoded in the input shuffle unit to pass the input The shuffling unit encodes the first stream block to be encoded according to a preset encoding algorithm.
The method according to claim 1, wherein the determining at least one first shuffling group corresponding to the data block to be encoded according to the first shuffling level comprises:

Acquiring multiple coded streams corresponding to the data block to be coded;

According to the first shuffling level, the multiple encoded streams are divided into multiple first shuffling units, and the multiple first shuffling units are divided into at least one first shuffling group. The shuffling unit includes at least one coded stream, and the first shuffling group includes a plurality of first shuffling units.
The method according to claim 1, wherein said determining the coding length of each first shuffling unit comprises:

For each first shuffle unit in each first shuffle group, determine the total code length of the stream block to be coded in the coded stream contained in the first shuffle unit as the code of the first shuffle unit length.
The method according to claim 1, wherein the first shuffling unit determines the output shuffle unit and the input shuffle unit according to the coding length of each first shuffle unit, include:

Determine the shuffling type of each first shuffling unit according to the code length of each first shuffling unit;

According to the shuffling type of each first shuffling unit and preset shuffling rules, in each of the first shuffling units, an output shuffling unit and an input shuffling unit corresponding to each output shuffling unit are determined ；

The sending the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be coded in the input shuffle unit includes:

For each output shuffle unit, the second preset number of stream blocks to be shuffled in the output shuffle unit are sent to the input shuffle unit corresponding to the output shuffle unit as the first in the input shuffle unit. A stream block to be encoded.
The method according to claim 4, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit comprises:

For each first shuffling unit in each of the first shuffling units, determine a first difference between the code length of the first shuffling unit and the code lengths of other first shuffling units;

The shuffling type of the first shuffling unit is determined according to the first difference corresponding to the first shuffling unit.
The method according to claim 5, wherein the determining the shuffling type of the first shuffling unit according to the first difference corresponding to the first shuffling unit comprises:

If there is a target difference in the first difference corresponding to the first shuffling unit whose absolute value is greater than or equal to the first preset difference threshold, and the target difference is all positive, then the first shuffle is determined The shuffling type of the unit is a high coding type;

If there is a target difference in the first difference corresponding to the first shuffle unit whose absolute value is greater than or equal to the first preset difference threshold, and there is a negative target difference in the target difference, then the first difference is determined The shuffling type of a shuffling unit is a low coding type.
The method according to claim 6, wherein the method further comprises:

If the first difference corresponding to the first shuffling unit does not have a target difference with an absolute value greater than or equal to the first preset difference threshold, it is determined that the shuffling type of the first shuffling unit is a medium coding type.
The method according to claim 4, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit comprises:

Determine an average code length according to the code length of each first shuffling unit;

For each first shuffling unit in each of the first shuffling units, determine a second difference between the coding length of the first shuffling unit and the average coding length;

The shuffling type of the first shuffling unit is determined according to the second difference value corresponding to the first shuffling unit.
8. The method according to claim 8, wherein the determining the shuffling type of the first shuffling unit according to the second difference value corresponding to the first shuffling unit comprises:

If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a positive number, then the shuffling type of the first shuffling unit is determined High coding type;

If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a negative number, it is determined that the shuffling type of the first shuffling unit is Low encoding type.
The method according to claim 9, wherein the method further comprises:

If the absolute value of the second difference value corresponding to the first shuffling unit is smaller than the second preset difference value threshold, it is determined that the shuffling type of the first shuffling unit is a medium coding type.
The method according to claim 4, wherein the first shuffling unit determines the output shuffling according to the shuffling type and the preset shuffling rule of each first shuffling unit. The washing unit and the input shuffle unit corresponding to each output shuffle unit include:

If the first number of the first target shuffle unit of the high coding type is less than or equal to the second number of the second target shuffle unit of the low coding type, the first target shuffle unit is determined as the output shuffle unit, and the For each output shuffle unit, in the second target shuffle unit, determine at least one second target shuffle unit as the input shuffle unit corresponding to the output shuffle unit;

If the first number of first target shuffle units of the high coding type is greater than the second number of second target shuffle units of the low coding type, then the second number of first target shuffle units are determined as output shuffle units, And for each output shuffle unit, in the second target shuffle unit, at least one second target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.
The method according to claim 1, wherein the method further comprises:

Obtain the source data to be encoded;

According to the received encoding instruction, in the source data, the encoding area corresponding to the encoding instruction is determined, the encoding area includes at least one data block to be encoded, and the data block to be encoded is a source data block or a source data sub Piece;

For each to-be-coded data block in the at least one to-be-coded data block, divide the to-be-coded data block into multiple stream blocks, and send the multiple stream blocks to a plurality of corresponding to the to-be-coded data block The coded stream is used as a stream block to be shuffled in the multiple coded streams.
The method according to claim 1, wherein the method further comprises:

When it is detected that the encoding of the first encoded stream among the plurality of encoded streams is completed, the fourth preset number of to-be-encoded stream blocks in the second encoded streams that have not been encoded in the plurality of encoded streams are sent to the first The coded stream is used as the stream block to be coded in the first coded stream.
The method according to claim 1, wherein the method further comprises:

If the total coding length of the to-be-coded stream blocks in each first shuffle group is greater than the original length of the to-be-coded data block, the coding process of the to-be-coded data block is terminated.
The method according to claim 1, wherein the method comprises:

According to the second shuffle level, determine at least one second shuffle group corresponding to the data block to be encoded, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one coded stream ；

The stream block to be coded in each second shuffling unit is used as the stream block to be shuffled to perform shuffling again until the code length of each second shuffling unit meets the preset proximity condition.
The method according to claim 1, wherein the encoding the first stream block to be encoded by the input shuffling unit according to a preset encoding algorithm comprises:

Encoding the preset characters included in the first stream block to be encoded according to the first encoding rule corresponding to the preset characters to obtain first encoded data;

The first encoded data is encoded according to a preset second encoding rule.
The method according to claim 12, wherein the method further comprises:

Generating an encoding header block of an encoded data block corresponding to each data block to be encoded, where the encoding header block contains the storage address of the encoded data block corresponding to the encoding header block;

Store each encoding header block, and store each encoded data block after each encoding header block.
The method according to claim 17, wherein the coded data block is composed of coded data, and the size of the coded data is equal to the size of the coded data in the data block to be coded; or,

The coded data block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the data block to be coded.
The method according to claim 17, wherein the coded data block is composed of coded data sub-blocks corresponding to multiple source data sub-blocks belonging to the same source data block;

The coded data sub-block is composed of coded data, and the size of the coded data is equal to the coded size of the data to be coded in the source data sub-block; or,

The coded data sub-block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the source data sub-block.
A shuffling method, characterized in that the method comprises:

According to the first shuffle level, determine at least one first shuffle group corresponding to the data block to be decoded, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit includes at least one decoded stream ；

Determine the code length of each first shuffling unit;

Determine an output shuffle unit and an input shuffle unit in each of the first shuffle units according to the code length of each of the first shuffle units;

Send the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be decoded in the input shuffle unit to pass the input The shuffling unit decodes the first stream block to be decoded according to a preset decoding algorithm.
The method according to claim 20, wherein the determining at least one first shuffling group corresponding to the data block to be decoded according to the first shuffling level comprises:

Acquiring multiple decoded streams corresponding to the data block to be decoded;

According to the first shuffling level, the multiple decoded streams are divided into multiple first shuffling units, and the multiple first shuffling units are divided into at least one first shuffling group. The shuffle unit includes at least one decoded stream, and the first shuffle group includes a plurality of first shuffle units.
The method according to claim 20, wherein said determining the coding length of each first shuffling unit comprises:

For each first shuffle unit in each first shuffle group, determine the total code length of the stream block to be decoded in the decoded stream contained in the first shuffle unit as the code of the first shuffle unit length.
22. The method according to claim 20, wherein the first shuffle unit determines the output shuffle unit and the input shuffle unit according to the coding length of each first shuffle unit, include:

Determine the shuffling type of each first shuffling unit according to the code length of each first shuffling unit;

According to the shuffling type of each first shuffling unit and preset shuffling rules, in each of the first shuffling units, an output shuffling unit and an input shuffling unit corresponding to each output shuffling unit are determined ；

The sending the first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be decoded in the input shuffle unit includes:

For each output shuffle unit, the second preset number of stream blocks to be shuffled in the output shuffle unit are sent to the input shuffle unit corresponding to the output shuffle unit as the first in the input shuffle unit. A stream block to be decoded.
The method according to claim 23, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit comprises:

For each first shuffling unit in each of the first shuffling units, determine a first difference between the code length of the first shuffling unit and the code lengths of other first shuffling units;

The shuffling type of the first shuffling unit is determined according to the first difference corresponding to the first shuffling unit.
The method of claim 24, wherein the determining the shuffling type of the first shuffling unit according to the first difference value corresponding to the first shuffling unit comprises:

If there is a target difference in the first difference corresponding to the first shuffling unit whose absolute value is greater than or equal to the first preset difference threshold, and the target difference is all positive, then the first shuffle is determined The shuffling type of the unit is a high coding type;

If there is a target difference in the first difference corresponding to the first shuffle unit whose absolute value is greater than or equal to the first preset difference threshold, and there is a negative target difference in the target difference, then the first difference is determined The shuffling type of a shuffling unit is a low coding type.
The method according to claim 25, wherein the method further comprises:

If the first difference corresponding to the first shuffling unit does not have a target difference with an absolute value greater than or equal to the first preset difference threshold, it is determined that the shuffling type of the first shuffling unit is a medium coding type.
The method according to claim 23, wherein the determining the shuffling type of each first shuffling unit according to the coding length of each first shuffling unit comprises:

Determine an average code length according to the code length of each first shuffling unit;

For each first shuffling unit in each of the first shuffling units, determine a second difference between the coding length of the first shuffling unit and the average coding length;

The shuffling type of the first shuffling unit is determined according to the second difference value corresponding to the first shuffling unit.
28. The method of claim 27, wherein the determining the shuffling type of the first shuffling unit according to the second difference value corresponding to the first shuffling unit comprises:

If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a positive number, then the shuffling type of the first shuffling unit is determined High coding type;

If the absolute value of the second difference corresponding to the first shuffling unit is greater than or equal to the second preset difference threshold, and the second difference is a negative number, it is determined that the shuffling type of the first shuffling unit is Low encoding type.
The method according to claim 28, wherein the method further comprises:

If the absolute value of the second difference value corresponding to the first shuffling unit is smaller than the second preset difference value threshold, it is determined that the shuffling type of the first shuffling unit is a medium coding type.
23. The method according to claim 23, characterized in that, according to the shuffling type of each first shuffling unit and a preset shuffling rule, in each first shuffling unit, determining the output shuffling The washing unit and the input shuffle unit corresponding to each output shuffle unit include:

If the first number of the first target shuffling units of the high decoding type is greater than the second number of the second target shuffling units of the low decoding type, the second target shuffling unit is determined to be the output shuffling unit, and for each An output shuffle unit, in the first target shuffle unit, determining at least one first target shuffle unit as the input shuffle unit corresponding to the output shuffle unit;

If the first number of the first target shuffling units of the high decoding type is less than or equal to the second number of the second target shuffling units of the low decoding type, the first number of second target shuffling units are determined as output shuffling Unit, and for each output shuffle unit, in the first target shuffle unit, at least one first target shuffle unit is determined as the input shuffle unit corresponding to the output shuffle unit.
The method according to claim 20, wherein the method further comprises:

Acquiring encoding header data corresponding to the data to be decoded;

According to the received decoding instruction, in the encoding header data, determining a decoding area containing at least one encoding header block corresponding to the decoding instruction, and obtaining at least one to-be-decoded data block corresponding to the at least one encoding header block, The encoding header block contains the storage address of the encoded data block corresponding to the encoding header block;

For each to-be-decoded data block in the at least one to-be-decoded data block, divide the to-be-decoded data block into multiple stream blocks, and send the multiple stream blocks to multiple corresponding to the to-be-decoded data block The decoded stream is used as the stream block to be shuffled in the multiple decoded streams.
The method according to claim 31, wherein the data block to be decoded is composed of encoded data, and the size of the encoded data is equal to the encoded size of the data to be encoded in the data block to be encoded; or,

The data block to be decoded is composed of encoded data and padding data, and the sum of the size of the encoded data and the size of the padding data is equal to the size of the data block to be encoded.
The method according to claim 31, wherein the data block to be decoded is composed of encoded data sub-blocks corresponding to multiple source data sub-blocks belonging to the same source data block;

The coded data sub-block is composed of coded data, and the size of the coded data is equal to the coded size of the data to be coded in the source data sub-block; or,

The coded data sub-block is composed of coded data and padding data, and the sum of the size of the coded data and the size of the padding data is equal to the size of the source data sub-block.
The method according to claim 20, wherein the method further comprises:

When it is detected that the decoding of the first decoded stream among the plurality of decoded streams is completed, the second preset number of to-be-decoded stream blocks in the second decoded streams that have not been decoded in the plurality of decoded streams are sent to the first decoded stream. The decoded stream is used as the stream block to be decoded in the first decoded stream.
The method according to claim 20, wherein the method further comprises:

According to the second shuffle level, determine at least one second shuffle group corresponding to the data block to be decoded, the second shuffle group includes a plurality of second shuffle units, and the second shuffle unit includes at least one decoded stream ；

The stream block to be decoded in each second shuffling unit is used as the stream block to be shuffled to perform shuffling again until the code length of each second shuffling unit meets the preset proximity condition.
A shuffling device, characterized in that the device comprises:

The first determination module is configured to determine at least one first shuffle group corresponding to the data block to be encoded according to the first shuffle level, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit The washing unit contains at least one coded stream;

The second determining module is used to determine the code length of each first shuffling unit;

A third determining module, configured to determine an output shuffle unit and an input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit;

A sending module, configured to send a first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be coded in the input shuffle unit, The first stream block to be encoded is encoded by the input shuffling unit according to a preset encoding algorithm.
A shuffling device, characterized in that the device comprises:

The first determining module is configured to determine at least one first shuffle group corresponding to the data block to be decoded according to the first shuffle level, the first shuffle group includes a plurality of first shuffle units, and the first shuffle unit The washing unit contains at least one decoding stream;

The second determining module is used to determine the code length of each first shuffling unit;

A third determining module, configured to determine an output shuffle unit and an input shuffle unit in each first shuffle unit according to the code length of each first shuffle unit;

A sending module, configured to send a first preset number of stream blocks to be shuffled in the output shuffle unit to the input shuffle unit as the first stream blocks to be decoded in the input shuffle unit, The first stream block to be decoded is decoded by the input shuffling unit according to a preset decoding algorithm.
A computer device comprising a memory and a processor, and a computer program that can be run on the processor is stored on the memory, wherein the processor implements any one of claims 1 to 19 when the computer program is executed. The steps of the method described in item.
A computer-readable storage medium with a computer program stored thereon, wherein the computer program implements the steps of the method according to any one of claims 1 to 19 when the computer program is executed by a processor.
A chip system, characterized in that it comprises a processor, the processor is coupled with a memory, the memory stores program instructions, and claims 1 to 19 are implemented when the program instructions stored in the memory are executed by the processor. Any of the methods.
A computer device comprising a memory and a processor, and a computer program that can be run on the processor is stored on the memory, wherein the processor implements any one of claims 20 to 35 when the computer program is executed. The steps of the method described in item.
A computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the steps of the method according to any one of claims 20 to 35 when the computer program is executed by a processor.
A chip system, comprising a processor, the processor is coupled with a memory, the memory stores program instructions, and when the program instructions stored in the memory are executed by the processor, claims 20 to 35 are implemented Any of the methods described.