One approach to removing intersymbol interference in a communications channel is to employ adaptive blind equalization to reduce the symbol error rate (SER). The most popular class of algorithms used for blind equalization are those that minimize the Godard (or constant modulus) criteria [3,4]. This study seeks to compare the performance of the Constant Modulus Algorithm (CMA 2-2) with a more computationally efficient signed-error version of CMA (SE-CMA) [1,5]. In particular, I show through simulation that SE-CMA obtains better performance than CMA 2-2 when a BPSK source is used.