CN1187688C - Memory control method realized by lifting wavelet fast algorithm VLSI - Google Patents
Memory control method realized by lifting wavelet fast algorithm VLSI Download PDFInfo
- Publication number
- CN1187688C CN1187688C CNB031146007A CN03114600A CN1187688C CN 1187688 C CN1187688 C CN 1187688C CN B031146007 A CNB031146007 A CN B031146007A CN 03114600 A CN03114600 A CN 03114600A CN 1187688 C CN1187688 C CN 1187688C
- Authority
- CN
- China
- Prior art keywords
- data
- register
- control
- read
- write
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
The present invention discloses a control method for a memory for improving the VLSI realization of the fast wavelet algorithm. For wavelets with m/n beats (m is the exponent number of a low-pass filter, and n is the exponent number of a high-pass filter), and an M*N input image, m+2 registers with the capacity of M are used, serial input is received, and data is output in parallel so that row transformation and column transformation can be carried out like a production line; the front ends of columns are expanded in the writing mode of a control register, which is different from the existing mode that data is first stored and then is expanded, and thus, storage space is saved, and the transformation rate is improved; the rear ends of the columns are expanded in the writing mode and the symmetrical completion mode of the control register. The present invention converts the serial input into parallel output through parallel embedded buffer memories so that the wavelet row transformation and the wavelet column transformation are operated like a production line; through the complete reading and writing control of the register, the front end and the rear end of row data are expanded. The present invention has simple structure and improves operating speed.
Description
Technical field
The invention belongs to the VLSI design field.Be specifically related to the control circuit of storer in Lifting Wavelet fast algorithm hardware is realized.Be particularly related to the memory control methods that a kind of VLSI of being used for realizes the Lifting Wavelet fast algorithm.
Background technology
As the basis of compression of images and processing, two-dimensional discrete wavelet conversion (2D DWT) has obtained using widely.In numerous applications, as aspects such as multimedia messages processing, medicine and satellite remote sensing, the effect that the positive play more and more of two-dimensional discrete wavelet conversion is important.One of implementation method of two-dimensional discrete wavelet conversion is to adopt the tower decomposition method of mallat at present, alternately adopts low pass and high-pass filtering to obtain by level and vertical direction at image.This wavelet transform calculated amount based on convolution is big, and to the requirement height of storage space, the appearance of Lifting Wavelet has effectively solved this problem.It does not rely on Fourier transform, has finished the structure to the biorthogonal wavelet wave filter fully in the spatial domain.Memorizer control circuit proposed by the invention is the implementation framework based on the lifting fast algorithm of two-dimensional discrete wavelet conversion.
Below, one of technology as a setting, at first the boosting algorithm to two-dimensional discrete wavelet conversion is illustrated.
Boosting algorithm has provided the simple and effective building method of biorthogonal wavelet, has used basic polynomial interpolator to obtain the high fdrequency component of signal, afterwards by making up the low frequency component that scaling function obtains signal.The basic thought of boosting algorithm is by a basic small echo (lazy wavelet), progressively constructs a new small echo with good more character, the basic meaning that Here it is promotes.The boosting algorithm of a standard has 3 steps: decompose (split) prediction (predict) and renewal (update).
Summary of the invention
The objective of the invention is to, the memory control methods that provides a kind of VLSI of being used for to realize the Lifting Wavelet fast algorithm makes hardware utilization factor height, cost low, has concurrency, little, the characteristic of simple structure of hardware spending.
In order to achieve the above object, solution of the present invention is: adopt parallel embedded buffer memory, realize that the order of small echo line translation coefficient writes and parallel read-out, thereby realize further pipeline processes, and, realize the expansion of data by the read-write of control store.
The memory control methods that is used for VLSI realization Lifting Wavelet fast algorithm comprises that control is selected, write to storer and front end is expanded, reads to control with the rear end and expand three parts, realizes according to following steps:
1) selection of storer
(m is the low-pass filter exponent number to clap small echo for m/n, n is the Hi-pass filter exponent number), (M is a picture traverse to the input picture of M * N, N is a picture altitude), the DPRAM that uses (m+2) * M size is as register, the input of serial is become parallel output, when m storer carried out read operation, simultaneously 2 remaining storeies are carried out write operation, remain the storer that 2 needs upgrade and when reading all the other m storeies, carry out write operation, make the carrying out that small echo line translation and rank transformation can streamline;
2) write control and front end expansion
The front end expansion that the mode that adopts control register to write is listed as for the m/n small echo, need be carried out
The expansion of the front end of individual data writes the by control with first line data that produces after the line translation
In the individual storer, second line data writes simultaneously
With
Individual register is until with
Individual data write the 1st and
Individual register has been finished the front end expansion of data;
Data after individual circulate successively and write in the register, write m register after, send and read enable signal, with the capable data of m before beginning to read, simultaneously, carry out the capable write operation of m+1 and m+2;
3) read control and rear end expansion
For the rank transformation of m/n small echo, when sense data, m the data in the register are once read in control, and it is carried out rank transformation; The mode that the rear end expansion of data adopts control register to read is finished, and need carry out
The rear end expansion of individual data, when last capable data were read in judgement, circulation was read successively
Individual data, and carry out symmetrical polishing according to last data of row, finished the rear end expansion of line data.
The present invention is by adopting parallel embedded buffer memory, and the input of serial is converted into parallel output, realized the water operation between the small echo row-column transform, and fully by read-write control to register, realized the front-end and back-end expansion of line data, simple, improved travelling speed.
Description of drawings
Fig. 1 is the one dimension boosting algorithm synoptic diagram of embodiment of the invention Daubechies 9/7 biorthogonal wavelet.
Fig. 2 is that embodiment of the invention Daubechies 9/7 small echo promotes the storer control synoptic diagram of realizing.
Fig. 3 writes control and front end expansion synoptic diagram in the embodiment of the invention.
Fig. 4 reads control and back segment expansion synoptic diagram in the embodiment of the invention.
Embodiment
The present invention is described in more detail below in conjunction with drawings and Examples.
The VLSI implementation framework of Lifting Wavelet fast algorithm can be divided into row expansion, row filtering, memory read/write control and row expansion, row filtering.The present invention is intended to propose a kind of new memory read/write control and extended method, at simplified structure, reduces on the basis of chip area, improves hardware utilization.In conjunction with the characteristics of wavelet transform, decompose in order to carry out multilevel wavelet flexibly, the wavelet decomposition of one-level only is discussed here.If carry out the wavelet decomposition of next stage, only need the wavelet coefficient that will decompose (being coefficient image) is got final product as one group of new input.Like this, promptly guarantee the independence of wavelet decomposition, also increased the dirigibility of carrying out multistage decomposition.
1) selection of storer
When wavelet transformation, read by row view data.And the wavelet conversion coefficient after row expansion and the row filtering produces line by line, for it being carried out rank transformation, needs storage intermediate result.Handle because will carry out access, realize so required storage unit will be placed on chip internal, thereby can reduce power consumption these results.Wavelet coefficient is that order produces after the line translation, and clap small echo (here for m/n, m is the low-pass filter exponent number, n is the Hi-pass filter exponent number), in the beginning of each row, for the 1st to m input, to produce 2 outputs, 2 inputs of later every increase will produce 2 outputs, and rank transformation also is like this.In order to save the stand-by period, conversion can be carried out on streamline ground, consider to use m+2 register.For the input picture of M * N, need the register of (m+2) * M size.Here, select to use DPRAM.Through the storage of register, the input of serial is become parallel output, when m storer carried out read operation, 2 storeies that are left are carried out write operation.Remain the storer that 2 needs upgrade and when reading all the other m storeies, carry out write operation, make the carrying out that line translation and rank transformation can streamlines.
2) write control and front end expansion
In the present invention, the front end expansion that is listed as of the mode that has adopted control register to write.The mode of expanding is then deposited to data by the elder generation that is different from the past, carries out the front end expansion with the mode of writing control, has saved storage space, and has improved the speed of conversion.For the m/n small echo, need carry out
The expansion of the front end of individual data in the present invention, writes the by control with first line data that produces after the line translation
In the individual storer, second line data writes simultaneously
With
Individual register is until with
Individual data write the 1st and the 2nd
Individual register has been finished the front end expansion of data.
Data after individual circulate successively and write in the register.After having write m register, send and read enable signal, read the preceding capable data of m, simultaneously, carry out the capable write operation of m+1 and m+2 beginning.
3) read control and rear end expansion
When sense data, owing to rank transformation, once import m data for the m/n small echo, can obtain 2 outputs, therefore m the data in the register are once read in control, and it is carried out rank transformation.The mode that the rear end expansion of data adopts control register to read is finished.Clap small echo for m/n, need carry out
The rear end expansion of individual data.When last capable data were read in judgement, circulation was read successively
Individual data, and last data symmetry polishing about going at this moment, have been finished the rear end expansion of line data.
According to technical scheme of the present invention, the inventor has provided following embodiment, but the invention is not restricted to this
Embodiment.
What use in the present embodiment is Daubechies 9/7 biorthogonal wavelet.
Referring to Fig. 1, Fig. 1 has provided the one dimension boosting algorithm of Daubechies 9/7 small echo and has realized synoptic diagram.The wavelet transformation of two dimension is to obtain by carry out one dimension lifting conversion respectively in the row and column direction of image.Data after the line translation need be expanded and store.By can seeing among Fig. 1, initial in each line translation, 9 points of every input can obtain the output of 2 points, in the drawings, as input R1 during to R9, can obtain exporting S1, S2.2 points of every afterwards input can obtain the output of 2 points, promptly by importing R3 to R11, can obtain exporting S3, and S4 to R13, can obtain exporting S5, S6 by input R5.
Fig. 2 has provided the storer control synoptic diagram when boosting algorithm is realized., consider the parallel of read operation and write operation here, adopted 11 registers, 9 registers are carried out read operation at every turn, obtain 9 inputs, 2 remaining registers are carried out write operation.
What Fig. 3 had provided the embodiment of the invention writes control and front end expansion synoptic diagram, has provided the enable signal of writing of 11 registers.For Daubechies 9/7 small echo, need carry out the front end expansion of 4 points, by seeing among the figure,, finished expansion very easily by writing of control register, as b, c, d is shown in the e.Wherein the phase width of enabling of writing of each register is the image line width.
What Fig. 4 had provided the embodiment of the invention reads control and rear end expansion synoptic diagram, has provided the enable signal of reading of 11 registers.For Daubechies 9/7 small echo, need carry out the rear end expansion of 3 points.By seeing among the figure,,, shown in the j, and, finished the rear end expansion for last data symmetry polishing of going as i by reading of control register.
Claims (1)
1. a memory control methods that is used for VLSI realization Lifting Wavelet fast algorithm is characterized in that, comprises that control is selected, write to storer and front end is expanded, reads to control with the rear end and expand three parts, and realize according to following steps:
1) selection of storer
Clap small echo for m/n, wherein m is the low-pass filter exponent number, and n is the Hi-pass filter exponent number, the input picture of M * N, and wherein M is a picture traverse, N is a picture altitude; The DPRAM that uses (m+2) * M size is as register, the input of serial is become parallel output, when m storer carried out read operation, simultaneously 2 remaining storeies are carried out write operation, remain the storer that 2 needs upgrade and when reading all the other m storeies, carry out write operation, make the carrying out that small echo line translation and rank transformation can streamline;
2) write control and front end expansion
The front end expansion that the mode that adopts control register to write is listed as for the m/n small echo, need be carried out
The expansion of the front end of individual data writes the by control with first line data that produces after the line translation
In the individual storer, second line data writes simultaneously
With
Individual register is until with
Individual data write the 1st and the 2nd
Individual register has been finished the front end expansion of data;
Data after individual circulate successively and write in the register, write m register after, send and read enable signal, with the capable data of m before beginning to read, simultaneously, carry out the capable write operation of m+1 and m+2;
3) read control and rear end expansion
For the rank transformation of m/n small echo, when sense data, m the data in the register are once read in control, and it is carried out rank transformation; The mode that the rear end expansion of data adopts control register to read is finished, and need carry out
The rear end expansion of individual data, when last capable data were read in judgement, m-1 was read in circulation successively, m-3 ... m-1-2
Individual data, and carry out symmetrical polishing according to last data of row, finished the rear end expansion of line data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031146007A CN1187688C (en) | 2003-04-07 | 2003-04-07 | Memory control method realized by lifting wavelet fast algorithm VLSI |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031146007A CN1187688C (en) | 2003-04-07 | 2003-04-07 | Memory control method realized by lifting wavelet fast algorithm VLSI |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1448848A CN1448848A (en) | 2003-10-15 |
| CN1187688C true CN1187688C (en) | 2005-02-02 |
Family
ID=28684126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031146007A Expired - Fee Related CN1187688C (en) | 2003-04-07 | 2003-04-07 | Memory control method realized by lifting wavelet fast algorithm VLSI |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1187688C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1295653C (en) * | 2004-07-22 | 2007-01-17 | 华中科技大学 | Circuit for realizing direct two dimension discrete small wave change |
| CN102300092B (en) * | 2011-08-25 | 2013-04-24 | 北京航空航天大学 | Lifting scheme-based 9/7 wavelet inverse transformation image decompressing method |
| CN102970545A (en) * | 2012-12-11 | 2013-03-13 | 东南大学 | Static image compression method based on two-dimensional discrete wavelet transform algorithm |
| CN104301740B (en) * | 2014-10-27 | 2017-09-29 | 北京航天自动控制研究所 | A kind of hardware-accelerated circuit of wavelet transformation of infrared image 9/7 |
-
2003
- 2003-04-07 CN CNB031146007A patent/CN1187688C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1448848A (en) | 2003-10-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8265402B2 (en) | 2 dimensional signal encoding/decoding method and device | |
| CN100576881C (en) | A kind of self-adapting video image zooming engine based on polyphase filter technology | |
| CN101599167B (en) | Access method of memory | |
| CN101212674A (en) | Image address mapping method in memory | |
| CN102158694A (en) | Remote-sensing image decompression method based on GPU (Graphics Processing Unit) | |
| US8204331B2 (en) | Information processing apparatus and method to reduce delay in image decoding | |
| CN1187688C (en) | Memory control method realized by lifting wavelet fast algorithm VLSI | |
| CN1717049A (en) | Wavelet changeable VLSI structure based on line | |
| US20080285872A1 (en) | Information processing device and method | |
| JP2008288841A (en) | Encoder and method | |
| Tewari et al. | High-speed & memory efficient 2-d dwt on xilinx spartan3a dsp using scalable polyphase structure with da for jpeg2000 standard | |
| US7929777B2 (en) | Variable length decoding device, variable length decoding method and image capturing system | |
| JP4245123B2 (en) | Wavelet processing apparatus and wavelet processing method | |
| US5828849A (en) | Method to derive edge extensions for wavelet transforms and inverse wavelet transforms | |
| US8213731B2 (en) | Information processing device and method | |
| CN102751963B (en) | Based on configurable wavelet transform circuit and its implementation of multiply-accumulator ring | |
| CN104053011B (en) | It is applied to the 2-d discrete wavelet inverse converter in JPEG2000 decoder | |
| Li et al. | Reducing dram image data access energy consumption in video processing | |
| CN102333222A (en) | Two-dimensional discrete wavelet transform circuit and image compression method using same | |
| JP2001025018A (en) | Wavelet transformer, encoding/decoding device, wavelet transformation processing method and recording medium | |
| CN102281437A (en) | Lifting structure two-dimensional discrete wavelet transform interlaced scanning method for image compression | |
| Salehi et al. | A block-based 2D Discrete Wavelet Transform structure with new scan method for overlapped sections | |
| CN105260983A (en) | 5/3 wavelet transformation method based on HyperX platform | |
| CN101800874A (en) | Access method and system of compressed video | |
| CN1374692A (en) | Design method of built-in parallel two-dimensional discrete wavelet conversion VLSI structure |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20050202 Termination date: 20120407 |