Sorry, you need to enable JavaScript to visit this website.

Signal Processing for Communications and Networking

Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems


Large peak to average power ratios (PAPRs) are problematic for communication systems. One possible approach to control the PAPR is the tone reservation method. We analyze the tone reservation method for general complete orthonormal systems, and consider two solvability concepts: strong solvability and weak solvability. Strong solvability requires a rather strong control of the peak value of the transmit signal by the energy of the information signal, and thus might be to restrictive for practical applications.

Paper Details

Authors:
Holger Boche, Ullrich J. Mönich
Submitted On:
13 April 2018 - 6:14am
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

icassp2018_papr.pdf

(116 downloads)

Subscribe

[1] Holger Boche, Ullrich J. Mönich, "Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/2678. Accessed: Dec. 14, 2018.
@article{2678-18,
url = {http://sigport.org/2678},
author = {Holger Boche; Ullrich J. Mönich },
publisher = {IEEE SigPort},
title = {Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems},
year = {2018} }
TY - EJOUR
T1 - Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems
AU - Holger Boche; Ullrich J. Mönich
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/2678
ER -
Holger Boche, Ullrich J. Mönich. (2018). Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems. IEEE SigPort. http://sigport.org/2678
Holger Boche, Ullrich J. Mönich, 2018. Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems. Available at: http://sigport.org/2678.
Holger Boche, Ullrich J. Mönich. (2018). "Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems." Web.
1. Holger Boche, Ullrich J. Mönich. Tone Reservation and Solvability Concepts for the PAPR Problem in General Orthonormal Transmission Systems [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/2678

FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL


We consider the non-orthogonal multiple access (NOMA) design for a classical two-user multiple access channel (MAC) with finite-alphabet inputs. In contrast to the majority of existing NOMA schemes using continuous Gaussian distributed inputs, we consider practical quadrature amplitude modulation (QAM) constel- lations at both transmitters, whose sizes are not necessarily the same.

poster.pdf

PDF icon poster.pdf (147 downloads)

Paper Details

Authors:
Zheng Dong, He (Henry) Chen, Jian-Kang Zhang, Lei Huang, and Branka Vucetic
Submitted On:
12 April 2018 - 8:55pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

poster.pdf

(147 downloads)

Subscribe

[1] Zheng Dong, He (Henry) Chen, Jian-Kang Zhang, Lei Huang, and Branka Vucetic, "FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/2530. Accessed: Dec. 14, 2018.
@article{2530-18,
url = {http://sigport.org/2530},
author = {Zheng Dong; He (Henry) Chen; Jian-Kang Zhang; Lei Huang; and Branka Vucetic },
publisher = {IEEE SigPort},
title = {FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL},
year = {2018} }
TY - EJOUR
T1 - FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL
AU - Zheng Dong; He (Henry) Chen; Jian-Kang Zhang; Lei Huang; and Branka Vucetic
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/2530
ER -
Zheng Dong, He (Henry) Chen, Jian-Kang Zhang, Lei Huang, and Branka Vucetic. (2018). FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL. IEEE SigPort. http://sigport.org/2530
Zheng Dong, He (Henry) Chen, Jian-Kang Zhang, Lei Huang, and Branka Vucetic, 2018. FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL. Available at: http://sigport.org/2530.
Zheng Dong, He (Henry) Chen, Jian-Kang Zhang, Lei Huang, and Branka Vucetic. (2018). "FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL." Web.
1. Zheng Dong, He (Henry) Chen, Jian-Kang Zhang, Lei Huang, and Branka Vucetic. FINITE-ALPHABET NOMA FOR TWO-USER UPLINK CHANNEL [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/2530

FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION

Paper Details

Authors:
Yifei Yang, Shuowen Zhang, Joni Polili Lie, Rui Zhang
Submitted On:
12 April 2018 - 11:28am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ICASSP_FMGSC.pdf

(81 downloads)

Subscribe

[1] Yifei Yang, Shuowen Zhang, Joni Polili Lie, Rui Zhang, "FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/2398. Accessed: Dec. 14, 2018.
@article{2398-18,
url = {http://sigport.org/2398},
author = {Yifei Yang; Shuowen Zhang; Joni Polili Lie; Rui Zhang },
publisher = {IEEE SigPort},
title = {FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION},
year = {2018} }
TY - EJOUR
T1 - FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION
AU - Yifei Yang; Shuowen Zhang; Joni Polili Lie; Rui Zhang
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/2398
ER -
Yifei Yang, Shuowen Zhang, Joni Polili Lie, Rui Zhang. (2018). FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION. IEEE SigPort. http://sigport.org/2398
Yifei Yang, Shuowen Zhang, Joni Polili Lie, Rui Zhang, 2018. FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION. Available at: http://sigport.org/2398.
Yifei Yang, Shuowen Zhang, Joni Polili Lie, Rui Zhang. (2018). "FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION." Web.
1. Yifei Yang, Shuowen Zhang, Joni Polili Lie, Rui Zhang. FLEXIBLE MULTI-GROUP SINGLE CARRIER MODULATION: OPTIMAL SUBCARRIER GROUPING AND RATE MAXIMIZATION [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/2398

JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION

Paper Details

Authors:
Submitted On:
7 March 2017 - 2:01pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

Poster_ICASSP_2017.pdf

(446 downloads)

Subscribe

[1] , "JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/1692. Accessed: Dec. 14, 2018.
@article{1692-17,
url = {http://sigport.org/1692},
author = { },
publisher = {IEEE SigPort},
title = {JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION},
year = {2017} }
TY - EJOUR
T1 - JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION
AU -
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/1692
ER -
. (2017). JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION. IEEE SigPort. http://sigport.org/1692
, 2017. JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION. Available at: http://sigport.org/1692.
. (2017). "JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION." Web.
1. . JOINT CHANNEL AND CARRIER FREQUENCY ESTIMATION FOR M-ARY CPM OVER FREQUENCY-SELECTIVE CHANNEL USING PAM DECOMPOSITION [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/1692

LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION

Paper Details

Authors:
Afshin Abdi, Ali Payani, Faramarz Fekri
Submitted On:
4 March 2017 - 9:50pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

DL_poster.pdf

(314 downloads)

Subscribe

[1] Afshin Abdi, Ali Payani, Faramarz Fekri, "LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/1630. Accessed: Dec. 14, 2018.
@article{1630-17,
url = {http://sigport.org/1630},
author = {Afshin Abdi; Ali Payani; Faramarz Fekri },
publisher = {IEEE SigPort},
title = {LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION},
year = {2017} }
TY - EJOUR
T1 - LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION
AU - Afshin Abdi; Ali Payani; Faramarz Fekri
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/1630
ER -
Afshin Abdi, Ali Payani, Faramarz Fekri. (2017). LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION. IEEE SigPort. http://sigport.org/1630
Afshin Abdi, Ali Payani, Faramarz Fekri, 2017. LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION. Available at: http://sigport.org/1630.
Afshin Abdi, Ali Payani, Faramarz Fekri. (2017). "LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION." Web.
1. Afshin Abdi, Ali Payani, Faramarz Fekri. LEARNING DICTIONARY FOR EFFICIENT SIGNAL COMPRESSION [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/1630

Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform


The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive cancellation list (SCL) decoder on a GPU and identify the bottlenecks of this algorithm with respect to parallel computing and its difficulties. The inherent serial decoding property of the SCL algorithm naturally limits the achievable speed-up gains on GPUs when compared to CPU implementations.

Paper Details

Authors:
Sebastian Cammerer, Benedikt Leible, Matthias Stahl, Jakob Hoydis, Stephan ten Brink
Submitted On:
28 February 2017 - 7:34am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Poster Presentation ICASSP'17

(275 downloads)

Subscribe

[1] Sebastian Cammerer, Benedikt Leible, Matthias Stahl, Jakob Hoydis, Stephan ten Brink, "Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/1506. Accessed: Dec. 14, 2018.
@article{1506-17,
url = {http://sigport.org/1506},
author = {Sebastian Cammerer; Benedikt Leible; Matthias Stahl; Jakob Hoydis; Stephan ten Brink },
publisher = {IEEE SigPort},
title = {Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform},
year = {2017} }
TY - EJOUR
T1 - Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform
AU - Sebastian Cammerer; Benedikt Leible; Matthias Stahl; Jakob Hoydis; Stephan ten Brink
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/1506
ER -
Sebastian Cammerer, Benedikt Leible, Matthias Stahl, Jakob Hoydis, Stephan ten Brink. (2017). Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform. IEEE SigPort. http://sigport.org/1506
Sebastian Cammerer, Benedikt Leible, Matthias Stahl, Jakob Hoydis, Stephan ten Brink, 2017. Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform. Available at: http://sigport.org/1506.
Sebastian Cammerer, Benedikt Leible, Matthias Stahl, Jakob Hoydis, Stephan ten Brink. (2017). "Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform." Web.
1. Sebastian Cammerer, Benedikt Leible, Matthias Stahl, Jakob Hoydis, Stephan ten Brink. Combining Belief Propagation and Successive Cancellation List Decoding of Polar Codes on a GPU Platform [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/1506

SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL


We study the problem of remote reconstruction of a continuous signal from its multiple corrupted versions. We are interested in the optimal number of samples and their locations for each corrupted signal to minimize the total reconstruction distortion of the remote signal. The correlation among the corrupted signals can be utilized to reduce the sampling rate.

Poster3.pdf

PDF icon Poster3.pdf (503 downloads)

Paper Details

Authors:
Submitted On:
7 December 2016 - 3:17am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Poster3.pdf

(503 downloads)

Subscribe

[1] , "SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1399. Accessed: Dec. 14, 2018.
@article{1399-16,
url = {http://sigport.org/1399},
author = { },
publisher = {IEEE SigPort},
title = {SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL},
year = {2016} }
TY - EJOUR
T1 - SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL
AU -
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1399
ER -
. (2016). SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL. IEEE SigPort. http://sigport.org/1399
, 2016. SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL. Available at: http://sigport.org/1399.
. (2016). "SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL." Web.
1. . SAMPLING AND DISTORTION TRADEOFFS FOR INDIRECT SOURCE RETRIEVAL [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1399

Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN


Compressed sensing recovery techniques allow for reconstruction of an unknown sparse vector from an underdetermined system of linear equations. Recently, a lot of attention was drawn to the problem of recovering the sparse vector from quantized CS measurements. Especially interesting is the case, when extreme quantization is enforced that captures only the sign of the measurements. The problem becomes even more difficult if the measurements are corrupted by noise. In this paper we consider \ac{AWGN}.

Paper Details

Authors:
Osman Musa,Gabor Hannak,Norbert Goertz
Submitted On:
6 December 2016 - 12:16pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

globalsip2016-poster.pdf

(336 downloads)

Subscribe

[1] Osman Musa,Gabor Hannak,Norbert Goertz, "Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1368. Accessed: Dec. 14, 2018.
@article{1368-16,
url = {http://sigport.org/1368},
author = {Osman Musa;Gabor Hannak;Norbert Goertz },
publisher = {IEEE SigPort},
title = {Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN},
year = {2016} }
TY - EJOUR
T1 - Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN
AU - Osman Musa;Gabor Hannak;Norbert Goertz
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1368
ER -
Osman Musa,Gabor Hannak,Norbert Goertz. (2016). Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN. IEEE SigPort. http://sigport.org/1368
Osman Musa,Gabor Hannak,Norbert Goertz, 2016. Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN. Available at: http://sigport.org/1368.
Osman Musa,Gabor Hannak,Norbert Goertz. (2016). "Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN." Web.
1. Osman Musa,Gabor Hannak,Norbert Goertz. Generalized Approximate Message Passing for One-Bit Compressed Sensing with AWGN [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1368

In-Network Linear Regression with Arbitrarily Split Data Matrices


We address for the first time the question of how networked agents can collaboratively fit a Morozov-regularized linear model when each agent knows a summand of the regression data. This question generalizes previously studied data-splitting scenarios, which require that the data be partitioned among the agents. To answer the question, we introduce a class of network-structured problems, which contains the regularization problem, and by using the Douglas-Rachford splitting algorithm, we develop a distributed algorithm to solve these problems.

Poster.pdf

PDF icon Poster.pdf (1129 downloads)

Paper Details

Authors:
François D. Côté, Ioannis N. Psaromiligkos, Warren J. Gross
Submitted On:
5 December 2016 - 6:33pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Poster.pdf

(1129 downloads)

Subscribe

[1] François D. Côté, Ioannis N. Psaromiligkos, Warren J. Gross, "In-Network Linear Regression with Arbitrarily Split Data Matrices", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1353. Accessed: Dec. 14, 2018.
@article{1353-16,
url = {http://sigport.org/1353},
author = {François D. Côté; Ioannis N. Psaromiligkos; Warren J. Gross },
publisher = {IEEE SigPort},
title = {In-Network Linear Regression with Arbitrarily Split Data Matrices},
year = {2016} }
TY - EJOUR
T1 - In-Network Linear Regression with Arbitrarily Split Data Matrices
AU - François D. Côté; Ioannis N. Psaromiligkos; Warren J. Gross
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1353
ER -
François D. Côté, Ioannis N. Psaromiligkos, Warren J. Gross. (2016). In-Network Linear Regression with Arbitrarily Split Data Matrices. IEEE SigPort. http://sigport.org/1353
François D. Côté, Ioannis N. Psaromiligkos, Warren J. Gross, 2016. In-Network Linear Regression with Arbitrarily Split Data Matrices. Available at: http://sigport.org/1353.
François D. Côté, Ioannis N. Psaromiligkos, Warren J. Gross. (2016). "In-Network Linear Regression with Arbitrarily Split Data Matrices." Web.
1. François D. Côté, Ioannis N. Psaromiligkos, Warren J. Gross. In-Network Linear Regression with Arbitrarily Split Data Matrices [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1353

DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS

Paper Details

Authors:
Mahmoud Abdelaziz, Lauri Anttila, Mikko Valkama
Submitted On:
7 December 2016 - 10:49am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

GlobalSIP_DPD_Mabdelaziz.pdf

(336 downloads)

Subscribe

[1] Mahmoud Abdelaziz, Lauri Anttila, Mikko Valkama, "DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1347. Accessed: Dec. 14, 2018.
@article{1347-16,
url = {http://sigport.org/1347},
author = {Mahmoud Abdelaziz; Lauri Anttila; Mikko Valkama },
publisher = {IEEE SigPort},
title = {DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS},
year = {2016} }
TY - EJOUR
T1 - DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS
AU - Mahmoud Abdelaziz; Lauri Anttila; Mikko Valkama
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1347
ER -
Mahmoud Abdelaziz, Lauri Anttila, Mikko Valkama. (2016). DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS. IEEE SigPort. http://sigport.org/1347
Mahmoud Abdelaziz, Lauri Anttila, Mikko Valkama, 2016. DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS. Available at: http://sigport.org/1347.
Mahmoud Abdelaziz, Lauri Anttila, Mikko Valkama. (2016). "DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS." Web.
1. Mahmoud Abdelaziz, Lauri Anttila, Mikko Valkama. DIGITAL PREDISTORTION FOR MITIGATING TRANSMITTER-INDUCED RECEIVER DESENSITIZATION IN CARRIER AGGREGATION FDD TRANSCEIVERS [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1347

Pages