No abstract

No abstract

This paper describes the REAL REgister ALlocation program. REAL uses a track assignment algorithm taken from channel routing called the Left Edge algorithm. REAL is optimal for non-pipelined designs with no conditional branches. It is thought that REAL is also optimal for designs with conditional branches, pipelined or not. Experimental results are included in the report, which illustrate the optimal solutions found by REAL. REAL is part of the ADAM Advanced Design AutoMation system, and will be used to process designs output from MAHA and Sehwa.

Abstract:This papcr defines a niultiplc rcsolution represcntatikm for the two-dimcnsional gray-scale shapcs in an image. 'l'his uepucsentatina is constructed by detecting peaks and ridges in the UitTcrcncc of Low Pass (DOLP) transfoim. Descriptions of shapes which are cncoded in this reprcscntation may be niatchcd efficiendy despite changes in size, orientation or position.?vlGtiVati@i?S fGr a multiple xsdl-ttion repiaentation arc prcsentcd fir%. followed by die definition of the DOLI' l'ransbrm. Txhniques arc then prtscnted for encoding a sqmbolic suuctura! description of forms from the DOLP transform. This proccss involves detecting local peaks and ridges in each band-pass unngc and ill the entire thrce-dimensiowl spacc dcfincd by the Il0I.P transform. L.inkins ndjaccnt peaks in different band-pass imugcs gives a multiplc resolution tree which describes shape. Pcakj which are locd maxina in .this trec providc laiidmarks for aligning, maiiiyulating, and matching shapes. Ilctxting and linking die ridges in cach DOLP band-pass irnnge providers a graph which links pcaks within a shapc in a band-pass image and dcscribcs thc positions of the boundaries af the shapc at multiple resolutions. Pctccting and linkin2 the ridges in the DOLP dircc spacc describes elongated forms and links the Iargest peaks in rhc trcc.The principles for determining the correspondence betwecn symbols in pairs oP such descriptions are then dcscribed. Such corrcspondence matching is shown to be simplified by using thc corrcspondcnce at lower resolutions to constrain thc possible corrcspondcnce at higher resolutions.

No abstract

MAHA is a program which implements an algorithm for register level synthesis of data paths from a data flow specification. The algorithm is based on a linear hardware assignment to critical path nodes, followed by a cost-based assignment using the concept of the freedom of a node to be scheduled. Functions with the least scheduling freedom are scheduled first. The program either minimizes cost, subject to a time constraint, or maximizes speed subject to a cost constraint. The implementation of this algorithm is presented using examples from the literature.MAHA is written in Franz LISP, and executes within minutes for problems of practical size on a VAX 11/780.

No abstract

No abstract