Reconfigurable Intelligent surface (RIS) has emerged as a candidate technology for enhancing coverage in millimeter wave wireless networks at a lower energy and cost footprint. RIS has several antenna elements that can each be configured to reflect impinging electromagnetic waves after imparting a chosen phase shift with possibly some amplitude attenuation (a.k.a. chosen reflection coefficient). Over the canonical RIS-enabled communications scenario, an optimal choice of reflection coefficients (or optimal RIS pattern) can be efficiently determined for an ideal unit-amplitude unconstrained phase alphabet. However, for most practical RIS that entail finite alphabets with amplitude imbalance and per-group-of-elements control, efficiently determining optimal patterns remain open problems. In this paper we resolve two such open problems by designing optimal and efficient pattern determination algorithms for binary and quaternary alphabets. We show that our algorithms can noticeably improve over the state-of-art conventional heuristic, especially in the presence of high amplitude imbalance and more restrictive per-group control. The designed algorithms also yield companion sets, which we show offer very significant advantages in RIS pattern selection under interference limit (leakage suppression) constraints.

This work introduces the enhanced reverse link in Revision D of IS-2000, which is also known as cdma2000 1/spl times/EV-DV. The goals and considerations of the design process are discussed. Design alternatives, choices, and trade-offs are then presented. Finally, the overall operation of the system is examined.

In a previous paper, No, Golomb, Gong, Lee and Gaal (see ibid., vol.44, p.814-17, 1998) conjectured that certain binary sequences having a simple trace description possess the ideal autocorrelation property. In the present paper it is shown that each such sequence is balanced and, moreover, that the dual of the linear cyclic code generated by the sequence and its cyclic shifts, is a triple-error correcting code having the same weight distribution as the triple-error correcting Bose-Chaudhuri-Hocquenghem (BCH) code. This cyclic code also contains a cyclic subcode that yields a new family of sequences having the same size and correlation parameters as does the family of Gold sequences.

In this correspondence, we present five new classes of binary sequences of period 2/sup n/-1 with ideal autocorrelation. These sequences, which correspond to new cyclic Hadamard difference sets, were found by extensive computer search. Conjectures on the general construction of these sequences are formulated.