References of "Ottersten, Björn 50002797"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA Remote Carrier Synchronization Technique for Coherent Distributed Remote Sensing Systems
Merlano Duncan, Juan Carlos UL; Martinez Marrero, Liz UL; Querol, Jorge UL et al

in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing (2021), 14

Phase, frequency, and time synchronization are crucial requirements for many applications, such as multi-static remote sensing and communication systems. Moreover, the synchronization solution becomes ... [more ▼]

Phase, frequency, and time synchronization are crucial requirements for many applications, such as multi-static remote sensing and communication systems. Moreover, the synchronization solution becomes even more challenging when the nodes are orbiting or flying on airborne or spaceborne platforms. This paper compares the available technologies used for the synchronization and coordination of nodes in distributed remote sensing applications. Additionally, this paper proposes a general system model and identifies preliminary guidelines and critical elements for implementing the synchronization mechanisms exploiting the inter-satellite communication link. The distributed phase synchronization loop introduced in this work deals with the self-interference in a full-duplex point to point scenario by transmitting two carriers at each node. All carriers appear with different frequency offsets around a central frequency, called the application central-frequency or the beamforming frequency. This work includes a detailed analysis of the proposed algorithm and the required simulations to verify its performance for different phase noise, AWGN, and Doppler shift scenarios. [less ▲]

Detailed reference viewed: 78 (14 UL)
Full Text
Peer Reviewed
See detailSystem Modelling and Design Aspects of Next Generation High Throughput Satellites
Sharma, Shree Krishna UL; Querol, Jorge UL; Maturo, Nicola UL et al

in IEEE Communications Letters (2021), 69

As compared to terrestrial systems, the design of Satellite Communication (SatCom) systems require a different approach due to differences in terms of wave propagation, operating frequency, antenna ... [more ▼]

As compared to terrestrial systems, the design of Satellite Communication (SatCom) systems require a different approach due to differences in terms of wave propagation, operating frequency, antenna structures, interfering sources, limitations of onboard processing, power limitations and transceiver impairments. In this regard, this letter aims to identify and discuss important modeling and design aspects of the next generation High Throughput Satellite (HTS) systems. First, communication models of HTSs including the ones for multibeam and multicarrier satellites, multiple antenna techniques, and for SatCom payloads and antennas are highlighted and discussed. Subsequently, various design aspects of SatCom transceivers including impairments related to the transceiver, payload and channel, and traffic-based coverage adaptation are presented. Finally, some open topics for the design of next generation HTSs are identified and discussed. [less ▲]

Detailed reference viewed: 97 (10 UL)
Full Text
Peer Reviewed
See detailGeneralized Multiplexed Waveform Design Framework for Cost-Optimized MIMO Radar
Hammes, C.; R., B. S. M.; Ottersten, Björn UL

in IEEE Transactions on Signal Processing (2021), 69

Cost-optimization through the minimization of hardware and processing costs with minimal loss in performance is an interesting design paradigm in evolving and emerging Multiple-Input-Multiple-Output (MIMO ... [more ▼]

Cost-optimization through the minimization of hardware and processing costs with minimal loss in performance is an interesting design paradigm in evolving and emerging Multiple-Input-Multiple-Output (MIMO) radar systems. This optimization is a challenging task due to the increasing Radio Frequency (RF) hardware complexity as well as the signal design algorithm complexity in applications requiring high angular resolution. Towards addressing these, the paper proposes a low-complexity signal design framework, which incorporates a generalized time multiplex scheme for reducing the RF hardware complexity with a subsequent discrete phase modulation. The scheme further aims at achieving simultaneous transmit beamforming and maximum virtual MIMO aperture to enable better target detection and discrimination performance. Furthermore, the paper proposes a low-complexity signal design scheme for beampattern matching in the aforementioned setting. The conducted performance evaluation indicates that the listed design objectives are met. [less ▲]

Detailed reference viewed: 64 (6 UL)
Full Text
Peer Reviewed
See detailUser Scheduling for Precoded Satellite Systems With Individual Quality of Service Constraints
Trinh, van Chien UL; Lagunas, Eva UL; Tung, Ta Hai et al

in Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Virtual Conference, Sept. 2021 (2021)

Detailed reference viewed: 84 (8 UL)
Full Text
Peer Reviewed
See detailAnalog Beamforming with Antenna Selection for Large-Scale Antenna Arrays
Arora, Aakash UL; Tsinos, Christos; Mysore Rama Rao, Bhavani Shankar UL et al

in Proc. 2021 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP) (2021)

