25 citations found. Retrieving documents...
B. Sklar, Digital Communications: Fundamentals and Applications, Prentice Hall, 1988.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Adaptive Code Rate for Orthogonal Code Hopping - Multiplexing Ochm In (2003)   (Correct)

.... perforation: random perforation with a probability of P p . Turbo codes [9] Perfect channel estimation and equal gain combining [10] are assumed. We first consider BPSK, however, simulation results can be applied to QPSK because QPSK can be characterized as two orthogonal BPSK channels [11]. Wireless channels are assumed to experience AWGN or independent (uncorrelated) Rayleigh fading. No specific code hopping patterns are designated and random hopping patterns are considered, and thus, collision and perforation of symbols occur randomly. Recursive Systematic Convolutional ....

B. Sklar, Digital Communications: Fundamentals and Applications, Prentice Hall, 1988.


A Novel Approximation Method For Error Rate Curves In.. - Feldmann, Radimirsch   (Correct)

....goals 2 and 3. Rational functions are smoother but they often have poles. Their behaviour outside the defined range is also undetermined. Analytical calculation of the ER is possible for many PL modulation schemes. However, we are interested in ER after channel decoding. As shown in e.g. [2], the mathematical calculation of channel coding performance is very complicated and leads to fractional functions in most cases which often have poles in the defined range. The idea for the proposed function is to analyse the properties of the ER rate curves and to find a function that fits ....

Sklar B.:" Digital Communications -- Fundamentals and Applications", .1st edition, Prentice Hall, 1988


Energy Efficient Broadcast with Sectored Antennas in Wireless.. - Lin, Noubir (2002)   (Correct)

....The antennas orientation is static. Since the nodes are randomly picked, and the orientation is static, the initial orientation of the antennas should have no effects on our result. We compute the power consumption for transmission between nodes s and d with distance d(s; t) as specified in [2]: P (s; t) S d(s; t) For multi sector antenna (S 1) the gain achieved by optimizing BIP, for example, using the sweep post processing discussed by Wieselthier, et al. [4] is very small. And for omnidirectional antenna, the improvement is about 20 (data not shown) much smaller ....

B. Sklar. Digital communications: Fundamentals and applications, 1988.


Energy Efficient Broadcast with Sectored Antennas in Wireless.. - Lin, Noubir (2002)   (Correct)

....The antennas orientation is static. Since the nodes are randomly picked, and the orientation is static, the initial orientation of the antennas should have no effects on our result. We compute the power consumption for transmission between nodes # and # with distance #### ## as specified in [2]: # ### ### # # #### ## For multi sector antenna (# # #) the gain achieved by optimizing BIP, for example, using the sweep post processing discussed by Wieselthier, et al. [4] is very small. And for omnidirectional antenna, the improvement is about ### (data not shown) much smaller ....

B. Sklar. Digital communications: Fundamentals and applications, 1988.


Soft Deadline Bounds for Two-Way Transactions in.. - Amre El-Hoiydi.. (2001)   (Correct)

....according to the bit error probability versus 0 b EN curve. For a GFSK receiver, this curve would depend on the receiver technology. Because such results are not yet readily available and deserve a study on their own, the performance curve of non coherent FSK modulation has been used instead [5]: ### # 0 1 2 exp (2 ) bB PEN # This deviation of the model from the Bluetooth system specification remains acceptable for this set of simulations, as we mostly want to verify the formulas for the extreme case, when the jammers are so close to the receiver that the signal to noise ratio is ....

Bernard Sklar, "Digital Communications, Fundamentals and Applications", Prentice-Hall, 1988.


The Newtonian Architecture for Virtual Landscapes: An.. - Wedlake (1999)   (Correct)

....33 MM MM H H H H H H H H MM H H MM H H H MM WAN LAN :Host :Message Manager H MM Figure 3. 1: Distributed client server network architecture The peer to peer connections use quality of service (QoS) technologies whenever possible, such as available with ATM, IPv6, and RSVP (see [3, 43, 45]) The QoS capabilities allow systems to specify the maximum acceptable latency and jitter within the packet switching networks. Quality of service is helpful for the DVR system to ensure a consistent view of the shared virtual environment to remote users. However, it is not always available. For ....

