Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
show what you've done thus far.
basically, you should have 5 steps with 8 values per step. (there are 8 states, 000, 001, 010, ...)
the values are "number of errors required to get to this state."
at the end, you select the lowest number of errors of the 8 final states, then trace the valid state transitions backwards until you get the data. eg, each state can transition to (and transition from) exactly two other states.
I dont know how you used the viterbi algorithm. For viterbi to work properly, the traceback depth should be "K*5 for non-punctured viterbi decoder" and "K*7 for punctured viterbi decoder" where K is constraint length. In you case K=3.