  A frame is an overcomplete set that can represent vectors(signals) faithfully
and stably. Two frames are equivalent if signals can be essentially represented
in the same way, which means two frames differ by a permutation, sign change or
orthogonal transformation. Since these operations are combinatorial in nature,
it is infeasible to check whether two frames are equivalent by exhaustive
search. In this note, we present an algorithm that can check this equivalence
in polynomial time. Theoretical guarantees are provided for special cases.
