Ameha Tsegaye Abebe

Ameha Tsegaye Abebe

Auto-generated profile, based on publicly available information

Ameha Tsegaye Abebe

Samsung Research Seoul Republic of Korea

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
20 November 2019 in IEEE Access
Verified
Journal Article
Open access
AAAmeha Tsegaye Abebe
Ameha Tsegaye Abebe
CKChung G Kang
Chung G Kang
In sparse code multiple access (SCMA)-based grant-free (GF) access, both user’s channel and the selected SCMA codebook (CB) are considered as a transmission signature for multi-user detection (MUD). In conventional SCMA-based grant-free (GF) access where a single codebook (CB) is employed per a user’s random access transmission, however, random selection of CBs and random fading channel reduce the minimum Euclidean distance among overloaded layers (signatures). This significantly degrades the performance. Furthermore, it is also challenging to reduce the collision rate in the course of selecting random access resources while maintaining low preamble overhead. In this paper, we consider a new approach that maps user’s consecutive symbols to codewords from the different SCMA CBs in a round-robin manner. It is shown that a combinatorial nature of multiple CBs and the inherent code diversity therein allow to simultaneously reduce collision probability while providing sufficient separation among transmissions, consequently decreasing users’ activity misdetection rate. It is also shown that the proposed multi-codebook SCMA (MC-SCMA)-based GF access scheme outperforms the conventional single CB-based SCMA version by overloading of more users (almost up to 200%) as it allows a large number of highly non-orthogonal preambles to be employed while keeping the same preamble length (overhead). Finally, we conclude that the proposed joint design of non-orthogonal preambles and data transmission based on multiple CBs provides a significant performance improvement for the grant-free access system. It can also readily be extended to other code-based non-orthogonal multiple access (NOMA) schemes.

9 September 2020 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
AAAmeha Tsegaye Abebe
Ameha Tsegaye Abebe
CKChung G Kang
Chung G Kang
Grant-free (GF) access has been one of the enablers for the various use cases in 5th generation (5G) mobile system, especially for time-critical massive machine-type communication (mMTC). However, these use cases have diverse quality of service (QoS) requirements, which can be measured in terms of an access success rate from a GF random access perspective. Consequently, a GF scheme that enables supporting of diverse QoS is highly sought. This paper proposes a GF access scheme in which high-QoS users superpose multiple preambles to improve their access success rate as a result of the diversity in access collision and multiple access interference seen by multiple preambles. We further show that in the presence of multiple antennas in the base station (BS), a low-complexity receiver can correctly detect active preambles with a significantly high probability, even under severe multiple access interference caused by non-orthogonal preamble transmission. An theoretical performance analysis is conducted by modeling the preamble reception as a multiple measurement vector-based compressive sensing problem. The preamble misdetection probability is shown to decrease exponentially as the number antennas at BS increases. Numerical results demonstrate multiple-order improvement in terms of the access success rate for critical-QoS users, even under severe noise and multiple access contamination.

9 August 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
AAAmeha Tsegaye Abebe
Ameha Tsegaye Abebe
CKChung G Kang
Chung G Kang
The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense of increased non-orthogonality among transmitted signals. This paper presents the design of multi-sequence spreading random access (MSRA) which employs multiple spreading sequences to spread the different symbols of a user as opposed to the conventional schemes in which a user employs the same spreading sequence for each symbol. We show that MSRA provides code diversity, enabling the multi-user detection (MUD) to be modeled into a well-conditioned multiple measurement vector (MMV) CS problem. The code diversity is quantified by the decrease in the average Babel mutual coherence among the spreading sequences. Moreover, we present a two-stage active user detection (AUD) scheme for both wideband and narrowband implementation. Our theoretical analysis shows that with MSRA activity misdetection falls exponentially while the size of GF-RA frame is increased. Finally, the simulation results show that about 82% increase in utilization of RRs, i.e., more active users, is supported by MSRA than the conventional schemes while achieving the RA failure rate lower bound set by random access collision.

13 January 2020 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
AAAmeha T. Abebe
Ameha T. Abebe
CKChung G Kang
Chung G Kang
Observing that employing a single codebook (CB) per user transmission block in the conventional CB-based non-orthogonal multiple access (NOMA) schemes doesn’t exploit code and interference diversity and has limitations in some unfavorable channel conditions, this letter presents multiple CB-based NOMA (MC-NOMA) in which multiple CBs are employed by a user in a round robin manner. Performance of schemes such as sparse code multiple access (SCMA) and pattern division multiple access (PDMA) is improved by MC-NOMA without incurring any additional receiver complexity and loss in spectral efficiency. Furthermore, to fully exploit code and interference diversity for MC-NOMA, CBs assignment algorithm is presented.

1 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
FTFitsum Debebe Tilahun
Fitsum Debebe Tilahun
AAAmeha Tsegaye Abebe
Ameha Tsegaye Abebe
CKChung G Kang
Chung G Kang
To support the newly introduced multimedia services with ultra-low latency and extensive computation requirements, resource-constrained end user devices should utilize the ubiquitous computing resources available at network edge for augmenting on-board (local) processing with edge computing. In this regard, the capability of cell-free massive MIMO to provide reliable access links by guaranteeing uniform quality of service without cell edge can be exploited for seamless parallel processing. Taking this into account, we consider a cell-free massive MIMO-enabled mobile edge network to meet the stringent requirements of the advanced services. For the considered mobile edge network, we formulate a joint communication and computing resource allocation (JCCRA) problem with the objective of minimizing energy consumption of the users while meeting the tight delay constraints. We then propose a fully distributed cooperative solution approach based on multiagent deep deterministic policy gradient (MADDPG) algorithm. The simulation results demonstrate that the performance of the proposed distributed approach has converged to that of a centralized deep deterministic policy gradient (DDPG)-based target benchmark, while alleviating the large overhead associated with the latter. Furthermore, it has been shown that our approach significantly outperforms heuristic baselines in terms of energy efficiency, roughly up to 5 times less total energy consumption.

8 August 2022 in arXiv
Verified
Preprint
Open access
PDF file
MHMinsig Han
Minsig Han
AAAmeha T. Abebe
Ameha T. Abebe
CKChung G Kang
Chung G Kang
In grant-free sparse code multiple access (GF-SCMA) system, active user detection (AUD) is a major performance bottleneck as it involves complex combinatorial problem, which makes joint design of contention resources for users and AUD at the receiver a crucial but a challenging problem. To this end, we propose autoencoder (AE)-based joint optimization of both preamble generation networks (PGNs) in the encoder side and data-aided AUD in the decoder side. The core architecture of the proposed AE is a novel user activity extraction network (UAEN) in the decoder that extracts a priori user activity information from the SCMA codeword data for the data-aided AUD. An end-to-end training of the proposed AE enables joint optimization of the contention resources, i.e., preamble sequences, each associated with one of the codebooks, and extraction of user activity information from both preamble and SCMA-based data transmission. Furthermore, we propose a self-supervised pre-training scheme for the UAEN prior to the end-to-end training, to ensure the convergence of the UAEN which lies deep inside the AE network. Simulation results demonstrated that the proposed AUD scheme achieved 3 to 5dB gain at a target activity detection error rate of $\bf{{10}^{-3}}$ compared to the state-of-the-art DL-based AUD schemes.