Programming for reducing Boole function by Rot method

[galaticos]

Hi, I'm newcomers, I'm an young student with a little experience, when I look its site I like it immediatly I hope I could share much when I grow up and collect more knowledge, but now I need your aid
I'm programming with C to reducing Boole function by ROT method
e.x: x*y + (not x)* y =y, or: xyz + (not x)yt + .....= x !

this is my project which my lecturer entrust. But now I don't have enough information about ROT and algorithm for it.
Anyone can help me to find doc, informations, sourcecode v v... to reference to help me image the require of project and the way program'd execute. Thanks[/u]

 

[The Svin]

hxxp://www.lsi.upc.es/~jordicf/gavina/BIB/files/vlsi04.pdf

 

[galaticos]

thanks for this link, it's provide me some idea about algorithm. But my teacher order us do it by Rot mehod, first time i wanted to do this by Quine McCluskey Method, but he refused Now I want more information about algorithm with ROT method ( ROT = Route Optimal Tree ? isn't it ?)