Bernard Sklar. Digital Communications: Fundamentals and Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1988.


Wireless Video Transport Using Conditional Retransmission.. - Aramvith, Lin, Sun (2000)   (1 citation)  (Correct)

....prepare for the bad state. A value of 0.3 is used in the simulations. We define block interleaving block nl where n is the codeword length (in bits) and l is an interleaving depth (in bits) We use a BCH(n,k) code where for every k bits of actual data, n k redundancy bits are added to the codeword [9]. The interleaving is shown in Fig. 3. The interleaving degree should be sufficiently large to spread out burst errors in time. A unique well protected synchronization codeword is used to mark the boundary between the packets with interleaving and the packets without interleaving. At the receiver ....

B. Sklar, Digital Communications Fundamentals and Applications, Prentice Hall, 1988.


Software pi/4-DQPSK Modem: A Student Project Using the.. - Weiss, Braithwaite..   (Correct)

.... stream onto inphase and quadrature signals modulated by ### differential QPSK [1] After upsampling both inphase and quadrature component, Kingsbury filters # # ### are applied for pulse shaping in order to restrict the bandwidth and to prohibit intersymbol interference (ISI) on the receiver end [3, 5]. After digital to analogue conversion, standard laboratory hardware can be used to further modulate the signals, add noise interference, or apply amplitude and phase distortion to the signals. The receiver was designed to run at ### the symbolrate to provide high resolution for the clock ....

B. Sklar. Digital Communications: Fundamentals and Applications. Prentice Hall, Englewood Cliffs, 1988.


Software pi/4-DQPSK Modem: A Student Project Using the.. - Weiss, Braithwaite.. (2000)   (Correct)

.... stream onto inphase and quadrature signals modulated by =4 differential QPSK [1] After upsampling both inphase and quadrature component, Kingsbury filters h 1 [n] are applied for pulse shaping in order to restrict the bandwidth and to prohibit intersymbol interference (ISI) on the receiver end [3, 5]. After digital to analogue conversion, standard laboratory hardware can be used to further modulate the signals, add noise interference, or apply amplitude and phase distortion to the signals. The receiver was designed to run at 16 the symbolrate to provide high resolution for the clock ....

B. Sklar. Digital Communications: Fundamentals and Applications. Prentice Hall, Englewood Cliffs, 1988.


A Formal Model of Asynchronous Communication and Its Use in.. - Moore (1993)   (15 citations)  (Correct)

.... 82530 Serial Communications Controller[Int91] A version of biphase mark, called Manchester, is used in the Ethernet[Rod88] and is implemented in the Intel 82C501AD Ethernet Serial Interface[Int91] Biphase mark is also used in some optical communications and satellite telemetry applications[Skl88]. There is no doubt that it works. But, as far as we have been able to determine, a rigorous analysis of its tolerance of asynchrony has not been done. This is a grey area because it is at the boundary between continuous physical phenonmenon (e.g. waves and interference) and discrete logical ....

Sklar, B.: Digital Communications Fundamentals and Applications. Prentice Hall, 1988.


Parallel Implementation of a Compressed Image Decoder - Krull   (Correct)

....= log 2 (26) 4.7 bits symbol. So, a lossless compression technique used on this source would yield an average code length of at least 4.7 bits per symbol. One lossless compression technique which has been shown to provide the shortest average code length for a given symbol set is Huffman coding [16]. Huffman coding assigns variable length codewords to source symbols the lengths of which are inversely proportional to the source symbol relative frequency. So, the most likely source symbol receives the shortest codeword. Figures 3 and 4 illustrate the processes used to assign Huffman codewords. ....

Bernard Sklar, Digital Communications Fundamentals and Applications, Prentice Hall, Englewood Cliffs, NJ, 1988.


