| 摘要 |
PROBLEM TO BE SOLVED: To decode a grating code with a wide free distance by using a plural ity of processors, so as to decode the code according to a specific procedure. SOLUTION: A processor P<(> L<)> decides a set TM<(> L<)> including 2<m> of distance sets with respect to 2<m> of binary sets V<(> L<)> (t+Λ<(1)> +...+Λ<(> L<-1)> ), based on a signal y(t+i) to be decoded and gives the result to a processor P<(> L<-1)> , whereΛ<(1)> ,...,Λ<(> L<)> are constant and not negative. The processor P<(1)> decides 2<m> sets of TM<(1)> , including the distance with respect to 2<m> sets of possible values v<(1)> and gives the result to 2<m> sets of TM<(1)> , where (l) is L-1, L-2,..., 1. The processor P<(0)> recovers converted signals u, v<(0)> and the recovered signal v<(0)> is fed back into the processor P<(1)> . The processor P<(1)> feeds back V<(l+1)> to the processor P<(l+1)> , where (l)=1, 2,..., L-1.
|
