CN103369326B - Be suitable to the transform coder of high-performance video coding standard HEVC - Google Patents

Be suitable to the transform coder of high-performance video coding standard HEVC Download PDF

Info

Publication number
CN103369326B
CN103369326B CN201310283390.3A CN201310283390A CN103369326B CN 103369326 B CN103369326 B CN 103369326B CN 201310283390 A CN201310283390 A CN 201310283390A CN 103369326 B CN103369326 B CN 103369326B
Authority
CN
China
Prior art keywords
data
coefficient
eeeo
achieve
try
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.)
Active
Application number
CN201310283390.3A
Other languages
Chinese (zh)
Other versions
CN103369326A (en
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 CN201310283390.3A priority Critical patent/CN103369326B/en
Publication of CN103369326A publication Critical patent/CN103369326A/en
Application granted granted Critical
Publication of CN103369326B publication Critical patent/CN103369326B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Complex Calculations (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention discloses a kind of transform coder being suitable to high-performance video coding standard HEVC, mainly solve multiplier in prior art and use too much, the problem that circuit is complicated.Comprising: one-dimensional DCT module (1), transposition buffer module (2) and top layer control module (3), wherein one-dimensional DCT module (1) adopts the various dct transforms that multiple butterfly processing element and multiple strange coefficient processing unit complete in HEVC standard, this strange coefficient processing unit, by complicated multiplication operation being decomposed to multi-level pmultistage circuit and using shift unit, adder and subtractor to realize, namely stages shift device, adder and subtractor is used to substitute matrix multiplier, to simplify circuit structure.It is regular that the present invention has simple in construction, and reusing degree is high, and critical path is short, and clock frequency is high, it is easy to integrated advantage, can realize the transition coding to video residual error data efficiently when not using multiplier.

Description

Be suitable to the transform coder of high-performance video coding standard HEVC
Technical field
The invention belongs to electronic circuit technology field, be specifically related to the transform coder structure in video compression coding standard HEVC, can be applicable to VLSI designs.
Background technology
It is known that along with the development of electronics and information industry, the application of digital video technology has become increasingly extensive.But, along with the continuous lifting of image resolution ratio, the data volume of its correspondence also increases therewith.Contradiction between these mass data and hard-disk capacity and channel capacities also seems and becomes increasingly conspicuous.Thus, existing compression algorithm is proposed huge challenge by High Data Rate, big data quantity problem, becomes a big bottleneck of extension high-resolution video application.How to reduce data volume when not losing or do not lose information as far as possible and have become as the problem that people are studying.Therefore, many image/video compression algorithms are proposed in succession by people.
Wherein, HEVC, as up-to-date video compression coding standard, which employs a lot of efficient image compression algorithm.Relative to H.264 video compression coding standard, it have employed finer tree-shaped partitioned organization so that the piecemeal of image is finer;And the size of basic block is also increased to 64 × 64 by the 16 × 16 of H.264 middle employing so that it is be more suitable for the compression of big image.But while obtaining higher compression efficiency, the computational complexity of its correspondence is also greatly increased.Lifting along with basic block size, the size of HEVC converter unit also increases therewith, and it need to support 4 × 4,8 × 8,16 × 16 and 32 × 32 4 kinds of dct transforms so that the multiplier number in its corresponding circuits sharply increases, translation circuit becomes sufficiently complex, becomes a hard-wired difficult point.Thus, design an efficient transform coder and seem particularly significant.
So far, in order to reduce the multiplier number in transition coding module, reduce transition coding module complexity, it has been suggested that transition coding structure mainly have following two:
The first is the structure that the part butterfly adopted in HEVC test model combines with matrix multiplier, it makes use of the symmetry of basic matrix in transition coding, decreases the multiplier number of 3 times.This structure is made up of four butterfly structures and four matrix multipliers.Wherein, butterfly structure is made up of a series of adders and subtractor, after butterfly structure, computing is divided into two parts, even segments and odd number part, this odd number part completes to calculate by the translation circuit that multiplexing transform block size is less, and this even segments is then use matrix multiplier to be calculated.Although this structure passes through optimization, but in its matrix multiplier, the number of multiplier is still a lot, and not easily hardware realizes.
The second is the patent application " being suitable to the transform coder of HEVC standard " (number of patent application 201210251115.9, publication number CN102857756A) that Xian Electronics Science and Technology University proposes.A kind of transform coder being suitable to HEVC standard of this Invention Announce, is mainly used in solving part butterfly and uses too much problem with multiplier in matrix multiplier combined structure.This structure includes one-dimensional DCT/DST module, transposition buffer module and topside control unit.Wherein, one-dimensional DCT/DST module, in conjunction with butterfly structure and matrix multiplication array, completes the various transition codings of HEVC;Transposition buffer module utilizes the storage different with memorizer in the path delay between depositor and reading order, completes the transposition operation of transform data;Topside control unit produces the reset of one-dimensional DCT/DST module and transposition buffer module and enables signal, controls the work of each module coordination.But the one-dimensional transform module in this structure still to use 48 multipliers, and its circuit structure is more complicated, is unfavorable for that hardware-efficient realizes, and its clock cycle required when realizing relatively large transition coding is also long.
Summary of the invention
Present invention aims to the deficiency of above-mentioned prior art, a kind of transform coder being suitable to high-performance video coding standard HEVC is proposed, to reduce the complexity of circuit structure, reduce the clock cycle required during transition coding, being prone to hardware realize, the high-performance meeting HEVC coding standard realizes requirement.
Realizing the object of the invention technical thought is: by part butterfly is decomposed with the matrix multiplication operation in matrix multiplier combined structure, the operation of the multiplication of its complexity is decomposed to multi-level pmultistage circuit complete, namely operation is completed by simple shift unit and adder, the computational complexity making every stage circuit is substantially reduced, thus shortening critical path, improve clock frequency and the code efficiency of transition coding circuit, finally give a transform coder being suitable to high-performance video coding standard HEVC not comprising multiplier.
According to above-mentioned thinking, the transform coder of the present invention includes: one-dimensional DCT module, transposition buffer module and top layer control module, the data output end of this one-dimensional DCT module is connected with the data input pin of transposition buffer module, and data input pin is connected with the data output end of transposition buffer module;This top layer controls module and is connected with the reset terminal of one-dimensional DCT module, Enable Pin and the reset terminal of transposition buffer module, Enable Pin respectively, it is characterised in that:
Described one-dimensional DCT module, including:
32 butterfly processing elements, for completing the operation coefficient to be transformed of input being added between two and subtracting each other between two, and will add up 16 data obtaining of operation and input to 16 butterfly processing elements, 16 data phase reducing obtained input to 32 strange coefficient processing unit;
16 butterfly processing elements, for completing the operation that 16 data of 32 butterfly processing element inputs are added between two and are subtracted each other between two, and will add up 8 data obtained and input to 8 butterfly processing elements, input to 16 strange coefficient processing unit by subtracting each other 8 data obtained;
32 strange coefficient processing unit, for obtain 16 data by the input of 32 butterfly processing elements and these 16 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 16 groups different, be added, subtract each other, try to achieve 16 transform datas, and input to transposition buffer module;
8 butterfly processing elements, for completing the operation that 8 data of 16 butterfly processing element inputs are added between two and are subtracted each other between two, and will add up 4 data obtained and input to 4 butterfly processing elements, input to 8 strange coefficient processing unit by subtracting each other 4 data obtained;
16 strange coefficient processing unit, for obtain 8 data by the input of 16 butterfly processing elements and these 8 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 8 groups different, be added, subtract each other, try to achieve 8 transform datas, and input to transposition buffer module;
4 butterfly processing elements, for completing 4 data of 8 butterfly processing element inputs are added between two and are subtracted each other between two, and will add up 2 data obtained and input to 4 even coefficient processing unit, input to 4 strange coefficient processing unit by subtracting each other 2 data obtained;
8 strange coefficient processing unit, for obtain 4 data by the input of 8 butterfly processing elements and these 4 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 4 groups different, be added, subtract each other, try to achieve 4 transform datas and input to transposition buffer module;
4 even coefficient processing unit, have been used for 2 data of 4 butterfly processing elements input are postponed, and shifter-adder, the operation subtracted each other, try to achieve 2 transform datas and input to transposition buffer module;
4 strange coefficient processing unit, for obtain 2 data by the input of 4 butterfly processing elements and these 2 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 2 groups different, be added, subtract each other, try to achieve 2 transform datas and input to transposition buffer module;
Reset and enable control unit, control module with top layer and be connected, control the reset of module output for receiving top layer and enable signal, and according to the reset of unit resetted and enable in the signal one-dimensional DCT module of control and enable.
The present invention compared with prior art has the advantage that
First, present invention employs unified conversion and realize structure, it is possible to use same encoder circuit completes the dct transform of 4 kinds of different masses sizes, thus improve the extent for multiplexing of circuit, being greatly reduced circuit scale;
Second, the one-dimensional DCT module that the present invention adopts, complete by complicated multiplying is assigned in multi-level pmultistage circuit, the strange coefficient processing unit not comprising multiplier is used to complete the multiplication operation of complexity, reduce the complexity in every stage circuit, improve system clock frequency, be more suitable for hardware and realize;
Accompanying drawing explanation
Fig. 1 is the population structure block diagram of transform coder of the present invention;
Fig. 2 is transposition buffer module structural representation of the present invention;
Fig. 3 is the structured flowchart of one-dimensional DCT module in the present invention;
Fig. 4 is structure and the connection diagram of 32 butterfly processing elements, 16 butterfly processing elements, 8 butterfly processing elements and 4 butterfly processing elements in the present invention;
Fig. 5 is the structure chart of 4 even coefficient processing unit in the present invention;
Fig. 6 is the structure chart of 4 strange coefficient processing unit in the present invention;
Fig. 7 is the structure chart that in the present invention, 8 dot factors are added subelement;
Fig. 8 is the structure chart that in the present invention, 16 dot factors are added subelement;
Fig. 9 is the structure chart that in the present invention, 32 dot factors are added subelement.
Detailed description of the invention
The present invention is to the improvement of one-dimensional transform structure in existing HEVC standard, it is possible to reduce the computational complexity of every grade of flowing water, improves system clock, and is easier to the Parallel Implementation of hardware.
Below in conjunction with drawings and Examples, the present invention is described in detail.
With reference to Fig. 1, the transform coder of the high-performance video coding standard HEVC of the present invention, controlled module 3 by one-dimensional DCT module 1, transposition buffer module 2 and top layer to constitute, wherein the output of top layer control module 3 is divided into two-way, the first via is connected with one-dimensional DCT module 1, and the second tunnel is connected with transposition buffer module 2;The input of the data input pin of one-dimensional DCT module 1 is divided into two-way, the first via and outside input data cube computation, and the second tunnel is connected with the data output end of transposition buffer module 2;The data output end of one-dimensional DCT module 1 is connected with the data input pin of transposition buffer module 2;The data input pin of transposition buffer module 2 is connected with the data output end of one-dimensional DCT module 1, and the output of the data output end of transposition buffer module 2 is divided into two-way, and the first via is connected with the data input pin of one-dimensional DCT module 1, and the second tunnel is connected with outside outfan.Wherein:
Described top layer controls module 3, module 30 and data flow control module 31 is enabled including resetting, the enable that resets module 30 enables unit 20 with the transposition reset enabling control unit 19 and transposition buffer module 2 that resets of one-dimensional DCT module 1 respectively and is connected, and enables and reset signal for the offer of the two module;Data flow control module 31 is connected with the address control unit 22 of transposition buffer module 2, is used for producing control signal, controls read-write mode and the read-write order of transposition buffer module 2.This reset enables module 30 and data flow control module 31 and constitutes by enumerator and logic circuit, for the count status according to enumerator and the alternative types that currently carries out, the reset of one-dimensional DCT module 1 is produced by logic circuit, enable the reset with transposition buffer module 2, enable, data flow con-trol signal, control the one-dimensional DCT module 1 input data to transform coder and carry out one-dimensional line translation, and produce control signal and control transposition buffer module 2 and receive the line translation result of one-dimensional DCT module 1, after All Datarows has processed, control transposition buffer module 2 and the line translation result output after transposition is carried out one-dimensional rank transformation to one-dimensional DCT module 1.
With reference to Fig. 2, described transposition buffer module 2, reset including transposition and enable unit 20, RAM memory 21 and address control unit 22, transposition reset enables unit 20 and is made up of logic circuit, control, for receiving top layer, reset, the enable signal that module 3 sends, and produce reset and the enable of control signal control RAM memory 21 and address control unit 22;RAM memory 21 is made up of 8 memory arrays, and each memory array is all connected with one-dimensional DCT module 1;Address control unit 22 is connected with the address end of each memory array in RAM memory 21, for producing input and output enable and the I/O Address of each memorizer, realize being stored in 8 memory arrays the dct transform result that one-dimensional DCT module 1 inputs respectively, then the operation exported row wise or column wise.
Described one-dimensional DCT module 1, has been used for 4 DCT in HEVC standard, 8 DCT, 16 DCT and 32 DCT one-dimensional transforms, and its structure is as shown in Figure 3.
With reference to Fig. 3, one-dimensional DCT module 1, including 32 butterfly processing elements 10,16 butterfly processing elements 11,32 strange coefficient processing unit, 13,16 strange coefficient processing unit 14 of 12,8 butterfly processing elements, 4 butterfly processing elements 15,8 strange coefficient processing unit, 17,4 strange coefficient processing unit 18 of 16,4 even coefficient processing unit, reset and enable control unit 19, wherein:
Described reset enables control unit 19, it is made up of logic circuit, its unit enabling unit 30 and one-dimensional DCT module 1 that resets controlling module 3 with top layer is connected, control the reset of module 3 output for receiving top layer and enable signal, and controlling reset and the enable of unit in whole one-dimensional DCT module 1 according to resetting and enabling signal.
Described 32 butterfly processing elements 10, are made up of 16 adders and 16 subtractors, and these 16 adders are connected with 16 butterfly processing elements 11, and these 16 subtractors and 32 strange coefficient processing unit 12 are connected, as shown in Figure 4.
32 data inputted from one-dimensional DCT module 1 input are carried out head and the tail and sue for peace between two by these 16 adders, namely try to achieve the 1st data and the 32nd data sum E0, then ask the 2nd data and the 31st data sum E1, and so on, try to achieve the 16th data and the 17th data sum E15, and 16 the addition result E that will try to achieve0~E15Input to 16 butterfly processing elements 11;
32 coefficients inputted from one-dimensional DCT module 1 input are carried out head and the tail and ask poor between two by these 16 subtractors, namely try to achieve the difference O of the 1st data and the 32nd data0, then try to achieve the difference O of the 2nd data and the 31st data1, and so on, try to achieve the difference O of the 16th data and the 17th data15, and subtract each other result O by try to achieve 160~O15Input to 32 strange coefficient processing unit 12.
Described 16 butterfly processing elements 11, are made up of 8 adders and 8 subtractors, and these 8 adders are connected with 8 butterfly processing elements 13, and these 8 subtractors and 16 strange coefficient processing unit 14 are connected, as shown in Figure 4.
These 8 adders data E to being inputted by 32 butterfly processing elements 100~E15Carry out head and the tail to sue for peace between two, namely try to achieve E0With E15Sum EE0, then try to achieve E1With E14Sum EE1, and so on, try to achieve E7With E8Sum EE7, and 8 the addition result EE that will try to achieve0~EE7Input to 8 butterfly processing elements 13;
These 8 subtractors are to data E0~E15Carry out head and the tail and ask poor between two, namely try to achieve E0With E15Difference EO0, then try to achieve E1With E14Difference EO1, and so on, try to achieve E7With E8Difference EO7, and subtract each other result EO by try to achieve 80~EO7Input to 16 strange coefficient processing unit 14.
Described 8 butterfly processing elements 13, are made up of 4 adders and 4 subtractors, and these 4 adders and 4 butterfly processing elements 15, these 4 subtractors and 8 strange coefficient processing unit 16 are connected, as shown in Figure 4.
These 4 adders data EE to being inputted by 16 butterfly processing elements 110~EE7Carry out head and the tail to sue for peace between two, namely try to achieve EE0With EE7Sum EEE0, then try to achieve EE1With EE6Sum EEE1, and so on, try to achieve and EE3With EE4Sum EEE3, 4 addition result EEE will trying to achieve0~EEE3Input to 4 butterfly processing elements 15;
These 4 subtractors are to data EE0~EE7Carry out head and the tail and ask poor between two, namely try to achieve EE0With EE7Difference EEO0, then try to achieve EE1With EE6Difference EEO1, and so on, try to achieve also, and EE3With EE4Difference EEO3Result EEO is subtracted each other by try to achieve 40~EEO3Input to 8 strange coefficient processing unit 16.
Described 4 butterfly processing elements 15, are made up of 2 adders and 2 subtractors, and these 2 adders and 4 even coefficient processing unit 17, these 2 subtractors and 4 strange coefficient processing unit 18 are connected, as shown in Figure 4.
These 2 adder data EEE in the hope of being inputted by 8 butterfly processing elements 130With EEE3Sum EEEE0, and the data EEE of input1With EEE2Sum EEEE1, and these 2 the addition result EEEE that will try to achieve0、EEEE1Input to 4 even coefficient processing unit 17;
These 2 subtractors data EEE in the hope of input0With EEE3Difference EEEO0, and the data EEE of input1With EEE2Difference EEEO1, and subtract each other result EEEO by try to achieve 20、EEEO1Input to 4 strange coefficient processing unit 18.
With reference to Fig. 5, described 4 even coefficient processing unit 17, constituted by postponing subelement 170,2 butterfly computation subelements 171 and displacement subelement 172;
This delay subelement 170, to the data EEEE inputted by 4 butterfly processing elements 150With EEEE1Carry out the delay of 2 clock cycle, obtain delayed data EEEE0_0With EEEE1_0, and these 2 data are sent into 2 butterfly computation subelements 171;
These 2 butterfly computation subelements 171, are made up of 1 adder and 1 subtractor, for the delayed data EEEE postponing subelement 170 input0_0With EEEE1_0Carry out respectively being added and subtracting each other, obtain summarized information EEEEE and subtract each other data EEEEO feeding displacement subelement 172;
This displacement subelement 172, is made up of 2 shift units, for data EEEEE and the EEEEO inputted by 2 butterfly computation subelements 171 is moved to left 6, and by 2 Fruiting coefficient tried to achieve output to transposition buffer module 2.
With reference to Fig. 6, described 4 strange coefficient processing unit 18, it is added subelement 181 is constituted by 14 dot factor operator unit 180 and 24 dot factors;
This 4 dot factor operator unit 180, is made up of depositor, shift unit and adder cascade, has been used for the data EEEO inputted by 4 butterfly processing elements 150、EEEO1Postpone, obtain retardation coefficient EEEO0_0、EEEO1_0, and try to achieve EEEO respectively0With EEEO0, and EEEO1With EEEO1Self move to left the data sum after not coordination, it may be assumed that
Try to achieve EEEO0With EEEO0Self move to left the data sum after 1, obtain the first summation coefficient EEEO of 40_1,
Try to achieve EEEO1With EEEO1Self move to left the data sum after 1, obtain the second summation coefficient EEEO of 41_1,
Try to achieve EEEO0With EEEO0Self move to left the data sum after 2, obtain the 3rd summation coefficient EEEO of 40_2,
Try to achieve EEEO1With EEEO1Self move to left the data sum after 2, obtain the 4th summation coefficient EEEO of 41_2,
Again these retardation coefficients and summation coefficient are inputed to each 4 dot factors and be added subelement 181;
Each 4 dot factors are added subelement 181, are made up of shift unit, adder and subtractor cascade, for trying to achieve a Fruiting coefficient of dct transform, namely divide 3 grades of two retardation coefficient EEEO to 4 dot factor operator unit 180 inputs0_0, EEEO1_0, and four summation coefficient EEEO0_1, EEEO0_2, EEEO1_1, EEEO1_2Merge, wherein:
1st grade, be carry out respectively following three system numbers once merging simultaneously:
First group is by EEEO0_0And EEEO1_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, first of obtain at 4 the 1st grade merges coefficient COE4_101
Second group is by EEEO0_1And EEEO1_1After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, second of obtain at 4 the 1st grade merges coefficient COE4_102
3rd group is by EEEO0_2And EEEO1_2After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of obtain at 4 the 1st grade merges coefficient COE4_103
2nd grade is that three the merging coefficients simultaneously tried to achieve the 1st grade carry out secondary merging respectively:
By first merging coefficient COE of the 1st grade of 44_101With second merging coefficient COE of the 1st grade of 44_102After moving to left respectively, then carrying out being added or subtracting each other, first of obtain at 4 the 2nd grade merges coefficient COE4_201
By the 3rd the merging coefficient COE of the 1st grade of 44_103Moving to left, second of obtain at 4 the 2nd grade merges coefficient COE4_202
3rd level is that two the merging coefficients tried to achieve the 2nd grade merge, by first merging coefficient COE of the 2nd grade of 44_201With second merging coefficient COE of the 2nd grade of 44_202After moving to left respectively, then carry out being added or subtracting each other, obtain the Fruiting coefficient COEFF of 44, and by this Fruiting coefficient COEFF of 44Output is to transposition buffer module 2.
Described 8 strange coefficient processing unit 16, are added subelement 161 are constituted by 18 dot factor operator unit 160 and 48 dot factors;
This 8 dot factor operator unit 160, is made up of depositor, shift unit and adder cascade, for the data EEO to 8 butterfly processing element 13 inputs0~EEO3Postpone respectively, obtain retardation coefficient EEO0_0~EEO3_0, and try to achieve data EEO respectively0~EEO3With this data EEO0~EEO3Self move to left the data sum after not coordination, it may be assumed that
Try to achieve EEO0With EEO0Self move to left the data sum after 1, obtain the first summation coefficient EEO of 80_1
Try to achieve EEO1With EEO1Self move to left the data sum after 1, obtain the second summation coefficient EEO of 81_1
Try to achieve EEO2With EEO2Self move to left the data sum after 1, obtain the 3rd summation coefficient EEO of 82_1
Try to achieve EEO3With EEO3Self move to left the data sum after 1, obtain the 4th summation coefficient EEO of 83_1
Try to achieve EEO0With EEO0Self move to left the data sum after 2, obtain the 5th summation coefficient EEO of 80_2
Try to achieve EEO1With EEO1Self move to left the data sum after 2, obtain the 6th summation coefficient EEO of 81_2
Try to achieve EEO2With EEO2Self move to left the data sum after 2, obtain the 7th summation coefficient EEO of 82_2
Try to achieve EEO3With EEO3Self move to left the data sum after 2, obtain the 8th summation coefficient EEO of 83_2
Coefficient of suing for peace these eight is sent into and is added subelement 161 to each 8 dot factors;
Each 8 dot factors are added subelement 161, are made up of shift unit, adder and subtractor cascade, for trying to achieve a Fruiting coefficient of dct transform, namely divide 4 grades of coefficient EEO to being inputted by 8 dot factor operator unit 1600_0~EEO3_0、EEO0_1~EEO3_1And EEO0_2~EEO3_2Carry out shifter-adder or displacement is subtracted each other, wherein:
1st grade, be carry out respectively following six system numbers once merging simultaneously:
First group is by EEO0_0And EEO1_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, first that obtains 8: 0 1st grades merges coefficient COE8_101
Second group is by EEO2_0And EEO3_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, second that obtains 8: 0 1st grades merges coefficient COE8_102
3rd group is by EEO0_1And EEO1_1After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd that obtains 8: 0 1st grades merges coefficient COE8_103
4th group is by EEO2_1And EEO3_1After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 4th that obtains 8: 0 1st grades merges coefficient COE8_104
5th group is by EEO0_2And EEO1_2After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 5th that obtains 8: 0 1st grades merges coefficient COE8_105
6th group is by EEO2_2And EEO3_2After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 6th that obtains 8: 0 1st grades merges coefficient COE8_106
2nd grade, be simultaneously the 1st grade is tried to achieve three combination and coefficient carry out secondary merging respectively:
First group is by COE8_101And COE8_102After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, first that obtains 8: 0 2nd grades merges coefficient COE8_201
Second group is by COE8_103And COE8_104After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, second that obtains 8: 0 2nd grades merges coefficient COE8_202
3rd group is by COE8_105And COE8_106After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd that obtains 8: 0 2nd grades merges coefficient COE8_203
3rd level is that three the merging coefficients simultaneously tried to achieve the 2nd grade carry out three merging respectively:
By first merging coefficient COE of 8: 0 2nd grades8_201With second merging coefficient COE of 8: 0 2nd grades8_202After moving to left respectively, then carrying out being added or subtracting each other, first that obtains 8 3rd levels merges coefficient COE8_301
By the 3rd the merging coefficient COE of 8: 0 2nd grades8_203Moving to left, second that obtains 8 3rd levels merges coefficient COE8_302
4th grade is that two merging coefficients that 3rd level is tried to achieve merge, by first merging coefficient COE of 8 3rd levels8_301Coefficient COE is merged with the second of 8 3rd levels8_302After moving to left respectively, then carry out being added or subtracting each other, obtain the Fruiting coefficient COEFF of 88, and by this Fruiting coefficient COEFF of 88Output is to transposition buffer module 2, as shown in Figure 7.
Described 16 strange coefficient processing unit 14, are added subelement 141 are constituted by 1 16 dot factor operator unit 140 and 8 16 dot factors;
This 16 dot factor operator unit 140, is made up of depositor, shift unit and adder cascade, for the data EO to 16 butterfly processing element 11 inputs0~EO7Postpone respectively, obtain retardation coefficient EO0_0~EO7_0, and try to achieve retardation coefficient EO respectively0~EO7With EO0~EO7Self move to left the data sum after not coordination, it may be assumed that
Try to achieve data EO0With EO0Self move to left the data sum after 1, obtain the first summation coefficient EO of 160_1
Try to achieve data EO1With EO1Self move to left the data sum after 1, obtain the second summation coefficient EO of 161_1
And so on;
Try to achieve data EO7With EO7Self move to left the data sum after 1, obtain the 8th summation coefficient EO of 167_1
Try to achieve data EO0With EO0Self move to left the data sum after 2, obtain the 9th summation coefficient EO of 160_2
Try to achieve data EO1With EO1Self move to left the data sum after 2, obtain the tenth summation coefficient EO of 161_2
And so on;
Try to achieve data EO7With EO7Self move to left the data sum after 2, obtain the 16th summation coefficient EO of 167_2
Coefficient of suing for peace these 16 is sent into and is added subelement 141 to each 16 dot factors;
Described 16 dot factors are added subelement 141, are made up of shift unit, adder and subtractor cascade, for trying to achieve a Fruiting coefficient of dct transform, namely divide 5 grades of coefficient EO to being inputted by 16 dot factor operator unit 1400_0~EO7_0、EO0_1~EO7_1And EO0_2~EO7_2Carry out shifter-adder or displacement is subtracted each other, wherein:
1st grade, be carry out respectively following 12 system numbers once merging simultaneously:
First group is by EO0_0And EO1_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, first of obtain at 16 the 1st grade merges coefficient COE16_101
Second group is by EO2_0And EO3_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, second of obtain at 16 the 1st grade merges coefficient COE16_102
3rd group is by EO4_0And EO5_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of obtain at 16 the 1st grade merges coefficient COE16_103
4th group is by EO6_0And EO7_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 4th of obtain at 16 the 1st grade merges coefficient COE16_104
5th group is by EO0_1And EO1_1After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 5th of obtain at 16 the 1st grade merges coefficient COE16_105
6th group is by EO2_1And EO3_1After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 6th of obtain at 16 the 1st grade merges coefficient COE16_106
And so on;
11st group is by EO4_2And EO5_2After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 11st of obtain at 16 the 1st grade merges coefficient COE16_111
12nd group is by EO6_2And EO7_2After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 12nd of obtain at 16 the 1st grade merges coefficient COE16_112
2nd grade, be that following six system numbers are carried out secondary merging respectively simultaneously:
First group is by COE16_101And COE16_102After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, first of obtain at 16 the 2nd grade merges coefficient COE16_201
Second group is by COE16_103And COE16_104After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, second of obtain at 16 the 2nd grade merges coefficient COE16_202
3rd group is by COE16_105And COE16_106After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of obtain at 16 the 2nd grade merges coefficient COE16_203
4th group is by COE16_107And COE16_108After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 4th of obtain at 16 the 2nd grade merges coefficient COE16_204
5th group is by COE16_109And COE16_110After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 5th of obtain at 16 the 2nd grade merges coefficient COE16_205
6th group is by COE16_111And COE16_112After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 6th of obtain at 16 the 2nd grade merges coefficient COE16_206
3rd level, is following three combinations coefficient are carried out three times respectively merge simultaneously:
First group is by COE16_201And COE16_202After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, first of the 3rd level obtaining at 16 merges coefficient COE16_301
Second group is by COE16_203And COE16_204After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, second of the 3rd level obtaining at 16 merges coefficient COE16_302
3rd group is by COE16_205And COE16_206After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of the 3rd level obtaining at 16 merges coefficient COE16_303
4th grade is that three the merging coefficients simultaneously 3rd level tried to achieve carry out four merging respectively:
Coefficient COE is merged by the first of the 3rd levels of 1616_301Second of 3rd level with 16 merges coefficient COE16_302After moving to left respectively, then carrying out being added or subtracting each other, first of obtain at 16 the 4th grade merges coefficient COE16_401
Coefficient COE is merged by the 3rd of the 3rd levels of 16 the16_303Moving to left, second of obtain at 16 the 4th grade merges coefficient COE16_402
5th grade is that two the merging coefficients tried to achieve the 4th grade merge, by first merging coefficient COE of the 4th grade of 1616_401With second merging coefficient COE of the 4th grade of 1616_402After moving to left respectively, then carry out being added or subtracting each other, obtain the Fruiting coefficient COEFF of 1616, and by this Fruiting coefficient COEFF of 1616Output is to transposition buffer module 2, as shown in Figure 8.
Described 32 strange coefficient processing unit 12, are added subelement 121 are constituted by 1 32 dot factor operator unit 120 and 16 32 dot factors;
This 32 dot factor operator unit 120, is made up of depositor, shift unit and adder cascade, for the data O to 32 butterfly processing element 10 inputs0~O15Postpone respectively, obtain retardation coefficient O0_0~O15_0, and try to achieve input data O respectively0~O15With this O0~O15Self move to left the data sum after not coordination, it may be assumed that
Try to achieve O0With O0Self move to left the data sum after 1, obtain the first summation coefficient O of 320_1
Try to achieve O1With O1Self move to left the data sum after 1, obtain the second summation coefficient O of 321_1
And so on;
Try to achieve O15With O15Self move to left the data sum after 1, obtain the 16th summation coefficient O of 3215_1
Try to achieve O0With O0Self move to left the data sum after 2, obtain the 17th summation coefficient O of 320_2
Try to achieve O1With O1Self move to left the data sum after 2, obtain the 18th summation coefficient O of 321_2
And so on;
Try to achieve O15With O15Self move to left the data sum after 2, obtain the 32nd summation coefficient O of 3215_2
Try to achieve O0With O0Self move to left the data sum after 3, obtain the 33rd summation coefficient O of 320_3
Try to achieve O1With O1Self move to left the data sum after 3, obtain the 34th summation coefficient O of 321_3
And so on;
Try to achieve O15With O15Self move to left the data sum after 3, obtain the 48th summation coefficient O of 3215_3
Coefficient of suing for peace these 48 is sent into and is added subelement 121 to each 32 dot factors;
Each 32 dot factors are added subelement 121, and for trying to achieve a Fruiting coefficient of dct transform, this subelement is made up of shift unit, adder and subtractor cascade, point 6 grades of coefficient O to being inputted by 32 dot factor operator unit 1200_0~O15_0、O0_1~O15_1、O0_2~O15_2And O0_3~O15_3Carry out shifter-adder or displacement subtracted each other,
Wherein:
1st grade, be carry out respectively following 32 system numbers once merging simultaneously:
First group is by O0_0And O1_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, first of obtain at 32 the 1st grade merges coefficient COE32_101
Second group is by O2_0And O3_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, second of obtain at 32 the 1st grade merges coefficient COE32_102
3rd group is by O4_0And O5_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of obtain at 32 the 1st grade merges coefficient COE32_103
And so on;
8th group is by O14_0And O15_0After the two retardation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 8th of obtain at 32 the 1st grade merges coefficient COE32_108
9th group is by O0_1And O1_1After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 9th of obtain at 32 the 1st grade merges coefficient COE32_109
Tenth group is by O2_1And O3_1After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the tenth of obtain at 32 the 1st grade merges coefficient COE32_110
And so on;
31st group is by O12_3And O13_3After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 31st of obtain at 32 the 1st grade merges coefficient COE32_131
32nd group is by O14_3And O15_3After the two summation coefficient moves to left respectively, then carrying out being added or subtracting each other, the 32nd of obtain at 32 the 1st grade merges coefficient COE32_132
2nd grade, be that following 16 system numbers are carried out secondary merging respectively simultaneously:
First group is by COE32_101And COE32_102After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, first of obtain at 32 the 2nd grade merges coefficient COE32_201
Second group is by COE32_103And COE32_104After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, second of obtain at 32 the 2nd grade merges coefficient COE32_202
3rd group is by COE32_105And COE32_106After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of obtain at 32 the 2nd grade merges coefficient COE32_203
4th group is by COE32_107And COE32_108After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 4th of obtain at 32 the 2nd grade merges coefficient COE32_204
5th group is by COE32_109And COE32_110After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 5th of obtain at 32 the 2nd grade merges coefficient COE32_205
6th group is by COE32_110And COE32_111After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 6th of obtain at 32 the 2nd grade merges coefficient COE32_206
And so on;
15th group is by COE32_128And COE32_129After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 15th of obtain at 32 the 2nd grade merges coefficient COE32_215
16th group is by COE32_130And COE32_131After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 16th of obtain at 32 the 2nd grade merges coefficient COE32_216
3rd level, is following eight system numbers carry out three times respectively merge simultaneously:
First group is by COE32_201And COE32_202After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, first of the 3rd level obtaining at 32 merges coefficient COE32_301
Second group is by COE32_203And COE32_204After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, second of the 3rd level obtaining at 32 merges coefficient COE32_302
3rd group is by COE32_205And COE32_206After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of the 3rd level obtaining at 32 merges coefficient COE32_303
And so on;
7th group is by COE32_213And COE32_214After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 7th of the 3rd level obtaining at 32 merges coefficient COE32_307
8th group is by COE32_215And COE32_216After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 8th of the 3rd level obtaining at 32 merges coefficient COE32_308
4th grade, be following four combinations coefficient are carried out four times respectively merge simultaneously:
First group is by COE32_301And COE32_302After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, first of obtain at 32 the 4th grade merges coefficient COE32_401
Second group is by COE32_303And COE32_304After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, second of obtain at 32 the 4th grade merges coefficient COE32_402
3rd group is by COE32_305And COE32_306After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 3rd of obtain at 32 the 4th grade merges coefficient COE32_403
4th group is by COE32_307And COE32_308After the two merging coefficient moves to left respectively, then carrying out being added or subtracting each other, the 4th of obtain at 32 the 4th grade merges coefficient COE32_404
5th grade is that four the merging coefficients simultaneously tried to achieve the 4th grade carry out five merging respectively:
By first merging coefficient COE of the 4th grade of 3232_401With second merging coefficient COE of the 4th grade of 3232_402After moving to left respectively, then carrying out being added or subtracting each other, first of obtain at 32 the 5th grade merges coefficient COE32_501
By the 3rd the merging coefficient COE of the 4th grade of 3232_403With the 4th the merging coefficient COE of the 4th grade of 3232_404After moving to left respectively, then carrying out being added or subtracting each other, second of obtain at 32 the 5th grade merges coefficient COE32_502
6th grade is that two the merging coefficients tried to achieve the 5th grade merge, by first merging coefficient COE of the 5th grade of 3232_501With second merging coefficient COE of the 5th grade of 3232_502After moving to left respectively, then carry out being added or subtracting each other, obtain the Fruiting coefficient COEFF of 3232, and by this Fruiting coefficient COEFF of 3232Output is to transposition buffer module 2, as shown in Figure 9.
It is added subelement 181,8 dot factor at above-mentioned each 4 dot factors and is added in the every one-level merging in subelement 161,16 dot factor addition subelement 141 and 32 dot factor addition subelement 121, choosing of shift count and adder or subtractor, is determine according to actual demand and experiment.

Claims (10)

1. the transform coder being suitable to high-performance video coding standard HEVC, including: one-dimensional DCT module (1), transposition buffer module (2) and top layer control module (3), the data output end of this one-dimensional DCT module (1) is connected with the data input pin of transposition buffer module (2), and data input pin is connected with the data output end of transposition buffer module (2);This top layer controls module (3) and is connected with the reset terminal of one-dimensional DCT module (1), Enable Pin and the reset terminal of transposition buffer module (2), Enable Pin respectively, it is characterised in that:
Described one-dimensional DCT module (1), including:
32 butterfly processing elements (10), it is made up of 16 adders and 16 subtractors, it is respectively utilized to complete the operation that the coefficient to be transformed to input is added between two and subtracts each other between two, and will add up 16 data obtaining of operation and input to 16 butterfly processing elements (11), 16 data phase reducing obtained input to 32 strange coefficient processing unit (12);
16 butterfly processing elements (11), it is made up of 8 adders and 8 subtractors, it is respectively utilized to complete the operation that 16 data that 32 butterfly processing elements (10) are inputted are added between two and subtract each other between two, and will add up 8 data obtained and input to 8 butterfly processing elements (13), input to 16 strange coefficient processing unit (14) by subtracting each other 8 data obtained;
32 strange coefficient processing unit (12), it is added subelement (121) cascade is constituted by 1 32 dot factor operator unit (120) and 16 32 dot factors, for obtain 16 data being inputted by 32 butterfly processing elements (10) and these 16 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 16 groups different, be added, subtract each other, try to achieve 16 transform datas, then input to transposition buffer module (2);
8 butterfly processing elements (13), it is made up of 4 adders and 4 subtractors, it is respectively utilized to complete the operation that 8 data that 16 butterfly processing elements (11) are inputted are added between two and subtract each other between two, and will add up 4 data obtained and input to 4 butterfly processing elements (15), input to 8 strange coefficient processing unit (16) by subtracting each other 4 data obtained;
16 strange coefficient processing unit (14), it is added subelement (141) cascade is constituted by 1 16 dot factor operator unit (140) and 8 16 dot factors, for obtain 8 data being inputted by 16 butterfly processing elements (11) and these 8 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 8 groups different, be added, subtract each other, try to achieve 8 transform datas, and input to transposition buffer module (2);
4 butterfly processing elements (15), it is made up of 2 adders and 2 subtractors, it is respectively utilized to complete 4 data that 8 butterfly processing elements (13) are inputted be added between two and subtract each other between two, and will add up 2 data obtained and input to 4 even coefficient processing unit (17), input to 4 strange coefficient processing unit (18) by subtracting each other 2 data obtained;
8 strange coefficient processing unit (16), it is added subelement (161) cascade is constituted by 18 dot factor operator unit (160) and 48 dot factors, for obtain 4 data being inputted by 8 butterfly processing elements (13) and these 4 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 4 groups different, be added, subtract each other, try to achieve 4 transform datas and input to transposition buffer module (2);
4 even coefficient processing unit (17), constituted by postponing subelement (170), 2 butterfly computation subelements (171) and displacement subelement (172) cascade, 2 data for completing 4 butterfly processing elements (15) are inputted postpone, and shifter-adder, the operation subtracted each other, try to achieve 2 transform datas and input to transposition buffer module (2);
4 strange coefficient processing unit (18), it is added subelement (181) is constituted by 14 dot factor operator unit (180) and 24 dot factors, for obtain 2 data being inputted by 4 butterfly processing elements (15) and these 2 data self move to left rear coefficient and, and carry out summed result respectively shifting by shift count 2 groups different, be added, subtract each other, try to achieve 2 transform datas and input to transposition buffer module (2);
Reset and enable control unit (19), control module (3) with top layer to be connected, control module (3) reset that exports for receiving top layer and enable signal, and controlling reset and the enable of unit in one-dimensional DCT module (1) according to resetting and enabling signal.
2. transform coder according to claim 1, it is characterised in that: input data are carried out head and the tail and sue for peace between two by 16 adders in 32 butterfly processing elements (10), and 16 the addition result E that will try to achieve0~E15Input to 16 butterfly processing elements (11);Input coefficient is carried out head and the tail and asks poor between two by 16 subtractors, and subtracts each other result O by try to achieve 160~O15Input to 32 strange coefficient processing unit (12).
3. transform coder according to claim 1, it is characterised in that: the data E to being inputted by 32 butterfly processing elements (10) of 8 adders in 16 butterfly processing elements (11)0~E15Carry out head and the tail to sue for peace between two, and 8 the addition result EE that will try to achieve0~EE7Input to 8 butterfly processing elements (13);8 subtractors are to data E0~E15Carry out head and the tail and ask poor between two, and subtract each other result EO by try to achieve 80~EO7Input to 16 strange coefficient processing unit (14).
4. transform coder according to claim 1, it is characterized in that: 32 dot factors operator unit (120) described in 32 strange coefficient processing unit (12) are made up of depositor, shift unit and adder cascade, have been used for the data O inputted by 32 butterfly processing elements (10)0~O15Carry out delay and obtain retardation coefficient O0_0~O15_0, and try to achieve O0~O15With O0~O15Self move to left 1,2,3 and O0_1~O15_1、O0_2~O15_2、O0_3~O15_3, these coefficients are sent into and are added subelement (121) to each 32 dot factors;32 described dot factors are added subelement (121), are made up of shift unit, adder and subtractor cascade, have been used for the coefficient O inputted by 32 dot factors operator unit (120)0_0~O15_0、O0_1~O15_1、O0_2~O15_2And O0_3~O15_3Carry out shifter-adder or displacement is subtracted each other, finally try to achieve 1 data and output it to transposition buffer module (2).
5. transform coder according to claim 1, it is characterised in that: the data EE to being inputted by 16 butterfly processing elements (11) of 4 adders in 8 butterfly processing elements (13)0~EE7Carry out head and the tail to sue for peace between two, and 4 the addition result EEE that will try to achieve0~EEE3Inputing to 4 butterfly processing elements (15), 4 subtractors are to data EE0~EE7Carry out head and the tail and ask poor between two, and subtract each other result EEO by try to achieve 40~EEO3Input to 8 strange coefficient processing unit (16).
6. transform coder according to claim 1, it is characterized in that: 16 dot factors operator unit (140) described in 16 strange coefficient processing unit (14), it is made up of depositor, shift unit and adder cascade, has been used for the data EO inputted by 16 butterfly processing elements (11)0~EO7Postpone, obtain retardation coefficient EO0_0~EO7_0, and try to achieve EO0~EO7Respectively with EO0~EO7Self move to left 1 sum coefficient EO0_1~EO7_1And EO0~EO7Self move to left 2 sum coefficient EO0_2~EO7_2, these coefficients are sent into and are added subelement (141) to each 16 dot factors;16 described dot factors are added subelement (141), are made up of shift unit, adder and subtractor cascade, have been used for the coefficient EO inputted by 16 dot factors operator unit (140)0_0~EO7_0、EO0_1~EO7_1And EO0_2~EO7_2Carry out shifter-adder or displacement is subtracted each other, finally try to achieve 1 data and export to transposition buffer module (2).
7. transform coder according to claim 1, it is characterised in that: 2 adders data EEE in the hope of being inputted by 8 butterfly processing elements (13) in 4 butterfly processing elements (15)0With EEE3Sum EEEE0, and the data EEE of input1With EEE2Sum EEEE1, and these 2 the addition result EEEE that will try to achieve0、EEEE1Input to 4 even coefficient processing unit (17);2 subtractor data EEE in the hope of input0With EEE3Difference EEEO0, and the data EEE of input1With EEE2Difference EEEO1, and 2 will be tried to achieve subtract each other result EEEO0、EEEO1Input to 4 strange coefficient processing unit (18).
8. transform coder according to claim 1, it is characterized in that: 8 dot factors operator unit (160) described in 8 strange coefficient processing unit (16), it is made up of depositor, shift unit and adder cascade, has been used for the data EEO inputted by 8 butterfly processing elements (13)0~EEO3Postpone, obtain retardation coefficient EEO0_0~EEO3_0, and try to achieve EEO0~EEO3Respectively with EEO0~EEO3Self move to left 1 sum coefficient EEO0_1~EEO3_1And EEO0~EEO3Self move to left 2 sum coefficient EEO0_2~EEO3_2, these coefficients are sent into and are added subelement (161) to each 8 dot factors;8 described dot factors are added subelement (161), are made up of shift unit, adder and subtractor cascade, have been used for the coefficient EEO inputted by 8 dot factors operator unit (160)0_0~EEO3_0、EEO0_1~EEO3_1And EEO0_2~EEO3_2Carry out shifter-adder or displacement is subtracted each other, finally try to achieve 1 data and export to transposition buffer module (2).
9. transform coder according to claim 1, it is characterised in that: the delay subelement (170) described in 4 even coefficient processing unit (17), to the data EEEE inputted by 4 butterfly processing elements (15)0With EEEE1Carry out the delay of 2 clock cycle, obtain delayed data EEEE0_0With EEEE1_0, and these 2 data are sent into 2 butterfly computation subelements (171);2 described butterfly computation subelements (171), are made up of 1 adder and 1 subtractor, for postponing the delayed data EEEE that subelement (170) inputs0_0With EEEE1_0Carry out respectively being added and subtracting each other, obtain summarized information EEEEE and subtract each other data EEEEO feeding displacement subelement (172);Described displacement subelement (172), it is made up of 2 shift units, for data EEEEE and the EEEEO inputted by 2 butterfly computation subelements (171) is moved to left, and 2 data will be tried to achieve export to transposition buffer module (2).
10. transform coder according to claim 1, it is characterised in that: 4 strange coefficient processing unit
(18) 4 dot factors operator unit (180) described in, are made up of depositor, shift unit and adder cascade, have been used for the data EEEO inputted by 4 butterfly processing elements (15)0、EEEO1Postpone, obtain retardation coefficient EEEO0_0、EEEO1_0, and try to achieve EEEO respectively0With EEEO0, and EEEO1With EEEO1Self move to left the data sum after not coordination, it may be assumed that
Try to achieve EEEO0With EEEO0Self move to left the data sum EEEO after 10_1,
Try to achieve EEEO1With EEEO1Self move to left the data sum EEEO after 11_1,
Try to achieve EEEO0With EEEO0Self move to left the data sum EEEO after 20_2,
Try to achieve EEEO1With EEEO1Self move to left the data sum EEEO after 21_2,
These coefficients are inputed to each 4 dot factors and is added subelement (181);
4 described dot factors are added subelement (181), are made up of shift unit, adder and subtractor cascade, for the coefficient EEEO that 4 dot factors operator unit (180) are inputted0_0、EEEO1_0、EEEO0_1、EEEO1_1、EEEO0_2And EEEO1_2Carry out shifter-adder or displacement is subtracted each other, finally try to achieve 1 data and export to transposition buffer module (2).
CN201310283390.3A 2013-07-05 2013-07-05 Be suitable to the transform coder of high-performance video coding standard HEVC Active CN103369326B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310283390.3A CN103369326B (en) 2013-07-05 2013-07-05 Be suitable to the transform coder of high-performance video coding standard HEVC

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310283390.3A CN103369326B (en) 2013-07-05 2013-07-05 Be suitable to the transform coder of high-performance video coding standard HEVC

Publications (2)

Publication Number Publication Date
CN103369326A CN103369326A (en) 2013-10-23
CN103369326B true CN103369326B (en) 2016-06-29

Family

ID=49369731

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310283390.3A Active CN103369326B (en) 2013-07-05 2013-07-05 Be suitable to the transform coder of high-performance video coding standard HEVC

Country Status (1)

Country Link
CN (1) CN103369326B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105100811B (en) * 2014-05-14 2018-04-03 北京君正集成电路股份有限公司 The implementation method and device of a kind of video transformation
CN105791871A (en) * 2014-12-25 2016-07-20 炬芯(珠海)科技有限公司 Discrete cosine transform DCT device and application method
CN106028049B (en) * 2016-07-06 2018-11-13 电子科技大学 A kind of two-dimensional dct image processor
CN107181963B (en) * 2017-03-31 2019-10-22 武汉斗鱼网络科技有限公司 A kind of video-frequency compression method and device
CN107027039B (en) * 2017-04-14 2019-08-27 西安电子科技大学 Discrete cosine transform implementation method based on efficient video coding standard
CN109521994B (en) * 2017-09-19 2020-11-10 华为技术有限公司 Multiplication hardware circuit, system on chip and electronic equipment
CN108184127B (en) * 2018-01-13 2020-06-12 福州大学 Configurable multi-size DCT (discrete cosine transform) transformation hardware multiplexing architecture
CN116366248B (en) * 2023-05-31 2023-09-29 山东大学 Kyber implementation method and system based on compact instruction set expansion

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102857756A (en) * 2012-07-19 2013-01-02 西安电子科技大学 Transfer coder adaptive to high efficiency video coding (HEVC) standard
CN103024389A (en) * 2012-12-24 2013-04-03 芯原微电子(北京)有限公司 HEVC (high efficiency video coding) decoding device and method
CN103067718A (en) * 2013-01-30 2013-04-24 上海交通大学 One-dimensional inverse discrete cosine transform (IDCT) module circuit suitable for digital video coding/decoding
CN103092559A (en) * 2013-01-30 2013-05-08 上海交通大学 Multiplying unit structure for discrete cosine transformation (DCT)/inverse discrete cosine transformation (IDCT) circuit under high efficiency video coding (HEVC) standard

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9049452B2 (en) * 2011-01-25 2015-06-02 Mediatek Singapore Pte. Ltd. Method and apparatus for compressing coding unit in high efficiency video coding

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102857756A (en) * 2012-07-19 2013-01-02 西安电子科技大学 Transfer coder adaptive to high efficiency video coding (HEVC) standard
CN103024389A (en) * 2012-12-24 2013-04-03 芯原微电子(北京)有限公司 HEVC (high efficiency video coding) decoding device and method
CN103067718A (en) * 2013-01-30 2013-04-24 上海交通大学 One-dimensional inverse discrete cosine transform (IDCT) module circuit suitable for digital video coding/decoding
CN103092559A (en) * 2013-01-30 2013-05-08 上海交通大学 Multiplying unit structure for discrete cosine transformation (DCT)/inverse discrete cosine transformation (IDCT) circuit under high efficiency video coding (HEVC) standard

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
A Low Complexity Multiplierless Transform Coding for HEVC;Chunxiao Fan et al.;《Advances in Multimedia Information Processing-PCM 2012》;20121206;578-586 *
新一代视频编码标准——HEVC;朱秀昌等;《南京邮电大学学报(自然科学版)》;20130630;第33卷(第3期);1-11 *

Also Published As

Publication number Publication date
CN103369326A (en) 2013-10-23

Similar Documents

Publication Publication Date Title
CN103369326B (en) Be suitable to the transform coder of high-performance video coding standard HEVC
JP2628493B2 (en) Image coding device and image decoding device provided with cosine transform calculation device, calculation device and the like
CN102065309B (en) DCT (Discrete Cosine Transform) realizing method and circuit
CN101841730A (en) Real-time stereoscopic vision implementation method based on FPGA
CN112257844B (en) Convolutional neural network accelerator based on mixed precision configuration and implementation method thereof
CN110851779A (en) Systolic array architecture for sparse matrix operations
CN114995782A (en) Data processing method, device, equipment and readable storage medium
CN102300092B (en) Lifting scheme-based 9/7 wavelet inverse transformation image decompressing method
CN101426134A (en) Hardware device and method for video encoding and decoding
CN108259919B (en) Hardware system for rapidly realizing 8x8DCT (discrete cosine transform)
CN116167425B (en) Neural network acceleration method, device, equipment and medium
Yin et al. FPGA-based high-performance CNN accelerator architecture with high DSP utilization and efficient scheduling mode
CN107092462B (en) 64-bit asynchronous multiplier based on FPGA
CN103092559B (en) For the multiplier architecture of DCT/IDCT circuit under HEVC standard
CN116842304A (en) Method and system for calculating irregular sparse matrix
CN103902762A (en) Circuit structure for conducting least square equation solving according to positive definite symmetric matrices
CN101126974B (en) Improved Booth2 multiplier structure
CN102447898B (en) Method for realizing KLT (Karhunen-Loeve Transform) by means of FPGA (Field Program Gate Array)
CN103179398A (en) FPGA (field programmable gate array) implement method for lifting wavelet transform
CN210109863U (en) Multiplier, device, neural network chip and electronic equipment
Kumar et al. Complex multiplier: implementation using efficient algorithms for signal processing application
CN210006029U (en) Data processor
CN116187408B (en) Sparse acceleration unit, calculation method and sparse neural network hardware acceleration system
CN103176768B (en) Calculate modular multiplication method and the scalable modular multiplier of classical modular multiplication
CN113031909B (en) Data processor, method, device and chip

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant