Method of optimizing a sparse array for use in a MIMO radar
Patent Information
- Authority / Receiving Office
- EP · EP
- Patent Type
- Applications
- Current Assignee / Owner
- PROVIZIO LTD
- Filing Date
- 2024-08-16
- Publication Date
- 2026-07-01
AI Technical Summary
Conventional radar systems face challenges in achieving high angular resolution and sensitivity while maintaining affordability, especially in automotive applications, due to the need for a large number of antenna elements which increases cost and size.
The method involves designing a sparse MIMO array antenna that optimizes the separation distances between elements to minimize sidelobe levels and the number of missing spatial lags, while considering MIMO array mapping conditions, thereby achieving a balance between angular resolution and hardware cost.
This approach results in a sparse MIMO array that provides improved angular resolution and reduced sidelobe levels, leading to increased radar processing speed and reduced DSP complexity, while maintaining a lower hardware cost compared to conventional systems.
Smart Images

Figure EP2024073156_27022025_PF_FP_ABST
Abstract
Description
[0001]Title Method of Optimizing a Sparse Array for use in a MIMO radar Field 5 The present invention relates to a method of optimizing an antenna array with a reduced number of elements and optimal performance for use in a MIMO radar system. Background of Invention 10 With research being conducted in many countries into self-driving vehicles, and with over 1.2 billion automobiles in the world, it is clear that autonomous transportation represents a huge emerging market for stakeholders that include both governments and private industry. However, for autonomous transportation to become a reality, affordable sensor systems with high 15 performance and high reliability are necessary. Technologies including radar, lidar, ultrasound, and camera arrays have all been utilised and although each has inherent advantages over some of the others, none are currently adequate for widespread implementation in complex autonomous driving scenarios (such as busy city centre driving), due to a lack of 20 resolution, sensitivity, all-weather capability or affordability. Radar technologies offer cheaper solutions to most of these issues however, with the exception of angular resolution and sensitivity, both of which can be improved – but at a greater cost. 25 The angular resolution or beamwidth of an antenna array aperture is given by the below equation: ேௗ ఏ 30 Where ∆ ^^ is the angular resolution, λ is the wavelength, N is the number of antenna elements, d is the spacing between antenna elements and ^ is the angle of transmission or reception of a signal. The value of d is typically set to λ / 2 in a conventional radar system to ensure Nyquist sampling criterion of the spatial signal at the antenna aperture is met and grating lobes are thereby prevented within the field of view. This therefore means that the 5 above equation simplifies to angular resolution being equal to 2 / N for boresight (^ = 0 degrees) signals. In a conventional radar system, a larger antenna array – with associated increased number of antenna elements and related hardware – is therefore 10 needed to improve spatial resolution. As antenna array aperture sizes become larger to achieve this, however, the number of receivers required becomes exceedingly expensive for applications such as automotive radar. When a low angular resolution is required, a wide beam is sufficient and is obtained when a small antenna array aperture, with a small number of 15 antenna elements, is used. When high angular resolution is required, a narrower beam is needed and a larger antenna array aperture with additional elements must be utilised. Additional receivers are therefore required, and this results in an increase to the overall radar cost and size. This means that for applications requiring low cost (such as an automotive 20 radar), a conventional architecture is limited to a minimal number of elements and hence a wide beam. However, the general rule largely applies, i.e., higher angular resolution requires more antenna elements. Conversely, Multiple-input multiple-output (MIMO) radars go some way to alleviate this increase in cost. 25 MIMO radars are a type of phased array radar which employ transmitters and receivers distributed in such a way that spatial resolution and range are improved when compared to a conventional monostatic radar with an equivalent total number of transmit and receive channels. There are 30 predominately two different types of MIMO radars. One is Statistical MIMO, where the antennas are placed far apart from each other to provide different ‘views’ of the ‘scene’, and another is Beam forming MIMO where the antennas are placed close to each other and act together to form a ‘virtual’, larger, beam forming array. 5 Beam forming methods like that used in a conventional radar system, and analogous to that formed by digital post-processing in MIMO systems, manipulate the virtual array to make use of wave coherence to focus the energy transmitted or received by each radiating element into a narrow beam, which increases the power in the direction of the beam’s peak, while 10 reducing the power in all other directions. By considering beam forming along one axis only, it is seen that larger arrays allow narrower beams with increased focusing of the signal, leading to a higher array gain. It is widely known to those related to the field that the MIMO technique, 15 which comprises of measuring the magnitude and phase of the signal received at N receivers (multiple outputs) for each of M transmitters (multiple inputs), can be used to form a ‘virtual’ receive array that is larger than the physical receive array and thereby enables improved object angular resolution. Various modulation schemes for MIMO exist which aim 20 to achieve orthogonality between the signals transmitted by each individual transmitter, such that they can be separated out on the receiver side. These include but are not limited to Time Division Duplex (TDD), Frequency Division Duplex (FDD) and Binary Phase Modulation (BPM). For TDD MIMO, the transmitters sequentially transmit a signal one at a time. The 25 receive elements then receive signals originating from each of the transmitters sequentially in time, and these can thereby be separated according to which transmitter the signal originated from. When the spacing between said transmit and receive elements is set accordingly, the signals at each receiver can be rearranged corresponding to the transmitter from 30 which they originated, and the phase differences on each received radiated wave is such that an equivalent larger number of receive elements appear than are actually present and thus ‘virtual’ elements are created. FIG.1 illustrates a virtual array which consists of (M x N) number of 5 elements, whilst only making use of (M + N) physical antenna elements, and which is much larger than the physical number of transmitters and receivers required. Therefore, the angular resolution of the virtual array is much finer than that of the physical array when not used in a MIMO implementation. 10 The MIMO arrangement shown in FIG.1 is a uniform linear array (ULA), as the elements lie in a line along one dimension, with uniform separation. Such ULAs allow for grating lobes to be prevented within the radar’s field of regard through choice of the antenna separation to satisfy the Nyquist spatial sampling criterion. Linear sparse arrays have aperture widths or 15 sizes equal to their equivalent filled ULAs but are, by definition, sparsely populated. As they need fewer antenna elements than ULAs to create equivalent narrow beams, they belong to the general class of non-uniform linear arrays (NULAs). With fewer elements in the array, ‘holes’ or vacancies, arise that are deliberately created into the design of the sparse 20 array to achieve, or maintain, certain desired characteristics. It will be widely accepted in the field, that ULAs and NULAs can be extended over two dimensions to form rectangular arrays and so sparse arrays are equally valid in both axes of a rectangular array. 25 The key advantage of sparse arrays, therefore, is that they have reduced hardware cost for a given angular resolution, which when combined by the additional hardware reductions obtained by a MIMO system, makes such an implementation very attractive. Furthermore, as the spacings between elements in sparse arrays are larger, they are not so affected by mutual 30 couplings between antenna elements (compared to ULAs where the elements are much closer) and for a given number of antenna elements, provide larger apertures (which is the sum of all the inter-element spacings) while detecting more source signals through direction-of-arrival estimation than full ULAs with the same number of elements. 5 Different types of linear sparse arrays have been developed, in which the most common types are now discussed. Minimum Redundancy Arrays (MRAs) are sparse arrays where all possible spacings, or ‘spatial lags’, are covered at least once but with as few repeating lags as possible. FIG.2 illustrates this calculation of spatial lags by subtracting all possible sensor 10 positions in the sparse array from each other. In another type of sparse array called a Minimum Hole Array (MHA), spatial lags are only allowed to appear once, with the array optimised to minimise the number of missing lags in the array, or ‘holes’ in the ‘difference array’, 15 which is formed from the spatial lags (differences) that can be generated using the available sensors in the conventional array. In practice though perfect MHAs are rare and element positions follow the known prior-art Golumb ruler spacings for radio astronomy arrays. When the number of sparse elements is less than 5, it has been shown that MRAs and MHAs 20 are identical. FIG.3 illustrates the distinction between a 5-element MRA and a 5-element MHA. FIG.4 illustrates two different nested array sizes and spacings combined within a single array to produce a hole free combination array, also referred 25 to as a super-nested array. Super-nested arrays have multiple different arrays combined and are similar to nested arrays. FIG.5 illustrates co-prime arrays, (including extended co-prime arrays) where sub-arrays are designed to run concurrently in the combined array 30 rather than consecutively as in the nested cases. While each type uses a proven methodology for angle determination, the radiation pattern – which is determined by the array factor calculation for the array – gives an insight into how such arrays can affect object determination in radar applications. The main issue arising from sparse arrays is that the 5 grating lobes resulting from sub-Nyquist spatial sampling may introduce ambiguity into angle finding. In that context, the key problems are how to select the locations of the array elements such that the sidelobe levels (or the lobes, i.e. local maxima, of the array factor that are not the main lobe or beam) of the sparse array are low, minimising the number of missing spatial 10 lags and minimising the number of elements which are needed to enable angle finding. FIG.6 shows this issue by comparing the boresight (0-degrees) array factors for 12-element arrays designed by the previously listed prior-art methods 15 and indicates that many will cause false radar detections as high sidelobes appear at angular regions off-boresight, which are much higher in value than that which would appear from the equivalent ULA having the same aperture size and a separation distance D equalling a half wavelength of the operating frequency. When sidelobes are high in a radar system, it is 20 possible that objects could be detected as a result of the higher signal levels appearing from these, but which will be interpreted as appearing on the main beam, or alternatively a single object may give rise to multiple detections at different angles due to the high sidelobe levels. Furthermore, as a result of the method of implementation of MIMO virtual arrays, whereby 25 transmitters are multiplexed together to give a larger virtual array, such sparse arrays are either difficult to implement, or in the case of nested, triply nested and co-prime arrays don’t lead to much of an increase in the virtual array aperture size which in turn reduces the angular resolution. 30 XP 087095549 titled “On the design of linear sparse arrays with beampattern shift invariant properties” shows an algorithm for the design of a MIMO array that considers the sidelobe level and main lobe beam width during the design. However, it does not consider the number of missing spatial lags which may present a reconstruction challenge in the DSP chain. 5 XP 033663812 titled “Sparse array design for automotive MIMO radar” uses a number of factors to independently optimise the sparse array and chooses the best result from these independent simulations which are completed using a number of different optimisation methods. However, it does not consider the number of missing spatial lags which may also present a 10 reconstruction challenge in the DSP chain. XP 031398994 titled “Co-array properties of minimum redundancy linear arrays with minimum sidelobe level” shows a method which chooses the optimum minimum redundancy array, by selecting the one with the minimum 15 sidelobe levels, when a number of alternative minimum redundancy arrays can be formed. This restricts its use to the selection of only minimum redundancy arrays, which cannot be used for MIMO configurations. XP 093117636 titled “Non redundant arrays” optimises a sparse array for 20 missing lags.. However, it cannot be applied to a MIMO mapped array. In view of the above, there is a need for a MIMO sparse array antenna design that concurrently considers the magnitude of sidelobes, the number of missing spatial lags and the MIMO array mapping conditions. 25 SUMMARY OF INVENTION The present invention relates to a sparse MIMO array antenna. 30 In an aspect of the present invention, there is provided a method for designing a sparse antenna array. The method includes determining a first set of separation distances among a plurality of sparse elements along an axis, wherein the first set minimises the highest radiated power of one or more sidelobes, when the beam is pointed at a boresight for a Uniform Linear Array (ULA) that has an equivalent aperture size but greater number 5 of elements with respect to the sparse antenna array. The method further includes determining at least one second set of separation distances among the plurality of sparse elements, that minimises the highest radiated power of one or more sidelobes, when the beam is pointed at different angular directions wherein at least one of these directions is at an edge of the field 10 of view for the equivalent ULA, wherein the first, and at least one second set of separation distances are identical and optimised simultaneously to minimise their combined error function. In another aspect of the present invention, there is provided a method for 15 designing a sparse MIMO virtual antenna array. The method includes determining a size of an equivalent uniform linear array (ULA) based on a target number of sparse elements of the sparse MIMO virtual antenna array; setting a first optimization target as the maximum signal level of one or more sidelobes of the ULA, when the beam is pointed at a boresight; setting a 20 second optimization target as the maximum signal level of one or more sidelobes of the ULA, when the beam is pointed at an edge of the field of view; determining a set of separation distances among the antenna array elements of the sparse MIMO virtual antenna array, that simultaneously minimises the first and second optimised targets, or minimises a combined 25 sum of the first and second optimisation targets, wherein the minimising the first optimisation target minimises highest radiated power of one or more sidelobes, and the minimising the second optimisation target minimises one or more missing spatial lags of the sparse MIMO virtual antenna array; and building the sparse MIMO virtual antenna array based on the determined 30 set of separation distances. In an embodiment of the present invention, the pointing the beam at the edge of the field of view comprises pointing the beam at an angle of 60 degrees off boresight. In an embodiment of the present invention, the pointing the beam at the 5 edge of the field of view comprises pointing the beam at an angle of -60 degrees off boresight. In an embodiment of the present invention, the set of separation distances include distances that are multiples of the unit separation distance, wherein the unit separation distance is equivalent to half wavelength of an operating 10 frequency of the sparse MIMO virtual antenna array. In an embodiment of the present invention, an aperture size of the sparse MIMO virtual antenna array is based on an angular resolution and the number of target sparse elements of the sparse MIMO virtual antenna array, and wherein the aperture size is approximated from a size trend for a 15 minimum redundancy array when the number of sparse elements is less than 12. In an embodiment of the present invention, the aperture size of the sparse MIMO virtual antenna array is approximated from a size trend for a minimum hole array, when the number of sparse elements is equal to or greater than 20 12. In an embodiment of the present invention, the method further includes applying a first weighting factor to the determination of the set of separation distances to minimise the one or more sidelobe levels at boresight. In an embodiment of the present invention, the method further includes 25 applying a second weighting factor to the determination of the set of separation distances to reduce the number of missing spatial lags in the sparse MIMO virtual antenna array, when the beam is pointed at an angle of 60 degrees off boresight. In an embodiment of the present invention, the method further includes determining the set of separation distances among the plurality of sparse antenna elements based on mapping of the positions of a plurality of transmit elements and the positions of a plurality of receive elements of the 5 sparse MIMO virtual antenna array, and each possible virtual array layout of the MIMO array. In an embodiment of the present invention, the setting the first optimization target comprises selecting positive and negative angles of nearest local minima from the boresight of the ULA, as first optimization angle boundaries 10 for the virtual array element positions of the MIMO sparse array; and setting the maximum signal level of the array factor at all angles outside of the region between the first optimization angle boundaries as the first optimization target. In an embodiment of the present invention, the setting the second 15 optimization target comprises selecting positive and negative angles of nearest local minima around main beam peak when the beam is pointed at an edge of the field of view, as second optimization angle boundaries for the virtual array element positions of the MIMO sparse array; and setting the maximum signal level of the array factor at all angles outside of the 20 region between the second optimization angle boundaries as the second optimization target. In an embodiment of the present invention, the normalised beamwidth of the main lobe of the array factor for the sparse MIMO antenna array is identical to that of the ULA having the same aperture size. 25 In another aspect of the present invention, there is provided a system for designing a sparse MIMO virtual antenna array. The system includes a memory to store one or more instructions; and a processor to execute the one or more instructions to: determine a size of an equivalent uniform linear array (ULA) based on a target number of sparse elements of the sparse 30 MIMO virtual antenna array; set a first optimization target as the maximum signal level of one or more sidelobes of the ULA, when the beam is pointed at a boresight; set a second optimization target as the maximum signal level of one or more sidelobes of the ULA, when the beam is pointed at an edge of the field of view; determine a set of separation distances among the 5 antenna array elements of the sparse MIMO virtual antenna array, that simultaneously minimises the first and second optimised targets, or minimises a combined sum of the first and second optimisation targets, wherein the minimising the first optimisation target minimises highest radiated power of one or more sidelobes, and the minimising the second 10 optimisation target minimises one or more missing spatial lags of the sparse MIMO virtual antenna array; and build the sparse MIMO virtual antenna array based on the determined set of separation distances. Various embodiments of the present invention disclose designing of sparse 15 arrays with low sidelobe levels, while keeping the number of missing lags in the array – or holes in the difference array – at a minimum. As a result, the direction of arrival (DOA) in such arrays can be found with lower computational cost and at a high resolution. Furthermore, the method can be used to design full virtual MIMO arrays and is therefore particularly 20 applicable for high performance radar applications at low cost, by performing a compromise between the brute-force optimization techniques and DSP techniques. The sparse array design of the present invention makes full use of all virtual 25 elements in a MIMO radar sparse array. Reduction of array factor sidelobes in the sparse array antenna design reduces false detections in a radar system. The sparse array design has an increased radar processing speed compared to that required for a radar with a similar angular resolution implemented by an equivalent ULA due to the reduced number of channels. 30 Furthermore, the sparse array design has a reduced DSP complexity in sparse array decoding due to the reduced number of holes in the array, and lower sidelobe levels. The present approach for designing sparse MIMO antenna array optimises 5 for main lobe width (MLW) which is directly proportional to the aperture size, the sidelobe level (SLL), the field-of-view (FOV) and the number of missing lags simultaneously, unlike the prior art methods, which do not consider the main lobe beam width, or aperture size and the sidelobe levels, which means that incorrect points may be detected on a sidelobe. 10 BRIEF DESCRIPTION OF DRAWINGS The present invention will be more clearly understood from the following 15 description of embodiments thereof, given by way of example only, with reference to the accompanying drawings, in which:- FIG.1 shows prior art of a conventional radar system comprising a single transmit antenna (TX) and a receive antenna (RX) array configured as 20 an 8 element ULA and its equivalent MIMO configuration achieved using 2 transmit antennas and 4 receive antennas; FIG.2 shows a 7-element ULA and its equivalent 4-element sparse array in MRA and MHA configurations; 25 FIG.3 shows the principal difference for sparse arrays designed as an MRA and an MHA; FIG.4 shows an example of the various types of nested sparse array 30 designs; FIG.5 shows an example of a co-prime sparse array design; FIG.6 shows the predicted array factor for 12-element arrays based on 5 design philosophies of ULAs, MRAs, MHAs, Co-Primes, Nested and Triply Nested arrays; FIG.7 shows the trend lines for sparse array sizes compared to their equivalent ULA size; 10 FIG.8 shows a typical example of a MIMO virtual array from 2 x TX antennas and 4 x RX antennas; FIG.9 shows an 8-element minimum redundancy array and one potential 15 mapped MIMO virtual array to partially approximate it using 2 transmit elements and 4 receive elements; FIG.10 is a flowchart illustrating a method for forming a sparse array antenna, in accordance with an embodiment of the present invention; 20 FIG.11 shows the optimisation regions used in the current invention for the first and second optimisation problems of the method of FIG.10; FIG.12 shows the layout for 8-element sparse array with MIMO mapping 25 when compared to a traditional 8-element MRA; FIG.13 compares the prior art array factor for an unmapped MHA layout and the MIMO mapped layout shown in FIG.12, developed using the current invention; 30 FIG.14 shows the spatial lag chart for an MRA, MIMO array shown in FIG.12 and the example of a MIMO array optimised only at boresight; and 5 FIG.15 shows the effect on sidelobes for beams scanned off-boresight when consideration is not given to the radiation pattern at the edge of the FOV during optimisation. DETAILED DESCRIPTION OF THE DRAWINGS 10 It has been previously stated that when a high angular resolution is required in radar systems, a narrower beam is needed. To achieve this with or without the additional virtual element gains of a MIMO system, a larger antenna array with additional elements must be used. This means additional 15 transmitters (in the case of a MIMO system) and / or receivers (in the case of a MIMO or single TX system) would be required, resulting in an increase to the overall radar cost and size. To keep costs low however, sparse arrays are often used. 20 Based on FIG.1, it can be said that the shape of the radiation pattern / array factor is formed because a time delay would exist between the signals arriving at each element within the array. The main lobe, or global maximum, of the radiation pattern / array factor is formed along the spatial direction in which the signals add constructively (in phase) to produce a maximum. In 25 turn, this direction is dependent upon the angle that the signal either approaches the array (receive) or the phase delay between antenna elements (transmit). In a ULA, the separation between adjacent elements is the same, and typically the Nyquist sampling criterion is satisfied to prevent grating lobes from being formed in the radiation patter / array factor over the 30 desired field of regard. However, as the distance between elements in an equivalent sparse array is not identical, the beam pattern would change, and sidelobes, which as has been previously defined are regions of local maxima occurring off-boresight, where the signal level is significant, would increase. 5 The prior art mathematical prediction of the radiation pattern of an array is now discussed, where for a wavefront impinging on a ULA of receivers at an angle θ, with the receivers have a spacing of D, the wavefront travels an extra distance of (n-1) D sin(θ) to reach the nth element in the array compared to the 1stelement. This time delay gives rise to a progressive 10 phase delay across the entire array, of (n-1) Φ at the nth element. When the signal arrives at each element simultaneously, it will correspond to an angle of incidence of 0-degrees, or at boresight. It is typically true that, for a given element separation, the greater the number of elements in the array, the finer the beamwidth and consequently, the angular resolution that can be 15 achieved. Mathematically, this focusing effect of an array can be expressed as the array factor, which is the complex valued far-field radiation pattern of an array of isotropic radiators. The one-dimensional array factor for a ULA can 20 be expressed elegantly at each discrete angle θ using: where wn is the complex weighting (having an amplitude and phase) at the nth element in the array, and D is the element separation. Those familiar in the art will appreciate that for a ULA, the term D is usually a distance of half 25 a wavelength at the frequency of operation and is unchanged between elements, but that the equation can be re-written in terms of distances from the first element as: where D0is the distance of the first element to itself and is therefore 0. This equation can, in turn, be used to determine the array factor of a sparse array. To convert the array factor to decibels, a LOG function is used, so that: ^^ ^^ௗ^( ^^) = 20 ^^ ^^ ^^^^[^^ ^^(^^)]……………..(4) When the array factor is calculated using the element locations of a physical array and multiplied by the radiation pattern of a single physical antenna element in that array, the resulting radiation pattern provides a good approximation for the radiation pattern of the physical array (not including effects such as mutual coupling between elements in the physical array which may alter the pattern). In decibel form, the gain of the array is given by: ^^^(^^)= ^^ ^^ௗ^(^^)+ ^^ா(^^)……………(5) Where GE is the gain of a single element. The steering angle of the array can be controlled by varying the phase of the weighting term wn. Furthermore, by reducing the amplitude of the weighting term wnat specific elements, the array pattern can be shaped to reduce the signal level of the sidelobes, but this is a detriment to the overall antenna gain. It has been previously shown that prior art sparse arrays do not concurrently consider the size of sidelobes, the number of missing spatial lags or the MIMO array mapping conditions, whereas the present invention takes all these factors concurrently into account. As per FIG.7, there is no fixed rule for most prior art sparse array designs to determine the exact reduction in the number of elements that can be obtained from a reduced element sparse array relative to a typical ULA, where D is a half wavelength of the operating frequency. However, there are trends that can be followed for either minimum redundancy or the minimum number of holes, or missing spatial lags. The sparse array optimisation region typically lies between the minimum hole array – which 5 is the most extreme in terms of number of elements relative to array aperture size – and the ULA or ‘filled array’. By comparing this mapping to an equivalent ULA mapping, the increases in array aperture size is easily seen. Furthermore, as most analyses consider the removal of elements from a 10 ULA rather than the expansion of an array from a known number of elements to a larger uniform array, an equation had been developed based on these trends to give a first order approximation of this increase when element placement restrictions such as MIMO array mappings are applied: 15 ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^. ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ( ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^) ≈ 0.24, ^^ < 12 9, ^^ ≥ 12 ൠ ………..(6) where x is the number of sparse array elements. 20 By examining this equation further, it is seen to follow the trend given by prior art minimum redundancy array calculations when x < 12, and follow the trend given by minimum hole array calculations, where layout mapping restrictions have less effect, when x ≥ 12. These trends are plotted in FIG.7, 25 where most possible equivalent ULA sizes would occur in the shaded or optimisation region when the degrees of freedom of the invention’s calculations are reduced by enforcing element placement restrictions in the design. However, if element placement restrictions are not needed, such as the case when MIMO is not used, then the solution invariably follows the MHA trend, and the following equation can be used as a first approximation equivalent ULA size in the current invention. ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^. ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ( ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^) ≈ 0.9 ^^ଶ− 4 ^^ + 9 … . (7) where x remains the number of sparse array elements. Various embodiments of the present invention enable the calculations to either give values for the separation between the nthand (n+1)thelements, Dn, that are integer multiples of the unit separation distance D (which generally continues to be a half wavelength of the operating frequency), or be given freedom to find separation distances containing real numbers. When the former condition is set for the case where element placement restrictions are not needed (i.e., when equation 7 is followed), the prior art element placements positions for the equivalent MHA are ultimately found. It is well known in the field that most post-processing techniques prefer to keep an integer number of distances, D, between elements and so this condition is used here. This simplifies the array angle-of-arrival processing, which typically uses FFT-based techniques. In an embodiment of the present invention, the layout restrictions caused by MIMO mapping are considered, which is why the prior art co-prime and nested array techniques mentioned earlier were developed. In a MIMO radar, the mapped positions of the virtual elements produced by the nthTX and mthRX antenna pair in the MIMO are given by (x(m + (n-1)M), y(m + (n-1)M)) = (xn, yn) + (xm, ym), where M is the total number of RX antennas. By way of example, the MIMO configuration shown in FIGs. 1 and 8 shows that a combination of 2 x TX elements with a spacing of 4D and 4 x RX elements at a spacing of D results in a virtual ULA of 8 elements at a spacing of D. However, if all 8 virtual elements could be mapped into a sparse array, the resulting sparse array would have an aperture size equal to that of a ULA of 24 elements (according to equation 6). However, due to the virtual element positions being a sum of the TX and RX element positions for each TX-RX pair, the RX element spacings are repeated N times throughout the 5 virtual MIMO array, where N is the number of TX antennas in the MIMO, and it is impossible to place the TX and RX antenna elements so that a mapped / virtual MIMO array conforms to any previously reported sparse arrays of a similar equivalent size. 10 To explain this further, a minimum redundancy sparse array which also has an equivalent ULA size of 24 elements is now shown in FIG.9. Many prior art disclosures have discussed the development of these well-known sparse array types where the element positions have been frequently found using specific optimisation algorithms such as genetic optimisation which 15 assumes each sparse array element must lie somewhere within a smaller, predefined range. Such techniques are well known in the field, but it is clear and obvious that such an array cannot be formed, and such optimisation algorithms cannot be used in a MIMO virtual array configuration as the element spacings cannot be made to align when the virtual array is mapped. 20 FIG.9 shows this diagrammatically with the comparison between the MRA and a mapped MIMO arrangement using 2 x TX elements and 4 x RX elements, which is only able to position 5 out of the 8 elements correctly. 25 In such MIMO cases, co-prime arrays are often used to form the virtual sparse array since there are equations available to calculate element placements, but these have smaller apertures than other sparse array options (falling closer to the MRA trendline in FIG.7), so their effectiveness in improving angular resolution is also reduced. Furthermore, when such 30 prior art virtual arrays have been designed, their focus has been to concentrate only on spatial lag coverage or alternatively on reducing spatial lag redundancy, while sidelobe levels have only been given secondary consideration, if at all. In an embodiment of the present invention, both spatial lag coverage and 5 radiation pattern sidelobe levels have been considered by focusing on the calculated radiated pattern, for the main beam, at both boresight and simultaneously at the edge of the FOV, which is achieved by adding the correct phase to each weighting element wn and is a well-known technique to those familiar in the field, where the phase added at each element in the 10 same plane of the array is: degrees ………………………(8) and ^ is the angle where the edge of the FOV occurs. 15 Here, a solution is sought to minimise the array factor sidelobe levels and thereby the physical array radiation pattern, for both beam conditions by optimising the separation between the sparse elements and minimising any possible false detections that may be introduced by the sparse array at all angles within the FOV. 20 FIG.10 is a flowchart illustrating a method 1000 for forming a sparse array antenna, in accordance with an embodiment of the present invention. The method can be implemented by a processor that executes the one or more instructions stored in a memory. FIG.11 shows the optimisation regions 25 used in the current invention for the first and second optimisation problems of the method of FIG.10. At step 1010, a size of an equivalent uniform linear array (ULA) aperture is determined based on a target number of sparse elements, using the equation (5) and the separation distance D. The separation distance D is usually a half wavelength of the operating frequency. At step 1020, the positive and negative angles are chosen, from boresight, 5 of the nearest local minima (1101, 1102) of the array factor for this ULA, having equal phase applied to all elements and setting these as the first optimisation boundaries for the virtual array element positions of the sparse array. 10 At step 1030, a first optimisation target is set as the maximum signal level of the array factor at all angles outside of the region between these first optimisation boundaries, i.e. we want to minimise the level of side lobes within this angular range. This completes the definition of the first problem and essentially accounts for all optimisation regions 1104 and 1105 outside 15 the main lobe 1103. Then, a second problem for the condition with element phases added according to the separation distances from the first element in the sparse array (equation 7) is defined, with the main beam 1106 pointed at the edge 20 of the FOV (typically 60-degrees off boresight). In an embodiment of the present invention, the second optimisation problem may be fixed to solve the condition for the main beam pointed at 60-degrees off-boresight, to define the problem for the case when omnidirectional antenna elements are used. 25 For the second problem, at step 1040, the second optimisation boundaries for most practical antennas are set based on the nearest minimum 1107 of the array factor around the main beam peak when steered to this edge of the FOV, and the FOV angle (60-degrees off boresight in the example in 30 Fig. 11). However, when omnidirectional antenna elements are used the second optimisation boundaries are set based on both nearest minimums of the array factor around the main beam peak when steered to this edge of the FOV. The edge 1107 is chosen as the one occurring closer to boresight than the steered direction of the beam, which is usually steered in the positive angular direction from boresight, but which can be steered in the 5 negative direction without restriction or change to the described invention. In an embodiment of the present invention, there may be at least two optimisation targets. In an example, the optimisation targets may be at 0°, +60°and -60°. 10 At step 1050, a second optimisation target is set as the maximum signal level of the array factor, for the region 1108, at all angles outside of the second optimisation angle boundaries, i.e. as with the first optimisation target, the level of side lobes is minimised within this angular range. In an embodiment of the present invention, a weighting function may be applied 15 to this second optimisation target by multiplying it by a factor of k where a value of k = 4 is used in this invention. Any value for k can be employed and is arbitrarily chosen depending on the type of optimisation algorithm used. The value of k may be used without restriction or change to the described invention. In an embodiment of the present invention, a weighting function 20 may be applied to the first optimisation target, to give priority to the detections around boresight to lower down the sidelobe levels. At step 1060, the separation distances between the antenna array elements are optimised for both the first and second problems, with identical 25 distances linked (due to the MIMO virtual array mapping), for simultaneously minimising first and second optimisation targets or a sum of both the first and second optimisation targets. In an embodiment of the present invention, the optimisation goal is set to 30 find a minimum of this newly defined, combined optimisation target. Any type of optimisation algorithm can be used, but a Generalised Reduced Gradient type is used in this invention. A solution is found when either the global minimum is found for the combined problem or the sidelobe levels have been reduced to an acceptable level in both the first and second problems. By optimising the level of the array factor, the resulting sidelobes 5 from the sparse array are reduced. In another embodiment of the present invention, the radiation pattern may be optimized rather than the array factor, to help reduce the sidelobe levels as the optimiser concentrates on the angular region where the gain of the single antenna element is high. 10 In an embodiment of the present invention, a Generalized Reduced Gradient function is used to look at the gradient of a function, as the decision variables (or separation distances) change and it is determined that it has reached an optimum solution when the partial derivatives equal zero. By randomly varying the initial, or starting values, of the decision variables and 15 repeating the process, it is possible over time to ensure that the global minimum is found rather than a local minimum, which may happen to occur near the starting values. The invention is not reliant on any particular type of solver however, and others such as a gradient, random, simplex or Newton Raphson may be used. Furthermore, by focusing on the signal level 20 of the array factor, the resulting sidelobes from the sparse array are reduced, and by combining the problem for the main beam focused at boresight and at the edge of the FOV simultaneously, a solution is found that considers both the sidelobe level (primarily as a result of the boresight optimisation) and the spatial lags (primarily as a result of the edge of the 25 FOV scan angle optimisation). As the separation distances are linked during the process according to the designed MIMO mapped architecture and optimised for all possible separations in the virtual array configuration, all virtual elements can be 30 optimised allowing the virtual array size to be maximised, while reducing the number of missing spatial lags and array factor sidelobe levels. A further consequence of linking the mapped virtual element spacings (due to the MIMO architecture) means that the number of optimisation variables is reduced, and the design process becomes much quicker as a result relative to one that doesn’t operate on the mapped virtual element spacings. 5 By considering the previous example of the 8-element array in FIG.9, the invention is demonstrated by minimising the array factor outside the main beam, calculated from equation 4, with two beams computed simultaneously, focused on boresight and at 60-degrees (which is typically 10 the edge of the FOV for most planar antennas), while allowing the variables Dn to change. Due to the MIMO layout mapping, the degrees of freedom of the problem are reduced by setting D1 = D5, D2 = D6 and D3 = D7 with the restriction set that D1+ D2+ D3+ D4+ D5+ D6+ D7= 11.5 wavelengths (based on 24 elements at a 0.5 wavelength spacing, and found when x is 15 set to 8 in equation 7). The minimising of the array factor with two beams computer simultaneously focused on boresight and at 60 degrees reduces the number of missing lags which helps in the processing of the sparse array later. 20 FIG.12 shows a viable MIMO mapped array 1200, in accordance with an embodiment of the present invention. The array factors for the prior art 8- element MRA and the layout derived from the MIMO mapped array 1200 of this invention show similar sidelobe levels when compared in FIG.13. This MIMO mapped array 1200 has only 3 missing holes in the difference array, 25 FIG. 14, with lags of 17D, 18D and 20D absent, out of all possible 23 combinations (13%). This shows that, although some holes exist, the number of these is considerably reduced when compared to similar MIMO layouts optimised for low sidelobe levels using boresight only optimisation, and the invention can be considered as a type of minimum hole array with 30 a reduced aperture size. By comparing holes that appear in this invention to that of a prior art 8-element equivalent MHA, which has a similar although slightly larger array aperture, it is seen that over 17% of holes exist in the larger, prior art MHA where the first hole appears for lag 16D. This hole must be recovered by digital signal processing techniques such as Iterative Method with Adaptive Threshold (IMAT) or matrix completion, but must also 5 be based on one fewer spatial lags (1D to 15D) than for recovery of lag 17D for the described invention (1D to 16D). Similar results are seen to occur for larger sparse arrays. The MIMO mapped array 1200 has therefore been derived using a novel technique, which allows full control over MIMO virtual array layouts and has a performance similar to the equivalent prior art MRA, 10 which cannot be configured as a virtual array layout in a MIMO system. The MIMO mapped array 1200 of the present invention can be used in defense or warfare systems but is more specifically applicable for automotive applications where lower cost is a high priority. Although, the MIMO array 1200 is a single dimensional array, it would be apparent to one of ordinary 15 skill in the art, that the MIMO array 1200 may be used to form a rectangular array. It has been previously stated that by including the second optimisation problem where the beam is pointed at the edge of the FOV, the number of 20 holes is greatly reduced, which can be seen in the spatial lag chart of FIG.14. This is the main aspect of the current invention where, when the main lobe is pointed at the edge of the FOV, the optimiser is forced to reduce the magnitude of grating lobes. These are defined as radiation pattern lobes other than the main lobe, which occur when the inter-element spacing along 25 with added phases is sufficiently large to permit the in-phase addition of radiated fields in more than one direction, and can be ideally avoided provided that the equation remains valid, where λ is the wavelength of the operating frequency, d is the distance between elements and ^ is the angle of direction in radians). This, in turn means that the 30 sparse array element positions are restricted from having very large separations, and in turn means that the likelihood of the removal of spatial lags is greatly reduced. FIG.14 shows this effect by comparing lags for an MRA, the previously described MIMO array example and the example of a MIMO array optimised with only the first optimisation problem at boresight, 5 considered. The need for the second optimisation problem is further represented in FIG.15, where array factor plots at boresight and at the edge of the FOV (60-degrees) are compared. When optimisation is only considered at boresight, i.e., for the first 10 optimisation problem, the sidelobes are seen to be kept to a relatively low level for the boresight scan angle. However, when phase-delays are added between antenna elements in such a way that the main beam is scanned to 60-degrees, a large grating lobe is seen to exist which means, in addition to the DSP processing complexity of 12 missing spatial lags, that signals 15 arriving from objects near boresight could be interpreted as arriving from objects at 60-degrees (and vice-versa). Thus, by optimising the problem simultaneously for both the main beam focused on boresight and at the edge of the FOV, a solution is found that 20 considers both the sidelobe level (primarily as a result of the boresight optimisation) and the spatial lags (primarily as a result of the edge of the FOV scan angle optimisation). It is to be noted, that the sidelobe levels for a particular beam pointing angle can be reduced significantly if the optimisation problem is only considered for one condition, i.e., with the main 25 beam pointed at either boresight or at the edge of the FOV. However, this is to the detriment of the sidelobe levels when the main beam is scanned to other angles. In these instances, solutions which allow more holes in the difference array are found, and thus the DSP complexity is increased. 30 By forcing the transmit and receive array elements to be placed in accordance with the MIMO element mappings in the optimisation problem, and thereby the virtual array element placements, the overall virtual array is optimised for all possible configurations of transmit and receive element placements. The maximum number of possible virtual elements are also used, which allows the virtual array size to be maximised. Further, by linking 5 the array element spacings together in accordance with the MIMO element mappings, the number of variables optimised is reduced compared to that of a sparse array design with the same number of elements but with no constraints on the spacings between them, and the design process becomes much quicker. Furthermore, by maximising the size of the virtual 10 array, the equivalent ULA size is increased meaning that the angular accuracy and resolution are increased. In the specification the terms "comprise, comprises, comprised and comprising" or any variation thereof and the terms include, includes, 15 included and including" or any variation thereof are considered to be interchangeable, and they should all be afforded the widest possible interpretation and vice versa. The invention is not limited to the embodiments hereinbefore described but 20 may be varied in both construction and detail. 25 30
Claims
Claims:
1. A method for designing a sparse MIMO virtual antenna array, comprising: 5 determining a size of an equivalent uniform linear array (ULA) based on a target number of sparse elements of the sparse MIMO virtual antenna array; setting a first optimization target as the maximum signal level of one or more sidelobes of the ULA, when the beam is pointed at a boresight; 10 setting a second optimization target as the maximum signal level of one or more sidelobes of the ULA, when the beam is pointed at an edge of the field of view; determining a set of separation distances among the antenna array elements of the sparse MIMO virtual antenna array, that simultaneously 15 minimises the first and second optimised targets, or minimises a combined sum of the first and second optimisation targets, wherein the minimising the first optimisation target minimises highest radiated power of one or more sidelobes, and the minimising the second optimisation target minimises one or more missing spatial lags of the sparse MIMO virtual antenna array; and 20 building the sparse MIMO virtual antenna array based on the determined set of separation distances.
2. The method as claimed in claim 1, wherein: the pointing the beam at the edge of the field of view comprises pointing 25 the beam at an angle of 60 degrees off boresight.
3. The method as claimed in claim 1 further comprising:the pointing the beam at the edge of the field of view comprises pointing the beam at an angle of -60 degrees off boresight.
4. The method as claimed in any preceding claim, wherein the set of 5 separation distances include distances that are multiples of the unit separation distance, wherein the unit separation distance is equivalent to half wavelength of an operating frequency of the sparse MIMO virtual antenna array. 10 5. The method as claimed in any preceding claim, wherein an aperture size of the sparse MIMO virtual antenna array is based on an angular resolution and the number of target sparse elements of the sparse MIMO virtual antenna array, and wherein the aperture size is approximated from a size trend for a minimum redundancy array when the number of sparse 15 elements is less than 12.
6. The method as claimed in any preceding claim, wherein the aperture size of the sparse MIMO virtual antenna array is approximated from a size trend for a minimum hole array, when the number of sparse elements is 20 equal to or greater than 12.
7. The method as claimed in any preceding claim, further comprising applying a first weighting factor to the determination of the set of separation distances to minimise the one or more sidelobe levels at boresight. 25 8. The method as claimed in any preceding claim, further comprising applying a second weighting factor to the determination of the set of separation distances to reduce the number of missing spatial lags in thesparse MIMO virtual antenna array, when the beam is pointed at an angle of 60 degrees off boresight.
9. The method as claimed in any preceding claim further comprising , 5 determining the set of separation distances among the plurality of sparse antenna elements based on mapping of the positions of a plurality of transmit elements and the positions of a plurality of receive elements of the sparse MIMO virtual antenna array, and each possible virtual array layout of the MIMO array. 10 10. The method as claimed in claim 1, wherein the setting the first optimization target comprises: selecting positive and negative angles of nearest local minima from the boresight of the ULA, as first optimization angle boundaries for 15 the virtual array element positions of the MIMO sparse array; and setting the maximum signal level of the array factor at all angles outside of the region between the first optimization angle boundaries as the first optimization target.
11. The method as claimed in claim 1, wherein the setting the second 20 optimization target comprises: selecting positive and negative angles of nearest local minima around main beam peak when the beam is pointed at an edge of the field of view, as second optimization angle boundaries for the virtual array element positions of the MIMO sparse array; and 25 setting the maximum signal level of the array factor at all angles outside of the region between the second optimization angle boundaries as the second optimization target.
12. The method as claimed claim 1, wherein the normalised beamwidth of the main lobe of the array factor for the sparse MIMO antenna array is identical to that of the ULA having the same aperture size.
13. A system for designing a sparse MIMO virtual antenna array, 5 comprising: a memory to store one or more instructions; and a processor to execute the one or more instructions to: determine a size of an equivalent uniform linear array (ULA) based on a target number of sparse elements of the sparse MIMO 10 virtual antenna array; set a first optimization target as the maximum signal level of one or more sidelobes of the ULA, when the beam is pointed at a boresight; set a second optimization target as the maximum signal level 15 of one or more sidelobes of the ULA, when the beam is pointed at an edge of the field of view; determine a set of separation distances among the antenna array elements of the sparse MIMO virtual antenna array, that simultaneously minimises the first and second optimised targets, or 20 minimises a combined sum of the first and second optimisation targets, wherein the minimising the first optimisation target minimises highest radiated power of one or more sidelobes, and the minimising the second optimisation target minimises one or more missing spatial lags of the sparse MIMO virtual antenna array; and 25 build the sparse MIMO virtual antenna array based on the determined set of separation distances.