DSPIC33FJ128GP706A-I/MR Microchip Technology, DSPIC33FJ128GP706A-I/MR Datasheet - Page 77

• Manufacturer Part Number: DSPIC33FJ128GP706A-I/MR
• Description: IC DSPIC MCU/DSP 128K 64-QFN
• Manufacturer: Microchip Technology
• Series: dsPIC™ 33Fr

Specifications of DSPIC33FJ128GP706A-I/MR

• Core Processor: dsPIC
• Core Size: 16-Bit
• Speed: 40 MIPs
• Connectivity: CAN, I²C, IrDA, LIN, SPI, UART/USART
• Peripherals: AC'97, Brown-out Detect/Reset, DMA, I²S, POR, PWM, WDT
• Number Of I /o: 53
• Program Memory Size: 128KB (128K x 8)
• Program Memory Type: FLASH
• Ram Size: 16K x 8
• Voltage - Supply (vcc/vdd): 3 V ~ 3.6 V
• Data Converters: A/D 18x10b/12b
• Oscillator Type: Internal
• Operating Temperature: -40°C ~ 85°C
• Package / Case: 64-VFQFN, Exposed Pad
• Product: DSCs
• Processor Series: DSPIC33F
• Core: dsPIC
• 3rd Party Development Tools: 52713-733, 52714-737, 53276-922, EWDSPIC
• Development Tools By Supplier: PG164130, DV164035, DV244005, DV164005, PG164120, DM240001, DV164033
• Core Frequency: 40MHz
• Core Supply Voltage: 3.3V
• Embedded Interface Type: I2C, SPI, UART
• No. Of I/o's: 53
• Flash Memory Size: 128KB
• Supply Voltage Range: 3V To 3.6V
• Rohs Compliant: No
• Lead Free Status / RoHS Status: Lead free / RoHS Compliant
• Eeprom Size: -
• Lead Free Status / Rohs Status: Lead free / RoHS Compliant

© 2009 Microchip Technology Inc.
Assuming that the integral starts at β, then:
EQUATION C-5:
Likewise, as strict integration cannot be realized in the entire cycle, so:
EQUATION C-6:
Similarly, the integral value of above equation is related to β with 2π as its period, let’s
denote it as F
F
EQUATION C-7:
It can be proved that,
EQUATION C-8:
In practical applications, it is necessary to sample the continuous analog signals and
process the data obtained with discrete algorithms. The quasi-synchronous recursive
process mentioned above can be expressed as follows:
For Equation C-4, the integral interval [x
can be divided equally into n x N sections, which results in n x N + 1 sampled data,
f(x
2
(x), and a recurrence formula can be obtained as the following:
i
), (i=0,1,...,nxN), and we can iterate as follows:
2
(β). If it won't confuse people, we'll write F
f x ( )
F
f x ( )
n
=
( )
α
F
=
1
=
( )
F
α
1
---------------- -
2
n
( )
lim
Power Calculation Theory
π
–
α
≠
1
+
∞
---------------- -
2
π
Δ
F
=
0
1
n
+
, x
⋅
( )
----- -
2
(
1
α
Δ
x
0
π
+
+ n x (2π + Δ)] whose width is n x (2π + Δ)
⋅
⋅
2
(
=
(
∫
x
β
π
β
+
+
+
f x ( )
∫
β
2
Δ
2
∫
β
π
π
)
F
)
+
F
n 1
Δ
1
–
)
( )
F
α
x ( ) x d
1
( )
1
d
α
(α) and F
α
d
α
2
(β) as F
DS51723A-page 77
1
(x) and