Abstract
It is shown that a large class of nonrecurrent RC ladder networks including, as a special case, the geometric ladder networks discussed by Bhattacharyya and Swamy can be represented as an equivalent RCG ladder network.

This publication has 0 references indexed in Scilit: