A backward algorithm of Lin and Tokad is described and its application to equivalent low-pass

ladder networks is illustrated. Also a relation is established which eliminates the necessity of applying the Lin and Tokad algorithm twice to obtain all the element values of the ladder network.