Jamison Ebert

Mr. Jamison Ebert

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 June 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
JEJamison Ebert
Jamison Ebert
VAVamsi K. Amalladinne
Vamsi K. Amalladinne
SRStefano Rini
Stefano Rini
JCJean-Francois Chamberland
Jean-Francois Chamberland
KNKrishna R. Narayanan
Krishna R. Narayanan
Unsourced random access (URA) is a recently proposed multiple access paradigm tailored to the uplink channel of machine-type communication networks. By exploiting a strong connection between URA and compressed sensing, the massive multiple access problem may be cast as a compressed sensing (CS) problem, albeit one in exceedingly large dimensions. To efficiently handle the dimensionality of the problem, coded compressed sensing (CCS) has emerged as a pragmatic signal processing tool that, when applied to URA, offers good performance at low complexity. While CCS is effective at recovering a signal that is sparse with respect to a single basis, it is unable to jointly recover signals that are sparse with respect to separate bases. In this article, the CCS framework is extended to the demixing setting, yielding a novel technique called coded demixing. A generalized framework for coded demixing is presented and a low-complexity recovery algorithm based on approximate message passing (AMP) is developed. Coded demixing is applied to heterogeneous multi-class URA networks and traditional single-class networks. Its performance is analyzed and numerical simulations are presented to highlight the benefits of coded demixing.

12 November 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JEJamison Ebert
Jamison Ebert
JCJean-Francois Chamberland
Jean-Francois Chamberland
KNKrishna R. Narayanan
Krishna R. Narayanan
This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner sparse regression code (SPARC), whose respective field size and section sizes are equal. For such codes, an efficient decoding algorithm is proposed based on approximate message passing (AMP) that dynamically shares soft information between inner and outer decoders. This dynamic exchange of information is facilitated by a denoiser that runs belief propagation (BP) on the factor graph of the outer LDPC code within each AMP iteration. It is shown that this BP denoiser falls within the framework of non-separable denoising functions and subsequently, that state evolution holds for the proposed AMP-BP algorithm. Leveraging the rich structure of SR-LDPC codes, this article proposes an efficient low-dimensional approximate state evolution recursion that can be used for efficient hyperparameter tuning, thus paving the way for future work on optimal code design. Finally, numerical simulations demonstrate that SR-LDPC codes outperform contemporary codes over the AWGN channel for parameters of practical interest. SR-LDPC codes are shown to be viable means for obtaining shaping gains over the AWGN channel.

16 January 2022 in Sensors
Verified
Journal Article
Open access
PDF file
VAVamsi K. Amalladinne
Vamsi K. Amalladinne
JEJamison Ebert
Jamison Ebert
JCJean-Francois Chamberland
Jean-Francois Chamberland
KNKrishna R. Narayanan
Krishna R. Narayanan
Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures are often employed to ensure that the central base station can accurately recover the set of sent codewords during a given transmission period. Many URA algorithms employ independent inner and outer decoders, which can help reduce computational complexity at the expense of a decay in performance. In this article, an enhanced decoding algorithm is presented for a concatenated coding structure consisting of a wide range of inner codes and an outer tree-based code. It is shown that this algorithmic enhancement has the potential to simultaneously improve error performance and decrease the computational complexity of the decoder. This enhanced decoding algorithm is applied to two existing URA algorithms, and the performance benefits of the algorithm are characterized. Findings are supported by numerical simulations.

6 June 2021
Verified
Conference Paper
Open access
JEJamison Ebert
Jamison Ebert
VAVamsi K. Amalladinne
Vamsi K. Amalladinne
JCJean-Francois Chamberland
Jean-Francois Chamberland
KNKrishna R. Narayanan
Krishna R. Narayanan
This article seeks to advance coded compressed sensing (CCS) as a practical scheme for unsourced random access. The CCS algorithm features a concatenated structure where an inner code is tasked with support recovery and an outer code conducts message disambiguation. Recently, the CCS scheme was improved through the use of approximate message passing (AMP) with a dynamic denoiser that shares soft information between the inner and outer decoders. This significantly improves performance at the cost of additional complexity. This work shows how the spatial coupling generated by the outer code is sufficiently strong to justify relaxing certain constraints on the inner code. It is shown that a block diagonal sensing matrix with the aforementioned dynamic denoiser forms an effective means to get good performance at reduced complexity. This novel architecture can be used to scale CCS to dimensions that were previously impractical. Findings are supported by numerical simulations.

29 August 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
WZWilliam W. Zheng
William W. Zheng
JEJamison Ebert
Jamison Ebert
SRStefano Rini
Stefano Rini
JCJean-Francois Chamberland
Jean-Francois Chamberland
The A-channel is a noiseless multiple access channel in which users simultaneously transmit Q−ary symbols and the receiver observes the union of all input symbols. An A-channel is said to be unsourced if additionally, all users’ transmissions are encoded across time using a common codebook and decoding is performed without regard to the identities of the active users. Whereas the A-channel employs a traditional set union, the B-channel employs a multiset union so that the receiver observes the set of input symbols together with their respective multiplicities. In this paper, we consider the task of coding for the unsourced A- and B-channels in the presence of i.i.d. erasures and we propose a novel tail-biting code called the linked loop code (LLC) for these channels. The LLC is shown to outperform contemporary codes in part due to its resilience to lost sections. The performance of the LLC code is investigated theoretically and bounds on the error performance are provided.