International Journal of Antennas and Propagation

Volume 2013 (2013), Article ID 323521, 9 pages

http://dx.doi.org/10.1155/2013/323521

## Minimum Redundancy MIMO Array Synthesis by means of Cyclic Difference Sets

School of Information Science and Engineering, Central South University, Changsha 410083, China

Received 18 February 2013; Accepted 14 August 2013

Academic Editor: Wenhua Chen

Copyright © 2013 Jian Dong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Antenna array synthesis is an important issue in MIMO radars. By judiciously designing antenna positions, one can create a very long virtual array steering vector with a small number of antennas and therefore achieve very high spatial resolution at a small cost. This paper presents a combinatorial methodology based on cyclic difference sets (CDSs) for minimum redundancy (MR) MIMO array synthesis which seeks to maximize the virtual array aperture for a given number of antennas. First, the key features of CDSs and the CDS-based MR-MIMO layouts are described. Then, the analytical expression of the maximum contiguous virtual array aperture is derived. Further, based on this expression, an enumerative shifting procedure is developed for identifying the optimal CDS-based MR-MIMO layout. Selected examples are analyzed to point out the computational effectiveness of the CDS-based MR-MIMO array synthesis.

#### 1. Introduction

Multiple-input multiple-output (MIMO) radars have drawn remarkable attention recently for high spatial resolution, reducing vulnerability and overcoming fading effect [1–7]. MIMO radars transmit orthogonal waveforms or noncoherent waveforms instead of transmitting coherent waveforms in traditional transmitter based radars. In the MIMO radar receiver, a matched filter bank is used to extract the orthogonal waveform components. There are two different kinds of MIMO radars using the noncoherent waveforms. The first is the statistical MIMO radars for increased spatial diversity [2, 3]. In this scenario, all antennas are far enough from each other so that they obtain echoes from different angles of target to combat target fades. The second is the co-located MIMO radars for a better spatial resolution [4–7]. In this scenario, the distances between transmitting antennas are small enough compared to the distance between the target and the radar station. Therefore, the target RCS is identical for all transmitting paths. The phase differences caused by different transmitting antennas along with the phase differences caused by different receiving antennas can form a new *virtual array *steering vector. With judiciously designed antenna positions, one can create a very long array steering vector with a small number of antennas. Thus, the spatial resolution can be dramatically increased at a small cost. In this paper, we focus on this second advantage.

In fact, the problem of how to properly arrange the transmitting and receiving (Tx/Rx) antenna elements in order to achieve the optimal spatial resolution has received considerable interests. As we all know, the uniform Tx/Rx arrays will lead to a uniform virtual array with a large amount of redundant spacings. Several thinned Tx/Rx array configurations were given by Forsythe and Bliss [1, 4] and Wang [7, 8] to reduce redundant spacings in the virtual array. A similar MIMO array design problem was considered in medical ultrasound imaging and direction of arrival estimation from the viewpoint of coarray [9, 10], and also several classes of thinned MIMO array configurations were presented. In [11], Chen and Vaidyanathan extended the minimum redundancy (MR) idea [12, 13] originally used in the field of radio astronomy and spectrum estimation to MIMO radars and formulated the MIMO array design as a problem of MR-MIMO array synthesis, which is to properly place Tx/Rx elements in order to make the contiguous aperture of the virtual array as large as possible.

The search of MR-MIMO arrays is difficult because the inverse mapping from difference coarray of the virtual array to Tx/Rx array configurations is analytically unknown. For a very small number of Tx/Rx elements, an exhaustive search [11] or a stochastic optimizer (e.g., genetic algorithms (GAs) and particle swarm optimization (PSO) [14]) is usually used. However, for a modest or large number of Tx/Rx elements, these algorithms do not seem feasible due to the exponentially explosive search space. Recently, some classes of analytical binary sequences, such as cyclic difference sets (CDSs) [15, 16] and almost difference sets (ADSs) [17–22], have been applied to antenna array pattern synthesis. The analytical methodologies present several potentials over other state-of-the-art approaches since they are not affected by convergence problems regardless of the array size; the array performances (e.g., peak sidelobe levels) are theoretically controlled or predicted for any aperture; these binary sequences may be an effective way to enhance global optimization methods. For MIMO applications, CDSs have been firstly exploited by the authors [23] to synthesize MR-MIMO arrays. In [23], we demonstrated that by placing the Tx/Rx elements at the CDS-derived locations, a virtual array with a large contiguous aperture can be synthesized using a very small number of Tx/Rx elements. However, considering the large amount of equivalent CDSs for the *cyclic shift* property, there exist a large number of different CDS-based MR-MIMO layouts with different virtual array apertures. So, a suitable procedure is needed for identifying the optimal CDS-based MR-MIMO layout. In this paper, following the developments of [23], we derive the analytical expression of the maximum contiguous virtual array aperture of CDS-based MR-MIMO layouts. Then, based on this, we develop an enumerative shifting procedure for identifying the optimal CDS-based MR-MIMO layout. This work can be considered as the complement and extension of the CDS-based MR-MIMO framework established in [23].

The rest of the paper is organized as follows. In Section 2, the problem of MR-MIMO array synthesis is mathematically formulated from the viewpoint of coarray. In Section 3, based on the key features of CDSs, the CDS-based MR-MIMO arrays are firstly presented. Then, based on the analytical expression of the maximum contiguous virtual array aperture, an enumerative shifting procedure is carefully described for identifying the optimal CDS-based MR-MIMO layout. In Section 4, representative numerical results are provided to illustrate the effectiveness of the MR-MIMO array synthesis by means of CDSs. Finally, Section 5 sums up the paper and presents conclusions.

#### 2. Problem Formulation of MR-MIMO Array Synthesis

Consider a colocated MIMO radar with an -element linear transmitting antenna array and an -element linear receiving antenna array. Let and denote the position of the th transmitting and the th receiving antennas normalized by unit spacing (usually half wavelength), respectively, where and . By transmitting orthogonal waveforms and extracting the waveforms in each receiving element with a set of matched filters, a virtual receiving array with antenna elements located at [1, 4] can be synthesized. Correspondingly, the difference coarray (i.e., the spacing set) of the virtual array can be expressed as

In MR-MIMO array design, the idea is to form a coarray which is minimally redundant in spacings, that is, a coarray that captures all of the spacings with a minimum number of Tx/Rx element pairs (ideally, each element of a nonredundant coarray involves only a single Tx/Rx element pair). The completeness of the coarray is required in order that a good point spread function (PSF) for imaging applications can be obtained [4, 9] or a covariance matrix can be estimated for direction of arrival estimation or adaptive beamforming [10, 13].

For a given total number of Tx/Rx elements, the MR-MIMO array design can be generalized as a multivariable constraint optimization problem [23] as follows: where the objective function is the largest contiguous aperture of the virtual array in MIMO radars; denotes the cardinality of the set ; the constraint function denotes the number of holes (i.e., missing spacings) in the coarray and can be computed by where is equal to 0 if belongs to and 1 otherwise.

The difficulty in solving this problem is that the inverse mapping from the difference coarray of the virtual array to Tx/Rx array configurations is analytically unknown. Usually, a numerical implementation described as follows is preferable. Given transmitting element number and receiving element number , an initial maximum aperture of the synthesized virtual array is chosen to determine whether the Tx/Rx elements can be placed at the proper locations so that all the required spacings of the coarray are present; that is, . If such Tx/Rx configurations are found, can be increased, and the procedure is repeated until grows too large. For such a numerical implementation, stochastic optimization techniques (e.g., PSO in [14]) seem good candidates because of their flexibility and generality. Usually, they allow to effectively explore the whole solution space and to figure out optimal MIMO array layout. However, it is very difficult to find a satisfactory solution after a nonnegligible number of iterations due to the exponentially explosive solution space, especially for modest or large MIMO array designs. Fortunately, the introduction of analytical binary sequences known as cyclic difference sets (CDSs) [23] presents a deterministic thinning methodology for MR-MIMO array synthesis. This CDS-based methodology can determine the analytical locations of Tx/Rx array elements and therefore is not affected by convergence problems regardless the array size. In this paper, starting from these CDS-derived MIMO layouts, the maximum contiguous virtual array aperture will be theoretically derived for any given number of Tx/Rx antennas. With this analytical expression of , the optimization problem in (3) can be greatly simplified. Then, the identifying of the optimal MR-MIMO layout will be limited to an enumerative shifting of reference sequences available in Web repositories [24].

