Jan 5, 2007 · His study presents a novel technique to estimate the computational complexity of sequential decoding using the Berry-Esseen theorem.
scholar.google.com › citations
Aug 19, 2007 · This study presents a novel technique to estimate the computational complexity of sequential decoding using the Berry-Esseen theorem.
Abstract and Figures. his study presents a novel technique to estimate the computational complexity of sequential decoding using the Berry-Esseen theorem.
Hong-Bin Wu's 3 research works with 41 citations and 296 reads, including: Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality.
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality. ... Analysis and design of raptor codes for joint decoding using Information ...
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality. ... A maximum-likelihood soft-decision sequential decoding algorithm for ...
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality · Computer Science, Mathematics. ArXiv · 2007.
Low-Complexity Soft-Output Sphere Decoding with Modified Repeated Tree ... Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality.
Apr 15, 2003 · Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality · Computer Science, Mathematics. ArXiv · 2007.
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality ... A generalization of the fano metric and its effect on sequential decoding using ...