/* | | Copyright disclaimer: |   This software was developed at the National Institute of Standards |   and Technology by employees of the Federal Government in the course |   of their official duties. Pursuant to title 17 Section 105 of the |   United States Code this software is not subject to copyright |   protection and is in the public domain. | |   We would appreciate acknowledgement if the software is used. |*//* | Project:     WCDMA simulation environment | Module:      C-level test bed for convolutional coder R=1/2 and K=9 | Author:      Tommi Makelainen, Nokia/NIST | Date:        February 17, 1999 | | History: |              February 17, 1999 Tommi Makelainen |                      Initial version. | */#include <stdio.h>#include <math.h>#include "chcoding.h"#include "chdecoding.h"#include "discmod.h"#include "discdemod.h"#include "channel.h"#include "rake.h"#define INPUT_SIZE 80#define PROB_VECTOR_LEN 2#define CODING_RATE 2int main(int argc, char *argv[]){    int metric_type;    int num_encode_stages, gen_polys[3], gen_poly_1, gen_poly_2;    int inputs[INPUT_SIZE];    int tx_coded_symbol_bits[ CODING_RATE * INPUT_SIZE ];    int rx_coded_symbol_bits[ CODING_RATE * INPUT_SIZE ];    int decoded_bits[INPUT_SIZE];    int tail[8];    int interleaver_cols, interleaver_rows;    double soft_prob_0[] = {0.9, 0.1};    double soft_prob_1[] = {0.1, 0.9};    double soft_bits[ CODING_RATE * INPUT_SIZE ];    MealyEncoder encoder1;    MealyEncoder encoder2;    ViterbiDecoder decoder;    int coder_type, coding_ratio;    int coder_instance, decoder_instance;    int coded_data_len;    int bit_delay;    int diff;    int i, tmp_value;    inputs[0] = 0;    for (i=1; i < INPUT_SIZE; i++) {        tmp_value = i % 3;        inputs[i] = tmp_value > 0 ? 0 : 1;    }     coding_ratio = 2; /* 2 = 1/2 or 3 = 1/3 */    for (i=0; i < coding_ratio*INPUT_SIZE; i++) soft_bits[i] = 1.0;    for (i=0; i < INPUT_SIZE; i++) decoded_bits[i] = -2;    for (i=0; i < 8; i++) tail[i] = 0;    coder_type = 1;  /* 1=conv., 2=turbo */    metric_type = 0; /* 0 = hard, 1 = soft */    gen_polys[0] = 0x171;    gen_polys[1] = 0x1eb;/*    coder_instance = wcdma_convcoding_init(metric_type,                          gen_poly_1, gen_poly_2, gen_poly_3,                          INPUT_SIZE);  */    coder_instance = wcdma_chcoding_init(coder_type, metric_type,                          coding_ratio, gen_polys, INPUT_SIZE);    if (coder_instance == -1) {        return(-1);    }    decoder_instance = wcdma_chdecoding_init(coder_type, coding_ratio,                          coding_ratio*INPUT_SIZE, metric_type, gen_polys,                           soft_prob_0, soft_prob_1, PROB_VECTOR_LEN);    if (coder_instance == -1) {        wcdma_chcoding_free(coder_instance);        return(-1);    }    interleaver_cols = 12;    interleaver_rows = 20;    wcdma_chcoding_enc(coder_type, coding_ratio, inputs, INPUT_SIZE,                       tx_coded_symbol_bits, tail, coder_instance);    wcdma_chdecoding_dec(coder_type, coding_ratio,                         tx_coded_symbol_bits, coding_ratio*INPUT_SIZE,                         soft_bits, decoded_bits, tail, decoder_instance);    printf("\n\tChecking difference of bits before and after convolution.\n");    diff=0;    bit_delay = 0;    for (i=0; i < INPUT_SIZE; i++) {      printf("input %d output %d\n", inputs[i], decoded_bits[i]);      diff += (inputs[i+bit_delay] == decoded_bits[i]) ? 0 : 1;    }    printf("\t\tDifference is %d bit places.\n", diff);    printf("\n");    wcdma_chcoding_free(coder_instance);    wcdma_chdecoding_free(decoder_instance);    return(0);}