AbstractThis paper describes the development of a filter for the channel multiplexer in the 12‐GHz band broadcasting satellite transponder with a high transmitting power (above 200 W). The filter for high‐power multiplexer must have a very low loss, to maintain the satellite transmitting power and to secure thermal stability. It was found that the use of a 6‐pole elliptic filter is better than that of a 4‐pole elliptic filter from the viewpoint of the insertion loss and the heat dissipation. The 6‐pole canonical filter is designed using TE113 dual‐mode. In the thermal design, super‐invar with small thermal expansion coefficient is used for the cylindrical waveguides of the filter, and copper with high thermal conductivity is used for the iris plate. Improving the heat dissipation and suppressing the temperature‐rise, the deterioration of the filter characteristics caused by the temperature variation is prevented. The experimental filter realized the insertion loss of less than 0.3 dB, the loss variation of 0.1 dBp‐p and group‐delay variation of 5 nsp‐p within the channel. No significant deterioration of the filter performance was observed through the thermal test of 0°C to 90°C and the high‐power test of 200 W. As a result, it was demonstrated that the proposed filter has better electrical and thermal performance than the previous 4‐pole elliptic filter, being suited as the filter for the multiplexers in high‐power broadcasting satellite transponders.
AbstractImproving the reliability of information transmission in communications networks and computer networks economically and efficiently is an important subject. A communications network (computer network) is represented by a graph whose nodes and edges correspond to switching offices (computers) and links, respectively, and communication between two nodes is made through a path in a graph. Routing is defined as the determination of a communication path between two nodes in a network. The diameter of the surviving route graph, where two nonfaulty nodes are connected by an edge if there are no faults on the route between them, could be one of the fault‐tolerant measures for a routing. In this paper, for the routing of any (k + 1)‐node connected graph G defined by Dolev et al., we discuss the upper and lower bounds of the diameter of the surviving route graph for any fault. We can also construct a routing for (k + 1)‐edge connected graph G such that the diameter of the surviving route graph is constant for any edge faults.
