File: RateDematch.cpp

package info (click to toggle)
codec2 1.2.0-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 76,376 kB
  • sloc: ansic: 436,819; cpp: 2,091; objc: 1,736; sh: 1,510; python: 1,405; asm: 683; makefile: 605
file content (103 lines) | stat: -rw-r--r-- 2,846 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/* RateDematch reverses the basic HSDPA Rate Matching algorithm

   The calling syntax is:
      y = RateDematch( x, X_i, e_ini, e_plus, e_minus );
 
      y = depunctured output (length X_i)

      x = input consisting of received/punctured bits
      X_i = length of the depunctured output
      e_ini = parameter used by algorithm
      e_plus = parameter used by algorithm
      e_minus = parameter used by algorithm

   Copyright (C) 2005, Matthew C. Valenti

   Last updated on Dec. 3, 2005


   Function RateDematch is part of the Iterative Solutions 
   Coded Modulation Library. The Iterative Solutions Coded Modulation 
   Library is free software; you can redistribute it and/or modify it 
   under the terms of the GNU Lesser General Public License as published 
   by the Free Software Foundation; either version 2.1 of the License, 
   or (at your option) any later version.

   This library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.
  
   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, write to the Free Software
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

*/
        
#include <math.h>
#include <mex.h>
#include <Matrix.h>
#include <stdlib.h>

/* main function that interfaces with MATLAB */
void mexFunction(
				 int            nlhs,
				 mxArray       *plhs[],
				 int            nrhs,
				 const mxArray *prhs[] )
{
	double *input, *output_p;
	int X_i, e_ini, e_plus, e_minus;
	int m, e, index, input_length;

	/* Check for proper number of arguments */
	if ((nrhs < 5 )||(nlhs  > 1)) {
		mexErrMsgTxt("Usage: y = RateDematch( x, X_i, e_ini, e_plus, e_minus )");
	} 		
	
	/* first input vector that needs to have rate matching reversed */
	input = mxGetPr( prhs[0] );	
	input_length = mxGetN( prhs[0] ); /* length of input */
	
	/* remaining inputs (all ints) */
	X_i = (int) *mxGetPr( prhs[1] );
	e_ini = (int) *mxGetPr( prhs[2] );
	e_plus = (int) *mxGetPr( prhs[3] );
	e_minus = (int) *mxGetPr( prhs[4] );

	/* verify that input length is correct
	   development note: eventually this could be replaced by a formula */
	e = e_ini;
	index = 1;
	for (m=1;m<=X_i;m++) {
		e -= e_minus;
		if (e<=0) 
			e += e_plus;
		else
			index++;
	}
	
	index--;
	if ( index != input_length )
		mexErrMsgTxt("Input length is invalid");

	/* Create output */
	plhs[0] = mxCreateDoubleMatrix( 1, X_i, mxREAL );
	output_p = mxGetPr( plhs[0] );

	/* Dematch */
	e = e_ini;
	index = 1;
	for (m=1;m<=X_i;m++) {
		e -= e_minus;
		if (e<=0) {
			/* zero pad */
			e += e_plus;
		} else {
			output_p[m-1] = input[index-1];
			index++;
		}
	}		

	return;
}