Table - PMC

Skip to main content

View full-text article in PMC

. 2020 Oct 13;20(20):5792. doi: 10.3390/s20205792

Algorithm 1 Decoding procedure

Phase 1—Slicing procedure

1:
procedure $s u b m a t r i x$ = SLICING( $P_{c}$ , $s u b m a t r i x$ )
2:
if $s u b m a t r i x$ is undefined or $P_{c}$ is independent to $s u b m a t r i x$ then
3:
New $s u b m a t r i x \leftarrow$ new List( $P_{c}$ )
4:
else
5:
$s u b m a t r i x$ .append( $P_{c}$ )
6:
end if
7:
end procedure

Phase 2—Decoding procedure

8:
procedure $p a c k e t s$ = Decoding( $s u b m a t r i x$ )
9:
$s p a r s e m a t r i x \leftarrow$ decompress header of each $P_{c}$ in $s u b m a t r i x$
10:
if $s p a r s e m a t r i x$ is full rank then
11:
Decode $s p a r s e m a t r i x$ by Equation (6)
12:
Remove $s u b m a t r i x$
13:
else
14:
Request additional $P_{c}$
15:
end if
16:
end procedure