Visible to the public Orthogonal STBC Set Building and Physical Layer Security Application

TitleOrthogonal STBC Set Building and Physical Layer Security Application
Publication TypeConference Paper
Year of Publication2020
AuthorsCribbs, M., Romero, R., Ha, T.
Conference Name2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
KeywordsBER, Bit error rate, brute force decoding complexity, Buildings, coding theory, communication complexity, communications link, complex orthogonal space-time block code, compositionality, cryptography, Decoding, encodes data symbols, error statistics, Information theory, Metrics, Monte Carlo methods, Monte Carlo simulations, Network security, orthogonal codes, orthogonal STBC matrix, orthogonal STBC set building, Physical layer, physical layer security application, physical layer security., PLS, pubcrawl, resilience, Resiliency, security, Signal processing algorithms, space-time block code, space-time block codes, telecommunication security, transformation algorithms, Transforms, transmitting antennas, Wireless communication
AbstractGiven a selected complex orthogonal space-time block code (STBC), transformation algorithms are provided to build a set, S, of unique orthogonal STBCs with cardinality equal to \textbackslashtextbarS\textbackslashtextbar = 2r+c+k-1·r!·c!, where r, c, and k are the number of rows, columns, and data symbols in the STBC matrix, respectively. A communications link is discussed that encodes data symbols with a chosen STBC from the set known only to the transmitter and intended receiver as a means of providing physical layer security (PLS). Expected bit error rate (BER) and informationtheoretic results for an eavesdropper with a priori knowledge of the communications link parameters with the exception of the chosen STBC are presented. Monte Carlo simulations are provided to confirm the possible BER results expected when decoding the communications link with alternative STBCs from the set. Application of the transformation algorithms provided herein are shown to significantly increase the brute force decoding complexity of an eavesdropper compared to a related work in the literature.
DOI10.1109/SPAWC48557.2020.9154289
Citation Keycribbs_orthogonal_2020