Location:
Search - ISSP
Search list
Description: Features
■ AEC Qualified
■ Powerful Harvard Architecture Processor
❐ M8C Processor Speeds up to 24 MHz
❐ Low Power at High Speed
❐ 3.0V to 5.25V Operating Voltage
❐ Automotive Temperature Range: -40°C to +85°C
■ Advanced Peripherals (PSoC®
Blocks)
❐ 4 Analog Type “E” PSoC Blocks Provide:
• 2 Comparators with DAC References
• Up to 10-Bit Single or Dual, 24 Channel ADC
❐ 4 Digital PSoC Blocks Provide:
• 8 to 32-Bit Timers, Counters, and PWMs
• CRC and PRS Modules
• Full- or Half-Duplex UART
• SPI Master or Slave
• Connectable to All GPIO Pins
❐ Complex Peripherals by Combining Blocks
• Capacitive Sensing Application Capability
■ Flexible On-Chip Memory
❐ 8K Flash Program Storage
❐ 512 Bytes SRAM Data Storage
❐ In-System Serial Programming (ISSP)
❐ Partial Flash Updates
❐ Flexible Protection Modes
❐ EEPROM Emulation in Flash-Features
■ AEC Qualified
■ Powerful Harvard Architecture Processor
❐ M8C Processor Speeds up to 24 MHz
❐ Low Power at High Speed
❐ 3.0V to 5.25V Operating Voltage
❐ Automotive Temperature Range:-40°C to+85°C
■ Advanced Peripherals (PSoC®
Blocks)
❐ 4 Analog Type “E” PSoC Blocks Provide:
• 2 Comparators with DAC References
• Up to 10-Bit Single or Dual, 24 Channel ADC
❐ 4 Digital PSoC Blocks Provide:
• 8 to 32-Bit Timers, Counters, and PWMs
• CRC and PRS Modules
• Full- or Half-Duplex UART
• SPI Master or Slave
• Connectable to All GPIO Pins
❐ Complex Peripherals by Combining Blocks
• Capacitive Sensing Application Capability
■ Flexible On-Chip Memory
❐ 8K Flash Program Storage
❐ 512 Bytes SRAM Data Storage
❐ In-System Serial Programming (ISSP)
❐ Partial Flash Updates
❐ Flexible Protection Modes
❐ EEPROM Emulation in Fl
Platform: |
Size: 360448 |
Author: aaooaa |
Hits:
Description: 这是一个用AVR MCU ATmega48V模拟ISSP协议烧写塞普拉斯PSOC的下位机程序，只要完成接收上位机指令与hex,并反馈上位机烧写PSOC芯片。开发IDE为AVR Studio 4.上位机程序为c++ 编写-This is a C lanuage source code build in AVR Studio 4, compiler is AVR_GCC.Its function is translate the ISSP protocol, program the PSOC, Device is ATmega48V.
Platform: |
Size: 43008 |
Author: Yahui |
Hits:
Description: 这是一份ISSP 协议，讲述了ISSP烧写PSOC的具体流程与时序-ISSP protocol, indicate the timing and process for programming the PSOC
Platform: |
Size: 104448 |
Author: Yahui |
Hits:
Description: 这是一份ISSP 协议，讲述了ISSP烧写PSOC的具体流程与时序-This is a ISSP agreement about PSOC ISSP programming specific processes and timing. .
Platform: |
Size: 152576 |
Author: Yahui |
Hits:
Description: 在系统编程，基于issp协议实现了touch screen的firmware自动升级过程。-In-system programming, based on the protocol of the touch screen issp the firmware upgrade process automatically.
Platform: |
Size: 104448 |
Author: yunxiang |
Hits:
Description: Write two C++ programs (using STL preferably) to solve the stack permutation
problem discussed in Chapter 3 of the textbook.
(a) (5 ) Problem 1: Print all possible stack permutations of an incoming train of n elements.
(command line format example): allsp <no. of elements in the incoming train>
Try to execute your program when n equals 5. In addition to printing all possible stack
permutations, report the total number of them.
(b) (5 ) Problem 2: Check if a given permutation is producible by the stack permutation.
(command line format example): issp <a file containing a given permutation>
Execute your program to check if the following sequence is a valid stack permutation:
4 6 5 8 10 9 7 3 2 1 (output order: from left to right)
Simply answer YES or NO in your report.
-Write two C++ programs (using STL preferably) to solve the stack permutation
problem discussed in Chapter 3 of the textbook.
(a) (5 ) Problem 1: Print all possible stack permutations of an incoming train of n elements.
(command line format example): allsp <no. of elements in the incoming train>
Try to execute your program when n equals 5. In addition to printing all possible stack
permutations, report the total number of them.
(b) (5 ) Problem 2: Check if a given permutation is producible by the stack permutation.
(command line format example): issp <a file containing a given permutation>
Execute your program to check if the following sequence is a valid stack permutation:
4 6 5 8 10 9 7 3 2 1 (output order: from left to right)
Simply answer YES or NO in your report.
Platform: |
Size: 1024 |
Author: Joekids |
Hits: