CN112506660A

CN112506660A - Method and device for optimizing memory of audio/video codec and storage medium

Info

Publication number: CN112506660A
Application number: CN202011447342.XA
Authority: CN
Inventors: 王尧; ***; 叶东翔; 朱勇
Original assignee: Barrot Wireless Co Ltd
Current assignee: Barrot Wireless Co Ltd
Priority date: 2020-12-09
Filing date: 2020-12-09
Publication date: 2021-03-16

Abstract

The application discloses a method, a device and a storage medium for optimizing an internal memory of an audio and video codec, and relates to the technical field of internal memory optimization. The method comprises the following steps: according to the life cycle of each variable in the audio and video codec, dividing the variables with no intersection in the life cycle into a group; judging whether the life cycles of the first maximum variable corresponding to the minor group and the second maximum variable corresponding to the major group have intersection in any two groups; if no intersection exists, merging the smaller group into the larger group, wherein the sum of the byte number occupied by the first maximum variable and the byte number occupied by the third variable is less than or equal to the byte number occupied by the second maximum variable; and distributing the same corresponding memory unit for each variable in each group according to the final grouping result. By analyzing the life cycle of each variable in the audio and video codec, each variable is grouped to share the same memory unit, so that the memory consumption is reduced, and the optimization of the memory of the established audio and video codec is realized.

Description

Method and device for optimizing memory of audio/video codec and storage medium

Technical Field

The present application relates to the field of memory optimization technologies, and in particular, to a method, an apparatus, and a storage medium for optimizing a memory of an audio/video codec.

Background

The existing memory allocation methods have two types: 1. when a continuous memory block needs to be used, a continuous memory is allocated to the continuous memory block, when the continuous memory block does not need to be used, the occupied continuous memory block is released, the dynamic memory allocation method (NEW/FREE method) or (Malloc/Free method) can obtain the lowest memory usage, and each data unit is allocated according to the complete life cycle of the data unit, namely, when the data unit is used, and is released when the data unit is used. 2. Using a static memory allocation mode, allocating a memory with a fixed size during initialization, and dividing the memory into 2 types: (1) the method is a global fixed and independently used memory area, and each variable occupies a fixed position and does not need to be shared with other variables; (2) the shared memory area is similar to a scratch paper shared memory area, when a continuous data block needs to use the memory, the fixed position is distributed in the memory of the block, and when the memory is used up, the dirty memory, namely the area with the invalidated content, is continuously distributed and used by other modules.

In the prior art, as the encoding and decoding process of the audio and video codec is complex, a large number of data units are input/output to/from each module in each operation step, and the encoding and decoding performance of the audio and video codec is seriously affected by a dynamic memory allocation mode, the million operation times of a processor required by a CPU for occupying each second of audio samples are increased; therefore, the commercial audio/video codec cannot adopt a mode of dynamically allocating and releasing the memory, while a module user of the codec is required to be very familiar with the structure of the shared memory area in a static memory allocation mode, and the information such as whether the service life cycle of the memory is finished by a module and a data block before the current operation module is obtained; moreover, the audio/video codec is mainly used in an embedded platform based on MCU/DSP, for example, the decoder is mainly used for earphones; therefore, there is a strict limitation on the size of the memory, and excessive memory consumption will affect the portability and cause an increase in the product cost.

Disclosure of Invention

The application aims to provide a method, a device and a storage medium for optimizing the memory of an audio and video codec, aiming at the problem of high memory consumption of the audio and video codec in the prior art.

In order to achieve the purpose, the technical scheme adopted by the application is as follows: a method for optimizing the memory of an audio/video codec is provided, which comprises the following steps: according to the life cycle of each variable in a plurality of variables used by the audio and video codec, dividing the variables with no intersection in the life cycle into a group, so that the life cycle of each variable in each group is not intersected; in any two groups, one group with smaller byte number corresponding to the maximum variable in the two groups is taken as a smaller group, the other group is taken as a larger group, and whether the life cycles of the first maximum variable corresponding to the smaller group and the second maximum variable corresponding to the larger group have intersection or not is judged; if the intersection does not exist, merging a smaller group into a larger group, wherein the sum of the byte number occupied by the first maximum variable and the byte number occupied by the third variable is less than or equal to the byte number occupied by the second maximum variable, and the third variable is a variable which has intersection with the life cycle of the first maximum variable in the larger group; and distributing the same corresponding memory unit for each variable in each group according to the final grouping result.

The application adopts another technical scheme that: an apparatus for optimizing memory of an audio/video codec is provided, which includes: a module for grouping variables whose life cycles are not intersected into one group according to the life cycles of the variables in the plurality of variables used by the audio and video codec, so that the life cycles of the variables in each group are not intersected; a module for determining whether there is intersection between life cycles of a first maximum variable corresponding to the smaller group and a second maximum variable corresponding to the larger group, wherein the one group with a smaller byte number corresponding to the maximum variable in the two groups is a smaller group and the other group is a larger group, in any two groups; a module for merging a smaller group into a larger group, wherein the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable is less than or equal to the number of bytes occupied by the second maximum variable, and the third variable is a variable in the larger group which has an intersection with the life cycle of the first maximum variable; and a module for allocating the same memory unit for each variable in each group according to the final grouping result.

The invention adopts another technical scheme that: a computer readable storage medium is provided that stores computer instructions operable to perform a method of optimizing audio video codec memory in scenario one.

The beneficial effect of this application is: a method for optimizing the internal memory of audio-video codec features that the internal memory structure of audio-video codec automatically constructed by the life cycle analysis program of each module data unit is used to allocate relative internal memory units to multiple variables used in audio-video codec, so reducing the consumption of internal memory.

Drawings

Fig. 1 is a schematic diagram of an embodiment of a method for optimizing an internal memory of an audio/video codec according to the present application;

fig. 2 is a schematic diagram illustrating components of an embodiment of the memory device for optimizing an audio/video codec according to the present invention.

Detailed Description

The following detailed description of the preferred embodiments of the present application, taken in conjunction with the accompanying drawings, will provide those skilled in the art with a better understanding of the advantages and features of the present application, and will make the scope of the present application more clear and definite.

It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

Fig. 1 is a flowchart illustrating a specific embodiment of the method for optimizing the memory of an audio/video codec according to the present application.

In the specific embodiment shown in fig. 1, the method for optimizing the memory of the audio/video codec includes a process S101, a process S102, a process S103, and a process S104.

The process S101 shown in fig. 1 includes: according to the life cycles of all the variables in the variables used by the audio and video codec, the variables with no intersection in the life cycles are divided into a group, so that the life cycles of all the variables in each group are not intersected.

In a specific embodiment of the present application, a process of grouping variables whose life cycles are not intersected into one group according to life cycles of variables in a plurality of variables used by an audio/video codec, so that life cycles of variables in each group are not intersected includes: and grouping according to the size of the memory independently occupied by each variable without intersection in the life cycle of the variables, so that the difference between the sizes of the memories independently occupied by the variables in each group is minimum. The grouping mode enables a plurality of variables used by the audio and video codec to occupy the minimum memory.

In a specific example of the present application, preferably, a variable a which occupies the largest number of bytes among a plurality of variables used by the audio/video codec is found, then a variable B which occupies the largest number of bytes and has no intersection with the life cycle of the variable a is found in the other variables except for the variable a according to the descending order of the number of bytes occupied by each variable, and then a variable C which occupies the largest number of bytes and has no intersection with the life cycles of the variable a and the variable B is found in the other variables except for the variable a and the variable B according to the descending order of the number of bytes occupied by each variable. The variable A, the variable B and the variable C are divided into a first group.

In this specific example, if there is a variable D that does not intersect with the life cycles of the variable a, the variable B, and the variable C in the remaining variables except the variable a, the variable B, and the variable C, the variable D is also classified into the first group, and the first group is completed until there is no variable that does not intersect with the life cycles of the variables in the current first group in the remaining variables.

