Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,847,071 papers from all fields of science
Search
Sign In
Create Free Account
Iterative method
Known as:
Iterative procedure
, Direct method (computational mathematics)
, Iterative approximation
Expand
In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Balancing domain decomposition method
Basis (linear algebra)
Coarse space (numerical analysis)
Computational mathematics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
An efficient tag search protocol in large-scale RFID systems
Min Chen
,
Wen Luo
,
Zhen Mo
,
Shigang Chen
,
Yuguang Fang
Proceedings IEEE INFOCOM
2016
Corpus ID: 52863978
Radio frequency identification (RFID) technology has many applications in inventory management, supply chain, product tracking…
Expand
Highly Cited
2003
Highly Cited
2003
Tradeoffs of designing floating-point division and square root on Virtex FPGAs
Xiaojun Wang
,
B. Nelson
11th Annual IEEE Symposium on Field-Programmable…
2003
Corpus ID: 19945687
Low latency, high throughput and small area are three major design considerations of an FPGA (field programmable gate array…
Expand
Highly Cited
2001
Highly Cited
2001
Extrinsic information in iterative decoding: a unified view
G. Colavolpe
,
G. Ferrari
,
R. Raheli
IEEE Transactions on Communications
2001
Corpus ID: 8516679
We address the use of the extrinsic information generated by each component decoder in an iterative decoding process. The BJCR…
Expand
Highly Cited
2001
Highly Cited
2001
Decoding low-density parity-check codes with probabilistic scheduling
Yongyi Mao
,
A. Banihashemi
IEEE Communications Letters
2001
Corpus ID: 15662808
We present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated…
Expand
Highly Cited
1997
Highly Cited
1997
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
M. Gertsman
,
J. Lodge
IEEE Transactions on Communications
1997
Corpus ID: 15892320
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived…
Expand
Highly Cited
1997
Highly Cited
1997
Blind spatio-temporal equalization and impulse response estimation for MIMO channels using a Godard cost function
Jitendra Tugnait
IEEE Transactions on Signal Processing
1997
Corpus ID: 6853523
Equalization and estimation of the matrix impulse response function of multiple-input multiple-output (MIMO) digital…
Expand
Highly Cited
1994
Highly Cited
1994
Decoding "turbo"-codes with the soft output Viterbi algorithm (SOVA)
Joachim Hagenauer
,
L. Papke
Proceedings of IEEE International Symposium on…
1994
Corpus ID: 58330579
Iterative decoding of two dimensional systematic convolutional codes has been termed "turbo"-(de)coding. It is shown that the…
Expand
Highly Cited
1972
Highly Cited
1972
Technical Note - Bounds for the Travelling-Salesman Problem
Nicos Christofides
Operational Research
1972
Corpus ID: 3029585
This paper concerns finding a tight lower bound to the travelling-salesman problem, with the hope that all the different branch…
Expand
Highly Cited
1967
Highly Cited
1967
Means, variances, and covariances for laser beam propagation through a random medium
R. Schmeltzer
1967
Corpus ID: 39722585
Wave propagation in a random continuous medium is studied by solving the stochastic wave equation with a random function for the…
Expand
Highly Cited
1966
Highly Cited
1966
The Equivalence of Certain Computations
D. C. Cooper
Computer/law journal
1966
Corpus ID: 62765408
Both iterative and recursive programs for computing generalizations of functions which obtain the factorial of an integer, which…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE