995 search results - page 139 / 199 » complexity 2011 |
142
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
113
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The determination of the optimal fractional Fourier transform (FrFT) order is a crucial issue for FrFT. This paper introduces a novel algorithm is proposed for the estimation of F...
110
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
133
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
— A new decoding algorithm, referred to as Min-Sum with Adaptive Message Control (AMC-MS), is proposed to reduce the decoding complexity of nonbinary LDPC codes. The proposed alg...
158
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...