Abstract: “This paper presents a novel algorithm for placement of circular cutting bits on a 141.36 inch circular trencher blade for hard rock cutting to be able to lay fiber optic cable of varying width. The blade is divided into 6 x segments of 60 degree each. The spiral algorithm calculates the exact angle of hit, no. of bits and the angle of exposure to precisely cut the required width of hard rock patch for fiber optic cable lying. With the no. of bits and angle known the best cutting blade speed and speed of wheeled machine can be calculated to obtain précised outcome. Given the type of material to cut the algorithm can also estimate based on the above mentioned parameters the running cost of trenching blades/ km in terms of bits replacement to forecast the exact cost of trenching. The algorithm simulation on hard rock shows as the no. of bits are reduced on the circular trencher blade the bits replacement rate / km increases, the effect is even worse if simultaneously the bit ground penet”

Keywords: Component, Trenching, cutting bits, circulat blade, rpm, speed, Micro trencher, Mean Time to Failure ( MTF).