#### 3. Minimum Redundancy MIMO Array Synthesis by means of Cyclic Difference Sets

##### 3.1. CDS-Based MR-MIMO Array

CDSs are combinatorial methods initially investigated in combinatorial mathematics and information theory [25, 26] and later applied to antenna array optimization [15, 16, 23]. A CDS is a set of integers [25, 26]
such that any integer () can be represented exactly times in the form , where “” means the difference is to be taken modulo . The parameters of any CDS are connected by
and so there are only two independent parameters among , , and . Given a CDS , the set
where each element is taken modulo , will also be a difference set. In this case, is called a *cyclic shift* of . If and are two difference sets with the same parameters and for any integers and with prime to , then and are called *equivalent* difference sets.

In [23], we demonstrated that by placing the Tx/Rx elements at the CDS-derived locations, a very large virtual array can be synthesized with a small number of Tx/Rx elements. The CDS-based MR-MIMO arrays are constructed as follows: where is a CDS with the parameters , ; is specified; is specified to ensure that the synthesized contiguous aperture is as large as possible; is a difference basis for a segment, ; is specified. A difference basis for the segment is a set of integers [27, 28]: such that any integer from this segment can be expressed as a difference . In fact, an -element difference basis corresponds to an -element minimum redundancy linear array in the transmitting only or receiving only scenario.

##### 3.2. Analytical Expression of the Maximum Contiguous Aperture of Virtual Array

From (1), (8), and (9), the synthesized virtual array determined by the CDS-based approach can be expressed as

Note that the uniformity of its difference coarray (i.e., the constraint ) is naturally guaranteed by the definitions of both CDSs and difference bases [23]. Now, we will derive the maximum contiguous aperture of , that is, looking for a maximum value of such that every integer () can be expressed as the difference between two integers and of the set .

To show this, we put , where and . If is expressible as , we choose , such that ; then, If, however, is expressible as , we choose , such that ; then Also if , Thus the maximum contiguous aperture can reach , and the set is a difference basis with respect to .

In the set (8) we observe that no integer such that is expressible in the form , where and are the largest element and the smallest element, respectively. Consequently the integers are expressible in the form . Choosing , such that , we express the integers as differences between pairs of integers of the set . Therefore, the maximum contiguous aperture of the virtual array is determined by

##### 3.3. Optimal MR-MIMO Array by Enumerative Shifting Procedure

Considering the large amount of equivalent CDSs for the *cyclic shift* property, there are always a large number of different CDS-based MIMO layouts with different virtual array apertures even for a given number of Tx/Rx antennas. Expression (17) indicates that the optimal MR-MIMO layout with the maximum will be achieved by selecting the CDS with the minimum value of . Towards this end, the problem of identifying the optimal MR-MIMO layout among all existing CDS-based layouts for a given number of Tx/Rx antennas is recast as an optimization one where the fitness function to be minimized is defined as follows:
where
with and being the largest element and the smallest element of a cyclic difference set , respectively. Obviously, by deriving the analytical expression of the maximum contiguous virtual array aperture , the solving of MR-MIMO array problem in (3) has been simplified as identifying the optimal CDS with minimum fitness .

