Sciweavers

373 search results - page 10 / 75
» Nearness and uniform convergence
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Near-Capacity Iteratively Decoded Binary Self-Concatenated Code Design Using EXIT Charts
— In this treatise Extrinsic Information Transfer (EXIT) charts are used to design binary Self-Concatenated Convolutional Codes employing Iterative Decoding (SECCC-ID) for commun...
Muhammad Fasih Uddin Butt, Raja Ali Riaz, Soon Xin...
GLOBECOM
2008
IEEE
14 years 2 months ago
Near-Capacity Three-Stage Downlink Iteratively Decoded Generalized Layered Space-Time Coding with Low Complexity
Abstract— This paper presents a low complexity iteratively detected space-time transmission architecture based on Generalized Layered Space-Time (GLST) codes and IRregular Convol...
Lingkun Kong, Soon Xin Ng, Lajos Hanzo
GLOBECOM
2010
IEEE
13 years 5 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo
EMO
2005
Springer
123views Optimization» more  EMO 2005»
14 years 1 months ago
Initial Population Construction for Convergence Improvement of MOEAs
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
Christian Haubelt, Jürgen Gamenik, Jürge...
COLT
2000
Springer
14 years 3 days ago
On the Convergence Rate of Good-Turing Estimators
Good-Turing adjustments of word frequencies are an important tool in natural language modeling. In particular, for any sample of words, there is a set of words not occuring in tha...
David A. McAllester, Robert E. Schapire