Table 7 Implementation of the C i operation
From: A new computational decoding complexity measure of convolutional codes
C implementation | C55x assembly | Description | Cycles | |
|---|---|---|---|---|
If (A < B) minor =A; | MOV *SP(#01h),AR1 | AR1 ← B | 1 | 1 |
else minor =B; | MOV *SP(#00h),AR2 | AR2 ← A | 1 | 1 |
CMP (AR2> =AR1), TC1 | if (AR2> =AR1) TC1 =1 | 1 | 1 | |
BCC @L1,TC1 | if (TC1) go to @L1 | 6 | 5 | |
MOV AR2,AR1 | AR1 ← AR2 | - | 1 | |
MOV AR1, *SP(#02h) | minor ← AR1 | - | 1 | |
B @L2 | go to @L2 | - | 6 | |
@L1: MOV AR1,*SP(#02h) | @L1: minor ← AR1 | 1 | - | |
@L2: …(next instruction) | @L2: …(next instruction) | - | - | |
Total | 10 or 16 | |||