Resumes
Resumes
Jari Parviainen Phones & Addresses
-
2205 All Saints Ln, Plano, TX 75025
-
Cupertino, CA
-
Colton, TX
Publications
Us Patents
Method And Arrangement For Enhancing Search Through Trellis
View pageUS Patent:
20050086577, Apr 21, 2005
Filed:
Nov 27, 2002
Appl. No.:
10/496759
Inventors:
Teemu Sipilä - Oulunsalo, FI
Jari Parviainen - Plano TX, US
Jari Parviainen - Plano TX, US
International Classification:
H03M013/03
US Classification:
714792000
Abstract:
The invention relates to an arrangement and method for enhancing a search through a trellis in connection with decoding or channel correction, for instance. When searching through the trellis, the state indexes being processed are divided into more than one subset at each stage of the trellis, the path metrics of the state indexes are defined in the subsets, and a predefined number of state indexes are selected for continuation from each subset on the basis of the metrics.
Method And Arrangement For Enhancing Search Through Trellis
View pageUS Patent:
7159167, Jan 2, 2007
Filed:
May 26, 2003
Appl. No.:
10/516120
Inventors:
Jari Parviainen - Plano TX, US
Teemu Sipila - Oulunsalo, FI
Teemu Sipila - Oulunsalo, FI
Assignee:
Nokia Corporation - Espoo
International Classification:
H03M 13/03
US Classification:
714792, 714796, 375265, 375341
Abstract:
The invention relates to a method and arrangement for enhancing a search through a trellis in a detector () that is arranged at each stage of the trellis to select a certain set of state indexes of the stage for continuation. The detector () is arranged, when each stage of the trellis is calculated, to define more than one unequal threshold value for the values of the state indexes, each threshold value defining one state index group, to calculate for each state index a path metric, to arrange the calculated state indexes into different groups by comparing the path metric value of the state index with the threshold values. Further the detector selects from the groups a certain number of state indexes for continuation in such a manner that starting from the group comprising the highest state indexes, entire groups are selected for continuation until the next entire group does not fit in. From this group only randomly selected state indexes are selected until a given number is collected.