An important step in the matrix group recognition program is the identification and decomposition of any irreducible module that happens to arise as the tensor product of a pair of smaller modules. An algorithm of Leedham-Green and O'Brien is available for this problem. We will discuss their algorithm and some ideas of Ryba and Parker for a new and very different algorithm.