| タイトル | Reliability - Based Hybrid ARQ Scheme with Encoded Parity Bit Retransmissions and Message Passing Decoding |
|---|---|
| 著者 | Daiki Koizumi 、Naoto Kobayashi 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| 年度 | 2007 |
| 形式 | 論文誌 |
| 分野 | 通信路符号化 |
| 掲載雑誌名 | IEICE Trans. Fundamentals |
| 掲載号・ページ | vol.E90-A, no.9, pp.1736-1744 |
| 掲載年 | 2007 |
| 掲載月 | 9 |
| アブスト （日本語） |
査読：有 DOI：10.1093/ietfec/e90-a.9.1736 |
| アブスト （英語） |
Reliability-based hybrid ARQ (RB-HARQ) is a kind of incremental-redundancy ARQ recently introduced. In the RB-HARQ, the receiver returns both NAK signal and set of unreliable bit indices if the received sequence is not accepted. Since each unreliable bit index is determined by the bitwise posterior probability, better approximation of that probability becomes crucial as the number of retransmissions increases. Assuming the systematic code for the initial transmission, the proposed RB-HARQ scheme has the following two features: (a) the sender retransmits newly encoded and interleaved parity bits corresponding to the unreliable information bits; (b) the retransmitted parity bits as well as the initial received sequence are put all together to perform the message passing decoding i.e. the suboptimal MAP decoding. Finally, simulation results are shown to evaluate the above two features. |
| 備考 （日本語） |
3 |
| 備考 （英語） |
3 |
| 論文原稿 | |
| 発表資料 |
関連論文
- A New Latent Class Model for Analysis of Purchasing and Browsing Histories on EC Sites
- Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels
- A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
- Parallel Architecture for Generalized LFSR in LSI Built-In Self Testing
- Parallel Encoder and Decoder Architecture for Cyclic Codes
- A Generalization of B.S.Clarke and A.R.Barron's Asymptotics of Bayes Codes for FSMX Sources
- Almost Sure and Mean Convergence of Extended Stochastic Complexity
- A Source Model with Probability Distribution over Word Set and Recurrence Time Theorem
- Properties of a Word-Valued Source with a Non-prefix-free Word Set
- Asymptotics of Bayesian Inference for a Class of Probabilistic Models under Misspecification
- An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
- On the Overflow Probability of Fixed - to - Variable Length Codes with Side Information
- A Study on the Degrees of Freedom in an Experimental Design Model Based on an Orthonormal System
- A Note on Relation between the Fourier Coefficients and the Effects in the Experimental Design
- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
- A Note on the Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel
- A Note on Automatic Construction Algorithms for Orthogonal Designs of Experiments Using Error-correcting Codes
- A Note on the Branch-and-Cut Approach to Decoding Linear Block Codes
- Estimation of the Effects in the Experimental Design using Fourier Transforms
- A Note on a Sampling Theorem for Functions over $GF(q)^n$ Domain