In the specific example, if no variables which have no intersection with the life cycles of the variable A, the variable B, the variable C and the variable D exist in the other variables except the variable A, the variable B, the variable C and the variable D, the first group is completely grouped, and the other variables except the variable A, the variable B, the variable C and the variable D are grouped into a second group in the same grouping mode as the first group; and finishing the current grouping until a plurality of variables used by the audio and video coder-decoder participate in the grouping.

The process S102 shown in fig. 1 includes: in any two groups, one group with smaller byte number corresponding to the maximum variable in the two groups is used as a smaller group, the other group is used as a larger group, and whether the life cycles of the first maximum variable corresponding to the smaller group and the second maximum variable corresponding to the larger group have intersection or not is judged.

In this specific embodiment, preferably, the variable with the maximum number of bytes occupied by each variable in the first group is found according to the number of bytes occupied by each variable, for example, the maximum variable in the first group is the variable a, and the variable with the maximum number of bytes occupied by each variable in the second group is found according to the number of bytes occupied by each variable, for example, the maximum variable in the second group is the variable E, and whether an intersection exists between the life cycles of the variable a and the variable E is determined. The judged result is used as a precondition for the next step.

The process S103 shown in fig. 1 includes: if the intersection does not exist, merging a smaller group into a larger group, wherein the sum of the byte number occupied by the first maximum variable and the byte number occupied by the third variable is less than or equal to the byte number occupied by the second maximum variable, and the third variable is a variable which has intersection with the life cycle of the first maximum variable in the larger group.

In an embodiment of the present application, merging a smaller group into a larger group, where a sum of a number of bytes occupied by the first maximum variable and a number of bytes occupied by the third variable is less than or equal to a number of bytes occupied by the second maximum variable, further includes: and judging the larger group after the smaller group is merged with other groups, so that the final groups can not be merged.

In a specific example of the present application, it is preferable to determine whether the life cycles of the variable a and the variable E have an intersection, and if the variable a and the life cycle of the variable E have no intersection, determine whether the life cycles of the variable B, the variable C, and the variable D in the first group have an intersection, for example, the life cycles of the variable D and the variable E have an intersection, compare the sum of the number of bytes occupied by the variable D and the variable E with the number of bytes occupied by the variable a, and if the sum of the number of bytes occupied by the variable D and the variable E is less than or equal to the number of bytes occupied by the variable a, merge the variables of the second group into the first group; the memory consumption is reduced on the basis of the current grouping.

In an embodiment of the present application, merging a smaller group into a larger group, where a sum of a number of bytes occupied by the first maximum variable and a number of bytes occupied by the third variable is less than or equal to a number of bytes occupied by the second maximum variable, further includes: after adding a fill-skip variable to each variable in the smaller group, the smaller group is assigned to the larger group.

In one embodiment of the present application, it is preferred that a fill skip variable is added to all variables of the second group so that the individual variables of the second group can share the same memory location as the variables of the first group. And filling skip variables into the variable group, wherein the bytes occupied by the skip variables are not less than the bytes of the variable with the maximum byte occupied by the other variables in the first group except the variable A.

In one embodiment of the present application, if the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable in the larger group is greater than the number of bytes occupied by the second maximum variable, the two groups are respectively determined with the other groups.

In a specific example of the present application, preferably, if there is an intersection in the life cycle of the variable D and the variable E, the sum of the number of bytes occupied by the variable D and the variable E is compared with the number of bytes occupied by the variable a, and if the sum of the number of bytes occupied by the variable D and the variable E is greater than the number of bytes occupied by the variable a, the first group and the second group cannot be merged at this time, and the first group and the second group can be respectively judged and merged with other groups.

In a specific embodiment of the present application, it is determined whether there is an intersection between life cycles of the first maximum variable corresponding to the smaller group and the second maximum variable corresponding to the larger group, and if there is an intersection, the two groups are determined with the other groups respectively.

In an embodiment of the present application, preferably, if there is an intersection between the life cycles of the variable a in the first group and the variable E in the second group, and the first group and the second group cannot be merged, the first group and the second group may be judged and merged with other groups respectively.

In a specific embodiment of the present application, the method further includes: and if the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable in the larger group is larger than the number of bytes occupied by the second maximum variable, the sum of the number of bytes of the non-intersection part of the life cycle of the first maximum variable and the third variable is smaller than or equal to the number of bytes occupied by the second maximum variable, and the first maximum variable and the third variable respectively execute read operation and write operation, merging the smaller group into the larger group.

In one embodiment of the present application, it is preferable that if there is an intersection between the variable D and the life cycle of the variable E, and the sum of the number of bytes occupied by the variable D and the number of bytes occupied by the variable E except for the intersection with the life cycle of the variable D is less than or equal to the number of bytes occupied by the variable a. Judging whether the variable D and the variable E respectively execute read operation and write operation, and if the variable D and the variable E respectively execute the read operation and the write operation, merging the variables of the second group into the first group; the memory consumption is reduced on the basis of the current grouping.

The process S104 shown in fig. 1 includes: and distributing the same corresponding memory unit for each variable in each group according to the final grouping result.

In this embodiment, preferably, after the variables in the second group are merged into the first group, memory cells are allocated to the variables in the current first group, and the size of the allocated memory cells is the number of bytes occupied by the variable a. Each bank is assigned a respective memory cell in turn.

In a specific embodiment of the present application, if, in a final grouping result, variables having an intersection in a lifecycle of any one group are respectively read and written, a fast-read and slow-write manner is used to enable the two variables to use the same memory cell.

In a specific example of the present application, preferably, if, in a final grouping result, there is an intersection between the variable D and the life cycle of the variable E in the first group, and the sum of the number of bytes occupied by the variable D and the number of bytes occupied by the remaining part of the variable E except the intersection with the life cycle of the variable D is less than or equal to the number of bytes occupied by the variable a, and the variable D and the variable E perform read operation and write operation respectively, the variable D and the variable E share the same memory cell in a fast-read and slow-write manner.

Fig. 2 is a schematic diagram illustrating an embodiment of an apparatus for optimizing an audio/video codec memory according to the present invention.

In the embodiment shown in fig. 2, the apparatus for optimizing an internal memory of an audio/video codec according to the present application may include: module 201, module 202, module 203, and module 204.

The module 201 shown in fig. 2 is a module for grouping variables whose life cycles are not intersected into one group according to the life cycles of the variables in the plurality of variables used by the audio/video codec, so that the life cycles of the variables in each group are not intersected; the module 202 shown in fig. 2 is a module for determining whether there is an intersection between life cycles of a first maximum variable corresponding to a smaller group and a second maximum variable corresponding to a larger group, where, in any two groups, one group with a smaller byte number corresponding to the maximum variable in the two groups is a smaller group, and the other group is a larger group; the module 203 shown in fig. 2 is a module for merging a smaller group, in which the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable is less than or equal to the number of bytes occupied by the second maximum variable, into a larger group if there is no intersection, where the third variable is a variable in the larger group that has an intersection with the life cycle of the first maximum variable; and the module 204 shown in fig. 2 is a module for allocating the same corresponding memory unit to each variable in the group according to the final grouping result.

In one embodiment of the present application, the

modules

201, 202, 203, and 204 in the apparatus for optimizing an audio-video codec memory of the present application may be directly in hardware, in a software module executed by a processor, or in a combination of the two.

A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium.

The Processor may be a Central Processing Unit (CPU), other general-purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), other Programmable logic devices, discrete Gate or transistor logic, discrete hardware components, or any combination thereof. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.

The device for optimizing the memory of the audio/video codec can be used for executing the method for optimizing the memory of the audio/video codec described in any one of the embodiments, and the implementation principle and the technical effect are similar, and are not described herein again.

In another embodiment of the present invention, a computer-readable storage medium stores computer instructions operable to perform a method for optimizing an audio-video codec memory in scenario one.

According to the method, the device and the storage medium for optimizing the memory of the audio and video codec, the method of automatically constructing the memory structure of the audio and video codec by the life cycle analysis program of each module data unit is used, corresponding memory units are distributed to a plurality of variables used in the audio and video codec, the consumption of the memory is reduced, and the optimization of the memory of the established audio and video codec is realized.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

The above description is only an example of the present application and is not intended to limit the scope of the present application, and all equivalent structural changes made by using the contents of the specification and the drawings, which are directly or indirectly applied to other related technical fields, are included in the scope of the present application.

Claims

1. A method for optimizing memory of an audio/video codec, comprising:

according to the life cycle of each variable in a plurality of variables used by the audio and video codec, dividing the variables with no intersection in the life cycle into a group, so that the life cycle of each variable in each group is not intersected;

in any two groups, one group with smaller byte number corresponding to the maximum variable in the two groups is a smaller group, the other group is a larger group, and whether the life cycles of a first maximum variable corresponding to the smaller group and a second maximum variable corresponding to the larger group have intersection is judged;

if no intersection exists, merging the small group of which the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by a third variable is less than or equal to the number of bytes occupied by the second maximum variable into the large group, wherein the third variable is a variable in the large group, which has an intersection with the life cycle of the first maximum variable; and

and distributing the same corresponding memory unit for each variable in each group according to the final grouping result.

2. The method of optimizing audio/video codec memory of claim 1, wherein the merging of the smaller group, in which the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable is less than or equal to the number of bytes occupied by the second maximum variable, into the larger group, further comprises:

and judging the larger group merged by the smaller group and other groups, so that the merging cannot be performed between final groups.

3. The method of optimizing audio/video codec memory of claim 1, wherein the merging of the smaller group, in which the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable is less than or equal to the number of bytes occupied by the second maximum variable, into the larger group, further comprises:

after adding a fill-skip variable to each variable within the smaller group, the smaller group is assigned to the larger group.

4. The method of optimizing memory of an audio/video codec of claim 1, wherein if the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable in the larger group is greater than the number of bytes occupied by the second maximum variable, the two groups are respectively subjected to the determination with the other groups.

5. The method according to claim 1, wherein it is determined whether there is an intersection between life cycles of the first maximum variable corresponding to the smaller group and the second maximum variable corresponding to the larger group, and if there is an intersection, the two groups are respectively subjected to the determination with the other groups.

6. The method of optimizing audio video codec memory of claim 1, further comprising:

and if the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by the third variable in the larger group is larger than the number of bytes occupied by the second maximum variable, the sum of the number of bytes of the non-intersection part of the life cycle of the first maximum variable and the life cycle of the third variable is smaller than or equal to the number of bytes occupied by the second maximum variable, and the first maximum variable and the third variable respectively execute read operation and write operation, merging the smaller group into the larger group.

7. The method according to claim 6, wherein said assigning the same memory unit for each intra-group variable according to the final grouping result comprises:

and utilizing a fast reading and slow writing mode to enable the first maximum variable and the third variable to use the same memory unit.

8. The method according to claim 1, wherein the step of grouping variables whose life cycles are not intersected into one group according to life cycles of respective variables in a plurality of variables used by the audio/video codec, such that life cycles of respective variables in each group are not intersected comprises:

and grouping according to the size of the memory independently occupied by each variable without intersection in the life cycle of the variables, so that the difference between the sizes of the memories independently occupied by the variables in each group is minimum.

9. An apparatus for optimizing memory in an audio/video codec, comprising:

a module for grouping variables of which the life cycles are not intersected into one group according to the life cycles of the variables in the plurality of variables used by the audio and video codec, so that the life cycles of the variables in each group are not intersected;

a module for determining whether there is an intersection between life cycles of a first maximum variable corresponding to the smaller group and a second maximum variable corresponding to the larger group, wherein the number of bytes corresponding to the largest variable in the two groups is smaller and the other group is larger, in any two groups;

a module configured to, if there is no intersection, merge the smaller group, in which the sum of the number of bytes occupied by the first maximum variable and the number of bytes occupied by a third variable is less than or equal to the number of bytes occupied by the second maximum variable, into the larger group, where the third variable is a variable in the larger group that has an intersection with the life cycle of the first maximum variable; and

and a module for allocating the same memory unit to each variable in the group according to the final grouping result.

10. A computer readable storage medium storing computer instructions, wherein the computer instructions are operable to perform the method of optimizing audio video codec memory of any one of claims 1-8.