Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. The Lounge
  3. Embedded CRC algorithm

Embedded CRC algorithm

Scheduled Pinned Locked Moved The Lounge
htmlcomhardwarealgorithmsquestion
3 Posts 3 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • B Offline
    B Offline
    Brakanjan
    wrote on last edited by
    #1

    Hi I'm look for the shortest and fastest possible CRC algorithm to use for embedded programming...anyone stumbled across any recently? BTW, try this. tx

    P S 2 Replies Last reply
    0
    • B Brakanjan

      Hi I'm look for the shortest and fastest possible CRC algorithm to use for embedded programming...anyone stumbled across any recently? BTW, try this. tx

      P Offline
      P Offline
      Phil Speller
      wrote on last edited by
      #2

      There is more than one type of CRC algorithm, but here[^] you'll find a link to the CRC32 code used in ZLib. It is copyrighted, but whether that means just the code or the algorithm as well I'm not sure. Well, the quiz didn't mention anything about the 3 people communicating with each other, so I thought of using hand-signals pass on what each person saw the others wearing. Phil

      1 Reply Last reply
      0
      • B Brakanjan

        Hi I'm look for the shortest and fastest possible CRC algorithm to use for embedded programming...anyone stumbled across any recently? BTW, try this. tx

        S Offline
        S Offline
        Stuart Dootson
        wrote on last edited by
        #3

        You could try the table driven algorithm documented here[^]. I've used it for checksumming comms packets in an embedded application and the overhead was negligable. To verify my implementation, I ran it back to back with the Boost[^] CRC 32 implementation (on my PC, not in the target, that is). HTH Stuart Dootson 'Java, Basic, who cares - it's all a bunch of tree-hugging hippy cr*p'

        1 Reply Last reply
        0
        Reply
        • Reply as topic
        Log in to reply
        • Oldest to Newest
        • Newest to Oldest
        • Most Votes


        • Login

        • Don't have an account? Register

        • Login or register to search.
        • First post
          Last post
        0
        • Categories
        • Recent
        • Tags
        • Popular
        • World
        • Users
        • Groups