IEEE/ICACT20220296 Slide.08        [Big Slide]       [YouTube] Oral Presentation
This is the structure of Rudin – Shapiro . The nth element of the Rudin-Shapiro sequence Sn is generated for n ¡Ã 0 by considering the binary representation of n, (bkbk-1¡¦b1b0)2 , and calculating the number of (11) digit blocks in the representation as 𝑟𝑛 = ¢²_(𝒊=𝟎)^(𝒌−𝟏)¢Æ(𝒃𝒊〖¡¤𝒃〗_(𝒊+𝟏) ) , then 𝒔_𝒏 𝒊𝒔 𝒆𝒒𝒖𝒂𝒍 𝒕𝒐 the parity of rn. In our Rudin-Shapiro sequence, we donated 1 with A and -1 with B and construct the structure for 0 ¡Â n ¡Â 21: AAABAABAAAABBBABAAABAB.

[Go to Next Slide]
Select Voice: