CA2241691A1 - Method and apparatus for symbol decoding using a variable number of survivor paths - Google Patents
Method and apparatus for symbol decoding using a variable number of survivor pathsInfo
- Publication number
- CA2241691A1 CA2241691A1 CA002241691A CA2241691A CA2241691A1 CA 2241691 A1 CA2241691 A1 CA 2241691A1 CA 002241691 A CA002241691 A CA 002241691A CA 2241691 A CA2241691 A CA 2241691A CA 2241691 A1 CA2241691 A1 CA 2241691A1
- Authority
- CA
- Canada
- Prior art keywords
- trellis
- nodes
- survivor paths
- current condition
- sequence
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Error Detection And Correction (AREA)
Abstract
A low complexity, high performance trellis decoder adapts the complexity of the trellis decoding process based on a current condition of the communications system.
A trellis structure of nodes and branches is developed to decode the sequence of symbols received over a communications channel. Each set of nodes in the trellis represents the possible values of a received symbol at one time instant. Each branch defines a specific transition between nodes at different time instants, and each branch has an associated branch metric or weight.
A linkage of branches between the nodes and the trellis defines a path through the trellis that represents one possible symbol sequence, and an accumulated metric/weight is generated for each possible path through the trellis. A variable number M survivor paths through is determined based on their accumulated path metric/weights. The value of the variable M depends on the current condition of the communications system. Once the value of M is adapted to the current condition, the sequence of received symbols is decoded using M
survivor paths through the trellis.
A trellis structure of nodes and branches is developed to decode the sequence of symbols received over a communications channel. Each set of nodes in the trellis represents the possible values of a received symbol at one time instant. Each branch defines a specific transition between nodes at different time instants, and each branch has an associated branch metric or weight.
A linkage of branches between the nodes and the trellis defines a path through the trellis that represents one possible symbol sequence, and an accumulated metric/weight is generated for each possible path through the trellis. A variable number M survivor paths through is determined based on their accumulated path metric/weights. The value of the variable M depends on the current condition of the communications system. Once the value of M is adapted to the current condition, the sequence of received symbols is decoded using M
survivor paths through the trellis.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/579,349 US5905742A (en) | 1995-12-27 | 1995-12-27 | Method and apparauts for symbol decoding |
US08/579,349 | 1995-12-27 | ||
PCT/US1996/020091 WO1997024849A1 (en) | 1995-12-27 | 1996-12-23 | Method and apparatus for symbol decoding using a variable number of survivor paths |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2241691A1 true CA2241691A1 (en) | 1997-07-10 |
CA2241691C CA2241691C (en) | 2006-02-28 |
Family
ID=36011135
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002241691A Expired - Fee Related CA2241691C (en) | 1995-12-27 | 1996-12-23 | Method and apparatus for symbol decoding using a variable number of survivor paths |
Country Status (1)
Country | Link |
---|---|
CA (1) | CA2241691C (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109075799A (en) * | 2016-04-29 | 2018-12-21 | 华为技术有限公司 | The coding and decoding method and device of polarization Polar code |
-
1996
- 1996-12-23 CA CA002241691A patent/CA2241691C/en not_active Expired - Fee Related
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109075799A (en) * | 2016-04-29 | 2018-12-21 | 华为技术有限公司 | The coding and decoding method and device of polarization Polar code |
CN109075799B (en) * | 2016-04-29 | 2024-03-15 | 华为技术有限公司 | Coding and decoding method and device for Polar codes |
Also Published As
Publication number | Publication date |
---|---|
CA2241691C (en) | 2006-02-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5638408A (en) | Variable transmission bit rate discrimination method and apparatus | |
EP0573621B1 (en) | Device and method for precoding | |
WO1996016483A3 (en) | A system for decoding digital data using a variable decision depth | |
EP2280494A2 (en) | Method and apparatus for data transmission using multiple transmit antennas | |
EP0801501A3 (en) | Viterbi decoder for digital packet signals | |
CA2290580A1 (en) | Device and method for selecting turbo or non-turbo error correction codes based on data type or length | |
JPH11177441A (en) | Viterbi detection method with decreased state number and data transmission system | |
EP0494709B1 (en) | Signal transmission system with sepatate tree coding for each of the parameters | |
CA2134996A1 (en) | Apparatus and Method for Trellis Decoder | |
CA2171406A1 (en) | Maximum likelihood sequence estimator and maximum likelihood sequence estimating method | |
EP1044507B1 (en) | Non-binary viterbi decoder using butterfly operations | |
Seshadri et al. | Decoding of severely filtered modulation codes using the (M, L) algorithm | |
CA2241691A1 (en) | Method and apparatus for symbol decoding using a variable number of survivor paths | |
WO2002060071A3 (en) | Viterbi decoder | |
Balachandran et al. | Reduced complexity sequence detection for nonminimum phase intersymbol interference channels | |
Lin et al. | Parallel Viterbi decoding methods for uncontrollable and controllable sources | |
Driscoll et al. | Detection processes for V32 modems using trellis coding | |
IL110202A (en) | Equalization and error detection apparatus for high rate digital communications | |
Schmidt et al. | Simple maximum-likelihood decoding of generalized first-order Reed-Muller codes | |
Visoz et al. | Joint equalization and decoding of trellis-encoded signals using the generalized Viterbi algorithm | |
Moorthy et al. | On the trellis structure of a (64, 40, 8) subcode of the (64, 42, 8) third-order Reed-Muller code | |
Mohammad et al. | A comparison between the M-algorithm and the list Viterbi algorithm | |
Baccarelli et al. | New insight into the performance of TCM schemes over fast time-variant multipath-degraded faded environments | |
Song et al. | An adaptive reduced-state sequence detector utilizing the symbol-aided method in the mobile satellite channel | |
SHOHON et al. | Multilevel coding with adaptive equalization and interleaving for fading channel |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
MKLA | Lapsed |
Effective date: 20151223 |