Co-Design Of DSP Systems - De Man, Bolsens, Lin, Van Rompaey.. (1996)   (5 citations)  (Correct)

....data flow functional blocks (DFB) such as h1, h2, L2, often operating at fairly different dataand execution rates and transforming the format of the data. The rate and format differences naturally result from operations such as: frequency down or up conversion, bit to symbol modulation [35], datacompression and error correction coding. When these DFBs operate on unfragmented signal words they can best be specified as data flow algorithms (e.g. in SILAGE, DFL or C) while others that manipulate individual bits of the signals can be directly specified as FSMDs [13] at VHDL register ....

B. Sklar. Digital Communications: Fundamentals and Applications. Prentice-Hall, 1988.


Adaptive Code Rate for Orthogonal Code Hopping - Multiplexing Ochm In (2002)   (Correct)

No context found.

B. Sklar, Digital Communications: Fundamentals and Applications, Prentice Hall, 1988.


Reliable Multipath Routing with Fixed Delays in MANET Using.. - Nodes Rui Ma (2003)   (1 citation)  (Correct)

No context found.

B. Sklar. Digital Communications: Fundamentals and Applications. Prentice Hall, 1988.


A Phase Measurement Radio Positioning System for Indoor Use - Reynolds (1999)   (2 citations)  (Correct)

No context found.

Sklar, Bernard. Digital Communications: Fundamentals and Applications. PTR


Dynamic Code Sharing Algorithms for IP Quality of Service in.. - Fossa, Jr.   (Correct)

No context found.

Bernard Sklar, Digital Communications Fundamentals and Applications, Prentice Hall, New Jersey, #988.


Adaptive Modulation and Error Control for Energy.. - Narkhede, Silveira.. (2003)   (Correct)

No context found.

Bernard Sklar, "Digital Communications: Fundamentals and Applications ", Chapter 9. Modulation and Coding Trade-off, Englewood Cliffs, NJ: Prentice Hall, 1988.


Addressing the Challenges of Reliable Data Transfer over.. - Chakravorty (2003)   (Correct)

No context found.

Bernard Sklar, "Digital Communications: Fundamentals and Applications", Prentice Hall PTR, January 2001, ISBN: 0-13-084788-7


Adaptive Digital Predistortion with Applications for LMDS Systems - Johnson (2000)   (Correct)

No context found.

B. Sklar, Digital Communications: Fundamentals and Applications, Prentice Hall, 1987. 89


A Proposed Architecture For A High-Data Rate Mobile Lmds.. - Katina Roshael Reece   (Correct)

No context found.

Sklar, Bernard. DIGITAL COMMUNICATIONS Fundamentals and Applications, Prentice Hall, 1988.


A Formal Model of Asynchronous Communication and Its Use in.. - Moore (1992)   (15 citations)  (Correct)

No context found.

B. Sklar. Digital Communications Fundamentals and Applications. Prentice Hall, 1988.


Transmission and Computational Energy Modeling for Wireless Video .. - Bhatkar (2003)   (Correct)

No context found.

Bernard Sklar, "Digital Communications: Fundamentals and Applications, "Pearson Education IInd edition


Statistical Error Shaping for Mismatch Cancellation in.. - Riches Member Ieee (2000)   (Correct)

No context found.

B. Sklar, "Digital Communications: Fundamentals and Applications", New Jersey, Prentice Hall, 1988.


Chapter 9: Partial Response Maximum Likelihood (PRML) - Od Pr Ml   (Correct)

No context found.

B. Sklar "Digital Communications. Fundamentals and Applications" - Prentice Hall, 1988. A useful textbook, contains description of partial response, convolutional codes and Viterbi decoding algorithm.


Optimal Solution of Off-line and On-line Generalized Caching - Hosseini-Khayat, Cox, Jr. (1996)   (Correct)

No context found.

Bernard Sklar, "Digital Communication: Fundamentals and Applications," Prentice Hall, New Jersey, 1988.

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