作者：
Park, GHYoon, SHHong, DKang, CEYonsei Univ
Dept Elect & Comp Engn Informat & Telecommun Lab Seodaemoon Gu Seoul 120749 South Korea LG Elect Inc
LG R&D Complex 533 Mobile Comm Res Lab Dept Mobile Comm TechDongan Gu Kyeongku Do 431749 South Korea
Several implementation methods for a MAP decoder are proposed in this paper, Using a novel pipeline structured time-shared process, the authors are able to efficiently overcome the restrictions imposed by the recursio...
详细信息
Several implementation methods for a MAP decoder are proposed in this paper, Using a novel pipeline structured time-shared process, the authors are able to efficiently overcome the restrictions imposed by the recursion process on state metrics. and the complexity of the MAP decoder can be reduced to a level on the order of a SOVA (Soft Output Viterbi algorithm) decoder. In addition. the authors propose an efficient controller structure that can be used for variable frame-size systems such as cdma-2000. The MAP decoder using a block-wise algorithm designed here was implemented in only one 20,000 gate circuit. It was validated by VHDL, which was compared with the results of the initial simulation (C programs). The decoder demonstrated a 300 kbps decoding processing ability with 8 iterations on a FPGA circuit, with a deviation only about 0.1-0.2 dB greater than that for an ideal MAP decoder, even when all hardware environments are considered.
Ranking query independent scholarly articles is a practical and difficult task, due to the heterogeneous, evolving and dynamic nature of entities involved in scholarly articles. To do this, we first propose a scholarl...
详细信息
ISBN:
(纸本)9781538655207
Ranking query independent scholarly articles is a practical and difficult task, due to the heterogeneous, evolving and dynamic nature of entities involved in scholarly articles. To do this, we first propose a scholarly article ranking model by assembling the importance of involved entities (i.e., articles, venues and authors) such that the importance is a combination of prestige and popularity to capture the evolving nature of entities. To compute the prestige of articles and venues, we propose a novel Time-Weighted PageRank that extends traditional PageRank with a time decaying factor. We then develop a batch algorithm for scholarly article ranking, in which we propose a block-wise method for Time-Weighted PageRank in terms of an analysis of the citation characteristics of scholarly articles. We further develop an incremental algorithm for dynamic scholarly article ranking, which partitions graphs into affected and unaffected areas, and employs different updating strategies for nodes in different areas. Using real-life data, we finally conduct an extensive experimental study, and show that our approach is both effective and efficient for ranking scholarly articles.
暂无评论