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

David Keith Maslen

dblp:48/738 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 1Theory of computation · 1 · 1 first-author

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
Optical networks · 50% Physical-layer communications · 50%
Theoretical computer science
2 papers
Algorithms and data structures · 77% Combinatorics and discrete mathematics · 23%

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

TopicWeightPapersLastEvidence papers
Optical networks
coherent optical communication
0.112006
Solving phase-noise Fokker-Planck equations using the motion-group Fourier transform · IEEE Trans. Commun. 2006
Physical-layer communications › synchronization
phase noise
0.112006
Solving phase-noise Fokker-Planck equations using the motion-group Fourier transform · IEEE Trans. Commun. 2006
Algorithms and data structures
numerical algorithms
0.112006
Solving phase-noise Fokker-Planck equations using the motion-group Fourier transform · IEEE Trans. Commun. 2006
Combinatorics and discrete mathematics › group theory
finite groups
0.011995
Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups · SODA 1995
Algorithms and data structures
fourier transform
0.011995
Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups · SODA 1995
Algorithms and data structures › symbolic computation › computational algebra › algebraic algorithms
fourier transform over finite groups
0.011995
Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups · SODA 1995
Combinatorics and discrete mathematics
group theory
0.011995
Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups · SODA 1995

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

noncommutative harmonic analysis · 0.1motion-group fourier transform · 0.1algebraic algorithm design · 0.0
YearPublicationVenuePosition
2006 Solving phase-noise Fokker-Planck equations using the motion-group Fourier transform
abstract
A quantity of importance in coherent optical communications is the probability density of a filtered signal in the presence of phase noise (PN). The Fokker-Planck(FP) approach has been recognized as a rigorous way to describe these statistical properties. However, computational difficulties in solving these FP equation shave prevented their widespread application. In this paper, we present a new and simple computational solution method based on techniques from noncommutative harmonic analysis on motion groups. This proposed method can easily solve all the PN FP equations with any kind of intermediate frequency filter. We also present a new derivation of PN FP equations from the viewpoint of stochastic processes.
Yunfeng Wang 0002, Yu Zhou 0018, David Keith Maslen, Gregory S. Chirikjian
IEEE Trans. Commun.3
1995 Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups
David Keith Maslen, Daniel N. Rockmore
SODA1