DocumentCode
3036103
Title
Optimizing the common-randomness secret key rate in beamformed communication systems
Author
Quist, B.T. ; Jensen, Michael A.
Author_Institution
Brigham Young Univ., Provo, UT, USA
fYear
2012
fDate
11-16 Nov. 2012
Firstpage
1
Lastpage
4
Abstract
Generating key bits with multiple antenna systems has the potential to dramatically increase the rate at which key bits can be generated. For beamforming systems, this work considers how to probe the channel to maximize the mutual information between channel estimates. For these systems, we provide an optimal probing strategy that uses the eigenvectors of the channel correlation matrix as probing vectors and then optimally allocates the transmission energy to each vector. Since this strategy cannot be implemented in practice, we also propose a practical channel estimation scheme that achieves near-optimal performance. Simulations demonstrate the performance advantage of the proposed strategy relative to that achieved using traditional channel estimation in which the total energy is equally allocated to all probing vectors.
Keywords
antennas; array signal processing; channel estimation; correlation methods; cryptography; matrix algebra; vectors; beamformed communication systems; beamforming systems; channel correlation matrix; channel estimates; channel estimation scheme; common-randomness secret key rate; eigenvectors; key bits generation; multiple antenna systems; mutual information; near-optimal performance; optimal probing strategy; probing vectors; transmission energy; Arrays; Channel estimation; Communication system security; Covariance matrix; Eigenvalues and eigenfunctions; Resource management; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Information Technology and Systems (ICWITS), 2012 IEEE International Conference on
Conference_Location
Maui, HI
Print_ISBN
978-1-4673-0947-9
Type
conf
DOI
10.1109/ICWITS.2012.6417769
Filename
6417769
Link To Document