In large-scale antenna array (LSAA) wireless communication systems employing analog beamforming architectures, the placement or selection of a subset of antennas can significantly reduce the power ... [more ▼]

In large-scale antenna array (LSAA) wireless communication systems employing analog beamforming architectures, the placement or selection of a subset of antennas can significantly reduce the power consumption and hardware complexity. In this work, we propose a joint design of analog beamforming with antenna selection (AS) or antenna placement (AP) for an analog beamforming system. We approach this problem from a beampattern matching perspective and formulate a sparse unit-modulus least-squares (SULS) problem, which is a nonconvex problem due to the unit-modulus and the sparsity constraints. To that end, we propose an efficient and scalable algorithm based on the majorization-minimization (MM) framework for solving the SULS problem. We show that the sequence of iterates generated by the algorithm converges to a stationary point of the problem. Numerical results demonstrate that the proposed joint design of analog beamforming with AS outperforms conventional array architectures with fixed inter-antenna element spacing. [less ▲]

Detailed reference viewed: 68 (15 UL)
Full Text
Peer Reviewed
See detailTransfer Learning and Meta Learning Based Fast Downlink Beamforming Adaptation
Yuan, Yi; Zheng, G.; Wong, K.-K. et al

in IEEE Transactions on Wireless Communications (2021)

This paper studies fast adaptive beamforming optimization for the signal-to-interference-plus-noise ratio balancing problem in a multiuser multiple-input single-output downlink system. Existing deep ... [more ▼]

This paper studies fast adaptive beamforming optimization for the signal-to-interference-plus-noise ratio balancing problem in a multiuser multiple-input single-output downlink system. Existing deep learning based approaches to predict beamforming rely on the assumption that the training and testing channels follow the same distribution which may not hold in practice. As a result, a trained model may lead to performance deterioration when the testing network environment changes. To deal with this task mismatch issue, we propose two offline adaptive algorithms based on deep transfer learning and meta-learning, which are able to achieve fast adaptation with the limited new labelled data when the testing wireless environment changes. Furthermore, we propose an online algorithm to enhance the adaptation capability of the offline meta algorithm in realistic non-stationary environments. Simulation results demonstrate that the proposed adaptive algorithms achieve much better performance than the direct deep learning algorithm without adaptation in new environments. The meta-learning algorithm outperforms the deep transfer learning algorithm and achieves near optimal performance. In addition, compared to the offline meta-learning algorithm, the proposed online meta-learning algorithm shows superior adaption performance in changing environments. [less ▲]

Detailed reference viewed: 37 (5 UL)
Full Text
Peer Reviewed
See detailPrecoding with Received-Interference Power Control for Multibeam Satellite Communication Systems
Lagunas, Eva UL; Perez-Neira, Ana Isabel; Martinez, Marc et al

in Frontiers in Space Technologies (2021)

Zero-Forcing (ZF) and Regularized Zero-Forcing (RZF) precoding are low-complexity sub-optimal solutions widely accepted in the satellite communications community to mitigate the resulting co-channel ... [more ▼]

Zero-Forcing (ZF) and Regularized Zero-Forcing (RZF) precoding are low-complexity sub-optimal solutions widely accepted in the satellite communications community to mitigate the resulting co-channel interference caused by aggressive frequency reuse. However, both are sensitive to the conditioning of the channel matrix, which can greatly reduce the achievable gains. This paper brings the attention to the benefits of a design that allows some residual received interference power at the co-channel users. The motivation behind this approach is to relax the dependence on the matrix inversion procedure involved in conventional precoding schemes. In particular, the proposed scheme aims to be less sensitive to the user scheduling, which is one of the key limiting factors for the practical implementation of precoding. Furthermore, the proposed technique can also cope with more users than satellite beams. In fact, the proposed precoder can be tuned to control the interference towards the co-channel beams, which is a desirable feature that is not met by the existing RZF solutions. The design is formulated as a non-convex optimization and we study various algorithms in order to obtain a practical solution. Supporting results based on numerical simulations show that the proposed precoding implementations are able to outperform the conventional ZF and RZF schemes. [less ▲]

Detailed reference viewed: 61 (10 UL)
Full Text
Peer Reviewed
See detailEfficient Algorithms for Constant-Modulus Analog Beamforming
Arora, Aakash UL; Tsinos, Christos; Mysore Rama Rao, Bhavani Shankar UL et al

in IEEE Transactions on Signal Processing (2021)

