Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Graham Wade

dblp:93/1779 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 5 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code › code parameters
code distance
0.012003
Dependence of dfree in MPCCC systems · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › convolutional codes
free distance
0.012003
Dependence of dfree in MPCCC systems · IEEE Trans. Commun. 2003
Coding theory › channel coding › turbo codes
interleaver design
0.012003
Dependence of dfree in MPCCC systems · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › concatenated codes
parallel concatenated convolutional codes
0.012003
Dependence of dfree in MPCCC systems · IEEE Trans. Commun. 2003
Coding theory › channel coding
turbo codes
0.012003
Dependence of dfree in MPCCC systems · IEEE Trans. Commun. 2003

Methods — techniques the papers use, named apart from their topics

computer search · 0.0
YearPublicationVenuePosition
2005 Turbo-coded multi-alphabet binary CPM for concatenated continuous phase modulation
abstract
Constant envelope and high spectral efficiency are among the key properties which make continuous phase modulation (CPM) a preferred choice for many applications. Numerous methods are available for designing concatenated CPM systems to achieve additional coding gains. In this paper, we propose a new serial concatenated CPM scheme. Our design uses a multi-alphabet binary CPM as an inner code, a modified turbo code as an outer code, and specially designed interleavers. The extrinsic information transfer (EXIT) chart technique has been employed to assist the outer code design. Using soft decision decoding, we show that our design gives noticeable improvements compared with previous concatenated CPM schemes over additive white Gaussian noise (AWGN) channel.
Jun Ning, Minyue Fu 0001, Graham Wade
GLOBECOM3
2003 Magnitude modulation for small satellite Earth terminals using QPSK and OQPSK
abstract
This paper investigates the design and application of data magnitude modulation to reduce power amplifier back-off for QPSK and OQPSK modulations for small satellite Earth stations. The coefficients for data magnitude modulation are obtained by using an iterative design loop. The parameters of this loop are tuned to obtain maximum gain. Roll-off factors from 10% to 100% are considered, with emphasis on small roll-off values for increased bandwidth efficiency. It is shown that a gain of almost 6 dB can ideally be obtained for a roll-off factor of 10%. Error correction coding is used to compensate for the increased sensitivity to noise of the magnitude modulated data. The loss due to this increased sensitivity is reduced from almost 5.5 dB to 1.2 dB for a roll-off factor of 10% by using high rate product codes, thus giving an overall gain of 4.8 dB. Trade offs between spectral regrowth and implementation are addressed.
Marcel Ambroze, Martin Tomlinson, Graham Wade
ICC3
2003 Dependence of dfree in MPCCC systems
abstract
This letter first investigates the distribution of the free distance, parameter d/sub free/ for multiple parallel concatenated schemes based on random interleavers. The distribution is obtained by computer search for information weight IW=2 error events, which are the most likely events to produce d/sub free/, at least for turbo codes. The dependence upon interleaver length and code memory is also studied. The design of the S-interleaver for turbo codes is shown to depend upon a combination of IW=2 error events (which are dependent on S) and IW=2+2 "crossed" error events (which are independent of S). The limiting value of S (for which the two effects are equal) is calculated for turbo codes and a novel algorithm to increase this limit (and hence, d/sub free/) is presented. The S-random interleaver design is extended to schemes with two interleavers, for which the use of paired S-random interleavers is proposed.
Marcel Ambroze, Graham Wade, Martin Tomlinson
IEEE Trans. Commun.2
2002 Power and bandwidth efficient modulation and coding for small satellite communication terminals
abstract
The objective of this project is to maximise the power and bandwidth efficiency of small satellite Earth communication terminals whose main limitation to satellite capacity is a nonlinear transmitting power amplifier. A form of envelope equalisation is presented in which regular QPSK modulation is used together with instantaneous data magnitude modulation so as to produce a near constant envelope signal when filtered with root 35% raised cosine filtering. The algorithm for deriving the magnitude values is presented along with results using a data lookup table approximation. Bit error rate figures are presented for envelope equalisation combined with a (4096,3249) binary product code and MAP decoding. It is shown that at 10/sup -6/ BER the E/sub b//N/sub 0/ is 3.52 dB, some 0.26 dB from the linear system. When used with a nonlinear power amplifier, the benefit of envelope equalisation is approximately 3 dB. The power spectrum is identical to that of the linear system with no spectral spreading and no increase in adjacent channel interference.
Martin Tomlinson, Marcel Ambroze, Graham Wade
ICC3
2002 Adding robustness to geometrical attacks to a wavelet based, blind video watermarking system
abstract
This paper describes a high capacity blind video watermarking system invariant to geometrical attacks such as shift, rotation, scaling and cropping. A spatial domain reference watermark is used to obtain invariance to geometric attacks by employing image registration techniques to determine and invert the attacks. A second, high capacity, watermark, which carries the data payload, is embedded in the wavelet domain according to a human visual system (HVS) model. This is protected by a state-of-the-art error correction code (turbo code). For a false detection probability of 10/sup -8/, the proposed system is invariant to scaling up to 180%, rotation up to 70/spl deg/, and arbitrary aspect ratio changes up to 200% on both axes. Furthermore, the system is virtually invariant to any shifting, cropping, or combined shifting and cropping attack, and it is robust to MPEG-2 compression as low as 2-3 Mbps.
Cristian Vasile Serdean, Marcel Ambroze, Martin Tomlinson, Graham Wade
ICME (1)4
1991 Compression of Meteosat data for image dissemination
Graham Wade, Zhauang Li
Comput. Commun.1