A recursive method for vector generation in non-increasing order of its likelihood for all binary vectors and its application for linear block code decodings

Takuya Kusaka; Ryuhei Yokoyama; Toru Fujiwara

doi:10.1587/transfun.E95.A.801

A recursive method for vector generation in non-increasing order of its likelihood for all binary vectors and its application for linear block code decodings

Takuya Kusaka, Ryuhei Yokoyama, Toru Fujiwara

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

A recursive and efficient method for generating binary vectors in non-increasing order of their likelihood for a set of all binary vectors is proposed. Numerical results on experiments show the effectiveness of this method. Efficient decoding algorithms with simulation results are also proposed as applications of the method.

Original language	English
Pages (from-to)	801-810
Number of pages	10
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E95-A
Issue number	4
DOIs	https://doi.org/10.1587/transfun.E95.A.801
Publication status	Published - Apr 2012

Keywords

Binary vector
Enumeration
MLD
Recursive algorithm
Soft-decision

ASJC Scopus subject areas

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1587/transfun.E95.A.801

Cite this

A recursive method for vector generation in non-increasing order of its likelihood for all binary vectors and its application for linear block code decodings. / Kusaka, Takuya; Yokoyama, Ryuhei; Fujiwara, Toru.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E95-A, No. 4, 04.2012, p. 801-810.

Research output: Contribution to journal › Article › peer-review

@article{7ace7fbf93254adaa567431267b402ed,

title = "A recursive method for vector generation in non-increasing order of its likelihood for all binary vectors and its application for linear block code decodings",

abstract = "A recursive and efficient method for generating binary vectors in non-increasing order of their likelihood for a set of all binary vectors is proposed. Numerical results on experiments show the effectiveness of this method. Efficient decoding algorithms with simulation results are also proposed as applications of the method.",

keywords = "Binary vector, Enumeration, MLD, Recursive algorithm, Soft-decision",

author = "Takuya Kusaka and Ryuhei Yokoyama and Toru Fujiwara",

year = "2012",

month = apr,

doi = "10.1587/transfun.E95.A.801",

language = "English",

volume = "E95-A",

pages = "801--810",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "4",

}

TY - JOUR

T1 - A recursive method for vector generation in non-increasing order of its likelihood for all binary vectors and its application for linear block code decodings

AU - Kusaka, Takuya

AU - Yokoyama, Ryuhei

AU - Fujiwara, Toru

PY - 2012/4

Y1 - 2012/4

N2 - A recursive and efficient method for generating binary vectors in non-increasing order of their likelihood for a set of all binary vectors is proposed. Numerical results on experiments show the effectiveness of this method. Efficient decoding algorithms with simulation results are also proposed as applications of the method.

AB - A recursive and efficient method for generating binary vectors in non-increasing order of their likelihood for a set of all binary vectors is proposed. Numerical results on experiments show the effectiveness of this method. Efficient decoding algorithms with simulation results are also proposed as applications of the method.

KW - Binary vector

KW - Enumeration

KW - MLD

KW - Recursive algorithm

KW - Soft-decision

UR - http://www.scopus.com/inward/record.url?scp=84859396023&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859396023&partnerID=8YFLogxK

U2 - 10.1587/transfun.E95.A.801

DO - 10.1587/transfun.E95.A.801

M3 - Article

AN - SCOPUS:84859396023

SN - 0916-8508

VL - E95-A

SP - 801

EP - 810

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 4

ER -

A recursive method for vector generation in non-increasing order of its likelihood for all binary vectors and its application for linear block code decodings

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this