RRRobin Rajamäki

Robin Rajamäki

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Robin Rajamäki has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Impossibility of Lossless Waveform Rank Reduction for Certain Redundant Arrays

    by Robin Rajamäki, Piya Pal

    Efficient use of spatio-temporal resources, including sensor arrays and transmit waveforms, is a key challenge in modern MIMO active sensing systems. This paper studies the impact of array redundancy and WR on active sensing performance. Specifically, we show that parameter identifiability at reduced WR critically depends on subspace properties of the so-called array redundancy pattern. We show that array geometries with identical sum co-arrays can exhibit markedly different identifiability properties at low WR. We derive a novel necessary condition for maximizing identifiability at reduced WR, which reveals that the unfavorable redundancy patterns of certain redundant arrays fundamentally limits their performance. The results yield new insights into resource-efficient sensing systems, motivating redundancy-aware array and waveform design.

  • Open Access

    Super-Resolution With Sparse Arrays: A Nonasymptotic Analysis of Spatiotemporal Trade-Offs

    by Pulak Sarangi, Mehmet Can Hücümenoğlu, Robin Rajamäki, Piya Pal

    Sparse arrays have emerged as a popular alternative to the conventional uniform linear array (ULA) due to the enhanced degrees of freedom (DOF) and superior resolution offered by them. In the passive setting, these advantages are realized by leveraging correlation between the received signals at different sensors. This has led to the belief that sparse arrays require a large number of temporal measurements to reliably estimate parameters of interest from these correlations, and therefore they may not be preferred in the sample-starved regime. In this paper, we debunk this myth by performing a rigorous non-asymptotic analysis of the Coarray ESPRIT algorithm. This seemingly counter-intuitive result is a consequence of the scaling of the singular value of the coarray manifold, which compensates for the potentially large covariance estimation error in the limited snapshot regime. Specifically, we show that for a nested array operating in the regime of fewer sources than sensors ( S = O (1)), it is possible to bound the matching distance error between the estimated and true directions of arrival (DOAs) by an arbitrarily small quantity ( ϵ ) with high probability, provided (i) the number of temporal snapshots ( L ) scales only logarithmically with the number of sensors (P), i.e. L = Ω(ln( P )/ ϵ 2 ), and (ii) a suitable separation condition is satisfied. Our results also formally prove the well-known empirical resolution benefits of sparse arrays, by establishing that the minimum separation between sources can be Ω(1/ P 2 ), as opposed to separation Ω(1/ P ) required by a ULA with the same number of sensors. In addition to the array geometry, our sample complexity expression reveals the dependence on other key model parameters such as Signal to Noise Ratio (SNR) and the dynamic range of the source powers. This enables us to establish the superior noise-resilience of nested arrays both theoretically and empirically. 1


  • Open Access

    Sparse Symmetric Linear Arrays with Low Redundancy and a Contiguous Sum Co-Array

    by Robin Rajamäki, Visa Koivunen

    Sparse arrays can resolve significantly more scatterers or sources than sensor by utilizing the co-array - a virtual array structure consisting of pairwise differences or sums of sensor positions. Although several sparse array configurations have been developed for passive sensing applications, far fewer active array designs exist. In active sensing, the sum co-array is typically more relevant than the difference co-array, especially when the scatterers are fully coherent. This paper proposes a general symmetric array configuration suitable for both active and passive sensing. We first derive necessary and sufficient conditions for the sum and difference co-array of this array to be contiguous. We then study two specific instances based on the Nested array and the Kl{\o}ve-Mossige basis, respectively. In particular, we establish the relationship between the minimum-redundancy solutions of the two resulting symmetric array configurations, and the previously proposed Concatenated Nested Array (CNA) and Kl{\o}ve Array (KA). Both the CNA and KA have closed-form expressions for the sensor positions, which means that they can be easily generated for any desired array size. The two array structures also achieve low redundancy, and a contiguous sum and difference co-array, which allows resolving vastly more scatterers or sources than sensors

  • Sparse Symmetric Linear Arrays With Low Redundancy and a Contiguous Sum Co-Array

    by Robin Rajamaki, Visa Koivunen

    Sparse arrays can resolve significantly more scatterers or sources than sensor by utilizing the co-array - a virtual array structure consisting of pairwise differences or sums of sensor positions. Although several sparse array configurations have been developed for passive sensing applications, far fewer active array designs exist. In active sensing, the sum co-array is typically more relevant than the difference co-array, especially when the scatterers are fully coherent. This paper proposes a general symmetric array configuration suitable for both active and passive sensing. We first derive necessary and sufficient conditions for the sum and difference co-array of this array to be contiguous. We then study two specific instances based on the Nested array and the Kløve-Mossige basis, respectively. In particular, we establish the relationship between the minimum-redundancy solutions of the two resulting symmetric array configurations, and the previously proposed Concatenated Nested Array (CNA) and Kløve Array (KA). Both the CNA and KA have closed-form expressions for the sensor positions, which means that they can be easily generated for any desired array size. The two array structures also achieve low redundancy, and a contiguous sum and difference co-array, which allows resolving vastly more scatterers or sources than sensors.


  • Hybrid Beamforming for Active Sensing Using Sparse Arrays

    by Robin Rajamaki, Sundeep Prabhakar Chepuri, Visa Koivunen

    This paper studies hybrid beamforming for active sensing applications, such as millimeter-wave or ultrasound imaging. Hybrid beamforming can substantially lower the cost and power consumption of fully digital sensor arrays by reducing the number of active front ends. Sparse arrays can be used to further reduce hardware costs. We consider phased arrays and employ linear beamforming with possibly sparse array configurations at both the transmitter and receiver. The quality of the acquired images is improved by adding together several component images corresponding to different transmissions and receptions. In order to limit the acquisition time of an image, we formulate an optimization problem for minimizing the number of component images subject to achieving a desired point spread function. Since this problem is not convex, we propose algorithms for finding approximate solutions in the fully digital beamforming case, as well as in the more challenging hybrid and analog beamforming cases that employ quantized phase shifters. We also determine upper bounds on the number of component images needed for achieving the fully digital solution using fully analog and hybrid architectures, and derive closed-form expressions for the beamforming weights in these cases. Simulations demonstrate that a hybrid sparse array with very few elements, and even fewer front ends, can achieve the resolution of a fully digital uniform array at the expense of a longer image acquisition time.


  • Open Access

    Hybrid Beamforming for Active Sensing using Sparse Arrays

    by Robin Rajamäki, Sundeep Prabhakar Chepuri, Visa Koivunen

    This paper studies hybrid beamforming for active sensing applications, such as millimeter-wave or ultrasound imaging. Hybrid beamforming can substantially lower the cost and power consumption of fully digital sensor arrays by reducing the number of active front ends. Sparse arrays can be used to further reduce hardware costs. We consider phased arrays and employ linear beamforming with possibly sparse array configurations at both the transmitter and receiver. The quality of the acquired images is improved by adding together several component images corresponding to different transmissions and receptions. In order to limit the acquisition time of an image, we formulate an optimization problem for minimizing the number of component images subject to achieving a desired point spread function. Since this problem is not convex, we propose algorithms for finding approximate solutions in the fully digital beamforming case, as well as in the more challenging hybrid and analog beamforming cases that employ quantized phase shifters. We also determine upper bounds on the number of component images needed for achieving the fully digital solution using fully analog and hybrid architectures, and derive closed-form expressions for the beamforming weights in these cases. Simulations demonstrate that a hybrid sparse array with very few elements, and even fewer front ends, can achieve the resolution of a fully digital uniform array at the expense of a longer image acquisition time.

  • Sparse Active Rectangular Array With Few Closely Spaced Elements

    by Robin Rajamaki, Visa Koivunen

    Sparse sensor arrays offer a cost effective alternative to uniform arrays. By utilizing the co-array, a sparse array can match the performance of a filled array, despite having significantly fewer sensors. However, even sparse arrays can have many closely spaced elements, which may deteriorate the array performance in the presence of mutual coupling. This paper proposes a novel sparse planar array configuration with few unit inter-element spacings. This Concentric Rectangular Array (CRA) is designed for active sensing tasks, such as microwave or ultrasound imaging, in which the same elements are used for both transmission and reception. The properties of the CRA are compared to two well-known sparse geometries: the Boundary Array and the Minimum-Redundancy Array (MRA). Numerical searches reveal that the CRA is the MRA with the fewest unit element displacements for certain array dimensions.


  • Open Access

    Sparse Active Rectangular Array with Few Closely Spaced Elements

    by Robin Rajamäki, Visa Koivunen

    Sparse sensor arrays offer a cost effective alternative to uniform arrays. By utilizing the co-array, a sparse array can match the performance of a filled array, despite having significantly fewer sensors. However, even sparse arrays can have many closely spaced elements, which may deteriorate the array performance in the presence of mutual coupling. This paper proposes a novel sparse planar array configuration with few unit inter-element spacings. This Concentric Rectangular Array (CRA) is designed for active sensing tasks, such as microwave or ultra-sound imaging, in which the same elements are used for both transmission and reception. The properties of the CRA are compared to two well-known sparse geometries: the Boundary Array and the Minimum-Redundancy Array (MRA). Numerical searches reveal that the CRA is the MRA with the fewest unit element displacements for certain array dimensions.

  • Open Access

    Planar additive bases for rectangles

    by Jukka Kohonen, Visa Koivunen, Robin Rajamäki

    We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in, for example, radar and medical imaging. The problem of minimizing the basis cardinality has not been addressed before. We propose two algorithms for finding the minimal bases of small rectangles: one in the setting where the basis elements can be anywhere in the rectangle, and another in the restricted setting, where the elements are confined to the lower left quadrant. We present numerical results from such searches, including the minimal cardinalities for all rectangles up to $[0,11]\times[0,11]$, and up to $[0,46]\times[0,46]$ in the restricted setting. We also prove asymptotic upper and lower bounds on the minimal basis cardinality for large rectangles.