Inspired by the discrete nature of the descriptors of the CDSs, an enumerative shifting procedure for searching optimal MR-MIMO layout is developed as follows.

(i) CDS selection and initialization: given transmitting antenna number , select a -CDS from the CDS Web repositories [24] as the initial CDS (where is specified) as follows: Set (usually, is specified in the initial CDS).

(ii) CDS cyclic shift: by exploiting the cyclic shift property, enumerate the -shifted version of the initial CDS and let where means modulo operation. Clearly, all these sets are the equivalent sets of the initial CDS.

(iii) Update the fitness: evaluate , where and are the largest element and the smallest element in the -shifted CDS , respectively. If , then update , , and .

(iv) Convergence check: if , then return and terminate; else continue.

(v) Update: update the shift indexes (i.e., ) to generate a new CDS sequence (i.e., a new cyclic shifted version of the reference CDS chosen in (i)) and go to (ii).

It is worth to notice that such a numerical procedure is very simple and computationally efficient since just up to evaluations are required for an MIMO array.

#### 4. Numerical Analysis

The potentialities of the CDS-based MR-MIMO array synthesis are assessed through a set of numerical experiments aimed at completing and extending the validations presented in [23]. Since the CDS-based planar MR-MIMO array can be easily generated by “multiplying” two orthogonal CDS-based linear MR-MIMO arrays [23], the following numerical studies will be focused on the linear MR-MIMO array synthesis.

The first test case refers to a half wavelength MIMO radar array with an eight-element linear transmitting array () and a four-element linear receiving array (). The synthesis of an MR-MIMO array is equal to the synthesis of a 32-element minimum redundancy virtual array in terms of . In the CDS-based approach, the MIMO arrays are constructed as follows: where is a CDS obtained from the Web repositories [24]; is a 4-element difference basis for a segment (i.e., ). The difference bases for any always exist with respect to and can be obtained in [28, 29].

Figure 1 shows the behavior of the contiguous virtual array aperture as a function of the shifted number by exploiting the CDS-based enumerative shifting procedure. The figure indicates that optimal MR-MIMO layout in terms of may not be unique. Figures 2(a) and 2(b) show the initial CDS-based MR-MIMO layout () and the resulting virtual array as well as its coarray, respectively. Figures 2(c) and 2(d) show the optimal MR-MIMO layout () obtained by the enumerative shifting procedure and the resulting virtual array as well as its coarray, respectively. It is worthwhile to observe that the overall length of the virtual array always exceeds , meaning that several elements of the virtual array are outside the segment. This additional resolution afforded by the excessive overall length might be welcome in some applications, even though the spacing coverage is incomplete above .

Further, in order to show computation efficiency of our CDS-based approach, other MR-MIMO array designs obtained by stochastic optimization methods are also investigated. For MR-MIMO array synthesis problem, the total size of the search space is determined by
where is the number of combinations of items taken at a time; and are specified, respectively. Obviously, the size of the search space will exponentially increase with the specified virtual array aperture . Therefore, it is difficult for stochastic optimization methods to find a satisfactory solution (i.e., MR-MIMO array with a large value of ) after a nonnegligible number of iterations. As an example, Figure 3 shows the convergence rate of the PSO-based search when finding an MR-MIMO solution with (where the size of the search space is of the order of 10^{20} according to (23)). Note that, except for the need of a large number of iterations (because of the rigorous terminal condition ), the fitness (i.e., ) computation for each individual at each iteration is time consuming. However, only less than evaluations are required for identifying an optimal MR-MIMO layout in the CDS-based enumerative shifting procedure. Moreover, the fitness computation in this procedure is very simple and requires nearly zero computation time. For summary, different MR-MIMO layouts and their characteristics, such as the maximum contiguous aperture *L*, the angle resolution (), and redundancy of the coarray ( [23]), are listed in Table 1. The comparisons show that by minimizing redundancies in the coarray, the optimized CDS-based MR-MIMO layout has achieved the largest virtual array aperture, meaning that it has the highest spatial resolution and also the largest number of available spatial degrees of freedom [8].

The second test case refers to a half wavelength () MIMO radar array with a twenty-element linear transmitting array () and a ten-element linear receiving array () in order to validate the large MR-MIMO array synthesis by means of CDSs. The synthesis of a MR-MIMO array is equal to the synthesis of a 200-element minimum redundancy virtual array in terms of . In the CDS-based approach, the MIMO arrays are constructed as follows:
where is a CDS obtained from the Web repositories [24]; is a 10-element difference basis for a segment (i.e., ). Figure 4 shows the behavior of the contiguous virtual array aperture as a function of the shifted number by exploiting the CDS-based enumerative shifting procedure. Figures 5(a) and 5(b) show the initial CDS-based MR-MIMO layout () and the resulting virtual array as well as its coarray. Figures 5(c) and 5(d) show the optimal MR-MIMO layout () obtained by the enumerative shifting procedure and the resulting virtual array as well as its coarray, respectively. More specifically, both CDS-based MR-MIMO layouts and their characteristics, such as the maximum contiguous aperture , the angle resolution , and redundancy of the coarray , are listed in Table 2. Note that, in this test case, an exhaustive search or a stochastic optimizer barely seems powerless for finding MR-MIMO arrays within a reasonable time due to the extremely huge search space (e.g., given , the size of the search space will be of the order 10^{89} according to (23)) and the rigorous constraint function. However, only less than 8000 evaluations are required for identifying an optimal MR-MIMO layout in the CDS-based enumerative shifting procedure. Moreover, the fitness computation in this procedure takes nearly zero computation time. In conclusion, the CDS-based enumerative shifting procedure is computationally efficient, and its advantage in optimization efficiency will become more significant with the increased scale of MR-MIMO array synthesis.

#### 5. Conclusion and Discussion

As a kind of deterministic thinning methodologies, the CDS-based approach presents several potentials over stochastic optimizers (e.g., GAs and PSO) or trial-and-test random techniques such as the computational efficiency and the predictable array performances (e.g., virtual array aperture) thanks to the analytical features of the arising CDS-based MIMO arrays. To identify the optimal MR-MIMO layout, a numerically efficient procedure has been developed in this paper, which is limited to an enumerative shifting of reference sequences available in Web repositories. Selected examples have been analyzed to point out the computational effectiveness of the CDS-based MR-MIMO array synthesis.

Further studies could be expected from the following aspects.(1)Other analytical sequences (e.g., ADSs, Hadamard Difference Sets [30], and McFarland difference sets [31]) with attractive features (e.g., low-level autocorrelation and cyclic shifting) could be investigated to verify their advantages and potentialities for MIMO array designs. Indeed, it has been recently shown that likewise CDS placements, but in a theoretically wider admissible set of configurations, ADSs can be profitably exploited to maximize channel capacity in MIMO communication applications [32].(2)The integration of analytical sequences and global optimizers for improved exploration efficiency is still a work in progress.

#### Acknowledgments

This work was supported in part by the National Science Foundation of China under Grant no. NSFC61201086, the Doctoral Fund of the Ministry of Education of China under Grant no. 20110162120044, and the China Postdoctoral Science Foundation under Grant no. 2012T50660.

#### References

