23 citations found. Retrieving documents...
J. F. Wakerly. Digital Design: Principles and Practices. Prentice Hall, Upper Saddle River, NJ, 3 rd edition, 2000.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Low Power Error Resilient Encoding for on-Chip Data Buses - Bertozzi, Benini, De Micheli (2002)   (7 citations)  (Correct)

....6 additional check bits. SEC and Double Error Detection Bus SECDED: A distance 3 Hamming code, like that implemented in SEC Leon, can easily be modified to increase its minimum distance to 4, adding one more check bit, chosen so that the parity of all bits, including the new one, is even [15]. This version of the Hamming code, that features 7 check bits instead of the 6 of the previous version, is usually used for single error correction and double error detection. Yet it allows to detect also all error patterns of an even number of errors, event though the double ones are the most ....

J. F. Wakerly. Digital Design: Principles and Practices. Prentice-Hall, Upper Saddle River, Third Edition 2000.


Maximum Minimal Distance Partitioning of the Z² Lattice - Bajic, Woods (2003)   (Correct)

....in [3] 4] He developed a class of methods called squaring constructions. For the lattice, when the number of partitions is , this method achieves . This is taught as the best method for lattice partitioning which maximizes the minimal intra partition distance for the given partition size [7] and gives rise to the best known TCM schemes [8] We are unaware of any partitioning algorithm that has achieved . In the remainder of the paper, we will demonstrate that this is possible and will describe a practical algorithm that achieves this. III. MAIN RESULTS A. MMD Lattice Partitioning ....

S. G. Wilson, Digital Modulation and Coding. Upper Saddle River, NJ: Prentice-Hall, 1996.


High Throughput Packet Radio using Sequential Decoding and.. - Orten (2002)   (Correct)

....[19, p. 361] P(C L) AL , 1) where A is a constant depending on the sequential decoding algorithm used, and p is the Pareto exponent. The Pareto exponent is found from (see [19] or [20] R E0(p) 2) p where R is the code rate and Eo(p) is the Gallager function, given by (see e.g. [20 22]) 1 Eo(p) log2 P(k)P(rlk) r:0 (3) where q is the number of input levels and Q is the number of output (quantization) levels, P(k) denotes a priori probabilities and P(rlk) denotes the probability of receiving r given that k was transmitted. Equation (3) assumes that the channel is ....

S. G. Wilson, Digital modulation and coding, Prentice Hall, Upper Saddle River, New Jersey, USA, 1996.


Soft-Decision Decoding of Linear Block Codes using Efficient.. - Wu, Hadjicostis   (Correct)

....approach is very ecient, especially under low SNR. I. Introduction Soft decision decoding provides substantial additional gain in comparison to hard decision decoding; however, this gain comes at the cost of exponential complexity as ML soft decision decoding has been shown to be NPcomplete [1]. Finding computationally ecient and practically implementable soft decision decoding algorithms has been investigated extensively and remains an open and challenging problem [2] 8] particularly since long block codes are important in the design of communication systems (noise averaging allows ....

....not need to be stored) The following proposition shows that the information of a reference of the current test error pattern e is always stored in the table. 1 The proposed rule is an improved version of the transition rule used in [4] Info. for [0 0 0 0] 1 2 B. B. B. B. Info. for [0 0 0 1] 2 1 Ref. to [1 0 0 1] B. B. Info. for [0 0 0 1] 2 1 Info. for [1 1 0 1] B. B. Info. for [0 0 0 1] 2 1 Ref. to [0 1 0 1] 0 1 0 1] B. B. Info. for [0 0 0 1] 2 1 Info. for [1 0 1 1] 0 0 1 1] Ref. to B. B. Info. for [0 0 0 1] 2 1 Info. for [0 1 1 1] 0 0 1 ....

[Article contains additional citation context not shown here]

S. G. Wilson, Digital Modulation and Coding. Upper Saddle River, NJ: Prentice-Hall, 1996.


Hardware Compilation for Software Engineers: an ATM Example - Fleury, Self, Downton (2001)   (Correct)

....whether software engineers, with limited background knowledge of the underlying hardware, could still participate in the high level design process. For general purpose computers the answer of course is yes, but for the hardware family that originated in the programmable logic device (PLD) [1] and has now encompassed complex eld programmable gate arrays (FPGAs) 2] the answer has until recently been no, principally because current software CAD tools do not suciently abstract from the hardware. FPGAs were originally thought of simply as weakly programmable glue logic, and CAD tools ....

