DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwak, J | ko |
dc.contributor.author | Yoon, SS | ko |
dc.contributor.author | Park, SM | ko |
dc.contributor.author | Kim, KS | ko |
dc.contributor.author | Lee, Kwyro | ko |
dc.date.accessioned | 2013-03-04T19:57:02Z | - |
dc.date.available | 2013-03-04T19:57:02Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2003-02 | - |
dc.identifier.citation | IEICE TRANSACTIONS ON COMMUNICATIONS, v.E86B, pp.844 - 846 | - |
dc.identifier.issn | 0916-8516 | - |
dc.identifier.uri | http://hdl.handle.net/10203/83919 | - |
dc.description.abstract | A simple address indexing method is proposed for path memory management in multi-PE Viterbi decoder, which solves data read/write conflict problem completely. This method not only simplifies control and addressing overhead but also has the advantage of requiring only two memory banks regardless of the number of PE's, with 100% PE utilization. | - |
dc.language | English | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.subject | ALGORITHM | - |
dc.title | A simple and efficient path metric memory management for Viterbi decoder composed of many processing elements | - |
dc.type | Article | - |
dc.identifier.wosid | 000181032100043 | - |
dc.identifier.scopusid | 2-s2.0-0043011160 | - |
dc.type.rims | ART | - |
dc.citation.volume | E86B | - |
dc.citation.beginningpage | 844 | - |
dc.citation.endingpage | 846 | - |
dc.citation.publicationname | IEICE TRANSACTIONS ON COMMUNICATIONS | - |
dc.contributor.localauthor | Lee, Kwyro | - |
dc.contributor.nonIdAuthor | Kwak, J | - |
dc.contributor.nonIdAuthor | Yoon, SS | - |
dc.contributor.nonIdAuthor | Park, SM | - |
dc.contributor.nonIdAuthor | Kim, KS | - |
dc.type.journalArticle | Letter | - |
dc.subject.keywordAuthor | decoding | - |
dc.subject.keywordAuthor | convolutional codes | - |
dc.subject.keywordAuthor | memory addressing | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.