A parallel Viterbi decoding algorithm
In this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array. We describe the algorith...
Uloženo v:
| Vydáno v: | Concurrency and computation Ročník 13; číslo 2; s. 95 - 102 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Chichester, UK
John Wiley & Sons, Ltd
01.02.2001
|
| Témata: | |
| ISSN: | 1532-0626, 1532-0634 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array. We describe the algorithm for Bose–Chaudhuri–Hocquenghem (BCH) codes which have a task graph with its valence restricted to four inputs and four outputs. The method is also applicable to convolution codes, but the complexity of the task graph increases with the number of input bits for these codes. Results for BCH codes are given for two general purpose parallel machines, an IBM SP2 and a Meiko CS2. Copyright © 2001 John Wiley & Sons, Ltd. |
|---|---|
| AbstractList | In this paper we express the Viterbi algorithm as a matrix-vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array. We describe the algorithm for Bose-Chaudhuri-Hocquenghem (BCH) codes which have a task graph with its valence restricted to four inputs and four outputs. The method is also applicable to convolution codes, but the complexity of the task graph increases with the number of input bits for these codes. Results for BCH codes given for two general purpose parallel machines, an IBM SP2 and a Meiko CS2. In this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array. We describe the algorithm for Bose–Chaudhuri–Hocquenghem (BCH) codes which have a task graph with its valence restricted to four inputs and four outputs. The method is also applicable to convolution codes, but the complexity of the task graph increases with the number of input bits for these codes. Results for BCH codes are given for two general purpose parallel machines, an IBM SP2 and a Meiko CS2. Copyright © 2001 John Wiley & Sons, Ltd. |
| Author | Reeve, J. S. |
| Author_xml | – sequence: 1 givenname: J. S. surname: Reeve fullname: Reeve, J. S. email: jsr@ecs.soton.ac.uk organization: Department of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, U.K |
| BookMark | eNp10M1OAjEUBeDGYCKg8RVmoy7MYG87v0uCgEZEF4rLptO5g9Uyg-0Q5e0dM4SF0dW5iy83J6dHOmVVIiGnQAdAKbtSaxyEPD0gXQg582nEg87-ZtER6Tn3RikA5dAlZ0NvLa00Bo230DXaTHs5qirX5dKTZllZXb-ujslhIY3Dk132yfNk_DS68WcP09vRcOYrzpLUZzRKkjCjGfCgCZkCixFSiBPOVNMggBwKoMgoQ57FOed5HKgikUXGQxkx3ifn7d-1rT426Gqx0k6hMbLEauMEi1LgLA4a6LdQ2co5i4VQupa1rsraSm0EUPEzhmjGEM0Yjb_45ddWr6Td_iEvW_mpDW7_Y2L0OG71rod2NX7ttbTvIop5HIqX-VTQu-B-vrieCMq_AbUqe04 |
| CitedBy_id | crossref_primary_10_1016_j_sigpro_2005_05_016 crossref_primary_10_1109_TNNLS_2013_2281761 |
| Cites_doi | 10.1023/A:1008114510995 10.1016/S0165-1684(00)00027-X 10.1364/AO.39.000269 10.1364/JOSAA.17.000265 10.1016/S0165-1684(99)00176-0 10.1109/4.845186 10.1002/j.1538-7305.1948.tb01338.x 10.1109/30.793540 10.1145/367766.368168 10.1016/S0019-9958(60)90287-4 10.1109/25.845103 10.1109/TIT.1967.1054010 |
| ContentType | Journal Article |
| Copyright | Copyright © 2001 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: Copyright © 2001 John Wiley & Sons, Ltd. |
| DBID | BSCLL AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1002/cpe.539 |
| DatabaseName | Istex CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Technology Research Database CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1532-0634 |
| EndPage | 102 |
| ExternalDocumentID | 10_1002_cpe_539 CPE539 ark_67375_WNG_0K4MNVDF_0 |
| Genre | article |
| GroupedDBID | .3N .DC .GA .Y3 05W 0R~ 10A 1L6 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACBWZ ACCZN ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEIGN AEIMD AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGYGG AHBTC AITYG AIURR AJXKR ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN BAFTC BDRZF BFHJK BHBCM BMNLL BROTX BRXPI BSCLL BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS EJD F00 F01 F04 F5P FEDTE G-S G.N GNP GODZA HF~ HGLYW HHY HVGLF HZ~ IX1 JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A O66 O9- OIG P2W P2X P4D PQQKQ Q.N Q11 QB0 QRW R.K ROL RX1 SUPJJ TN5 UB1 V2E W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 XV2 ~IA ~WT AAYXX CITATION O8X 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c3289-206885b0b1345b0a9127e1917832c15341d1f10e202e3b7d33d74cf8afb35a623 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000168190900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1532-0626 |
| IngestDate | Sun Nov 09 10:50:11 EST 2025 Sat Nov 29 01:41:08 EST 2025 Tue Nov 18 22:19:38 EST 2025 Tue Nov 11 03:09:45 EST 2025 Tue Nov 11 03:32:28 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3289-206885b0b1345b0a9127e1917832c15341d1f10e202e3b7d33d74cf8afb35a623 |
| Notes | ArticleID:CPE539 istex:D3B4D8E8E2D3466C67810ECE7A47CA567BAA93BD ark:/67375/WNG-0K4MNVDF-0 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 26913274 |
| PQPubID | 23500 |
| PageCount | 8 |
| ParticipantIDs | proquest_miscellaneous_26913274 crossref_citationtrail_10_1002_cpe_539 crossref_primary_10_1002_cpe_539 wiley_primary_10_1002_cpe_539_CPE539 istex_primary_ark_67375_WNG_0K4MNVDF_0 |
| PublicationCentury | 2000 |
| PublicationDate | February 2001 |
| PublicationDateYYYYMMDD | 2001-02-01 |
| PublicationDate_xml | – month: 02 year: 2001 text: February 2001 |
| PublicationDecade | 2000 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | Concurrency and computation |
| PublicationTitleAlternate | Concurrency Computat.: Pract. Exper |
| PublicationYear | 2001 |
| Publisher | John Wiley & Sons, Ltd |
| Publisher_xml | – name: John Wiley & Sons, Ltd |
| References | Kim KS, Song IH, Kim HG, Kim YH, Kim SY. A multiuser receiver for trellis-coded DS/CDMA systems in asynchronous channels. IEEE Transactions on Vehicle Technology 2000; 49:844-855. Hong SJ, Stark WE. Design and implementation of a low complexity VLSI turbo-code decoder architecture for low energy mobile wireless communications. Journal of Very Large Scale Integrated Signal Processing Systems and Signal Image Video Technology 2000; 24:43-57. Floyd RW. Algorithm 97: Shortest path. Communications of the ACM 1962; 5(6):345. Bose RC, Ray-Chaudhuri DK. On a class of error-correcting binary group codes. Information and Control 1960; 3:68-79. Kumar V, Grama A, Gupta A, Karypis G. Introduction to Parallel Computing, Design and Analysis of Algorithms. Benjamin-Cummings, 1994. Leus G, Moonen M. Viterbi and RLS decoding for deterministic blind symbol estimation in DS-CDMA wireless communication. Signal Processing 2000; 80:745-771. Neifeld MA, Xuan RZ, Marcellin MW. Communication theoretic image restoration for binary-valued imagery. Applied Optics 2000; 39:269-276. Viterbi AJ. Error bounds for convolution codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 1967; 13:260-269. Blahut RE. Theory and Practice of Error Control Codes. Addison-Wesley, 1983. Biglieri E, Caire G, Taricco G. Coding for the fading channel: a survey. Signal Processing 2000; 80:1135-1148. Gropp W, Lusk E, Skjellum A. USING MPI, Portable Parallel Programming with the Message Passing Interface. MIT Press, 1992. Berlekamp ER. Algebraic Coding Theory. McGraw-Hill Inc, 1968. Shannon CE. A mathematical theory of communication. Bell Systems Technical Journal 1948; 27:379-423. Shieh MD, Wu CM, Chou HH, Chen MH, Liu CL. Design and implementation of a DAB channel decoder. IEEE Transactions on Consumer Electronics 1999; 45:553-562. Miller C, Hunt BR, Marcellin MW, Neifeld MA. Image restoration with the Viterbi algorithm. Journal of the Optical Society of America A 2000; 17:265-275. Chang YN, Suzuki H, Parhi KK. A 2-Mb/s 256-state 10-mW rate-1/3 Viterbi decoder. IEEE Journal of the Solid-State Circuit 2000; 35:826-834. Hocquenghem A. Codes correcteurs d'erreurs. Chiffres (Paris) 1959; 2:147-156. 2000; 49 2000; 17 2000; 39 1960; 3 1962; 5 2000; 35 2000; 24 1999; 45 1967; 13 1983 1994 2000; 80 1992 1959; 2 1968 1948; 27 Berlekamp ER (e_1_2_1_12_2) 1968 Blahut RE (e_1_2_1_13_2) 1983 e_1_2_1_6_2 e_1_2_1_7_2 e_1_2_1_4_2 e_1_2_1_5_2 e_1_2_1_2_2 e_1_2_1_11_2 e_1_2_1_3_2 e_1_2_1_10_2 Hocquenghem A (e_1_2_1_15_2) 1959; 2 Gropp W (e_1_2_1_18_2) 1992 e_1_2_1_14_2 Kumar V (e_1_2_1_16_2) 1994 e_1_2_1_8_2 e_1_2_1_17_2 e_1_2_1_9_2 |
| References_xml | – reference: Gropp W, Lusk E, Skjellum A. USING MPI, Portable Parallel Programming with the Message Passing Interface. MIT Press, 1992. – reference: Chang YN, Suzuki H, Parhi KK. A 2-Mb/s 256-state 10-mW rate-1/3 Viterbi decoder. IEEE Journal of the Solid-State Circuit 2000; 35:826-834. – reference: Floyd RW. Algorithm 97: Shortest path. Communications of the ACM 1962; 5(6):345. – reference: Miller C, Hunt BR, Marcellin MW, Neifeld MA. Image restoration with the Viterbi algorithm. Journal of the Optical Society of America A 2000; 17:265-275. – reference: Blahut RE. Theory and Practice of Error Control Codes. Addison-Wesley, 1983. – reference: Biglieri E, Caire G, Taricco G. Coding for the fading channel: a survey. Signal Processing 2000; 80:1135-1148. – reference: Leus G, Moonen M. Viterbi and RLS decoding for deterministic blind symbol estimation in DS-CDMA wireless communication. Signal Processing 2000; 80:745-771. – reference: Shieh MD, Wu CM, Chou HH, Chen MH, Liu CL. Design and implementation of a DAB channel decoder. IEEE Transactions on Consumer Electronics 1999; 45:553-562. – reference: Neifeld MA, Xuan RZ, Marcellin MW. Communication theoretic image restoration for binary-valued imagery. Applied Optics 2000; 39:269-276. – reference: Viterbi AJ. Error bounds for convolution codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 1967; 13:260-269. – reference: Bose RC, Ray-Chaudhuri DK. On a class of error-correcting binary group codes. Information and Control 1960; 3:68-79. – reference: Kumar V, Grama A, Gupta A, Karypis G. Introduction to Parallel Computing, Design and Analysis of Algorithms. Benjamin-Cummings, 1994. – reference: Kim KS, Song IH, Kim HG, Kim YH, Kim SY. A multiuser receiver for trellis-coded DS/CDMA systems in asynchronous channels. IEEE Transactions on Vehicle Technology 2000; 49:844-855. – reference: Hocquenghem A. Codes correcteurs d'erreurs. Chiffres (Paris) 1959; 2:147-156. – reference: Shannon CE. A mathematical theory of communication. Bell Systems Technical Journal 1948; 27:379-423. – reference: Hong SJ, Stark WE. Design and implementation of a low complexity VLSI turbo-code decoder architecture for low energy mobile wireless communications. Journal of Very Large Scale Integrated Signal Processing Systems and Signal Image Video Technology 2000; 24:43-57. – reference: Berlekamp ER. Algebraic Coding Theory. McGraw-Hill Inc, 1968. – volume: 80 start-page: 745 year: 2000 end-page: 771 article-title: Viterbi and RLS decoding for deterministic blind symbol estimation in DS‐CDMA wireless communication publication-title: Signal Processing – volume: 2 start-page: 147 year: 1959 end-page: 156 article-title: Codes correcteurs d'erreurs publication-title: Chiffres (Paris) – year: 1983 – volume: 24 start-page: 43 year: 2000 end-page: 57 article-title: Design and implementation of a low complexity VLSI turbo‐code decoder architecture for low energy mobile wireless communications publication-title: Journal of Very Large Scale Integrated Signal Processing Systems and Signal Image Video Technology – volume: 3 start-page: 68 year: 1960 end-page: 79 article-title: On a class of error‐correcting binary group codes publication-title: Information and Control – volume: 49 start-page: 844 year: 2000 end-page: 855 article-title: A multiuser receiver for trellis‐coded DS/CDMA systems in asynchronous channels publication-title: IEEE Transactions on Vehicle Technology – volume: 17 start-page: 265 year: 2000 end-page: 275 article-title: Image restoration with the Viterbi algorithm publication-title: Journal of the Optical Society of America – year: 1968 – volume: 45 start-page: 553 year: 1999 end-page: 562 article-title: Design and implementation of a DAB channel decoder publication-title: IEEE Transactions on Consumer Electronics – volume: 13 start-page: 260 year: 1967 end-page: 269 article-title: Error bounds for convolution codes and an asymptotically optimum decoding algorithm publication-title: IEEE Transactions on Information Theory – volume: 5 issue: 6 year: 1962 article-title: Algorithm 97: Shortest path publication-title: Communications of the ACM – volume: 80 start-page: 1135 year: 2000 end-page: 1148 article-title: Coding for the fading channel: a survey publication-title: Signal Processing – year: 1992 – volume: 35 start-page: 826 year: 2000 end-page: 834 article-title: A 2‐Mb/s 256‐state 10‐mW rate‐1/3 Viterbi decoder publication-title: IEEE Journal of the Solid‐State Circuit – year: 1994 – volume: 27 start-page: 379 year: 1948 end-page: 423 article-title: A mathematical theory of communication publication-title: Bell Systems Technical Journal – volume: 39 start-page: 269 year: 2000 end-page: 276 article-title: Communication theoretic image restoration for binary‐valued imagery publication-title: Applied Optics – ident: e_1_2_1_11_2 doi: 10.1023/A:1008114510995 – ident: e_1_2_1_3_2 doi: 10.1016/S0165-1684(00)00027-X – volume-title: Algebraic Coding Theory year: 1968 ident: e_1_2_1_12_2 – ident: e_1_2_1_8_2 doi: 10.1364/AO.39.000269 – volume-title: Theory and Practice of Error Control Codes year: 1983 ident: e_1_2_1_13_2 – ident: e_1_2_1_7_2 doi: 10.1364/JOSAA.17.000265 – volume-title: USING MPI, Portable Parallel Programming with the Message Passing Interface year: 1992 ident: e_1_2_1_18_2 – ident: e_1_2_1_5_2 doi: 10.1016/S0165-1684(99)00176-0 – ident: e_1_2_1_10_2 doi: 10.1109/4.845186 – ident: e_1_2_1_2_2 doi: 10.1002/j.1538-7305.1948.tb01338.x – ident: e_1_2_1_6_2 doi: 10.1109/30.793540 – ident: e_1_2_1_17_2 doi: 10.1145/367766.368168 – volume-title: Introduction to Parallel Computing, Design and Analysis of Algorithms year: 1994 ident: e_1_2_1_16_2 – ident: e_1_2_1_14_2 doi: 10.1016/S0019-9958(60)90287-4 – ident: e_1_2_1_4_2 doi: 10.1109/25.845103 – volume: 2 start-page: 147 year: 1959 ident: e_1_2_1_15_2 article-title: Codes correcteurs d'erreurs publication-title: Chiffres (Paris) – ident: e_1_2_1_9_2 doi: 10.1109/TIT.1967.1054010 |
| SSID | ssj0011031 |
| Score | 1.5747913 |
| Snippet | In this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The... In this paper we express the Viterbi algorithm as a matrix-vector reduction in which multiplication is replaced by addition and addition by minimization. The... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 95 |
| SubjectTerms | BCH codes trellis decoding Viterbi decoding |
| Title | A parallel Viterbi decoding algorithm |
| URI | https://api.istex.fr/ark:/67375/WNG-0K4MNVDF-0/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.539 https://www.proquest.com/docview/26913274 |
| Volume | 13 |
| WOSCitedRecordID | wos000168190900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1532-0634 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011031 issn: 1532-0626 databaseCode: DRFUL dateStart: 20010101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwEB1By4ELZRVlzQG4BRIvuDlWXUCiRAhB4WZ5K1SEFqUt4vOxk7RQISQkTj5krMT2TGbGHr8HcCRYLehppn3poD4JJtKPKGU-FcQgHGklMvq2bofFce3xMbr5RvWV40PMNtycZWT_a2fgQo7OvkBD1Zs5pThahDKyWktKUG7etu87syMEx1-Qg6UiP7Bhe35j1nU-K7rOuaKym9WPuTjze7SauZt25R8fugorRYzp1XOlWIMFM1iHypS_wSvMeQOO655D_k4Sk3hddxVZ9j1t01HnzjyRPA3T_vj5dRPu2627xqVf0Cb4CiNXs-R4ZKgMZIiJbUQUImZcWmaNV9npIKEOe2FgUIAMlkxjrBlRvZroSUyFDYe2oDQYDsw2eAxpRKU2NsYixChqjR0rhNh5qKMgqpkqnExnkKsCU9xRWyQ8R0NG3A6e28FXwZsJvuUwGj9FTrIlmD0X6YurOmOUP8QXPLgi13G32eZBFQ6na8StLbgDDjEww8mIo_PIJteMVOEoW5DfXsUbNy3b7PxNbBeW88IzV8OyB6VxOjH7sKTex_1RelCo3SfAl9hY |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZgQ4IL4ynGaz0At0KbB1mPiDFAGxVCMLhFaZLBRNnQGIifT9x2A4SQkDjlUEdt_KidxP4MsKNEPegaYfwEoT4ZZYkfcS58rpglNDJaZe3bOm0Rx_W7u-iyyKrEWpgcH2Jy4IaWkf2v0cDxQPrgEzVUP9t9TqNpKDOnRLwE5cZV86Y9uUPABgY5WirxAxe35yWzOPmgmPrNF5WRre_fAs2v4Wrmb5qV_3zpAswXUaZ3lKvFIkzZ_hJUxh0cvMKgl2H3yEPs7zS1qdfBYuSk5xm3IUWH5qn0fjDsjR6eVuCmeXJ9fOYXjRN8TQlmLWEnGZ4ESUiZG1QUEmFxY-bMVzt-sNCE3TCwJCCWJsJQagTT3brqJpQrFxCtQqk_6Ns18AQxhCfGuiiLMau5M3eqCRGHoYmCqG6rsDdmodQFqjg2t0hljodMpFu8dIuvgjchfM6BNH6S7GUymDxXw0fMOxNc3sanMmixi7jTaMqgCrWxkKSzBrziUH07eH2R5DBy22vBqrCTSeS3V8njyxM3rP-NrAazZ9cXbdk-j1sbMJenoWFGyyaURsNXuwUz-m3UexluFzr4AcIr3Eg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bT9swFD7aKEK8rIOBKJeRB9a3QOJLXT-iQreJElUTLbxZju1ARWirUqb9_PkkaQFNSEh78kNsOb588TnxOd8HcKRFO8qssGGKVJ-MsjSUnIuQa-YIldboQr5t2BNJ0r65kf0qqhJzYUp-iOUPN0RG8b1GgLupzU6eWUPN1B1zKj9CjXHZ8qCsnf3qDnrLOwQUMCjZUkkYebu9TJnFxidV01dnUQ2n9c8rQ_OluVqcN936_7zpZ_hUWZnBabktNuCDG29CfaHgEFSA_gLfTgPk_s5zlwdDTEZOR4H1DikeaIHObyez0fzuYQsG3fOrzo-wEk4IDSUYtYRKMjyN0pgyX2gZE-HQMfPwNX4-WGzjLI4ciYijqbCUWsFM1tZZSrn2BtE2rIwnY7cDgSCW8NQ6b2Ux5gz3cKeGENGKrYxk2zWguZhCZSpWcRS3yFXJh0yUH7zyg29AsKw4LYk0_q3SLNZg-VzP7jHuTHB1nXxX0QW7TIZnXRU14HCxSMqjAa849NhNnh4VaUnvXgvWgKNiRd7qSnX6577YfV-1Q1jr-357P5OLPVgvo9AwoGUfVuazJ3cAq-b3fPQ4-1ptwb-BItvD |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+parallel+Viterbi+decoding+algorithm&rft.jtitle=Concurrency+and+computation&rft.au=Reeve%2C+J.+S.&rft.date=2001-02-01&rft.pub=John+Wiley+%26+Sons%2C+Ltd&rft.issn=1532-0626&rft.eissn=1532-0634&rft.volume=13&rft.issue=2&rft.spage=95&rft.epage=102&rft_id=info:doi/10.1002%2Fcpe.539&rft.externalDBID=n%2Fa&rft.externalDocID=ark_67375_WNG_0K4MNVDF_0 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon |