Triple Modular Redundancy (TMR) is a structure that has 3 modules and 1 voter. The voter discerns rights and wrongs among the results from modules. If the right results are more than 2, voter can produce right information as an output. If not, it means the TMR system fails. TMR can be chained together. More than 100 TMRs can be chained together, and we call it as a "Cascaded TMR". The cascaded TMR has been used in many fields like redundant Poly-Si TFT, pipeline process, and etc.
A lot of related studies have been done for more reliable and cost-effective structures of cascaded TMR. Every study suggests the unique structures, which can make the optimal structure automatically. There must be a lot of circumstances for making the optimal Cascaded TMR structures. Some structures needs to be built with minimum cost. Also, some other structures were to be built with the highest reliability. In this thesis, we studied an algorithm, which automatically makes an optimal cascaded TMR structure by given circumstances.