The use of a large-scale antenna array (LSAA) has become an important characteristic of multi-antenna communication systems to achieve beamforming gains. For example, in millimeter wave (mmWave) systems ... [more ▼]

The use of a large-scale antenna array (LSAA) has become an important characteristic of multi-antenna communication systems to achieve beamforming gains. For example, in millimeter wave (mmWave) systems, an LSAA is employed at the transmitter/receiver end to combat severe propagation losses. In such applications, each antenna element has to be driven by a radio frequency (RF) chain for the implementation of fully-digital beamformers. This strict requirement significantly increases the hardware cost, complexity, and power consumption. Therefore, constant-modulus analog beamforming (CMAB) becomes a viable solution. In this paper, we consider the scaled analog beamforming (SAB) or CMAB architecture and design the system parameters by solving the beampattern matching problem. We consider two beampattern matching problems. In the first case, both the magnitude and phase of the beampattern are matched to the given desired beampattern whereas in the second case, only the magnitude of the beampattern is matched. Both the beampattern matching problems are cast as a variant of the constant-modulus least-squares problem. We provide efficient algorithms based on the alternating majorization-minimization (AMM) framework that combines the alternating minimization and the MM frameworks and the conventional-cyclic coordinate descent (C-CCD) framework to solve the problem in each case. We also propose algorithms based on a new modified-CCD (M-CCD) based approach. For all the developed algorithms we prove convergence to a Karush-Kuhn-Tucker (KKT) point (or a stationary point). Numerical results demonstrate that the proposed algorithms converge faster than state-of-the-art solutions. Among all the algorithms, the M-CCD-based algorithms have faster convergence when evaluated in terms of the number of iterations and the AMM-based algorithms offer lower complexity. [less ▲]

Detailed reference viewed: 91 (8 UL)
Full Text
Peer Reviewed
See detailSatellite Broadband Capacity-on-Demand: Dynamic Beam Illumination with Selective Precoding
Chen, Lin UL; Lagunas, Eva UL; Chatzinotas, Symeon UL et al

in European Signal Processing Conference (EUSIPCO), Dublin, Ireland, Aug. 2021 (2021)

Efficient satellite resource utilization is one of the key challenges in next generation high-throughput satellite communication system. In this context, dynamic coverage scheduling based on traffic ... [more ▼]

Efficient satellite resource utilization is one of the key challenges in next generation high-throughput satellite communication system. In this context, dynamic coverage scheduling based on traffic demand has emerged as a promising solution, focusing system capacity into geographical areas where it is needed. Conventional Beam Hopping (BH) satellite system exploit the time-domain flexibility, which provides all available spectrum to a selected set of beams as long as they are not adjacent to each other. However, large geographical areas involving more than one adjacent beam may require full access to the available spectrum during particular instances of time. In this paper, we address this problem by proposing a dynamic beam illumination scheme combined with selective precoding, where only sub-sets of beams that are subject to strong inter-beam interference are precoded. With selective precoding, complexity at the groundsegment is reduced and only considered when needed. Supporting results based on numerical simulations show that the proposed scheme outperforms the relevant benchmarks in terms of demand matching performance. [less ▲]

Detailed reference viewed: 184 (85 UL)
Full Text
Peer Reviewed
See detailVertex Feature Encoding and Hierarchical Temporal Modeling in a Spatio-Temporal Graph Convolutional Network for Action Recognition
Papadopoulos, Konstantinos UL; Ghorbel, Enjie UL; Aouada, Djamila UL et al

in International Conference on Pattern Recognition, Milan 10-15 January 2021 (2021)

Detailed reference viewed: 129 (25 UL)
Full Text
Peer Reviewed
See detailDynamic Bandwidth Allocation and Precoding Design for Highly-Loaded Multiuser MISO in Beyond 5G Networks
Vu, Thang Xuan UL; Chatzinotas, Symeon UL; Ottersten, Björn UL

in IEEE Transactions on Wireless Communications (2021)

Multiuser techniques play a central role in the fifth-generation (5G) and beyond 5G (B5G) wireless networks that exploit spatial diversity to serve multiple users simultaneously in the same frequency ... [more ▼]

Multiuser techniques play a central role in the fifth-generation (5G) and beyond 5G (B5G) wireless networks that exploit spatial diversity to serve multiple users simultaneously in the same frequency resource. It is well known that a multi-antenna base station (BS) can efficiently serve a number of users not exceeding the number of antennas at the BS via precoding design. However, when there are more users than the number of antennas at the BS, conventional precoding design methods perform poorly because inter-user interference cannot be efficiently eliminated. In this paper, we investigate the performance of a highly-loaded multiuser system in which a BS simultaneously serves a number of users that is larger than the number of antennas. We propose a dynamic bandwidth allocation and precoding design framework and apply it to two important problems in multiuser systems: i) User fairness maximization and ii) Transmit power minimization, both subject to predefined quality of service (QoS) requirements. The premise of the proposed framework is to dynamically assign orthogonal frequency channels to different user groups and carefully design the precoding vectors within every user group. Since the formulated problems are non-convex, we propose two iterative algorithms based on successive convex approximations (SCA), whose convergence is theoretically guaranteed. Furthermore, we propose a low-complexity user grouping policy based on the singular value decomposition (SVD) to further improve the system performance. Finally, we demonstrate via numerical results that the proposed framework significantly outperforms existing designs in the literature. [less ▲]

Detailed reference viewed: 35 (3 UL)
Full Text
Peer Reviewed
See detailPrecoding for Satellite Communications: Why, How and What next?
Mysore Rama Rao, Bhavani Shankar UL; Lagunas, Eva UL; Chatzinotas, Symeon UL et al

in IEEE Communications Letters (2021)

Detailed reference viewed: 108 (15 UL)
Full Text
Peer Reviewed
See detailOn performance characterization of cascaded multiwire-PLC/MIMO-RF communication system
Ai, Yun; Kong, Long; Cheffena, Michael et al

in 2021 29th European Signal Processing Conference (EUSIPCO) (2021)

Detailed reference viewed: 15 (0 UL)
Full Text
Peer Reviewed
See detailAn Overview of Information-Theoretic Secrecy Analysis over Classical Wiretap Fading Channels
Kong; Ai, Yun; Lei, Lei et al

in EURASIP Journal on Wireless Communications and Networking (2021)

An alternative or supplementary approach named as physical layer security has been recently proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an ... [more ▼]

An alternative or supplementary approach named as physical layer security has been recently proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance investigations over the classic Alice-Bob-Eve wiretap fading channels is conducted. On the basis of the classic wiretap channel model, we have comprehensively listed and thereafter compared the existing works on physical layer secrecy analysis considering the small-scale, large-scale, composite, and cascaded fading channel models. Exact secrecy metrics expressions, including secrecy outage probability (SOP), the probability of non-zero secrecy capacity (PNZ), and average secrecy capacity (ASC), and secrecy bounds, including the lower bound of SOP and ergodic secrecy capacity, are presented. In order to encompass the aforementioned four kinds of fading channel models with a more generic and flexible distribution, the mixture gamma (MG), mixture of Gaussian (MoG), and Fox’s H- function distributions are three useful candidates to largely include the above-mentioned four kinds of fading channel models. It is shown that all they are flexible and general when assisting the secrecy analysis to obtain closed-form expressions. Their advantages and limitations are also highlighted. Conclusively, these three approaches are proven to provide a unified secrecy analysis framework and can cover all types of independent wiretap fading channel models. Apart from those, revisiting the existing secrecy enhancement techniques based on our system configuration, the on-off transmission scheme, artificial noise (AN) & artificial fast fading (AFF), jamming approach, antenna selection, and security region are presented. [less ▲]

Detailed reference viewed: 23 (3 UL)
Full Text
Peer Reviewed
See detailDoA Estimation Using Low-Resolution Multi-BitSparse Array Measurements
Sedighi, Saeid UL; Mysore Rama Rao, Bhavani Shankar UL; Soltanalian, Mojtaba et al

in IEEE Signal Processing Letters (2021)

This letter studies the problem of Direction of Arrival (DoA) estimation from low-resolution few-bit quantized data collected by Sparse Linear Array (SLA). In such cases, contrary to the one-bit ... [more ▼]

This letter studies the problem of Direction of Arrival (DoA) estimation from low-resolution few-bit quantized data collected by Sparse Linear Array (SLA). In such cases, contrary to the one-bit quantization case, the well known arcsine law cannot be employed to estimate the covaraince matrix of unquantized array data. Instead, we develop a novel optimization-based framework for retrieving the covaraince matrix of unquantized array data from low-resolution few-bit measurements. The MUSIC algorithm is then applied to an augmented version of the recovered covariance matrix to find the source DoAs. The simulation results show that increasing the sampling resolution to $2$ or $4$ bits per samples could significantly increase the DoA estimation performance compared to the one-bit sampling regime while the power consumption and implementation costs is still much lower in comparison to the high-resolution sampling implementations. [less ▲]

