CN117319651A - Method and device for realizing Colmv data compression by combining LCU division - Google Patents

Method and device for realizing Colmv data compression by combining LCU division Download PDF

Info

Publication number
CN117319651A
CN117319651A CN202311295495.0A CN202311295495A CN117319651A CN 117319651 A CN117319651 A CN 117319651A CN 202311295495 A CN202311295495 A CN 202311295495A CN 117319651 A CN117319651 A CN 117319651A
Authority
CN
China
Prior art keywords
sub
data
block
colmv
lcu
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311295495.0A
Other languages
Chinese (zh)
Inventor
刘琛
张玉明
周家庆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN202311295495.0A priority Critical patent/CN117319651A/en
Publication of CN117319651A publication Critical patent/CN117319651A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
    • H04N19/139—Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • H04N19/423—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
    • H04N19/426—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements using memory downsizing methods
    • H04N19/428—Recompression, e.g. by spatial or temporal decimation

Abstract

The invention provides a method and a device for realizing Colmv data compression by combining LCU division, which determine whether to transmit the Colmv data of the current LCU in a compression transmission mode for the current LCU with division information by judging the AXI transmission times of the current LCU with 64x64 division operation and carrying out compression transmission on the current LCU and the AXI transmission times of the AXI transmission required by dividing the current LCU in the existing 8x8 minimum block mode and transmitting the Colmv data of a sub-block. The invention can reduce the Colmv data volume, thereby reducing the data bandwidth of the Colmv data transmitted from the AXI to the DDR, and improving the access efficiency of the DDR.

Description

Method and device for realizing Colmv data compression by combining LCU division
Technical Field
The invention belongs to the technical field of video processing, and particularly relates to a method and a device for realizing Colmv data compression by combining LCU division.
Background
AV1 was proposed by the open media alliance (AOMedia) in 2019, which has followed the traditional hybrid coding framework and proposed many new technologies. Such as: more flexible block partitioning, wedge-shaped hybrid weighted prediction techniques, and so on. The introduced technology is more complex meaning that the codec complexity is higher, so the AV1 codec technology also needs to be optimized continuously. The CU sizes in AV1 are 128x128, 64x64, 32x32, 16x16, 8x8, 4x4. Where the largest CU is called LCU, LCU can also be divided continuously, and the smallest CU can be divided to a CU size of 4x4.
In the AV1 standard, it is specified that when Colmv data of a 64x64 size LCU is transmitted, the LCU is divided into 8x8 size blocks to be processed. The Colmv data corresponding to each 8x8 block is transmitted through the AXI bus and then stored in the DDR for subsequent decoding prediction. Obviously, when each LCU with the size of 64x64 in the code stream is divided into 8x8 blocks for transmission, the data volume is large, and the data transmission bandwidth requirement is high.
DDR is a common memory type for storing data in the process of decoding video, however, DDR access efficiency is limited to a certain extent, and frequent read/write operations and large-scale video data transmission and buffering requirements can result in low DDR access efficiency.
Currently, SOC scale at the chip level is increasing, and improving access efficiency of DDR and optimizing bandwidth of data transmission channel are critical to chip design. Therefore, how to implement a compression method capable of reducing Colmv data transmission of LCU is a key point in AV1 hardware design.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a method and a device for realizing Colmv data compression by combining LCU division. The technical problems to be solved by the invention are realized by the following technical scheme:
in a first aspect, the present invention provides a method for implementing Colmv data compression in combination with LCU partitioning, including:
s100, acquiring a current LCU with the size of 64x64 and partition information carried by the current LCU;
s200, respectively calculating a first AXI transmission time required by dividing the current LCU according to the mode that the size of each sub-block is 8x8, and transmitting the divided sub-blocks in a burst mode, and a second AXI transmission time required by compressing and transmitting the divided sub-blocks in a burst mode if the current LCU is divided according to the dividing information;
s300, if the second AXI transmission times are larger than the first AXI transmission times, dividing the current LCU according to the mode that the size of each sub-block is 8x8 to obtain a first sub-block, and directly transmitting the first sub-block;
s400, if the second AXI transmission times are not larger than the first AXI transmission times, dividing the current LCU according to the dividing information to obtain a second sub-block, and compressing and transmitting the second sub-block.
In a second aspect, the present invention provides an apparatus for implementing Colmv data compression in combination with LCU partitioning, including: a processing device for transmitting data over an AXI bus with a DDR, said processing device for processing the steps of:
s100, acquiring a current LCU with the size of 64x64 and partition information carried by the current LCU;
s200, respectively calculating a first AXI transmission time required by dividing the current LCU according to the mode that the size of each sub-block is 8x8, and transmitting the divided sub-blocks in a burst mode, and a second AXI transmission time required by compressing and transmitting the divided sub-blocks in a burst mode if the current LCU is divided according to the dividing information;
s300, if the second AXI transmission times are larger than the first AXI transmission times, dividing the current LCU according to the mode that the size of each sub-block is 8x8 to obtain a first sub-block, and directly transmitting the first sub-block;
s400, if the second AXI transmission times are not larger than the first AXI transmission times, dividing the current LCU according to the dividing information to obtain a second sub-block, and compressing and transmitting the second sub-block.
The beneficial effects are that:
the invention provides a method and a device for realizing Colmv data compression by combining LCU division, which determine whether to transmit the Colmv data of the current LCU in a compression transmission mode for the current LCU with division information by judging the AXI transmission times of the current LCU with 64x64 division operation and carrying out compression transmission on the current LCU and the AXI transmission times of the AXI transmission required by dividing the current LCU in the existing 8x8 minimum block mode and transmitting the Colmv data of a sub-block. The invention can reduce the Colmv data volume, thereby reducing the data bandwidth of the Colmv data transmitted from the AXI to the DDR, and improving the access efficiency of the DDR. The present invention will be described in further detail with reference to the accompanying drawings and examples.
Drawings
FIG. 1 is a flow chart of a method for implementing Colmv data compression in combination with LCU partitioning provided by the invention;
FIG. 2 is a diagram illustrating a possible division manner and a corresponding number of division blocks of a 64×64 LCU according to the present invention;
fig. 3 is a schematic diagram of a Colmv transmission location according to an example of the present invention.
Detailed Description
The present invention will be described in further detail with reference to specific examples, but embodiments of the present invention are not limited thereto.
Before describing the present invention, the technical terms related to the present invention will be explained first.
AV1 (AOMedia Video 1): a video codec format.
LCU (largest coding unite): and a maximum coding unit.
MV (Motion Vector): motion vectors.
Colmv, co-located motion vectors.
AXI, advanced eXtensible Interface (advanced extensible interface), which is an interface protocol defined by Arm, is contained in the advanced microcontroller bus architecture AMBA standard.
The following continues to describe the specific process of the method for implementing Colmv data compression in combination with LCU partitioning of the present invention.
With reference to fig. 1 and fig. 2, the present invention provides a method for implementing Colmv data compression in combination with LCU partitioning, including:
s100, acquiring a current LCU with the size of 64x64 and partition information carried by the current LCU;
the division information of the current LCU refers to division information acquired in a division mode specified by an AV1 standard protocol, and comprises horizontal division and vertical division; AV1 standard protocol supports 1:4 and 4:1 rectangular division mode and T-shaped division mode; the lowest division scale of the AV1 standard protocol is 4×4. The partition information indicates whether a partition operation exists for the 64x64 current LCU.
S200, respectively calculating a first AXI transmission time required by dividing the current LCU according to the mode that the size of each sub-block is 8x8, and transmitting the divided sub-blocks in a burst mode, and a second AXI transmission time required by compressing and transmitting the divided sub-blocks in a burst mode if the current LCU is divided according to the dividing information;
the first AXI transmission times and the second AXI transmission times are all the AXI transmission times required by burst transmission of the Colmv data of the divided sub-blocks.
S300, if the second AXI transmission times are larger than the first AXI transmission times, dividing the current LCU according to the mode that the size of each sub-block is 8x8 to obtain a first sub-block, and directly transmitting the first sub-block;
noteworthy are: colmv data transmitted over AXI as a sub-block, whether a first sub-block or a second sub-block. The first and second AXI transmission times are for distinguishing between the first AXI transmission times and the second AXI transmission times, and do not represent an order. AXI transfer times refer to the total number of times required for burst transfers over the AXI bus.
S400, if the second AXI transmission times are not larger than the first AXI transmission times, dividing the current LCU according to the dividing information to obtain a second sub-block, and compressing and transmitting the second sub-block.
Noteworthy are: there are flat areas in the video image, so there are cases where the motion data of multiple 8x8 blocks in the LCU are highly consistent. For an LCU of size 64x64, if transmission of Colmv data is performed in a conventional manner, 64 Colmv data of 8x8 blocks need to be transmitted. If the current division mode of the LCU with the size of 64x64 is considered, there are less than 64 Colmv data, less than 64 Colmv data are transmitted, the Colmv data are input into the DDR through the AXI bus for subsequent decoding operation, and the Colmv data transmitted by the AXI are reduced, so that the transmission data bandwidth is reduced.
In a specific embodiment of the present invention, calculating, in S200, the first AXI transmission number required to divide the current LCU in such a way that each sub-block has a size of 8x8, and burst transmitting the divided sub-blocks includes:
s211, if the current LCU is divided in a mode that the size of each sub-block is 8x8, obtaining 64 first sub-blocks of 8x 8;
s212, determining the Colmv data bit width P bit of each first sub-block and the byte number X of each transmission data; the number of bytes is the number of bytes of data in each data transfer;
s213, calculating the first AXI transmission times M of the 64 first sub-blocks needing burst transmission according to the Colmv data bit width P bit of each first sub-block and the byte number X of each transmission data;
wherein, X P bits are transmitted in each burst, and the data bandwidths of the first sub-blocks of the 64 8X8 are: p X M. The burst transmission is a transmission mode of data transmission, which means that a plurality of data adjacent to an address are continuously transmitted for a period of time.
In a specific embodiment of the present invention, if the calculating in S200 divides the current LCU according to the dividing information, and compresses and burst-transmits the second AXI transmission times required for the divided sub-blocks includes:
s221, if the current LCU is divided according to the dividing information, obtaining each second sub-block;
s222, determining the data bit width Q bits of each second sub-block and the byte number Y of each compressed transmission data;
the data bit width Q of each second sub-block includes a Colmv data bit width of one 8×8 block after compression, a compression flag bit of 1bit, a bit width of each second sub-block size, and a bit width of each second sub-block position.
S213, according to the data bit width Q bits of each second sub-block and the byte number Y of each compressed transmission data, calculating the second AXI transmission times N required by compressing and burst transmitting the second sub-block. The data bandwidth after all the second sub-blocks are transmitted is as follows: q x Y x N.
From the data bandwidths required for the first sub-block and the second sub-block to be transmitted, the bandwidth of a 64x64 LCU is reduced in efficiency according to the method of the present invention by: (P X M-Q Y N)/(P X M).
In a specific embodiment of the present invention, compressing the second sub-block before transmitting in S400 includes:
sequentially compressing all the second sub-blocks to obtain compressed data of the current LCU;
adding a data head before compressing the data to obtain a transmission data packet of the current LCU;
and inputting the transmission data packet of the current LCU into the DDR through an AXI bus.
Noteworthy are: the header is a new string of data that is appended before each 64x64 size LCU compresses the data, including the number of valid colmv's of 64x64 size and the position of each colmv in one axi transmission.
The details of the apparatus for implementing Colmv data compression in combination with LCU partitioning according to the present invention will be described further below.
The invention provides a device for realizing Colmv data compression by combining LCU division, which comprises: a processing device for transmitting data over an AXI bus with a DDR, said processing device for processing the steps of:
s100, acquiring a current LCU with the size of 64x64 and partition information carried by the current LCU;
s200, respectively calculating a first AXI transmission time required by dividing the current LCU according to the mode that the size of each sub-block is 8x8, and transmitting the divided sub-blocks in a burst mode, and a second AXI transmission time required by compressing and transmitting the divided sub-blocks in a burst mode if the current LCU is divided according to the dividing information;
s300, if the second AXI transmission times are larger than the first AXI transmission times, dividing the current LCU according to the mode that the size of each sub-block is 8x8 to obtain a first sub-block, and directly transmitting the first sub-block;
s400, if the second AXI transmission times are not larger than the first AXI transmission times, dividing the current LCU according to the dividing information to obtain a second sub-block, and compressing and transmitting the second sub-block.
The implementation process of the processing device in the apparatus is consistent with the implementation process of the method of the present invention, and the present invention is not repeated here.
The invention is described below by way of example in the actual process of a method and apparatus for implementing Colmv data compression in combination with LCU partitioning.
This embodiment applies to Colmv data transfer of a 64x64 size LCU in a chip hardware implemented AV1 decoder. Data is transmitted over an AXI bus that is 128bits wide.
The core idea of the invention is to acquire the division information of the LCU with the current 64x64 size, judge whether the current LCU is divided according to the division information, namely the specific processes of the invention S200 to S400 determine whether the current LCU is divided according to the division information or the division of 8x 8. If the current LCU is divided according to the division information, the division operation of the current LCU with the size of 64x64 is executed, whether the compression operation is carried out or not is further judged, and otherwise, the calculation of the LCU with the size of 64x64 is skipped.
The Colmv data bit width of each 8X8 sub-block is obtained, the P bit is set, the byte number of each data transmission is calculated, the X number is set, the data transmission number of one burst transmission is calculated, and the M number is set. In this example, the Colmv data bit width of each 8X8 sub-block is 29bits, and includes Colmv reference information data of 3bits and Colmv data information of 26bits, and x= |128bits/29 bits|128/29|4, and m= |64/4|=16.
The method comprises the steps of obtaining the number of dividing blocks according to dividing information of the LCU with the current 64x64 size, setting the number of the dividing blocks as S, setting data and data bit width of the proper dividing blocks as Qbits, calculating the byte number of each data transmission, setting Y, calculating the data transmission number of one burst transmission, and setting N times. And setting proper head data and data bit width for each LCU with 64x64 size, wherein the bit width is set as hbits. The Colmv data bit width of each divided block in this example is 42bits, and includes Colmv reference information data of 3bits, colmv data information of 26bits, position information of 6bits of divided blocks, size information of 6bits of divided blocks, and compression identifier of 1 bit. The number of dividing blocks in this example is 17. The header data in this example is 8bits, including the effective number of Colmv of 4bits and the position information of each Colmv of 4bits in one transmission.
Since header data of each LCU of 64x64 size is output together with Colmv data of the divided blocks, it is necessary to represent a transmission position of the Colmv data of each divided block in the header data as shown in fig. 3 below.
The header data is output together with Colmv data, in this example, |128-8/(42) |=2, |128/42|=3, thus y=3, and s=17, thus n=6.
The Colmv position information in the header data is only the position information of Colmv in one transmission, so the 1,2 position of the first transmission of each LCU with 64x64 size in the transmission process is Colmv, and the 0, 1,2 positions of the rest N-1 transmissions represent the transmission position of Colmv.
Finally, by comparing the sizes of N and M, judging whether the Colmv data of the current LCU with the size of 64x64 divided is compressed and then transmitted. If N < M, the Colmv data of the current LCU with the size of 64x64 is compressed and output to the DDR in N times by Y Qbits of Colmv data each time, and the header information of the hbbits contains the number and transmission position of the current Colmv. If n=m, the current Colmv data is not compressed, and the current 64X 64-sized Colmv data is sent to the AXI bus M times, X pieces of Pbits Colmv data each time, and finally stored in the DDR for subsequent decoding prediction.
If Colmv data of the current 64x64 size LCU is compressed, the data bandwidth compression rate is: (P X M-Q Y N)/(P X M)
The calculated n=6, m=16, N < m in this example, so Colmv data of the current LCU of 64x64 size is compression-transmitted.
The Colmv data bandwidth without compression processing is: p X m=30 bits 4X 16=1920 bits; the data bandwidth for compression is: q x Y x n=42bits x3 x 6=756 bits; the data compression rate is: (P X M-Q Y X M)/(P X M) = ((30 bits 4X 16) - (42 bits 3X 6))/(30 bits 4X 16) = (1920-756)/1920=0.606. The data bandwidth of the current 64x64 size LCU after compression is reduced by 60.6% from the data bandwidth of the current 64x64 size LCU.
In summary, the present invention proposes a method and apparatus for implementing Colmv data compression in combination with LCU partitioning, which transmits Colmv data with the number of partitioning blocks to a 64x64 size LCU having partitioning operation, and reduces the amount of Colmv data, thereby reducing the data bandwidth of Colmv data transmitted from AXI to DDR, and improving access efficiency of DDR.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present invention, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.
Although the present application has been described herein in connection with various embodiments, other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from a review of the figures, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the "a" or "an" does not exclude a plurality.
The foregoing is a further detailed description of the invention in connection with the preferred embodiments, and it is not intended that the invention be limited to the specific embodiments described. It will be apparent to those skilled in the art that several simple deductions or substitutions may be made without departing from the spirit of the invention, and these should be considered to be within the scope of the invention.

Claims (10)

1. A method for implementing Colmv data compression in combination with LCU partitioning, comprising:
s100, acquiring a current LCU with the size of 64x64 and partition information carried by the current LCU;
s200, respectively calculating a first AXI transmission time required by dividing the current LCU according to the mode that the size of each sub-block is 8x8, and transmitting the divided sub-blocks in a burst mode, and a second AXI transmission time required by compressing and transmitting the divided sub-blocks in a burst mode if the current LCU is divided according to the dividing information;
s300, if the second AXI transmission times are larger than the first AXI transmission times, dividing the current LCU according to the mode that the size of each sub-block is 8x8 to obtain a first sub-block, and directly transmitting the first sub-block;
s400, if the second AXI transmission times are not larger than the first AXI transmission times, dividing the current LCU according to the dividing information to obtain a second sub-block, and compressing and transmitting the second sub-block.
2. The method for implementing Colmv data compression in combination with LCU partitioning according to claim 1, wherein calculating the first AXI transmission times required if the current LCU is partitioned in such a way that each sub-block has a size of 8x8 in S200, and burst-transmitting the partitioned sub-blocks, comprises:
s211, if the current LCU is divided in a mode that the size of each sub-block is 8x8, obtaining 64 first sub-blocks of 8x 8;
s212, determining the Colmv data bit width P bit of each first sub-block and the byte number X of each transmission data;
s213, calculating the first AXI transmission times M of the 64 first sub-blocks needing burst transmission according to the Colmv data bit width P bit of each first sub-block and the byte number X of each transmission data;
wherein X P bits are transmitted per burst.
3. The method for implementing Colmv data compression in combination with LCU partitioning according to claim 2, wherein the data bandwidths of the first 64 8x8 sub-blocks after transmission are: p X M.
4. The method for implementing Colmv data compression in combination with LCU partitioning according to claim 1, wherein calculating in S200 the second AXI transmission times required if the current LCU is partitioned according to the partitioning information, and the partitioned sub-blocks are compressed and burst-transmitted comprises:
s221, if the current LCU is divided according to the dividing information, obtaining each second sub-block;
s222, determining the data bit width Q bits of each second sub-block and the byte number Y of each compressed transmission data;
s213, according to the data bit width Q bits of each second sub-block and the byte number Y of each compressed transmission data, calculating the second AXI transmission times N required by compressing and burst transmitting the second sub-block.
5. The method for implementing Colmv data compression in combination with LCU partitioning according to claim 4, wherein the data bandwidths of all second sub-blocks after transmission are: q x Y x N.
6. The method for implementing Colmv data compression in combination with LCU partitioning according to claim 1, wherein the partitioning information of the current LCU refers to partitioning information obtained in a partitioning manner specified by AV1 standard protocol, including horizontal partitioning and vertical partitioning; AV1 standard protocol supports 1:4 and 4:1 rectangular division mode and T-shaped division mode; the lowest division scale of the AV1 standard protocol is 4×4.
7. The method for implementing Colmv data compression in combination with LCU partitioning according to claim 1, wherein the data bit width Q of each second sub-block comprises a Colmv data bit width of 8x8 blocks after compression, a compression flag bit of 1bit, a bit width of each second sub-block size, and a bit width of each second sub-block position.
8. The method for implementing Colmv data compression in combination with LCU partitioning according to claim 1, wherein the burst transmission is a transmission mode of data transmission, which means that a plurality of data adjacent to an address are continuously transmitted for a period of time.
9. The method of claim 1, wherein compressing and then transmitting the second sub-block in S400 comprises:
sequentially compressing all the second sub-blocks to obtain compressed data of the current LCU;
adding a data head before compressing the data to obtain a transmission data packet of the current LCU;
and inputting the transmission data packet of the current LCU into the DDR through an AXI bus.
10. An apparatus for implementing Colmv data compression in combination with LCU partitioning, comprising: a processing device for transmitting data over an AXI bus with a DDR, said processing device for processing the steps of:
s100, acquiring a current LCU with the size of 64x64 and partition information carried by the current LCU;
s200, respectively calculating a first AXI transmission time required by dividing the current LCU according to the mode that the size of each sub-block is 8x8, and transmitting the divided sub-blocks in a burst mode, and a second AXI transmission time required by compressing and transmitting the divided sub-blocks in a burst mode if the current LCU is divided according to the dividing information;
s300, if the second AXI transmission times are larger than the first AXI transmission times, dividing the current LCU according to the mode that the size of each sub-block is 8x8 to obtain a first sub-block, and directly transmitting the first sub-block;
s400, if the second AXI transmission times are not larger than the first AXI transmission times, dividing the current LCU according to the dividing information to obtain a second sub-block, and compressing and transmitting the second sub-block.
CN202311295495.0A 2023-10-08 2023-10-08 Method and device for realizing Colmv data compression by combining LCU division Pending CN117319651A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311295495.0A CN117319651A (en) 2023-10-08 2023-10-08 Method and device for realizing Colmv data compression by combining LCU division

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311295495.0A CN117319651A (en) 2023-10-08 2023-10-08 Method and device for realizing Colmv data compression by combining LCU division

