Demo Data from SIGIR 2026 / reviewers in the wild / expert
Cajetan M. Akujuobi
dblp:42/2246
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 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 |
Physical-layer communications · 92% Network optimization and economics · 8% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › transmission design › adaptive transmission
bit loading |
0.1 | 1 | 2006 | A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006 |
Physical-layer communications › digital subscriber line
discrete multitone |
0.1 | 1 | 2006 | A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006 |
Physical-layer communications
modulation |
0.1 | 1 | 2006 | A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006 |
Physical-layer communications › multiuser systems
multiuser communication |
0.0 | 1 | 2006 | A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006 |
Network optimization and economics
resource allocation |
0.0 | 1 | 2006 | A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006 |
Methods — techniques the papers use, named apart from their topics
greedy algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Joint Design of Channel-Source Coding for Compressive Sampling SystemsabstractCompressive sampling (CS) is based on the principle of sampling signals according to their sparsity or compressibility as opposed to the rate specified by the Nyquist/Shannon sampling theorem. Shannon's separation principle of source and channel coding cannot always be used to improve CS reconstruction performance in the presence of noise, including conditions when the channel is time-varying and there is a delay constraint, or when multiple channels are present as in broadcast/multicast applications. In this paper, we propose performing joint design of the source and channel coding to improve noisy CS performance in multicast and time varying channels. Olusegun O. Odejide, Cajetan M. Akujuobi, Annamalai Annamalai, Gerald L. Fudge |
CCNC | 2 |
| 2009 | Application of Analytic Wavelet Transform for Signal Detection in Nyquist Folding Analog-to-Information ReceiverabstractOne of the challenges in Cognitive Radio (CR) is efficiently monitoring a wideband radio frequency (RF) spectrum in order to identify unoccupied bands. Compressive Sensing (CS) has recently been proposed to address this problem. Typical CS techniques, however, involve random projections followed by a computationally intensive signal reconstruction process. Since spectral monitoring does require full signal reconstruction - only identification of occupied regions to avoid - we propose a novel spectrum monitoring approach based on the Nyquist Folding Receiver (NYFR) in conjunction with the Analytic Wavelet Transform. The NYFR performs analog compression via a non-uniform sampling process that induces a chirp-like modulation on each received signal. This induced modulation can be measured using time-frequency analysis techniques to determine the original RF band of origin without full signal reconstruction. This paper investigates the feasibility of using the Analytic Wavelet Transform to perform NYFR information recovery in support of CR wideband spectrum sensing. Olusegun O. Odejide, Cajetan M. Akujuobi, Annamalai Annamalai, Gerald L. Fudge |
ICC | 2 |
| 2006 | A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT systemabstractThis letter first reviews the multiuser bit-loading algorithms for discrete multitone systems. Then an improved algorithm is proposed, which allows several users to get additional bits in parallel. It reduces the number of iterations dramatically. A new fairness coefficient is also introduced to reduce the variance of the data rate among users Cajetan M. Akujuobi, Matthew N. O. Sadiku |
IEEE Trans. Commun. | 1 |