Detailed reference viewed: 55 (3 UL)
Full Text
Peer Reviewed
See detailLocalization Performance of 1-Bit Passive Radars in NB-IoT Applications using Multivariate Polynomial Optimization
Sedighi, Saeid UL; Mishra, Kumar Vijay; Mysore Rama Rao, Bhavani Shankar UL et al

in IEEE Transactions on Signal Processing (2021), 69

Several Internet-of-Things (IoT) applications provide location-based services, wherein it is critical to obtain accurate position estimates by aggregating information from individual sensors. In the ... [more ▼]

Several Internet-of-Things (IoT) applications provide location-based services, wherein it is critical to obtain accurate position estimates by aggregating information from individual sensors. In the recently proposed narrowband IoT (NB-IoT) standard, which trades off bandwidth to gain wide coverage, the location estimation is compounded by the low sampling rate receivers and limited-capacity links. We address both of these NB-IoT drawbacks in the framework of passive sensing devices that receive signals from the target-of-interest. We consider the limiting case where each node receiver employs one-bit analog-to-digital-converters and propose a novel low-complexity nodal delay estimation method using constrained-weighted least squares minimization. To support the low-capacity links to the fusion center (FC), the range estimates obtained at individual sensors are then converted to one-bit data. At the FC, we propose target localization with the aggregated one-bit range vector using both optimal and sub-optimal techniques. The computationally expensive former approach is based on Lasserre's method for multivariate polynomial optimization while the latter employs our less complex iterative joint r\textit{an}ge-\textit{tar}get location \textit{es}timation (ANTARES) algorithm. Our overall one-bit framework not only complements the low NB-IoT bandwidth but also supports the design goal of inexpensive NB-IoT location sensing. Numerical experiments demonstrate feasibility of the proposed one-bit approach with a 0.6\% increase in the normalized localization error for the small set of 20-60 nodes over the full-precision case. When the number of nodes is sufficiently large (>80), the one-bit methods yield the same performance as the full precision. [less ▲]

Detailed reference viewed: 59 (3 UL)
Full Text
See detailPrecoding-Aided Bandwidth Optimization for High Throughput Satellite Systems
Abdu, Tedros Salih UL; Lei, Lei UL; Kisseleff, Steven UL et al

Scientific Conference (2021)

Linear precoding boosts the spectral efficiency of the satellite system by mitigating the interference signal. Typically, all users are precoded and share the same bandwidth regardless of the user demand ... [more ▼]

Linear precoding boosts the spectral efficiency of the satellite system by mitigating the interference signal. Typically, all users are precoded and share the same bandwidth regardless of the user demand. This bandwidth utilization is not efficient since the user demand permanently varies. Hence, demand-aware bandwidth allocation with linear precoding is promising. In this paper, we exploited the synergy of linear precoding and flexible bandwidth allocation for geostationary (GEO) high throughput satellite systems. We formulate an optimization problem with the goal to satisfy the demand by taking into account that multiple precoded user groups can share the different bandwidth chunks. Hence, optimal beam groups are selected with minimum bandwidth requirement to match the per beam demand. The simulation results show that the proposed method of combining bandwidth allocation and linear precoding has better bandwidth efficiency and demand satisfaction than benchmark schemes. [less ▲]

Detailed reference viewed: 58 (9 UL)
Full Text
Peer Reviewed
See detailInterference Mitigation Methods for Coexistence of Radar and Communication
Kumar, Sumit UL; Mishra, Vijay Kumar; Mysore Rama Rao, Bhavani Shankar UL et al

in 15th European Conference on Antennas and Propagation (EuCAP) (2021)

We consider a communications-centric spectrum sharing scenario where the communications link has a minimum service constraint in throughput and the radar maximizes its receive signal-to-interference-plus ... [more ▼]

We consider a communications-centric spectrum sharing scenario where the communications link has a minimum service constraint in throughput and the radar maximizes its receive signal-to-interference-plus-noise ratio (SINR). Prior works on joint power, allocation indicate that, under a communication-centric scenario, radar transmit power is gradually reduced as the throughput demand for communications link increases. Such an approach results in severe degradation of radar SINR, especially when the communications link suffers an outage. We propose methods based on successive-interference-cancellation to improve the radar SINR. This comprises both coexistence and coordination approaches. Numerical experiments show significant improvement in radar SINR when communications throughput demand rises and eventually goes into the outage. [less ▲]

Detailed reference viewed: 26 (7 UL)