| 1. |
- Kamuf, Matthias, et al.
(författare)
-
A simplified computational kernel for trellis-based decoding
- 2004
-
Ingår i: IEEE Communications Letters. - 1089-7798. ; 8:3, s. 156-158
-
Tidskriftsartikel (refereegranskat)abstract
- A simplified branch metric and add-compare-select (ACS) unit is presented for use in trellis-based decoding architectures. The simplification is based on a complementary property of best feedforward and some systematic feedback encoders. As a result, one adder is saved in every other ACS unit. Furthermore, only half the branch metrics have to be calculated. It is shown that this simplification becomes especially beneficial for rate 1/2 convolutional codes. Consequently, area and power consumption will be reduced in a hardware implementation.
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Kamuf, Matthias, et al.
(författare)
-
Providing flexibility in a convolutional encoder
- 2003
-
Ingår i: Proceedings of the 2003 IEEE International Symposium on Circuits and Systems (Cat. No.03CH37430). - 0780377613 ; , s. 272-275
-
Konferensbidrag (refereegranskat)abstract
- In future radio systems, flexible coding and decoding architectures will be required. In case of the latter, implementing architectural flexibility with regard to low power issues is a challenging task. The flexible encoding platform in this paper is a first step toward this envisioned decoder. It generates a wide class of codes, starting with convolutional codes. As an extension to this, turbo codes will be included by adding an interleaver. At this prototyping stage, the system is implemented on an FPGA. The decision to choose the observer canonical form is defended by a thorough investigation of its critical path properties. Proper configuration allows code rates of b/c, b=1 ... 15, c=2 ... 16, b
|
|
| 5. |
|
|
| 6. |
- Thorén, Karl, et al.
(författare)
-
Precision Issues in the implementation of BCJR decoders
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232 ; , s. 289-289
-
Konferensbidrag (refereegranskat)abstract
- The BCJR algorithm is a symbol-bysymbol soft-output MAP decoder for trellis codes. This paper studies the effect of wordlength variations on the BCJR performance and looks at two strategies for reducing the wordlength.
|
|
