DSPcpp/differenceEquation.cpp at main · jjackbauer/DSPcpp · GitHub

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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include "differenceEquation.hpp"
differenceEquation::differenceEquation(std::vector<std::complex<double>> a,std::vector<std::complex<double>> b)
{

	setA(a);
	setB(b);
}
differenceEquation::differenceEquation(differenceEquation &toCopy) noexcept : a{toCopy.getA()}, b{toCopy.getB()}, response{toCopy.getResponse()}
{

}
differenceEquation& differenceEquation::operator=(differenceEquation &toCopy) noexcept
{
	setA(toCopy.getA());
	setB(toCopy.getB());
	setResponse(toCopy.getResponse());
	return *this;
}
differenceEquation::differenceEquation(differenceEquation &&toMove) noexcept : a{std::move(toMove.getA())}, b{std::move(toMove.getB())}, response{std::move(toMove.getResponse())}
{

}
differenceEquation& differenceEquation::operator=(differenceEquation &&toMove) noexcept
{
	setA(std::move(toMove.getA()));
	setB(std::move(toMove.getB()));
	setResponse(std::move(toMove.getResponse()));
	return *this;
}
std::complex<double> differenceEquation::get(long long int n)//causal
{
	if(n < response.size() && n >= 0)
		return response.at(n);
	else
		return 0;
}
std::vector<std::complex<double>> differenceEquation::impulse(long long int n)
{
	std::vector<std::complex<double>> x(b.size());
	std::vector<std::complex<double>> y(a.size());
	response.clear();
	for(auto & i : y)//condições iniciais zeradas
		i=0;

	for(auto &i : x)//Impulso
		i=0;

	x[0]=1;


	for(int k=0 ; k < n ; k++)
	{
		response.push_back(std::complex<double> (0,0));

		for(int j=1 ; j < (int) a.size() ; j++)
			response[k]-=a[j]*y[j];
		for(int j=0 ; j < (int) b.size() ; j++)
			response[k]+=b[j]*x[j];

		response[k]/=a[0];
		y.insert(y.begin(),response[k]);
		y.pop_back();
		x.insert(x.begin(),std::complex<double> (0,0));
		x.pop_back();
	}

		return response;

}
std::vector<std::complex<double>> differenceEquation::step(long long int n)
{
	std::vector<std::complex<double>> x(b.size());
	std::vector<std::complex<double>> y(a.size());
	response.clear();

	for(auto & i : y)//condições iniciais zeradas
		i=0;

	for(auto &i : x)//Degrau
		i=1;


	for(int k=0 ; k < n ; k++)
	{
		response.push_back(std::complex<double> (0,0));

		for(int j=1 ; j < (int) a.size() ; j++)
			response[k]-=a[j]*y[j];

		for(int j=0 ; j < (int) b.size() ; j++)
			response[k]+=b[j]*x[j];


		response[k]/=a[0];
		y.insert(y.begin(),response[k]);
		y.pop_back();

	}

		return response;
}
const std::vector<std::complex<double>>& differenceEquation::getA() const
{
	return a;
}

void differenceEquation::setA(const std::vector<std::complex<double>> &a)
{
	this->a = a;
}

const std::vector<std::complex<double>>& differenceEquation::getB() const
{
	return b;
}

void differenceEquation::setB(const std::vector<std::complex<double>> &b)
{
	this->b = b;
}

const std::vector<std::complex<double> >& differenceEquation::getResponse() const
{
	return response;
}

void differenceEquation::setResponse(const std::vector<std::complex<double> > &response)
{
	this->response = response;
}