A new algorithm for fast decoding of simplex and other quasi-orthogonal pseudorandom codes, which eliminates the restrictions for the hardware implementation of the decoder in processing very long codes in the real-time communications, has been considered. The proposed algorithm is the most efficient in the data-transmission systems with pseudorandom signals in cases, when the implementation of the optimal correlation decoder is difficult or impossible due to technical reasons.