As a first example we will generate a sequence of 500000 random bits {0,1} and BPSK modulate these. Thereafter the BPSK signals will be transmitted over an AWGN channel with a signal-to-noise ratio dB. The received signal is then decoded and the number of bit errors are calculated.
using std::cout;
using std::endl;
{
int N;
double N0;
N = 500000;
N0 = 1;
RNG_randomize();
rec = symbols + sqrt(N0 / 2) * randn(N);
cout <<
"There were " <<
berc .get_errors() <<
" received bits in error." << endl;
cout <<
"There were " <<
berc .get_corrects() <<
" correctly received bits." << endl;
cout <<
"The error probability was " <<
berc .get_errorrate() << endl;
cout << "The theoretical error probability is " << 0.5*erfc(1.0) << endl;
return 0;
}
Bit Error Rate Counter (BERC) Class.
BPSK modulator with real symbols.
void modulate_bits(const bvec &bits, vec &output) const
Modulate bits into BPSK symbols in complex domain.
void demodulate_bits(const vec &signal, bvec &output) const
Demodulate noisy BPSK symbols in complex domain into bits.
Include file for the IT++ communications module.
When you run this program, the output will look something like this:
There were 39224 received bits in error.
There were 460776 correctly received bits.
The error probability was 0.078448
The theoretical error probability is 0.0786496