-
1
-
-
85015784514
-
-
NGMN 5G, NGMN Alliance, White Paper, Feb. 2015
-
NGMN 5G, NGMN Alliance, White Paper, Feb. 2015.
-
-
-
-
2
-
-
84979831146
-
MIMO-NOMA design for small packet transmission in the Internet of Things
-
Z. Ding, L. Dai, and H. V. Poor, "MIMO-NOMA design for small packet transmission in the Internet of Things," IEEE Access, vol. 4, pp. 1393-1405, 2016.
-
(2016)
IEEE Access
, vol.4
, pp. 1393-1405
-
-
Ding, Z.1
Dai, L.2
Poor, H.V.3
-
3
-
-
84911971183
-
Blind detection of SCMA for uplink grant-free multiple-access
-
Aug.
-
A. Bayesteh, E. Yi, H. Nikopour, and H. Baligh, "Blind detection of SCMA for uplink grant-free multiple-access," in Proc. 11th Int. Symp. Wireless Commun. Syst. (ISWCS), Aug. 2014, pp. 853-857.
-
(2014)
Proc. 11th Int. Symp. Wireless Commun. Syst. (ISWCS)
, pp. 853-857
-
-
Bayesteh, A.1
Yi, E.2
Nikopour, H.3
Baligh, H.4
-
4
-
-
84978759579
-
Joint user activity and data detection based on structured compressive sensing for NOMA
-
Jul.
-
B. Wang, L. Dai, T. Mir, and Z. Wang, "Joint user activity and data detection based on structured compressive sensing for NOMA," IEEE Commun. Lett., vol. 20, no. 7, pp. 1473-1476, Jul. 2016.
-
(2016)
IEEE Commun. Lett.
, vol.20
, Issue.7
, pp. 1473-1476
-
-
Wang, B.1
Dai, L.2
Mir, T.3
Wang, Z.4
-
5
-
-
84922932060
-
Sparsity controlled random multiple access with compressed sensing
-
Feb.
-
J. P. Hong, W. Choi, and B. D. Rao, "Sparsity controlled random multiple access with compressed sensing," IEEE Trans. Wireless Commun., vol. 14, no. 2, pp. 998-1010, Feb. 2015.
-
(2015)
IEEE Trans. Wireless Commun.
, vol.14
, Issue.2
, pp. 998-1010
-
-
Hong, J.P.1
Choi, W.2
Rao, B.D.3
-
7
-
-
84969769430
-
Iterative order recursive least square estimation for exploiting frame-wise sparsity in compressive sensingbased MTC
-
May
-
A. T. Abebe and C. G. Kang, "Iterative order recursive least square estimation for exploiting frame-wise sparsity in compressive sensingbased MTC," IEEE Commun. Lett., vol. 20, no. 5, pp. 1018-1021, May 2016.
-
(2016)
IEEE Commun. Lett.
, vol.20
, Issue.5
, pp. 1018-1021
-
-
Abebe, A.T.1
Kang, C.G.2
-
8
-
-
84928348711
-
Characterization of coded random access with compressive sensing based multi-user detection
-
Dec.
-
Y. Ji, C. Stefanovic, C. Bockelmann, A. Dekorsy, and P. Popovski, "Characterization of coded random access with compressive sensing based multi-user detection," in Proc. IEEE GLOBECOM, Dec. 2014, pp. 1740-1745.
-
(2014)
Proc. IEEE GLOBECOM
, pp. 1740-1745
-
-
Ji, Y.1
Stefanovic, C.2
Bockelmann, C.3
Dekorsy, A.4
Popovski, P.5
-
9
-
-
0035246564
-
Factor graphs and the sum-product algorithm
-
Feb.
-
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory., vol. 47, no. 2, pp. 498-519, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory.
, vol.47
, Issue.2
, pp. 498-519
-
-
Kschischang, F.R.1
Frey, B.J.2
Loeliger, H.-A.3
-
10
-
-
73149095169
-
Message-passing algorithms for compressed sensing
-
Nov.
-
D. L. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," Proc. Nat. Acad. Sci. USA, vol. 106, no. 45, pp. 18914-18919, Nov. 2009.
-
(2009)
Proc. Nat. Acad. Sci. USA
, vol.106
, Issue.45
, pp. 18914-18919
-
-
Donoho, D.L.1
Maleki, A.2
Montanari, A.3
-
11
-
-
85015754187
-
Maximum likelihood from incomplete data via the em algorithm
-
A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Statist. Soc. B (Methodol.), vol. 39, no. 1, pp. 1-38, 1977.
-
(1977)
J. Roy. Statist. Soc. B (Methodol.)
, vol.39
, Issue.1
, pp. 1-38
-
-
Dempster, A.P.1
Laird, N.M.2
Rubin, D.B.3
-
12
-
-
41849096757
-
Novel low-density signature for synchronous CDMA systems over AWGN channel
-
Apr.
-
R. Hoshyar, F. P. Wathan, and R. Tafazolli, "Novel low-density signature for synchronous CDMA systems over AWGN channel," IEEE Trans. Signal Process., vol. 56, no. 4, pp. 1616-1626, Apr. 2008.
-
(2008)
IEEE Trans. Signal Process.
, vol.56
, Issue.4
, pp. 1616-1626
-
-
Hoshyar, R.1
Wathan, F.P.2
Tafazolli, R.3
|