Search Results - "Kurkoski, Brian M."

Quantization of Binary-Input Discrete Memoryless Channels by Kurkoski, Brian M., Yagi, Hideki

“…The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm, which finds an optimal…”
Get full text

Construction D' Lattices for Power-Constrained Communications by Zhou, Fan, Kurkoski, Brian M.

“…Designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping are described. Two encoding…”
Get full text

Reliability-Based Decoding of Low-Density Lattice Codes Using Gaussian and Eisenstein Integers by Wiriya, Warangrat, Kurkoski, Brian M.

“…This paper proposes reliability-based decoding for complex low-density lattice codes (CLDLC) which can be applied to both Gaussian and Eisenstein integers. Two…”
Get full text

Algebra of L-Banded Matrices by Huang, Shunqi, Liu, Lei, Kurkoski, Brian M.

“…Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways…”
Get full text

The Three/Two Gaussian Parametric LDLC Lattice Decoding Algorithm and Its Analysis by Parrao Hernandez, Ricardo Antonio, Kurkoski, Brian M.

“…Low density lattice codes (LDLCs) are high-dimensional lattices with a sparse inverse generator matrix that can be decoded efficiently using iterative…”
Get full text

A Design of Overlapped Chunked Code over Compute-and-Forward for Multi-Source Multi-Relay Networks by Ngeth, Rithea, Kurkoski, Brian M, Lim, Yuto, Tan, Yasuo

“…This paper investigates the design of overlapped chunked codes (OCC) for multi-source multi-relay networks where a physical-layer network coding approach,…”
Get full text

Data sharing among wireless client devices in cooperative manner with minimum transmissions by Lin, Nyan, Kurkoski, Brian M., TAN, Yasuo, LIM, Yuto

“…A group of nearby wireless end devices such as mobile phones can benefit a fast service to satisfy their required packets by cooperating to exchange their…”
Get full text

Memory AMP by Liu, Lei, Huang, Shunqi, Kurkoski, Brian M.

“…Approximate message passing (AMP) is a low-cost iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian…”
Get full text

Encoding and Indexing of Lattice Codes by Kurkoski, Brian M.

“…Encoding and indexing of lattice codes is generalized from self-similar lattice codes to a broader class of lattices. If coding lattice <inline-formula>…”
Get full text

LDPC Decoding Mappings That Maximize Mutual Information by Romero, Francisco Javier Cuadros, Kurkoski, Brian M.

“…For low-density parity-check (LDPC) codes widely used in NAND flash memories, the bit-error rate performance is closely tied to the number of bits per message…”
Get full text

Steepest Gradient-Based Orthogonal Precoder for Integer-Forcing MIMO by Hasan, Mohammad Nur, Kurkoski, Brian M., Sakzad, Amin, Viterbo, Emanuele

“…In this paper, we develop an orthogonal precoding scheme for integer-forcing (IF) linear receivers using the steepest gradient algorithm. Although this scheme…”
Get full text

Coded Modulation Using Lattices and Reed-Solomon Codes, with Applications to Flash Memories by Kurkoski, Brian M.

“…This paper describes a coded modulation scheme where low-dimension lattices are used as the constellation, and Reed-Solomon codes are used for error…”
Get full text

Low-Dimensional Shaping for High-Dimensional Lattice Codes by Ferdinand, Nuwan S., Kurkoski, Brian M., Nokleby, Matthew, Aazhang, Behnaam

“…We propose two low-complexity lattice code constructions that have competitive coding and shaping gains. The first construction, named systematic Voronoi…”
Get full text

Sufficient Statistic Memory Approximate Message Passing by Liu, Lei, Huang, Shunqi, Kurkoski, Brian M.

“…Approximate message passing (AMP) type algorithms have been widely used in the signal reconstruction of certain large random linear systems. A key feature of…”
Get full text

Lattice-Based WOM Codes for Multilevel Flash Memories by Bhatia, Aman, Minghai Qin, Iyengar, Aravind R., Kurkoski, Brian M., Siegel, Paul H.

“…We consider t-write codes for write-once memories with n cells that can store multiple levels. Assuming an underlying lattice-based construction and using the…”
Get full text

Encoding and Decoding Construction D' Lattices for Power-Constrained Communications by Zhou, Fan, Fitri, Arini, Anwar, Khoirul, Kurkoski, Brian M.

“…This paper focuses on the encoding and decoding of Construction D' coding lattices that can be used with shaping lattices for power-constrained channels. Two…”
Get full text

Practical compute-and-forward approaches for the multiple access relay channel by Hasan, Mohammad Nur, Kurkoski, Brian M.

“…We consider a multiple access relay channel (MARC) network consisting of two sources, one relay, and one common destination applying compute-and-forward (CF)…”
Get full text

Orthogonal Precoder for Integer-Forcing MIMO by Hasan, Mohammad Nur, Kurkoski, Brian M., Sakzad, Amin, Viterbo, Emanuele

“…This paper focuses on orthogonal precoding for integer-forcing linear receiver and shows it has two advantages over unitary precoding. Orthogonal precoding…”
Get full text

On the relation between the asymptotic performance of different algorithms for information bottleneck framework by Hassanpour, Shayan, Wubben, Dirk, Dekorsy, Armin, Kurkoski, Brian M.

“…The general problem of quantizing observation signals appears in different aspects of data processing, from special code designs to realization of…”
Get full text

Memory Approximate Message Passing by Liu, Lei, Huang, Shunqi, Kurkoski, Brian M.

“…Approximate message passing (AMP) is a low-cost iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian…”
Get full text