File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/JSAC.2022.3222000
- Scopus: eid_2-s2.0-85142802282
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Heterogeneous Semantic and Bit Communications: A Semi-NOMA Scheme
Title | Heterogeneous Semantic and Bit Communications: A Semi-NOMA Scheme |
---|---|
Authors | |
Keywords | Non-orthogonal multiple access power region semantic communications semantic-versus-bit rate region |
Issue Date | 2023 |
Citation | IEEE Journal on Selected Areas in Communications, 2023, v. 41, n. 1, p. 155-169 How to Cite? |
Abstract | Multiple access (MA) design is investigated to facilitate the coexistence of the emerging semantic transmission and the conventional bit-based transmission in future networks. The semantic rate is adopted for measuring the performance of the semantic transmission. However, a key challenge is that there is no closed-form expression for a key parameter, namely the semantic similarity, which characterizes the sentence similarity between an original sentence and the corresponding recovered sentence. To overcome this challenge, we propose a data regression method, where the semantic similarity is approximated by a generalized logistic function. Using the obtained tractable function, we propose a heterogeneous semantic and bit communication framework, where an access point simultaneously sends the semantic and bit streams to one semantics-interested user (S-user) and one bit-interested user (B-user). To realize this heterogeneous semantic and bit transmission in multi-user networks, three MA schemes are proposed, namely orthogonal multiple access (OMA), non-orthogonal multiple access (NOMA), and semi-NOMA. More specifically, the bit stream in semi-NOMA is split into two streams, one is transmitted with the semantic stream over the shared frequency sub-band and the other is transmitted over the separate orthogonal frequency sub-band. To study the fundamental performance limits of the three proposed MA schemes, the semantic-versus-bit (SvB) rate region and the power region are defined. An optimal resource allocation procedure is then derived for characterizing the boundary of the SvB rate region and the power region achieved by each MA scheme. The structures of the derived solutions demonstrate that semi-NOMA is superior to both NOMA and OMA given its highly flexible transmission policy. Our numerical results: 1) confirm that the proposed semi-NOMA is the optimal MA scheme as compared to OMA and NOMA even under the symmetric channel case, and 2) reveal that the superiority of semi-NOMA is more prominent when the channel condition of the S-user is better than that of the B-user. |
Persistent Identifier | http://hdl.handle.net/10722/349826 |
ISSN | 2023 Impact Factor: 13.8 2023 SCImago Journal Rankings: 8.707 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mu, Xidong | - |
dc.contributor.author | Liu, Yuanwei | - |
dc.contributor.author | Guo, Li | - |
dc.contributor.author | Al-Dhahir, Naofal | - |
dc.date.accessioned | 2024-10-17T07:01:05Z | - |
dc.date.available | 2024-10-17T07:01:05Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | IEEE Journal on Selected Areas in Communications, 2023, v. 41, n. 1, p. 155-169 | - |
dc.identifier.issn | 0733-8716 | - |
dc.identifier.uri | http://hdl.handle.net/10722/349826 | - |
dc.description.abstract | Multiple access (MA) design is investigated to facilitate the coexistence of the emerging semantic transmission and the conventional bit-based transmission in future networks. The semantic rate is adopted for measuring the performance of the semantic transmission. However, a key challenge is that there is no closed-form expression for a key parameter, namely the semantic similarity, which characterizes the sentence similarity between an original sentence and the corresponding recovered sentence. To overcome this challenge, we propose a data regression method, where the semantic similarity is approximated by a generalized logistic function. Using the obtained tractable function, we propose a heterogeneous semantic and bit communication framework, where an access point simultaneously sends the semantic and bit streams to one semantics-interested user (S-user) and one bit-interested user (B-user). To realize this heterogeneous semantic and bit transmission in multi-user networks, three MA schemes are proposed, namely orthogonal multiple access (OMA), non-orthogonal multiple access (NOMA), and semi-NOMA. More specifically, the bit stream in semi-NOMA is split into two streams, one is transmitted with the semantic stream over the shared frequency sub-band and the other is transmitted over the separate orthogonal frequency sub-band. To study the fundamental performance limits of the three proposed MA schemes, the semantic-versus-bit (SvB) rate region and the power region are defined. An optimal resource allocation procedure is then derived for characterizing the boundary of the SvB rate region and the power region achieved by each MA scheme. The structures of the derived solutions demonstrate that semi-NOMA is superior to both NOMA and OMA given its highly flexible transmission policy. Our numerical results: 1) confirm that the proposed semi-NOMA is the optimal MA scheme as compared to OMA and NOMA even under the symmetric channel case, and 2) reveal that the superiority of semi-NOMA is more prominent when the channel condition of the S-user is better than that of the B-user. | - |
dc.language | eng | - |
dc.relation.ispartof | IEEE Journal on Selected Areas in Communications | - |
dc.subject | Non-orthogonal multiple access | - |
dc.subject | power region | - |
dc.subject | semantic communications | - |
dc.subject | semantic-versus-bit rate region | - |
dc.title | Heterogeneous Semantic and Bit Communications: A Semi-NOMA Scheme | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/JSAC.2022.3222000 | - |
dc.identifier.scopus | eid_2-s2.0-85142802282 | - |
dc.identifier.volume | 41 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 155 | - |
dc.identifier.epage | 169 | - |
dc.identifier.eissn | 1558-0008 | - |