S
Sarah Spence Adams
Researcher at Franklin W. Olin College of Engineering
Publications - 28
Citations - 325
Sarah Spence Adams is an academic researcher from Franklin W. Olin College of Engineering. The author has contributed to research in topics: Quaternion & Block code. The author has an hindex of 10, co-authored 28 publications receiving 312 citations.
Papers
More filters
Journal ArticleDOI
The Theory of Quaternion Orthogonal Designs
Jennifer Seberry,Kenneth Finlayson,Sarah Spence Adams,Tadeusz A. Wysocki,Tianbing Xia,Beata J. Wysocki +5 more
TL;DR: This paper builds a theory of these novel quaternion orthogonal designs, offers examples, and provides several construction techniques to lay the foundation for developing applications of these designs as Orthogonal space-time-polarization block codes.
Journal ArticleDOI
The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes
TL;DR: A tight lower bound on the decoding delay for maximum rate codes is shown, which is used to provide evidence that when the number of antennas is congruent to 2 modulo 4, the best achievable decoding delay is 2(m-1 2m_).
Journal ArticleDOI
On an Orthogonal Space-Time-Polarization Block Code
TL;DR: An efficient method for incorporating polarization diversity with space and time diversity is studied, based on extending orthogonal space-time block codes into the quaternion domain and utilizing a description of the dual-polarized signal by means of quaternions.
Journal ArticleDOI
The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs
TL;DR: The final case is addressed, and it is shown that when the number of columns is congruent to 2 modulo 4, the lower bound on decoding delay cannot be achieved and the shortest decoding delay a maximum rate COD can achieve is twice the lowerbound.
Journal ArticleDOI
Dynamic monopolies and feedback vertex sets in hexagonal grids
TL;DR: It is shown that dynamic monopolies and feedback vertex sets are equivalent in graphs wherein all vertices have degree 2 or 3, and this equivalence is used to provide exact values for the minimum size ofynamic monopolies of planar hexagonal grids, as well as upper and lower bounds on the minimum sizes of dynamic monopolie of cylindrical and toroidal hexagonal grid.