Fig. 1
From: A family of chaotic pure analog coding schemes based on baker’s map function
Partition and itinerary. a When N = 1, itinerary s has just 1 bit, +1 or −1 (left); for general N=n + 1, itinerary s has 2n patterns (right). Each specific pattern s j corresponds to one segment (cell) \(\protect \phantom {\dot {i}\!}C_{\mathbf {s}_{j}}\) of the feasible region. b The feasible region [−1,+1]2 is partitioned into 2N − 1 cells, with each cell \(\protect \phantom {\dot {i}\!}C_{\mathbf {s}_{j}}\) corresponding to one specific itinerary pattern s j . The parameters in the affine representation of the codewords and the endpoints of the cell can be determined once the itinerary s j is given