- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Note on the Branch-and-Cut Approach to Decoding Linear Block Codes (in Japanese) |
|---|---|
| Authors | Shunsuke Horii 、Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2009 |
| Format | International Conference |
| Category | Channel coding |
| Jounal Name | Proc. of 2010 International Workshop on Nonlinear Circuits, Communication and Signal Processing (NCSP'10) |
| Jounal Page | 321-324, Hawaii, USA |
| Published Year | 2010 |
| Published Month | 3 |
| Abstract （English） |
Maximum likelihood (ML) decoding of linear block codes can be considered as an integer linear programming (ILP). Since it is an NP-hard problem in general, there are many researches about the algorithms to approximately solve the problem. One of the most popular algorithms is linear programming (LP) decoding proposed by Feldman et al.. LP decoding is based on the LP relaxation, which is a method to approximately solve the ILP corresponding to the ML decoding problem. Advanced algorithms for solving ILP (approximately or exactly) include cutting-plane method and branchand- bound method. Another method for solving ILP is the branch-and-cut method, which is a hybrid of cutting-plane and branch-andbound methods. In this paper, we describe the branch-and-cut based ML decoding algorithm. The branch-and-cut method is widely used to solve ILP. The branch-and-cut method consists of some technical components and the performance of the algorithm depends on the selection of these components. It is important to consider how to select the technical components in the branch-and-cut method. We construct a generalized framework for the branch-and-cut based ML decoding and compare some algorithms with numerical simulations. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