J. F. Wakerly. Digital Design: Principles and Practices. Prentice Hall, Upper Saddle River, NJ, 3 rd edition, 2000.


Sequential decoding of convolutional codes for Rayleigh fading.. - Orten, al. (2001)   (Correct)

....# is a constant depending on the sequential decoding algorithm used, and # is the Pareto exponent. The value of the Pareto exponent is found from (see [11] or [12] # = # # (#) # # (2) where # is the code rate and # # (#) is the Gallager function. The Gallager function is found from (see e.g. [12, 14, 17]) # # (#) # log # ### # ### # ### # ### # (#)# (###) # ### # ### # (3) where # is the number of input levels and # is the number of output levels, # (#) denotes a priori probabilities and # (###) denotes the probability of receiving # given that symbol # was transmitted. Since the ....

S. G. Wilson, ####### ########## ### ######, Prentice Hall, Upper Saddle River, New Jersey, USA, 1996.


Sequential Decoding of Tailbiting Convolutional Codes for Packet.. - Orten (1999)   (1 citation)  (Correct)

....is given bythePareto distribution [17, p. 361] P (C L) AL ;ae # (1) where A is some constant and ae is the Pareto exponent. The Pareto exponent is found from (see [17] or [18] R = E 0 (ae) ae # (2) where R is the code rate and E 0 (ae) is the Gallager function, given by (see e.g. [18 20]) E 0 (ae) log 2 Q;1 X r=0 q;1 X k=0 P (k)P (rjk) 1 ae 1 1 ae # (3) where q is the number of input levels and Q is the number of output levels, P (k) denotes a priori probabilities and P (rjk) denotes the probability of receiving r given that k was transmitted. The decoder ....

S. G. Wilson, Digital modulation and coding, Prentice Hall, Upper Saddle River, NJ, 1996.


Coding, Decoding and Multiuser Detection for Wireless Communications - Orten (1997)   (Correct)

.... 0,100844,0] 5 25, 33, 37 12 (5,0,3,0,13,0,62,0,108,0,328,0,1051,0,2544,0,7197,0, 20658,0) 12,0,12,0,56,0,320,0,693,0,2324,0,8380,0,23009,0,71016, 0,222592,0] 6 47, 53, 75 13 (1,3,6,4,5,12,14,33,66,106,179,317,513,766,1297,2251, 3964,6721,10969,18818) [1,8,26,20,19,62,86,204,420,710,1345,2606,4343,6790, 12305,22356,41090,72820,123901,221886] 7 133, 165, 171 15 (3,3,6,9,4,18,35,45,77,153,263,436,764,1209,2046,3550, 5899,10002,16870,28701) 7,8,22,44,22,94,219,282,531,1104,1939,3460,6538, 11006,19478,35738,61865,109308,193128,340356] 8 225, 331, 367 16 (1,0,8,0,24,0,51,0,133,0,405,0,1129,0,3532,0,9754,0, 28746,0) ....

.... [2,26,51,80,168,283,529,722,1052,1648] 1,0) 8=28 20 (1,9,26,30,28,63,114,149,192,318) 1,16,66,102,120,279,583,769,1112,1946] 0,6) 8=27 20 (13,15,32,41,55,107,155,234,347,542) 24,39,88,198,243,545,797,1395,2059,3599] 0,2) 8=26 19 (8,20,28,44,63,104,164,249,385,607) [15,51,86,183,301,542,901,1473,2398,4039] (1,5) 8=25 18 (3,23,29,31,71,112,165,286,433,674) 5,57,85,114,344,574,885,1693,2741,4495] 0,1) 8=24 17 (2,17,33,30,76,110,157,316,465,834) 4,40,93,115,360,547,852,1912,2954,5690] 3,7) 8=23 16 (1,15,27,53,67,120,204,333,595,990) 1,34,78,223,301,627,1159,2080,3973,7169] 3,0) 8=22 15 ....

[Article contains additional citation context not shown here]

S. G. Wilson, Digital modulation and coding, Prentice Hall, Upper Saddle River, NJ, 1996.


Wireless Networks - Future Wireless Networks (1995)   (2 citations)  (Correct)

....are mutually exclusive, and induce tradeoffs in the choice of link level design techniques. 1.3. LINK LEVEL DESIGN 13 1.3. 1 Modulation Techniques Digital modulation is the process of encoding a digital information signal into the amplitude, phase, or frequency of the transmitted signal [59, 40, 57]. This encoding process impacts the bandwidth of the transmitted signal and its robustness to channel impairments. In general, a modulation technique encodes several bits into one symbol, and the rate of symbol transmission determines the bandwidth of the transmitted signal. Since the signal ....

....data rates the error floor becomes significant, thereby preventing the use of differential detection. 1.3. 2 Channel Coding and Link Layer Retransmission Channel coding adds redundant bits to the transmitted bit stream, which are used by the receiver to correct errors introduced by the channel [33, 40, 57]. This allows for a reduction in transmit power to achieve a given target BER and also prevents packet retransmissions if all the bit errors in a packet can be corrected. Conventional forward error correction (FEC) codes use block or convolutional code designs to produce the redundant bits for ....

S. G. Wilson. Digital Modulation and Coding. Upper Saddle River, NJ: Prentice-Hall, 1996.


Experience with OS Reliability Testing on the Exemplar System -.. - Faught (1997)   (Correct)

.... testing, which tests every limit on the program s behavior that any of the product s documents asserts, page 134) He says volume tests study the largest tasks the program can deal with, and stress tests study the program s response to peak bursts of activity, page 55) Rodney Wilson, in [WILSON], recognizes that many people have varying definitions of these terms, though he does not try to nail them down (pages 46, 82, 86) Wilson treats volume testing and load testing as synonyms. The CHO test s aim is to keep many parts of the system very busy for an extended period of time. While ....

Rodney Wilson. UNIX Test Tools and Benchmarks. Upper Saddle River, NJ: Prentice Hall, 1995. ISBN 0-13-125634-3.


Multi-rate Convolutional Codes - Frenger, Orten, Ottosson, Svensson (1998)   (4 citations)  (Correct)

....Process High rate punctured convolutional codes are constructed by puncturing a convolutional code of rate R = 1=n and constraint length 1 K, called the parent code. The parent code is an ordinary convolutional code, and it is thus completely specified by the encoder generator polynomials [49, 50] G j (D) g j 0 g j 1 D : g j K Gamma1 D K Gamma1 ; 3.1) where g j i 2 f0; 1g; j = 1; 2; n: 3.2) The bits to be punctured are described by an n Theta p puncturing matrix P consisting of zeros and ones. The output from the generator G j (D) is compared to the ....

....by calculating error bounds. If the distance spectrum, that is the number of bit errors associated with a given distance, of the code is known, it is rather straightforward to calculate an union upper bound on the bit error probability. For a rate 1=n code this bound is (see for example [32, 41, 49, 50]) P b 1 X d=d f c d P d ; 3.5) where c d is the information (error) weight, that is the number of bit errors for all error events of weight 2 d. The parameter d f is the distance of the error event with the smallest distance, the free distance of the code. Furthermore P d is the ....

[Article contains additional citation context not shown here]

S. G. Wilson, Digital modulation and coding, Prentice Hall, Upper Saddle River, NJ, 1996.


Sequential Decoding of Tailbiting Convolutional Codes for Hybrid.. - Orten (1999)   (1 citation)  (Correct)

....P (C L) AL Gammaae ; 1) where A is a constant depending on the sequential decoding algorithm used, and ae is the Pareto exponent. The Pareto exponent is found from (see [17] or [18] R = E 0 (ae) ae ; 2) where R is the code rate and E 0 (ae) is the Gallager function, given by (see e.g. [18 20]) E 0 (ae) Gamma log 2 Q Gamma1 X r=0 q Gamma1 X k=0 P (k)P (rjk) 1 ae 1 1 ae ; 3) where q is the number of input levels and Q is the number of output (quantization) levels, P (k) denotes a priori probabilities and P (rjk) denotes the probability of receiving r given that k was ....

S. G. Wilson, Digital modulation and coding, Prentice Hall, Upper Saddle River, NJ, 1996.


Sequential Decoding of Tailbiting Convolutional Codes for Packet.. - Orten (1999)   (1 citation)  (Correct)

....is given by the Pareto distribution [17, p. 361] P (C L) AL Gammaae ; 1) where A is some constant and ae is the Pareto exponent. The Pareto exponent is found from (see [17] or [18] R = E 0 (ae) ae ; 2) where R is the code rate and E 0 (ae) is the Gallager function, given by (see e.g. [18 20]) E 0 (ae) Gamma log 2 Q Gamma1 X r=0 q Gamma1 X k=0 P (k)P (rjk) 1 ae 1 1 ae ; 3) where q is the number of input levels and Q is the number of output levels, P (k) denotes a priori probabilities and P (rjk) denotes the probability of receiving r given that k was transmitted. ....

S. G. Wilson, Digital modulation and coding, Prentice Hall, Upper Saddle River, NJ, 1996.


A First Course in Digital Design Using VHDL and Programmable Logic - Areibi (2001)   (3 citations)  Self-citation (Design)   (Correct)

....The VHDL primers by Skahill[3] Yalamanchili[4] and Bhasker[5] would be suitable for the two text approach. The second is Offered for the first time in the fall 2000 T1C 19 to select a text that integrates the logic design theory with modeling in VHDL. The texts by Brown[6] Mano[7] and Wakerly[8] take this integrated approach. We chose Mano[7] for our course since it is based on a balanced treatment of logic design, digital system design and computer design basics. It also introduces both Verilog and VHDL. Two CDs for the Xilinx Student Edition 1.5 Foundation Series Software for Microsoft ....

....and help for their products. I think XESS has the best web and support between the vendors of reconfigurable boards. They also maintain a design database where people can place their designs on a public database. Out of the three books we were considering as text books, Mano[7] and Wakerly[8] include Xilinx Foundation tools. Xilinx Foundation Tools provide an FPGA editor to allow students browse their device. If a student ever ran into something that was hard to explain, he she could always open up the FPGA editor and see what the synthesis, and HDL code really gave them. In ....

J. Wakerly, Digital Design:Princples & Practices, Prentice Hall, Upper Saddle River, New Jersey, 2001.


Large-scale, Parallel Embedded Applications: A Hardware.. - Fleury, Self, Downton   (Correct)

No context found.

J. F. Wakerly. Digital Design: Principles and Practices. Prentice Hall, Upper Saddle River, NJ, 3 rd edition, 2000.


Application of Fuzzy Logic in Resistive Fault Modeling.. - Nourani, Attarha, Lucas (2002)   (Correct)

No context found.

J. Wakerly, Digital Design Principles and Practices. Upper Saddle River, NJ: Prentice-Hall, 1990.


Digital Image Data Hiding Using Side Information - Balado (2003)   (Correct)

No context found.

S. G. Wilson. Digital Modulation and Coding. Prentice-Hall, Upper Saddle River, New Jersey, 1996.


in a Cochannel Interference Limited Environment - Pierre Barthelemy Virginia   (Correct)

No context found.

L. W. Couch, Digital and Analog Communication Systems, 6 Edition, Prentice Hall, Upper Saddle River, NJ, 2001


Approaching the Capacity Limit in Image Watermarking: A.. - Perez-Gonzalez, al. (2001)   (Correct)

No context found.

S.G. Wilson, Digital Modulation and Coding, PrenticeHall, Upper Saddle River, NJ, 1996.


Data Fusion for Improved TOA/TDOA Position Determination in.. - Reza (2000)   (Correct)

No context found.

Leon W. Couch, Digital and Analog Communication Systems, Prentice Hall, Upper Saddle River, NJ, 1997.


IEEE TRANSACTIONS ON NANOTECHNOLOGY, VOL. 3, NO. 2, JUNE.. - Casper Lageweg Student (2004)   (Correct)

No context found.

J. Wakerly, Digital Design: Principles and Practices, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 2001.


Transmission of MPEG-2 Encoded VoD Services over Wireless Access .. - Ma, Zarki   (Correct)

No context found.

S. G. Wilson, Digital Modulation and Coding, PrenticeHall, Inc., Upper Saddle River, NJ 07458, 1996.


On the Voronoi Neighbor Ratio for Binary Linear Block Codes - Agrell (1998)   (Correct)

No context found.

S. G. Wilson, Digital Modulation and Coding. Upper Saddle River, NJ: Prentice-Hall, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC