3 edition of High-speed architecture for the decoding of trellis-coded modulation found in the catalog.

High-speed architecture for the decoding of trellis-coded modulation

semi-annual status report, period covered January 1992 - July 1992

  • 2384 Want to read
  • 73 Currently reading

Published by Administrator in New Mexico State University, Electrical and Computer Engineering

    Places:
  • United States
    • Subjects:
    • New Mexico State University, Electrical and Computer Engineering


      • Download High-speed architecture for the decoding of trellis-coded modulation Book Epub or Pdf Free, High-speed architecture for the decoding of trellis-coded modulation, Online Books Download High-speed architecture for the decoding of trellis-coded modulation Free, Book Free Reading High-speed architecture for the decoding of trellis-coded modulation Online, You are free and without need to spend extra money (PDF, epub) format You can Download this book here. Click on the download link below to get High-speed architecture for the decoding of trellis-coded modulation book in PDF or epub free.

      • Distributed to depository libraries in microfiche.Shipping list no.: 93-0454-M.Microfiche. [Washington, D.C. : National Aeronautics and Space Administration, 1993] 3 microfiches.

        StatementNew Mexico State University, Electrical and Computer Engineering
        PublishersNew Mexico State University, Electrical and Computer Engineering
        Classifications
        LC Classifications1992
        The Physical Object
        Paginationxvi, 138 p. :
        Number of Pages85
        ID Numbers
        ISBN 10nodata
        Series
        1
        2NASA contractor report -- NASA CR-191374.
        3

        nodata File Size: 7MB.


Share this book
You might also like

High-speed architecture for the decoding of trellis-coded modulation by New Mexico State University, Electrical and Computer Engineering Download PDF EPUB FB2


The encoding method of claim 1 wherein said multi-level symbols are assigned a five-level code, comprising a first, a second, a third, a fourth and a fifth code level, and wherein the first translation step further includes the step: translating a first predetermined bit value to said third code level and a second predetermined bit value to said second code level. A partition of a group is a decomposition of the group into disjoint subsets. Block 828 is introduced between the translator blocks 804, 806, 808, and 810 and addition blocks 812, 814, 816, and 818, respectively.

] Equations   1 Blocks 704, 706, 708 and 710 of FIG. In accordance with the Ungerboeck teaching, these two output values differ by the maximum Euclidean distance i.

As another example, assume the encoder 200 to be in the present state 10 i. This logic is derived from block 702 of FIG. The coset leader G 3 is selected by a bit called 14 which can be derived from the bits Sd[ 3: 4] and Sd[ 6: 8]. A symbol period, T, is nominally equal to 8 ns. A method of decoding a plurality of multi-level symbols as a plural-bit data word, each said symbol having a value selected from a five-level code, each said code level treated as a twos-complement number, comprising the steps of: a translation of each of selected bit positions of said twos-complement representation to predetermined bit positions of said data word; when the contents of a predetermined bit positions of a twos-complement representation of one of said symbol is a predetermined value, setting of predetermined bit positions of said data word to a selected value; generating a plural-bit offset word from predetermined bit positions of said twos-complement representation of each of said symbols; and generating predetermined bit positions of said data-word from said offset word to a selected value, dependent on said contents of said predetermined bit positions of a twos-complement representation of one of said symbol being said predetermined value.

The number pair along each of the branches depicted in FIG. At the same time, the encoder 200 has transitioned from the state 0 to the state 2, to the state 1, and back to the state 0. Therefore, it is more likely that the sequence of input bits is 1- 0- 0. In yet another aspect of the encoding method of the instant invention each of the multilevel symbols is encoded on a predetermined one of four signal lines and wherein the second translation step further includes the steps, when the contents of said predetermined one of the data word bits is said predetermined value, adding the fifth code value to one of the signal lines as selected by predetermined bit positions of the data word, discarding the symbol on the fourth signal line; and selecting the symbols on the remaining three signal lines from the symbols on the lines to which no fifth code value is added.

The 1000BASE-T standard uses a continuous signaling system; in the absence of data, Idle High-speed architecture for the decoding of trellis-coded modulation are transmitted.

Also provided by the invention is a method of decoding a plurality of multi-level symbols as a plural-bit data word, each symbol having a value selected from a five-level code, each code level treated as a twos-complement number, comprising the High-speed architecture for the decoding of trellis-coded modulation of; a translation of each of selected bit positions of the twos-complement representation to predetermined bit positions of the data word, when the contents of a predetermined bit positions of a twos-complement representation of one of the symbol is a predetermined value, setting of predetermined bit positions of the data word to a selected value; generating a plural-bit offset word from predetermined bit positions of the twos-complement representation of each of the symbols; and generating predetermined bit positions of the data-word from the offset word to a selected value, dependent on the contents of the predetermined bit positions of a twos-complement representation of one of the symbol being the predetermined value.

8 by their Ungerboeck labels Sd[ 6: 8] in the partition tree. Also suppose that the receiver detects the transmitted signal erroneously as 11- 11- 11.

Euclidean distance is the length of a straight line between points on a signal constellation.

Symbol encoding and decoding architecture for trellis

For example, the trellis diagram of FIG.excluding the first symbol. SUMMARY OF THE INVENTION The present invention provides a method of encoding a plural-bit data word as a plurality of multi-level symbols, each having a value selected from a predetermined plurality of levels, comprising the steps of a first translation of each of selected bit positions of the data word to one of the levels, when the contents of a predetermined one of the data word bits is a predetermined value, a second translation of each of the selected data word bit positions to one of the levels, generating a plural-bit offset word from predetermined bit positions of the data word and generating the multi-level symbols by addition of the offset word to the translated levels.

Thus, a convolutional encoder has memory.