Embedded C programming Tutorial , Keil C ide , microsoftware.gr - 26. The sieve of Eratosthenes

	Embedded C programming Tutorial , Keil C ide , microsoftware.gr
	Keil CRC and CAN BUS codes.

1. Shift led left

2.It's time for DAVE! <7/6/13>

3.Capture/Compare unit 6

4.ASC0-GPT1-MACROS

5.ASC0-FIFO-PEC

6.Analog converter

7.Memory manipulation routines

9.Understanding interrupt priorities using CAPCOM2 module

10. POINTERS TO FUNCTION <4/7/13>,<4/28/13>

11.Memory models, memory types

12. The heap , part 1

13. The heap , part 2

14. The heap , part 3

15. Structure example

16. Nested structures, Array of structures.

17. Passing array of structures to function using pointers.<1/5/13>

18. Self Referential Structures

20. Linked list example

21. Circular linked list

22. Union example

23. Enumeration example

24. Watchdog timer example

25. Void pointer example <7/4/13>

26. The sieve of Eratosthenes

28. Union and bitfields as flags example. <6/23/13>

29. Look up table example. <8/11/13>

30. Seven segment display multiplexing -four digits with dot- example

31. LCD character display example - JHD162A

32. Hash table introduction example <8/27/14>

33. Array of Linked Lists example

34. Array of Linked lists-more functions included.

35. Hash table construction,searching and printing.

36. Fininte state machines- a first approach.

37. Finite state machines- two events example.

38. SPI port and an AT25128 serial eeprom hardware.

40. Definite Integral Calculator for Scientists, Engineers...

41 .Hamming distance of a CRC polynomial

42. Linux play starting.

43. Galois GF(2^4) Finite Field

44. Construct your own time triggered real time operating system.

45. CANBUS C CODE EXAMPLE.

26. The sieve of Eratosthenes

This article presents a computer speed quality measurment process.

The sieve of Eratosthenes is an algorithm to find prime numbers developed by the famous ancient Greek mathematician Eratosthenes . It is useful to measure the speed quality of a computer.
At this example , to find prime numbers, we will use the formula 2v+3, v=0,1,2,3... and killing all the multiples (the killed multiples are ocoupied by zeros at the result presentation at Hyperterminal).
To measure the speed of calculation of prime numbers we use the timer T2 that is included at GPT1 module of the microcontroller. The time base of T2 is configured by DAVE to be at 2560 μsec and the speed of calculation (the elapsed time at the T2 register) is measured to be at thousands of μsec. The clock of the microcontroller is configured by DAVE to run at 12.5 MHZ.
We can start, stop and read T2 using macros defined at gpt1.h file.

The C code The result

|

|

|

EXPLORE EMBEDDEDE C

|

|

|