Publications (1)

Publication Number Publication Date
CN117319651A true CN117319651A (en) 2023-12-29

Family

ID=89249579

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311295495.0A Pending CN117319651A (en) 2023-10-08 2023-10-08 Method and device for realizing Colmv data compression by combining LCU division

Country Status (1)

Country Link
CN (1) CN117319651A (en)

Similar Documents

Publication Publication Date Title
CN105120293B (en) Image collaboration coding/decoding method and device based on CPU and GPU
US7782961B2 (en) DVC delta commands
US7129860B2 (en) System and method for performing scalable embedded parallel data decompression
US6108584A (en) Multichannel digital audio decoding method and apparatus
CN103229508B (en) Picture coding device and method for encoding images
US20010054131A1 (en) System and method for perfoming scalable embedded parallel data compression
EP2120447A1 (en) Information processing device and method
WO1995014350A1 (en) Quadtree-structured walsh transform coding
JP2002330410A (en) Signal processing unit and signal processing method
JPH0844535A (en) Adaptive bit-stream demultiplexing device for decoding system
JP2006524858A (en) Data processing apparatus using compression on data stored in memory
CN111953991A (en) Video CPU + GPU hardware decoding acceleration system and method based on window platform
CN104243886B (en) A kind of high speed image parsing and video generation method based on plug-in part technology
US8238434B2 (en) Apparatus and method for processing wavelet information
CN117319651A (en) Method and device for realizing Colmv data compression by combining LCU division
CN112290953A (en) Array encoding apparatus and method for multichannel data stream, array decoding apparatus and method
US20100135415A1 (en) Apparatus and method of lossless compression/restoration of selective image information
JP4100836B2 (en) Image processing device
CN108876703B (en) Data storage method
CN112689223A (en) Voice playing system and method for automobile combination instrument
CN101257590B (en) Coding, decoding method and device, display system
JP4181701B2 (en) Image processing device
CN116600129B (en) Method, system and device for optimizing video decoding bandwidth
US20100254618A1 (en) Method for Accessing Image Data and Related Apparatus
JPH0936749A (en) Coding decoding device and coding method used for it

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination