Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Cyrus D. Cantrell

dblp:00/5963 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 83% Cellular and mobile networks · 17%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › synchronization › frequency synchronization
carrier frequency offset estimation
0.112008
Two novel iterative joint frequency-offset and channel estimation methods for OFDMA uplink · IEEE Trans. Commun. 2008
Physical-layer communications
channel estimation
0.112008
Two novel iterative joint frequency-offset and channel estimation methods for OFDMA uplink · IEEE Trans. Commun. 2008
Physical-layer communications › signal processing for communications › statistical signal processing › estimation theory
joint estimation
0.112008
Two novel iterative joint frequency-offset and channel estimation methods for OFDMA uplink · IEEE Trans. Commun. 2008
Physical-layer communications › multiple access › multicarrier multiple access
OFDMA uplink
0.112008
Two novel iterative joint frequency-offset and channel estimation methods for OFDMA uplink · IEEE Trans. Commun. 2008
Cellular and mobile networks
radio access networks
0.112008
Two novel iterative joint frequency-offset and channel estimation methods for OFDMA uplink · IEEE Trans. Commun. 2008
Physical-layer communications
signal processing for communications
0.112008
Two novel iterative joint frequency-offset and channel estimation methods for OFDMA uplink · IEEE Trans. Commun. 2008

Methods — techniques the papers use, named apart from their topics

interference cancellation · 0.1expectation-maximization · 0.1SAGE algorithm · 0.1
YearPublicationVenuePosition
2008 Two novel iterative joint frequency-offset and channel estimation methods for OFDMA uplink
abstract
We address joint estimation of frequency offsets and channel responses in OFDMA uplink. A cyclically equal-spaced, equal-energy interleaved pilot preamble is proposed by which two iterative estimators are developed. In the first estimator, we develop a modified SAGE (space alternating generalized expectation-maximization) method by incorporating multiuser interference cancellation in both time and frequency domains into the SAGE method. The proposed modified SAGE method yields a faster convergence rate, a better estimation performance, and a lower complexity than the existing conventional SAGE method from [10]. In the second method, we propose a very low complexity ad hoc method to replace the high complexity frequency offset estimator of the first method. The proposed ad hoc method is developed based on the time-domain characteristics of the pilot preamble and the frequency-domain power concentration property of OFDMA systems. It achieves almost the same estimation performance as the first proposed method but requires significantly lower complexity. Both proposed methods are not only better in estimation performance, convergence rate, and complexity, but also more robust to the number of active uplink users than the existing method while requiring only one OFDM training symbol and no restriction of the data subcarrier assignment scheme.
Xiaoyu Fu, Hlaing Minn, Cyrus D. Cantrell
IEEE Trans. Commun.3
2006 Two Novel Iterative Joint Frequency-Offset and Channel Estimation Methods for OFDMA Uplink
abstract
We address joint estimation of frequency offsets and channel responses in OFDMA uplink. A cyclically equal-spaced, equal-energy interleaved pilot preamble is proposed by which two iterative estimators are developed. In the first estimator, we develop a modified SAGE (space alternating generalized expectation-maximization) method by incorporating multiuser interference cancellation in both time and frequency domains into the SAGE method. The proposed modified SAGE method yields a faster convergence rate, a better estimation performance, and a lower complexity than the existing conventional SAGE method. In the second method, we propose a very low complexity ad-hoc method to replace the high complexity frequency offset estimator of the first method. The proposed ad-hoc method is developed based on the time-domain characteristics of the pilot preamble and the frequency-domain power concentration property of OFDMA systems. It achieves almost the same estimation performance as the first proposed method but requires significantly lower complexity. Both proposed methods are not only better in estimation performance, convergence rate, and complexity, but also more robust to the number of active uplink users than the existing method while requiring only one OFDM training symbol and no restriction of the data subcarrier assignment scheme.
Xiaoyu Fu, Hlaing Minn, Cyrus D. Cantrell
GLOBECOM3
2004 Segregating the encompassing prefixes to enhance the performance of packet forwarding engines
abstract
We propose a novel approach for IP packet forwarding based on a new ternary content addressable memory configuration. Our design is an efficient hardware solution for the longest prefix matching problem in Internet routers. Our scheme segregates the encompassing prefixes into a separate, practically small TCAM module. Consequently, the remaining prefixes, that often conform to more than 92% of the lookup table, form a disjoint set. The big TCAM module that accommodates this set has a simplified architecture, with no priority encoder. Our architecture has lower update complexity, lower cost and shorter search time, compared to the conventional TCAM structure.
Mohammad J. Akhbarizadeh, Mehrdad Nourani, Cyrus D. Cantrell
GLOBECOM3