Function testEncodeDecode

GSMShare/AMRTest.cpp:36–74

Pat modified to use the Viterbi base class.

#else
// Pat modified to use the Viterbi base class.
void testEncodeDecode(const char *label, ViterbiBase *coder, unsigned frameSize, unsigned iRate, unsigned order, bool debug)
#endif
{
	const unsigned trials = 10;
	cout << endl;
	if (debug) cout << label << endl;
	BitVector v1 = randomBitVector(frameSize);
	if (debug) cout << "v1 " << v1 << endl;
	BitVector v2(iRate*frameSize+iRate*order);
#if OLD_TEST
	(*encoder)(v1, v2);
#else
	coder->encode(v1,v2);
#endif
	if (debug) cout << "v2 " << v2 << endl;
	for (int perr = 0; perr <= 50; perr += 10) {
		int errs = 0;
		// multiple trials smooths out the weirdnesses due to unfortunate positioning of noisy bits
		for (unsigned trial = 0; trial < trials; trial++) {
			SoftVector sv2(v2);
			for (unsigned j = 0; j < sv2.size(); j++) {
				if (random() % 100 < perr) sv2[j] = 0.5;
			}
			if (debug) cout << "n2 " << sv2 << endl;
			BitVector v3(frameSize);
#if OLD_TEST
			decoder(sv2, v3);
#else
			coder->decode(sv2,v3);
#endif
			if (debug) cout << "v3 " << v3 << endl;
			for (unsigned j = 0; j < frameSize; j++) {
				if (v1.bit(j) != v3.bit(j)) errs++;
			}
		}
		int pbbo = 100 * errs / (frameSize * trials);
		cout << label << ", " << "% ambiguous bits in : % bad bits out = " << perr << " : " << pbbo << endl;
	}
}

#if OLD_TEST
//void encoder12_2(BitVector &v1, BitVector &v2)   { ViterbiTCH_AFS12_2 vCoder; v1.encode(vCoder,v2); }