- K. W. Forsythe, D. W. Bliss, and G. S. Fawcett, “Multiple-input multiple-output (MIMO) radar: performance issues,” in
*Proceedings of the 38th Asilomar Conference on Signals, Systems and Computers*, pp. 310–315, November 2004. View at Scopus - E. Fishler, A. Haimovich, R. Blum, L. Cimini, D. Chizhik, and R. Valenzuela, “Performance of MIMO radar systems: advantages of angular diversity,” in
*Proceedings of the 38th Asilomar Conference on Signals, Systems and Computers*, pp. 305–309, November 2004. View at Scopus - E. Fishler, A. Haimovich, R. S. Blum, L. J. Cimini Jr., D. Chizhik, and R. A. Valenzuela, “Spatial diversity in radars—models and detection performance,”
*IEEE Transactions on Signal Processing*, vol. 54, no. 3, pp. 823–838, 2006. View at Publisher · View at Google Scholar · View at Scopus - D. W. Bliss and K. W. Forsythe, “Multiple-input multiple-output (MIMO) radar and imaging: degrees of freedom and resolution,” in
*Proceedings of the 37th Asilomar Conference on Signals, Systems and Computers*, pp. 54–59, November 2003. View at Scopus - C.-Y. Chen and P. P. Vaidyanathan, “MIMO radar space-time adaptive processing using prolate spheroidal wave functions,”
*IEEE Transactions on Signal Processing*, vol. 56, no. 2, pp. 623–635, 2008. View at Publisher · View at Google Scholar · View at Scopus - Y. Qu, G. S. Liao, S. Q. Zhu, X. Y. Liu, and H. Jiang, “Performance analysis of beamforming for MIMO radar,”
*Progress in Electromagnetics Research*, vol. 84, no. 2, pp. 123–134, 2008. View at Google Scholar · View at Scopus - W.-Q. Wang, “Virtual antenna array analysis for MIMO synthetic aperture radars,”
*International Journal of Antennas and Propagation*, vol. 2012, Article ID 587276, 10 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus - W.-Q. Wang, H. Shao, and J. Cai, “MIMO antenna array design with polynomial factorization,”
*International Journal of Antennas and Propagation*, vol. 2013, 9 pages, 2013. View at Publisher · View at Google Scholar - M. Karaman, I. O. Wygant, Ö. Oralkan, and B. T. Khuri-Yakub, “Minimally redundant 2-D array designs for 3-D medical ultrasound imaging,”
*IEEE Transactions on Medical Imaging*, vol. 28, no. 7, pp. 1051–1061, 2009. View at Publisher · View at Google Scholar · View at Scopus - P. Pal and P. P. Vaidyanathan, “Nested arrays: a novel approach to array processing with enhanced degrees of freedom,”
*IEEE Transactions on Signal Processing*, vol. 58, no. 8, pp. 4167–4181, 2010. View at Publisher · View at Google Scholar · View at Scopus - C.-Y. Chen and P. P. Vaidyanathan, “Minimum redundancy MIMO radars,” in
*Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS '08)*, pp. 45–48, May 2008. View at Publisher · View at Google Scholar · View at Scopus - A. T. Moffet, “Minimum-redundancy linear arrays,”
*IEEE Transactions on Antennas and Propagation*, vol. 16, pp. 172–175, 1968. View at Google Scholar - S. U. Pillai, Y. Bar-Ness, and F. Haber, “A new approach to array geometry for improved spatial spectrum estimation,”
*Proceedings of the IEEE*, vol. 73, no. 10, pp. 1522–1524, 1985. View at Publisher · View at Google Scholar · View at Scopus - K. Rezer, W. Gropengießer, and A. F. Jacob, “Particle swarm optimization of minimum-redundancy MIMO arrays,” in
*Proceedings of the German Microwave Conference (GeMiC '11)*, March 2011. View at Scopus - D. G. Leeper, “Isophoric arrays—massively thinned phased arrays with well-controlled sidelobes,”
*IEEE Transactions on Antennas and Propagation*, vol. 47, no. 12, pp. 1825–1835, 1999. View at Publisher · View at Google Scholar · View at Scopus - S. Caorsi, A. Lommi, A. Massa, and M. Pastorino, “Peak sidelobe level reduction with a hybrid approach based on GAs and difference sets,”
*IEEE Transactions on Antennas and Propagation*, vol. 52, no. 4, pp. 1116–1121, 2004. View at Publisher · View at Google Scholar · View at Scopus - G. Oliveri, M. Donelli, and A. Massa, “Linear array thinning exploiting almost difference sets,”
*IEEE Transactions on Antennas and Propagation*, vol. 57, no. 12, pp. 3800–3812, 2009. View at Publisher · View at Google Scholar · View at Scopus - G. Oliveri, L. Manica, and A. Massa, “ADS-based guidelines for thinned planar arrays,”
*IEEE Transactions on Antennas and Propagation*, vol. 58, no. 6, pp. 1935–1948, 2010. View at Publisher · View at Google Scholar · View at Scopus - G. Oliveri and A. Massa, “Fully interleaved linear arrays with predictable sidelobes based on almost difference sets,”
*IET Radar, Sonar and Navigation*, vol. 4, no. 5, pp. 649–661, 2010. View at Publisher · View at Google Scholar · View at Scopus - G. Oliveri and A. Massa, “Genetic algorithm (GA)-enhanced almost difference set (ADS)-based approach for array thinning,”
*IET Microwaves, Antennas and Propagation*, vol. 5, no. 3, pp. 305–315, 2011. View at Publisher · View at Google Scholar · View at Scopus - G. Oliveri, F. Caramanica, and A. Massa, “Hybrid ADS-based techniques for radio astronomy array design,”
*IEEE Transactions on Antennas and Propagation*, vol. 59, no. 6, pp. 1817–1827, 2011. View at Publisher · View at Google Scholar · View at Scopus - M. Carlin, G. Oliveri, and A. Massa, “On the robustness to element failures of linear ADS-thinned arrays,”
*IEEE Transactions on Antennas and Propagation*, vol. 59, no. 12, pp. 4849–4853, 2011. View at Publisher · View at Google Scholar · View at Scopus - J. Dong, Q. Li, and W. Guo, “A combinatorial method for antenna array design in minimum redundancy MIMO radars,”
*IEEE Antennas and Wireless Propagation Letters*, vol. 8, pp. 1150–1153, 2009. View at Publisher · View at Google Scholar · View at Scopus - La Jolla Cyclic Difference Set Repository, http://www.ccrwest.org/diffsets.html.
- L. D. Baumert,
*Cyclic Difference Sets*, Springer, New York, NY, USA, 1971. - M. Hall Jr,
*Combinatorial Theory*, Wiley, New York, NY, USA, 2nd edition, 1986. - J. Leech, “On the representation of 1, 2, ...,
*n*by differences,”*Journal London Mathematical Society*, vol. 31, pp. 160–169, 1956. View at Google Scholar - D. A. Linebarger, I. H. Sudborough, and I. G. Tollis, “Difference bases and sparse sensor arrays,”
*IEEE Transactions on Information Theory*, vol. 39, no. 2, pp. 716–721, 1993. View at Publisher · View at Google Scholar · View at Scopus - J. Dong, Q. Li, R. Jin, Y. Zhu, Q. Huang, and L. Gui, “A method for seeking low-redundancy large linear arrays in aperture synthesis microwave radiometers,”
*IEEE Transactions on Antennas and Propagation*, vol. 58, no. 6, pp. 1913–1921, 2010. View at Publisher · View at Google Scholar · View at Scopus - L. E. Kopilovich, “Square array antennas based on Hadamard difference sets,”
*IEEE Transactions on Antennas and Propagation*, vol. 56, no. 1, pp. 263–266, 2008. View at Publisher · View at Google Scholar · View at Scopus - G. Oliveri, F. Caramanica, C. Fontanari, and A. Massa, “Rectangular thinned arrays based on McFarland difference sets,”
*IEEE Transactions on Antennas and Propagation*, vol. 59, no. 5, pp. 1546–1552, 2011. View at Publisher · View at Google Scholar · View at Scopus - G. Oliveri, F. Caramanica, M. D. Migliore, and A. Massa, “Synthesis of non-uniform MIMO arrays through combinatorial sets,”
*IEEE Antennas and Wireless Propagation Letters*, vol. 11, pp. 728–731, 2012. View at Publisher · View at Google Scholar