Digital Signal Processing. Applications to Communications by Salvatore D. Morgera

By Salvatore D. Morgera

Show description

Read or Download Digital Signal Processing. Applications to Communications and Algebraic Coding Theories PDF

Similar microprocessors & system design books

Designing Embedded Systems with PIC Microcontrollers: Principles and Applications

This booklet is a hands-on creation to the foundations and perform of embedded procedure layout utilizing the PIC microcontroller. choked with beneficial examples and illustrations, it supplies an in-depth remedy of microcontroller layout, programming in either meeting language and C, and lines complicated issues corresponding to networking and real-time working platforms.

Logic and Language Models for Computer Science

This article makes in-depth explorations of a large variety of theoretical issues in laptop technological know-how. It plunges into the purposes of the summary techniques with a view to confront and deal with the skepticism of readers, and instill in them an appreciation for the usefulness of idea. A two-part presentation integrates common sense and formal language—both with functions.

Additional resources for Digital Signal Processing. Applications to Communications and Algebraic Coding Theories

Example text

4: Complexity of Cyclic Convolution of Some Factor Lengths Over a Field of Constants GF{Z). Length ΛΓ No. 1. 5: Complexity of Cyclic Convolution Algorithm Over a Field of Constants GF(4). Length N 15 63 255 4095 No. of Mults. 1. Just a fac­ tor of two increase in field size is seen to substantially decrease (by approximately 30%) the multiplicative complexity; however, computa­ tion of the linear forms associated with the matrices A, B, and C whose elements are now over the enlarged field is somewhat more complex.

The index set S = {0,1,3}. Let a denote the primitive element of GF(2S) satisfying a 3 + a + 1 = 0. The only divisor, i, of n in this case is 3, excluding t = 1, since p = 2; thus, Θ = (pn - l)/(pl - 1) = 1. For Θ = 1, the primitive polynomial is P\{u) = (u — a)(u — a 2 )(u — α 4 ) = υ? + u + 1. Since σ\ = 3, we now refer to the polynomial multiplication algorithm for degree σ\ — 1 = 2 in Appendix B. Using the linear forms in the /fc's, we proceed in the following manner to complete the first σ\ = 3 elements of each row of A\.

The vector ψ — x * y is periodic with period N and ψ = (Nf modp)ip. The algorithm for length pn — 1 is given by V> = C ( A x # B y ) , where AK = [A^, Aj2, · · ·] x, with N'-l (Ai)kj = Σ (Ai)kj+eN, itS. A similar relation holds for the term By. We have AQ = (Nf mod P)AQ. For any nonzero zeS, it is possible from P 3 to find a Θ = {pn - 1)/{ρσθ - 1) such that i is a multiple of Θ. 3, we also know that the rows of AQ are the MLRS's generated by PQ{U). ,n-l. 1. CYCLIC CONVOLUTION (Ai)kj = 49 tr(ßkafl).

Download PDF sample

Rated 4.83 of 5 – based on 41 votes