Mehmet Ertugrul Çelebi

Learn More
— In this paper, we propose efficient maximum-likelihood (ML) decoding for binary Kronecker product-based (KPB) codes. This class of codes, have a matrix defined by the n-fold iterated Kronecker product Gn = F ⊗n of a binary upper-triangular kernel matrix F, where some columns are suppressed given a specific puncturing pattern. Polar and Reed-Muller codes(More)
The key point in design of radial basis function networks is to specify the number and the locations of the centers. Several heuristic hybrid learning methods, which apply a clustering algorithm for locating the centers and subsequently a linear leastsquares method for the linear weights, have been previously suggested. These hybrid methods can be put into(More)
— In this paper, we propose a full rate space-time block code selection technique, which achieves full diversity when more than two transmit antennas are used for transmission. Only one or few feedback bits are needed at the transmitter, representing relative state information of the channels. Moreover, the proposed scheme allows separate decoding of(More)
—Polar coding is known as the first provably capacity-achieving coding scheme under low-complexity suboptimal successive cancelation decoding (SCD). The large error-correction capability of finite-length polar codes is mostly achieved with relatively long codes. SCD is the conventional decoder for polar codes and exhibits a quasi-linear complexity in terms(More)
—Polar codes are the first explicit class of codes that are provably capacity-achieving under the successive cancelation (SC) decoding. As a suboptimal decoder, SC has quasi-linear complexity N (1 + log N) in the code length N. In this paper, we propose a new non-binary SC decoder with reduced complexity N 2 (1 + log N 2) based on the folding operation,(More)