Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
ds2-notes
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Deploy
Releases
Model registry
Analyze
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
datovky
ds2-notes
Commits
bd3aaf80
Commit
bd3aaf80
authored
3 years ago
by
Filip Stedronsky
Browse files
Options
Downloads
Patches
Plain Diff
Succinct: fixup
parent
f261b9c3
Branches
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
fs-succinct/succinct.tex
+6
-6
6 additions, 6 deletions
fs-succinct/succinct.tex
with
6 additions
and
6 deletions
fs-succinct/succinct.tex
+
6
−
6
View file @
bd3aaf80
...
@@ -165,9 +165,7 @@ odd-numbered blocks have smaller alphabets than even-numbered ones. The second
...
@@ -165,9 +165,7 @@ odd-numbered blocks have smaller alphabets than even-numbered ones. The second
pass runs phase shifted by one block and converts the variable-alphabet blocks
pass runs phase shifted by one block and converts the variable-alphabet blocks
into blocks with alphabet
$
[
B
]
$
.
into blocks with alphabet
$
[
B
]
$
.
What is the redundancy of this scheme?
What is the redundancy of this scheme? Let us count how the number of blocks
Now we can finally analyze redundancy. Let us count how the number of blocks
increases throughout the encoding passes:
increases throughout the encoding passes:
\tightlist
{
o
}
\tightlist
{
o
}
\:
If the original length was a multiple of
$
b
$
, we must add one block to complete padding.
\:
If the original length was a multiple of
$
b
$
, we must add one block to complete padding.
...
@@ -215,9 +213,9 @@ from the alphabet $(B+1)^2$, output the alphabet $B^2$ and the part of the
...
@@ -215,9 +213,9 @@ from the alphabet $(B+1)^2$, output the alphabet $B^2$ and the part of the
information that did not fit into the output is passed as a
information that did not fit into the output is passed as a
``carry''
\foot
{
Sometimes the alternative term
{
\it
spill
}
is used instead.
}
to
``carry''
\foot
{
Sometimes the alternative term
{
\it
spill
}
is used instead.
}
to
the next encoding box (similarly to how carrying works when doing addition).
the next encoding box (similarly to how carrying works when doing addition).
See fig.
\figref
{
sole
_
boxes
}
.
See fig.
\figref
{
sole
_
boxes
}
.
We will also call these boxes
{
\it
mixers
}
.
\figure
[sole_boxes]
{
sole
_
boxes.pdf
}{}{
SOLE interpreted as a chain of
encoding bo
xes
}
\figure
[sole_boxes]
{
sole
_
boxes.pdf
}{}{
SOLE interpreted as a chain of
mi
xe
r
s
}
The start and end of the encoding are irregular, but we will ignore that for now.
The start and end of the encoding are irregular, but we will ignore that for now.
An important property of these boxes is that outgoing carry does not depend on incoming
An important property of these boxes is that outgoing carry does not depend on incoming
...
@@ -225,7 +223,7 @@ carry (unlike in addition). This allows for local decoding and modification. Oth
...
@@ -225,7 +223,7 @@ carry (unlike in addition). This allows for local decoding and modification. Oth
a single input change could affect the whole output. Now we can describe this scheme
a single input change could affect the whole output. Now we can describe this scheme
in a more abstract, high-level way (fig.
\figref
{
sole
_
hilevel
}
).
in a more abstract, high-level way (fig.
\figref
{
sole
_
hilevel
}
).
\figure
[sole_hilevel]
{
sole
_
hilevel.pdf
}{}{
SOLE high-level
block
diagram
}
\figure
[sole_hilevel]
{
sole
_
hilevel.pdf
}{}{
SOLE high-level
mixer
diagram
}
In our case, the input alphabet size is always
$
(
B
+
1
)
^
2
$
, the output alphabet size
In our case, the input alphabet size is always
$
(
B
+
1
)
^
2
$
, the output alphabet size
is
$
B
^
2
$
and the carry alphabet sizes form the sequence
$
B
+
3
i
$
. Given that the output
is
$
B
^
2
$
and the carry alphabet sizes form the sequence
$
B
+
3
i
$
. Given that the output
...
@@ -233,4 +231,6 @@ alphabet is smaller than the input alphabet, it makes sense that the carry alpha
...
@@ -233,4 +231,6 @@ alphabet is smaller than the input alphabet, it makes sense that the carry alpha
has to increase in size to accomodate the accumulating information that did not fit
has to increase in size to accomodate the accumulating information that did not fit
into the output. The final carry is then used to output some extra blocks at the end.
into the output. The final carry is then used to output some extra blocks at the end.
\subsection
{
Generalizing the mixer concept
}
\endchapter
\endchapter
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment