4,960 research outputs found
๋๊ท๋ชจ ์ฌ๋ฌผ ํต์ ์ ์ํ ์์ถ์ผ์ฑ ๊ธฐ๋ฐ ๋ค์ค ์ฌ์ฉ์ ๊ฒ์ถ
ํ์๋
ผ๋ฌธ (๋ฐ์ฌ)-- ์์ธ๋ํ๊ต ๋ํ์ : ๊ณต๊ณผ๋ํ ์ ๊ธฐยท์ปดํจํฐ๊ณตํ๋ถ, 2019. 2. ์ด๊ด๋ณต.Massive machine-type communication (mMTC) is a newly introduced service category in 5G wireless communication systems to support a variety of Internet-of-Things (IoT) applications. In the mMTC network, a large portion of devices is inactive and hence does not transmit data. Thus, the transmit vector consisting of data symbols of both active and inactive devices can be readily modeled as a sparse vector. In recovering sparsely represented multi-user vectors, compressed sensing based multi-user detection (CS-MUD) can be used. CS-MUD is a feasible solution to the grant-free uplink non-orthogonal multiple access (NOMA) environments. In this dissertation, two novel techniques regarding CS-MUD for mMTC networks are proposed.
In the first part of the dissertation, the sparsity-aware ordered successive interference cancellation (SA-OSIC) technique is proposed. In CS-MUD, multi-user vectors are detected based on a sparsity-aware maximum a posteriori probability (S-MAP) criterion. To reduce the computational complexity of S-MAP detection, sparsity-aware successive interference cancellation (SA-SIC) can be used. SA-SIC is a simple low-complexity scheme that recovers transmit symbols in a sequential manner. However, SA-SIC does not perform well without proper layer sorting due to error propagation. When multi-user vectors are sparse and each device is active with a distinct probability, the detection order determined solely by channel gains might not be optimal. In this dissertation, to reduce the error propagation and enhance the performance of SA-SIC, an activity-aware sorted QR decomposition (A-SQRD) algorithm that finds the optimal detection order is proposed. The proposed technique finds the optimal detection order based on the activity probabilities and channel gains of machine-type devices. Numerical results verify that the proposed technique greatly improves the performance of SA-SIC.
In the second part of the dissertation, the expectation propagation based joint AUD and CE (EP-AUD/CE) technique is proposed. In several studies regarding CS-MUD, the uplink channel state information (CSI) from the MTD to the BS is assumed to be perfectly known to the BS. In practice, however, the uplink CSI from the devices to the BS should be estimated before data detection. To address this issue, various joint active user detection (AUD) and channel estimation (CE) schemes have been proposed. Since only a few devices are active at one time, an element-wise (i.e., Hadamard) product of the binary activity pattern and the channel vector is also a sparse vector and thus compressed sensing (CS)-based technique is a good fit for the problem at hand. One potential shortcoming in these studies is that a prior distribution of the sparse vector is not exploited. In fact, these studies are based on the non-Bayesian greedy algorithms such as the orthogonal matching pursuit (OMP) and approximate message passing (AMP) algorithms, which do not require a prior distribution of the sparse vector. In essence, these algorithms find out non-zero values based on the instantaneous correlation between the sensing matrix and the observation vector so that they might not be effective in the situation where the prior distribution is available. In this case, clearly, by exploiting the statistical distribution of the sparse vector, the performance of AUD and CE can be improved substantially. The proposed technique finds the best approximation of the posterior distribution of the sparse channel vector based on the expectation propagation (EP) algorithm. Using the approximate distribution, AUD and CE are jointly performed. Numerical simulations show that the proposed technique substantially enhances AUD and CE performances over competing algorithms.๋๊ท๋ชจ ์ฌ๋ฌผ ํต์ (massive machine-type communications, mMTC)์ ๋ค์ํ ์ฌ๋ฌผ ์ธํฐ๋ท(internet of things, IoT) ์๋น์ค๋ฅผ ์ง์ํ๊ธฐ ์ํด ์ฐจ์ธ๋ ๋ฌด์ ํต์ ํ์ค์ ์๋ก ๋์
๋ ์๋น์ค ๋ฒ์ฃผ์ด๋ค. ๋๊ท๋ชจ ์ฌ๋ฌผ ํต์ ํ๊ฒฝ์์๋ ๋ง์ ์์ ์ฌ๋ฌผ ๊ธฐ๊ธฐ(machine-type device, MTD)๊ฐ ๋๋ถ๋ถ์ ํ์ ์ฌ๋กฏ(time slot)์์ ๋นํ์ฑ ์ํ์ด๋ฉฐ ๋ฐ์ดํฐ๋ฅผ ์ ์กํ์ง ์๋๋ค. ๋ฐ๋ผ์, ํ์ฑ ๋ฐ ๋นํ์ฑ ๊ธฐ๊ธฐ ๋ชจ๋์ ๋ฐ์ดํฐ ์ฌ๋ณผ๋ก ๊ตฌ์ฑ๋ ์ ์ก ๋ฒกํฐ๋ ํฌ์(sparse) ๋ฒกํฐ๋ก ํํ๋ ์ ์๋ค. ํฌ์ ๋ฒกํฐ๋ก ํํ๋ ๋ค์ค ์ฌ์ฉ์ ๋ฒกํฐ๋ฅผ ๋ณต์ํ๊ธฐ ์ํด, ์์ถ ์ผ์ฑ ๊ธฐ๋ฐ ๋ค์ค ์ฌ์ฉ์ ๊ฒ์ถ(CS-MUD)์ด ์ฌ์ฉ๋ ์ ์๋ค. CS-MUD๋ ์ค์ผ์ค๋ง(scheduling) ์ ์ฐจ๊ฐ ์๋ ์ํฅ๋งํฌ(uplink) ๋น์ง๊ต ๋ค์ค ์ ์(non-orthogonal multiple access, NOMA)์ ์ํ ํต์ฌ ๊ธฐ์ ์ค ํ๋์ด๋ค. ๋ณธ ํ์ ๋
ผ๋ฌธ์์๋ ๋๊ท๋ชจ ์ฌ๋ฌผ ํต์ ์ ์ํ ์๋ก์ด CS-MUD ๊ธฐ์ ๋ค์ ์ ์ํ๋ค.
๋
ผ๋ฌธ์ ์ฒซ ๋ฒ์งธ ๋ถ๋ถ์์๋, ํฌ์์ฑ์ ๊ณ ๋ คํ ์ ๋ ฌ ์์ฐจ์ ๊ฐ์ญ ์ ๊ฑฐ(sparsity-aware ordered successive interference cancellation, SA-OSIC) ๊ธฐ์ ์ ์ ์ํ๋ค. CS-MUD์์ ๋ค์ค ์ฌ์ฉ์ ๋ฒกํฐ๋ ํฌ์์ฑ์ ๊ณ ๋ คํ ์ต๋ ์ฌํ ํ๋ฅ (sparsity-aware maximum a posteriori probability, S-MAP) ๊ธฐ์ค์ ๋ฐ๋ผ ๊ฒ์ถ๋๋ค. S-MAP ๊ฒ์ถ์ ๊ณ์ฐ ๋ณต์ก์ฑ์ ์ค์ด๊ธฐ ์ํด ํฌ์์ฑ์ ๊ณ ๋ คํ ์์ฐจ์ ๊ฐ์ญ ์ ๊ฑฐ(sparsity-aware successive interference cancellation, SA-SIC)๋ฅผ ์ฌ์ฉํ ์ ์๋ค. ํฌ์ ๋ฐ์ดํฐ ๋ฒกํฐ ๊ฒ์ถ์ ๊ณ์ฐ ๋ณต์ก์ฑ์ ์ค์ด๊ธฐ ์ํด ์ฌ์ฉ๋๋ ํฌ์์ฑ ๊ณ ๋ ค ์ฐ์ ๊ฐ์ญ ์ ๊ฑฐ ๊ธฐ์ ์ ์ค๋ฅ ์ ํ(error propagation)๋ก ์ธํด ์ ์ ํ ์ฌ์ฉ์ ์ ๋ ฌ ์์ด๋ ์ฑ๋ฅ์ด ์ข์ง ์๋ค. ๋ค์ค ์ฌ์ฉ์ ๋ฒกํฐ๊ฐ ํฌ์ ๋ฒกํฐ์ด๊ณ ๊ฐ ๊ธฐ๊ธฐ๊ฐ ๋ค๋ฅธ ํ๋ฅ ๋ก ํ์ฑ์ผ ๊ฒฝ์ฐ ์ฑ๋ ์ด๋(channel gain)์ ์ํด์๋ง ๊ฒฐ์ ๋ ์ฌ์ฉ์ ๊ฒ์ถ ์์๋ ์ต์ ์ด ์๋ ์ ์๋ค. ๋ณธ ๋
ผ๋ฌธ์์๋, ์ค๋ฅ ์ ํ๋ฅผ ์ค์ด๊ณ ํฌ์์ฑ ๊ณ ๋ ค ์ฐ์ ๊ฐ์ญ ์ ๊ฑฐ์ ์ฑ๋ฅ์ ํฅ์ํ๊ธฐ ์ํด ๊ฐ ์ฌ๋ฌผ ๊ธฐ๊ธฐ์ ํ์ฑ ํ๋ฅ (activity probability)๊ณผ ์ฑ๋ ์ด๋์ ๊ธฐ๋ฐ์ผ๋ก ์ต์ ์ ๊ฒ์ถ ์์๋ฅผ ์ฐพ๋ ์๋ก์ด ์๊ณ ๋ฆฌ์ฆ์ ์ ์ํ๋ค. ์๋ฎฌ๋ ์ด์
์ ํตํด ์ ์ํ ๊ฒ์ถ ์์ ์ ๋ ฌ ๊ธฐ์ ์ ๋ฐ์ดํฐ ๊ฒ์ถ์ ์ฑ๋ฅ์ ํฌ๊ฒ ํฅ์ํจ์ ๊ฒ์ฆํ์๋ค.
๋
ผ๋ฌธ์ ๋ ๋ฒ์งธ ๋ถ๋ถ์์๋, ๊ธฐ๋๊ฐ ์ ํ ๊ธฐ๋ฐ ํ์ฑ ์ฌ์ฉ์ ๊ฒ์ถ ๋ฐ ์ฑ๋ ์ถ์ (expectation propagation based active user detection channel estimation, EP-AUD/CE) ๊ธฐ์ ์ ์ ์ํ๋ค. CS-MUD์ ๊ดํ ๋ช๋ช ์ฐ๊ตฌ์์, ๊ฐ ์ฌ๋ฌผ ๊ธฐ๊ธฐ๋ก๋ถํฐ ๊ธฐ์ง๊ตญ(base station, BS)์ผ๋ก์ ์ํฅ๋งํฌ ์ฑ๋ ์ํ ์ ๋ณด(channel state information, CSI)๋ ๊ธฐ์ง๊ตญ์ ์์ ํ ์๋ ค์ ธ ์๋ค๊ณ ๊ฐ์ ๋๋ค. ๊ทธ๋ฌ๋ ์ค์ ๋ก๋, ๋ฐ์ดํฐ ๊ฒ์ถ ์ ์ ๊ฐ ๊ธฐ๊ธฐ๋ก๋ถํฐ ๊ธฐ์ง๊ตญ์ผ๋ก์ ์ํฅ๋งํฌ ์ฑ๋ ์ํ ์ ๋ณด๋ฅผ ์ถ์ ํด์ผ ํ๋ค. ์ด ๋ฌธ์ ๋ฅผ ํด๊ฒฐํ๊ธฐ ์ํด ๋ค์ํ ํ์ฑ ์ฌ์ฉ์ ๊ฒ์ถ(active user detection, AUD) ๋ฐ ์ฑ๋ ์ถ์ (channel estimation, CE) ๊ธฐ์ ์ด ์ ์๋์๋ค. ๋๊ท๋ชจ ์ฌ๋ฌผ ํต์ ์์๋ ํ๋์ ํ์ ์ฌ๋กฏ์ ์ ์ ์์ ์ฅ์น๋ง ํ์ฑํ๋๊ธฐ ๋๋ฌธ์ ์ด์ง(binary)๊ฐ์ผ๋ก ์ด๋ฃจ์ด์ง ํ์ฑ ์ฌ๋ถ ๋ฒกํฐ์ ์ฑ๋ ๋ฒกํฐ์ ๊ณฑ์ ํฌ์ ๋ฒกํฐ๊ฐ ๋์ด ์์ถ์ผ์ฑ ์๊ณ ๋ฆฌ์ฆ์ผ๋ก ๋ณต์์ด ๊ฐ๋ฅํ๋ค. ํ์ง๋ง, ์ด๋ฌํ ์ฐ๊ตฌ๋ค์ ๋จ์ ์ค ํ๋๋ ํฌ์ ๋ฒกํฐ์ ์ฌ์ ๋ถํฌ(prior distritubion)๊ฐ ํ์ฉ๋์ง ์๋๋ค๋ ๊ฒ์ด๋ค. ํฌ์ ๋ฒกํฐ์ ํต๊ณ์ ์ฌ์ ๋ถํฌ๋ฅผ ์ด์ฉํ๋ฉด ํ์ฑ ์ฌ์ฉ์ ๊ฒ์ถ ๋ฐ ์ฑ๋ ์ถ์ ์ ์ฑ๋ฅ์ ํฌ๊ฒ ํฅ์ํ ์ ์๋ค. ๋ณธ ํ์ ๋
ผ๋ฌธ์์๋, ๊ธฐ๋๊ฐ ์ ํ(expectation propagation, EP) ์๊ณ ๋ฆฌ์ฆ์ ์ด์ฉํด ํฌ์ ์ฑ๋ ๋ฒกํฐ์ ์ฌํ ๋ถํฌ(posterior distribution)์ ๊ทผ์ฌ ๋ถํฌ๋ฅผ ์ฐพ๊ณ , ํด๋น ๊ทผ์ฌ ๋ถํฌ๋ฅผ ์ด์ฉํ์ฌ ํ์ฑ ์ฌ์ฉ์ ๊ฒ์ถ๊ณผ ์ฑ๋ ์ถ์ ์ ๋์์ ์ํํ๋ ๊ธฐ์ ์ ์ ์ํ๋ค. ์๋ฎฌ๋ ์ด์
์ ํตํด ์ ์ํ ์ฌ์ฉ์ ๊ฒ์ถ ๋ฐ ์ฑ๋ ์ถ์ ๊ธฐ์ ์ ํ์ฑ ์ฌ์ฉ์ ๊ฒ์ถ ๋ฐ ์ฑ๋ ์ถ์ ์ ์ฑ๋ฅ์ ์๋นํ ํฅ์ํจ์ ๊ฒ์ฆํ์๋ค.1 Introduction . . . . . 1
1.1 Sparsity-Aware Ordered Successive Interference Cancellation . . . . . 3
1.2 Expectation Propagation-based Joint Active User Detection and Channel Estimation . . . . . 4
2 Sparsity-Aware Ordered Successive Interference Cancellation . . . . . 7
2.1 System model . . . . . 7
2.2 Sparsity-Aware Successive Interference Cancellation (SA-SIC) . . . . . 9
2.2.1 Derivation of S-MAP Detection . . . . . 9
2.2.2 Sparsity-Aware SIC (SA-SIC) Detection . . . . . 10
2.3 Proposed Activity-Aware Sorted-QRD (A-SQRD) Algorithm . . . . . 11
2.4 Complexity Analysis . . . . . 15
2.5 Numerical Results . . . . . 15
2.5.1 Simulation Setup . . . . . 16
2.5.2 Simulation Results . . . . . 20
3 Expectation Propagation-based Joint Active User Detection and Channel Estimation . . . . . 21
3.1 System model . . . . . 21
3.2 Joint Active User Detection and Channel Estimation . . . . . 23
3.3 EP-Based Active User Detection and Channel Estimation . . . . . 26
3.3.1 A Brief Review of Expectation Propagation . . . . . 29
3.3.2 Form of the Approximation . . . . . 30
3.3.3 Iterative EP Update Rules . . . . . 31
3.3.4 Active User Detection and Channel Estimation . . . . . 36
3.3.5 Data Detection . . . . . 37
3.3.6 Comments on Complexity . . . . . 38
3.4 Simulation Results and Discussions . . . . . 39
3.4.1 Simulation Setup . . . . . 39
3.4.2 Simulation Results . . . . . 52
4 Conclusion . . . . . 54
Abstract (In Korean) . . . . . 60Docto
Massive MIMO for Internet of Things (IoT) Connectivity
Massive MIMO is considered to be one of the key technologies in the emerging
5G systems, but also a concept applicable to other wireless systems. Exploiting
the large number of degrees of freedom (DoFs) of massive MIMO essential for
achieving high spectral efficiency, high data rates and extreme spatial
multiplexing of densely distributed users. On the one hand, the benefits of
applying massive MIMO for broadband communication are well known and there has
been a large body of research on designing communication schemes to support
high rates. On the other hand, using massive MIMO for Internet-of-Things (IoT)
is still a developing topic, as IoT connectivity has requirements and
constraints that are significantly different from the broadband connections. In
this paper we investigate the applicability of massive MIMO to IoT
connectivity. Specifically, we treat the two generic types of IoT connections
envisioned in 5G: massive machine-type communication (mMTC) and ultra-reliable
low-latency communication (URLLC). This paper fills this important gap by
identifying the opportunities and challenges in exploiting massive MIMO for IoT
connectivity. We provide insights into the trade-offs that emerge when massive
MIMO is applied to mMTC or URLLC and present a number of suitable communication
schemes. The discussion continues to the questions of network slicing of the
wireless resources and the use of massive MIMO to simultaneously support IoT
connections with very heterogeneous requirements. The main conclusion is that
massive MIMO can bring benefits to the scenarios with IoT connectivity, but it
requires tight integration of the physical-layer techniques with the protocol
design.Comment: Submitted for publicatio
Sparse Message Passing Based Preamble Estimation for Crowded M2M Communications
Due to the massive number of devices in the M2M communication era, new
challenges have been brought to the existing random-access (RA) mechanism, such
as severe preamble collisions and resource block (RB) wastes. To address these
problems, a novel sparse message passing (SMP) algorithm is proposed, based on
a factor graph on which Bernoulli messages are updated. The SMP enables an
accurate estimation on the activity of the devices and the identity of the
preamble chosen by each active device. Aided by the estimation, the RB
efficiency for the uplink data transmission can be improved, especially among
the collided devices. In addition, an analytical tool is derived to analyze the
iterative evolution and convergence of the SMP algorithm. Finally, numerical
simulations are provided to verify the validity of our analytical results and
the significant improvement of the proposed SMP on estimation error rate even
when preamble collision occurs.Comment: submitted to ICC 2018 with 6 pages and 4 figure
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Future wireless networks have a substantial potential in terms of supporting
a broad range of complex compelling applications both in military and civilian
fields, where the users are able to enjoy high-rate, low-latency, low-cost and
reliable information services. Achieving this ambitious goal requires new radio
techniques for adaptive learning and intelligent decision making because of the
complex heterogeneous nature of the network structures and wireless services.
Machine learning (ML) algorithms have great success in supporting big data
analytics, efficient parameter estimation and interactive decision making.
Hence, in this article, we review the thirty-year history of ML by elaborating
on supervised learning, unsupervised learning, reinforcement learning and deep
learning. Furthermore, we investigate their employment in the compelling
applications of wireless networks, including heterogeneous networks (HetNets),
cognitive radios (CR), Internet of things (IoT), machine to machine networks
(M2M), and so on. This article aims for assisting the readers in clarifying the
motivation and methodology of the various ML algorithms, so as to invoke them
for hitherto unexplored services as well as scenarios of future wireless
networks.Comment: 46 pages, 22 fig
Grant-Free Massive MTC-Enabled Massive MIMO: A Compressive Sensing Approach
A key challenge of massive MTC (mMTC), is the joint detection of device
activity and decoding of data. The sparse characteristics of mMTC makes
compressed sensing (CS) approaches a promising solution to the device detection
problem. However, utilizing CS-based approaches for device detection along with
channel estimation, and using the acquired estimates for coherent data
transmission is suboptimal, especially when the goal is to convey only a few
bits of data.
First, we focus on the coherent transmission and demonstrate that it is
possible to obtain more accurate channel state information by combining
conventional estimators with CS-based techniques. Moreover, we illustrate that
even simple power control techniques can enhance the device detection
performance in mMTC setups.
Second, we devise a new non-coherent transmission scheme for mMTC and
specifically for grant-free random access. We design an algorithm that jointly
detects device activity along with embedded information bits. The approach
leverages elements from the approximate message passing (AMP) algorithm, and
exploits the structured sparsity introduced by the non-coherent transmission
scheme. Our analysis reveals that the proposed approach has superior
performance compared to application of the original AMP approach.Comment: Submitted to IEEE Transactions on Communication
A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems
The Massive MIMO (multiple-input multiple-output) technology has great
potential to manage the rapid growth of wireless data traffic. Massive MIMO
achieves tremendous spectral efficiency by spatial multiplexing of many tens of
user equipments (UEs). These gains are only achieved in practice if many more
UEs can connect efficiently to the network than today. As the number of UEs
increases, while each UE intermittently accesses the network, the random access
functionality becomes essential to share the limited number of pilots among the
UEs. In this paper, we revisit the random access problem in the Massive MIMO
context and develop a reengineered protocol, termed strongest-user collision
resolution (SUCRe). An accessing UE asks for a dedicated pilot by sending an
uncoordinated random access pilot, with a risk that other UEs send the same
pilot. The favorable propagation of Massive MIMO channels is utilized to enable
distributed collision detection at each UE, thereby determining the strength of
the contenders' signals and deciding to repeat the pilot if the UE judges that
its signal at the receiver is the strongest. The SUCRe protocol resolves the
vast majority of all pilot collisions in crowded urban scenarios and continues
to admit UEs efficiently in overloaded networks.Comment: To appear in IEEE Transactions on Wireless Communications, 16 pages,
10 figures. This is reproducible research with simulation code available at
https://github.com/emilbjornson/sucre-protoco
- โฆ