### Abstract

The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 less than i less than N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than N//M.

Original language | English (US) |
---|---|

Title of host publication | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |

Publisher | IEEE |

Pages | 2674-2677 |

Number of pages | 4 |

State | Published - 1988 |

### Fingerprint

### ASJC Scopus subject areas

- Signal Processing
- Electrical and Electronic Engineering
- Acoustics and Ultrasonics

### Cite this

*ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings*(pp. 2674-2677). IEEE.

**ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.** / Lee, Youngjik; Pillai, Unnikrishna.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings.*IEEE, pp. 2674-2677.

}

TY - GEN

T1 - ALGORITHM FOR OPTIMAL PLACEMENT OF SENSOR ELEMENTS.

AU - Lee, Youngjik

AU - Pillai, Unnikrishna

PY - 1988

Y1 - 1988

N2 - The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 less than i less than N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than N//M.

AB - The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 less than i less than N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than N//M.

UR - http://www.scopus.com/inward/record.url?scp=0023739243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023739243&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023739243

SP - 2674

EP - 2677

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

PB - IEEE

ER -