IEE Proceedings - Communications
Volume 153, Issue 5, October 2006
Volumes & issues:
Volume 153, Issue 5
October 2006
-
- Author(s): C. Tjhai ; M. Tomlinson ; M. Grassl ; R. Horan ; M. Ahmed ; M. Ambroze
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 581 –585
- DOI: 10.1049/ip-com:20050560
- Type: Article
- + Show details - Hide details
-
p.
581
–585
(5)
The minimum distance of all binary cyclic codes of length 151 is determined. Almost all of these cyclic codes have the same parameters as the best linear codes given in Brouwer's database. A nested chain of linear codes is derived from these cyclic codes and some new binary codes are obtained by applying Constructions X and XX to pairs of codes in this chain. Good candidates for nested codes can also be obtained by enlarging the cyclic codes of high minimum distance. In total, there are 39 new binary linear codes that have a minimum distance higher than codes previously considered to be the best linear codes. - Author(s): S. Papaharalabos ; P. Sweeney ; B.G. Evans ; P.T. Mathiopoulos
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 586 –590
- DOI: 10.1049/ip-com:20050247
- Type: Article
- + Show details - Hide details
-
p.
586
–590
(5)
A novel approach for improving the performance of the soft-output Viterbi algorithm (SOVA) when applied to turbo decoding is proposed. Based upon a modified two-step scaling factor approach for the decoder's extrinsic information, it is shown that the proposed technique reduces significantly the error floor present in previous SOVA-based turbo decoding techniques. Various computer simulated bit error rate (BER) performance evaluation results for binary phase shift keying (BPSK) signals transmitted over the additive white Gaussian noise (AWGN) and flat Rician fading channels clearly indicate that for large interleaver sizes and high numbers of decoding iterations no error floor is observed for BERs as low as 10−6. - Author(s): G. Altay ; O.N. Ucan ; H. Fatih Uğurdağ
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 591 –596
- DOI: 10.1049/ip-com:20050595
- Type: Article
- + Show details - Hide details
-
p.
591
–596
(6)
We propose a new simple decomposable code construction technique that generates codes with the full information rate for all of the minimum Hamming distance-4 binary linear block codes of even length greater than or equal to eight. Additionally, some optimal Hamming distance-8 and higher distance codes are obtained with our proposed scheme. A generic trellis structure for the proposed codes was also designed. It is shown that our trellis structures provide lower decoding complexity in comparison to the trellises of some other well-known block codes. - Author(s): W. Jin ; H. Xu ; F. Takawira
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 597 –602
- DOI: 10.1049/ip-com:20050447
- Type: Article
- + Show details - Hide details
-
p.
597
–602
(6)
The authors present a hybrid list decoding and Kaneko algorithm for Reed–Solomon (RS) codes. A new ruling out scheme motivated from Takuya Koumoto's work for a reduced-complexity list decoding algorithm, which reduces the complexity of the hybrid algorithm, is also proposed. Simulation results show that the performance of the hybrid algorithm for both (15, 7) and (31, 21) RS codes is comparable with the hybrid algorithm which combines the list algorithm and the Chase algorithm. But the complexity of the proposed hybrid algorithm is much less than that of the hybrid algorithm which combines the list algorithm and the Chase algorithm at high signal-to-noise ratios. - Author(s): K. Oteng-Amoako and S. Nooshabadi
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 603 –610
- DOI: 10.1049/ip-com:20050609
- Type: Article
- + Show details - Hide details
-
p.
603
–610
(8)
The authors present asymmetric turbo hybrid automatic-repeat-request (ATH-ARQ) schemes that employ component code selection and asymmetric rate compatible punctured turbo codes (ARCPT) for enhanced performance in fading channels. The paper also presents a novel low-rate ARCPT encoder structure. An analysis is presented for efficient ARCPT puncture schemes for improved throughput performance at low and high SNR values. It is shown that in certain instances, the use of conventional turbo code structures results in the best performance. - Author(s): X. Xie ; G. Li ; Z. Wang
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 611 –618
- DOI: 10.1049/ip-com:20050338
- Type: Article
- + Show details - Hide details
-
p.
611
–618
(8)
By analysing the characteristics of the communication channel in a bidirectional digital wireless endoscopy system, the authors propose an efficient automatic repeat query (ARQ) scheme, with a dynamically adaptive block size, a high data rate and an ultra-short communication distance. Two new strategies for adaptive block-size decision are also proposed. The optimum block-size formula for the wireless endoscopy system is given and analysed in detail. This ARQ scheme ensures not only the image's communication quality at a high data rate (2 Mbit/s) but also the optimum communication-power efficiency in the capsule. - Author(s): J.P. Fonseka ; J. Liu ; N. Goel
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 619 –625
- DOI: 10.1049/ip-com:20050147
- Type: Article
- + Show details - Hide details
-
p.
619
–625
(7)
A multi-interval line coding (MILC) technique which operates over blocks of intervals is proposed to increase the transmission rate without expanding the bandwidth or using higher order signalling. This is done by dividing every interval into sub-intervals, and allowing the signals to make amplitude transitions at the end of sub-intervals. However, the waveforms are generated by maintaining the duration of all individual pulses at least at equal to the original bit interval thereby maintaining spectral variations close to that of ordinary binary signals. Numerical results presented for data transmission over a printed circuit board (PCB) trace indicate that MILC schemes perform significantly better than ordinary binary signalling at the same information transfer rate under severe ISI conditions. - Author(s): S. Yousefi and B. Holmes
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 626 –632
- DOI: 10.1049/ip-com:20050585
- Type: Article
- + Show details - Hide details
-
p.
626
–632
(7)
New Bonferroni-type lower bounds on the word error probability of uncoded systems are developed. The new family of bounds is based on a recent Bonferroni inequality proposed by Cohen and Merhav. These novel tight bounds are developed for optimal maximum a posteriori (MAP) coherent detectors with nonuniform signalling over additive white Gaussian noise channel. The results are compared to the state-of-the-art KAT lower bounds and it is shown that the superiority of one bound to another is dependent on the signal constellation, the amount of nonuniformity of the Bernoulli source to be communicated, and the SNR range of interest. For instance, for smaller deviations from the uniform case, which are in fact more plausible, and at low SNRs, the new bounds are tighter than KAT lower bounds for all the constellations studied. - Author(s): A. Lodhi ; F. Said ; M. Dohler ; A.H. Aghvami
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 633 –638
- DOI: 10.1049/ip-com:20050239
- Type: Article
- + Show details - Hide details
-
p.
633
–638
(6)
Spatial diversity is a widely applied technique for enhancing the wireless system performance, since it greatly reduces the detrimental effects of multipath fading. Orthogonal space-time block codes are considered to be a good choice for spatial diversity, as they provide full diversity without any channel state information at the transmitter. The standard frequency domain application of these block codes for OFDM-based systems requires multiple inverse fast Fourier transform operations per OFDM symbol. This increases the system computational load, which grows with the increasing number of transmit antennas and sub-carriers. By using well-known properties of the discrete Fourier transform, we propose a time domain encoding of these codes, thereby requiring only one transformation per OFDM symbol. The proposed encoding strategy significantly reduces the computational load and hence facilitates implementation. - Author(s): D. Zheng ; V.K. Wei ; K.F. Chen
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 639 –644
- DOI: 10.1049/ip-com:20050167
- Type: Article
- + Show details - Hide details
-
p.
639
–644
(6)
Recently, a linkable ring signature scheme (called the LWW signature scheme), exhibiting the properties of anonymity, linkability and spontaneity, was presented. Its security is based on the decision Diffie–Hellman (DDH) problem. The distinguishing feature of the LWW signature scheme that differentiates it from other ring signature schemes is linkability, i.e. two signatures by the same signer can be linked. The LWW scheme can be used to construct new efficient e-voting systems. The drawback of the LWW scheme is that it works well on a group where the DDH problem is hard, but does not work on a GDH group where the DDH problem is easy and the computational Diffie–Hellman (CDH) problem is hard. In this paper, a linkable ring signature scheme is presented, based on a GDH group with anonymity, linkability and spontaneity. The security of the scheme is reduced to the discrete logarithm and a new intractability assumption (called DPDH problem) under the random oracle model. - Author(s): M. Noh ; Y. Lee ; H. Park
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 645 –650
- DOI: 10.1049/ip-com:20050026
- Type: Article
- + Show details - Hide details
-
p.
645
–650
(6)
The authors propose low complexity versions of a linear minimum mean square error (LMMSE) channel estimator for orthogonal frequency division multiplexing (OFDM) systems. They partition the channel autocorrelation matrix in the LMMSE estimator into small sub-matrices. The size of sub-matrix is determined by channel coherence bandwidth, a range of highly correlated channel frequency responses. Since the proposed estimator uses small sub-matrices instead of the whole channel auto-correlation matrix, the complexity is significantly reduced in spite of slight performance degradation. The performance of mean square error (MSE) has been evaluated in an exponential decay channel model through computer simulation to verify the validities of proposed schemes. - Author(s): N.H. Nedev ; S. McLaughlin ; D.I. Laurenson
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 651 –656
- DOI: 10.1049/ip-com:20050471
- Type: Article
- + Show details - Hide details
-
p.
651
–656
(6)
Impulse noise is a major limiting factor to the performance of digital subscriber lines, powerline communication systems, and digital TV. Research has shown that the impulse noise in all those transmission media has very similar statistical properties. Using noise distribution parameters for the specific case of telephone lines, this paper suggests a Bernoulli–Weibull model of impulse noise in the local loop at symbol level. This model is then applied to develop closed-form expressions for the error probability of PAM and single carrier QAM. A novel extension of the distribution of the impulse noise amplitudes to two dimensions is introduced to enable the analysis of two-dimensional modulations, such as QAM. It is shown that earlier noise models, which assume Gaussian distributed impulse amplitudes or Rayleigh distributed powers, produce overly optimistic results for the errors owing to impulse noise in comparison with the Bernoulli–Weibull model presented here. The error performance of multicarrier QAM (DMT) is also evaluated based on the Bernoulli–Weibull model, however this is done numerically owing to the lack of an analytical solution. It is shown that multicarrier QAM performs better than single carrier systems but only for low impulse power and low impulse probability. The analytical framework presented here is also directly applicable to powerline transmission and DVB-T systems as they have very similar impulse noise statistics to those in telephone lines. - Author(s): Y. Lee and W.-R. Wu
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 657 –663
- DOI: 10.1049/ip-com:20050569
- Type: Article
- + Show details - Hide details
-
p.
657
–663
(7)
Error propagation can seriously affect the performance of an adaptive decision feedback equaliser (DFE), especially when operated in time-varying channel environments. Error propagation not only affects DFE decisions, but also disturbs the DFE adaptation. The paper focuses on improving the robustness against error propagation for the least-mean-square (LMS) based minimum mean-squared-error DFE (MMSE-DFE). A specifically designed channel estimator is introduced to help the DFE adaptation in the decision-directed (DD) mode. Unlike the conventional DFE, the proposed adaptive channel-aided DFE (ACA-DFE) only adapts the feedforward filter with the LMS algorithm. The feedback filter, however, is obtained from the postcursors of the estimated channel convolved with the feedforward filter. As a result, the proposed ACA-DFE can reduce the error propagation effect and perform better than the conventional adaptive DFE. We also demonstrate that the ACA-DFE can be extended to multiple-input multiple-out (MIMO) systems improving the performance of the conventional MIMO DFE. - Author(s): B. De Schepper ; B. Steyaert ; S. Wittevrongel ; M. Moeneclaey ; H. Bruneel
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 664 –670
- DOI: 10.1049/ip-com:20050138
- Type: Article
- + Show details - Hide details
-
p.
664
–670
(7)
The authors consider an integrated switching element with a shared buffer memory and a constant hardware delay. This hardware delay is caused by the hardware operations required to process the routing information of incoming cells. A general uncorrelated cell arrival process in the switch, an independent and uniform routing process of cells from the inlets to the outlets of the switch and a first-come-first-served queueing discipline are assumed. The performance of the switching element is evaluated by means of an analytical technique based on an extensive use of probability generating functions. Explicit expressions for the probability generating functions, the mean values, the variances and the tail probabilities of the occupancy and the cell delay of the switch are obtained. Numerical examples show that the hardware delay has an important impact on the switch performance. - Author(s): B. Zhang and H.T. Mouftah
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 671 –674
- DOI: 10.1049/ip-com:20050509
- Type: Article
- + Show details - Hide details
-
p.
671
–674
(4)
QoS routing has been a critical issue for providing QoS in high-speed networks. The authors present the design of a fast routing algorithm for selecting the shortest path connecting a pair of nodes subject to a bandwidth constraint. The algorithm works by combining the strategies of informed search and backwards routing. Its worst-case computational complexity is deduced to be O(∣E∣lg∣V∣), where ∣E∣ and ∣V∣ represent the number of links and nodes in the network, respectively. Simulation results indicate, however, that the designed algorithm can greatly reduce the average-case running time in computing such constrained shortest paths as compared with existing work. - Author(s): H. Yin ; C. Lin ; G. Min ; X. Chu
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 675 –682
- DOI: 10.1049/ip-com:20050671
- Type: Article
- + Show details - Hide details
-
p.
675
–682
(8)
Owing to the existence of noticeable concentrated periods of contention and idleness, self-similar traffic can greatly increase packet delay and loss probability and thus reduce system resource utilisation. The development of efficient congestion control mechanisms plays a central role in the improvement of network quality of service (QoS), in particular for real-time multimedia applications. By exploiting the property of scale-invariant burstiness and correlation inherent in self-similar traffic, the authors propose an effective congestion control scheme, named adaptive wavelet and probability-based scheme (AWP), which concurrently operates over multiple time scales. AWP adopts the extended multifractal wavelet model (EMWM) for analysing estimated traffic volume across multiple time scales. Furthermore, a new auto-correction algorithm based on Bayes’ theory for confidence analysis is employed to examine the validity of the predicted information. The analysis results can be used to enhance the adaptability of the prediction algorithm. In particular, the AWP framework can be easily extended to more than two time scales by increasing the level of wavelet transforms, which brings AWP a natural advantage in implementation and scalability. A series of simulation experiments have demonstrated that the proposed AWP scheme is superior to TCP and TFRC as it can greatly improve the QoS of multimedia data transmission while avoiding congestion collapse on the network. - Author(s): O. Holland ; A. Golaup ; A.H. Aghvami
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 683 –690
- DOI: 10.1049/ip-com:20045155
- Type: Article
- + Show details - Hide details
-
p.
683
–690
(8)
In recent years, there has been an increasing proliferation of reasons for software/firmware in desktop computers to be upgraded over the Internet, and as computational devices continue to become ever more advanced and compact, it is anticipated that the same will be the case for mobile terminals in the near future. In this paper, we consider some important characteristics of such upgrade traffic. Initially, we study file size distributions for various file types on a range of servers/systems, and conclude that the Pareto distribution, as is often used to represent file sizes, is inappropriate. In fact, in order to achieve a better fit to the bulk of the distribution while still maintaining an infinite variance, file sizes are usually far better represented by the Pareto type 2 (Lomax) distribution. Leading on from this, we simulate multiple concurrent files being downloaded over a bottleneck link, taken from particular file-size distributions with a focus on mobile terminal reconfiguration. In doing so, we investigate the degree of burstiness/self-similarity and correlation structure in the resulting traffic. Understanding these phenomena is particularly important because of their tendencies to increase packet losses and queuing delays through compound fluctuations in link loads. - Author(s): J. Noonan ; P. Perry ; J. Murphy
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 691 –696
- DOI: 10.1049/ip-com:20050294
- Type: Article
- + Show details - Hide details
-
p.
691
–696
(6)
It is proposed to implement a synchronised routing table at the transport layer, referred to as an association routing table (ART), to improve the performance of multi-homed transport protocols. An algorithm is described that ensures that the routing tables can be synchronised, which is then used to implement a handover mechanism. The ART is implemented within the stream control transmission protocol (SCTP). It is shown that by using a synchronised ART, it is possible to implement failover in cases where the standard SCTP cannot do so, Configurations are more resilient to network errors, and it is possible to perform a handover without any network support. - Author(s): G.A. Safdar and W.G. Scanlon
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 697 –704
- DOI: 10.1049/ip-com:20045093
- Type: Article
- + Show details - Hide details
-
p.
697
–704
(8)
Wireless enabled portable devices must operate with the highest possible energy efficiency while still maintaining a minimum level and quality of service to meet the user's expectations. The authors analyse the performance of a new pointer-based medium access control protocol that was designed to significantly improve the energy efficiency of user terminals in wireless local area networks. The new protocol, pointer controlled slot allocation and resynchronisation protocol (PCSAR), is based on the existing IEEE 802.11 point coordination function (PCF) standard. PCSAR reduces energy consumption by removing the need for power saving stations to remain awake and listen to the channel. Using OPNET, simulations were performed under symmetric channel loading conditions to compare the performance of PCSAR with the infrastructure power saving mode of IEEE 802.11, PCF-PS. The simulation results demonstrate a significant improvement in energy efficiency without significant reduction in performance when using PCSAR. For a wireless network consisting of an access point and 8 stations in power saving mode, the energy saving was up to 31% while using PCSAR instead of PCF-PS, depending upon frame error rate and load. The results also show that PCSAR offers significantly reduced uplink access delay over PCF-PS while modestly improving uplink throughput. - Author(s): Z. Zeinalpour-Yazdi and M. Nasiri-Kenari
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 705 –718
- DOI: 10.1049/ip-com:20050591
- Type: Article
- + Show details - Hide details
-
p.
705
–718
(14)
The multiuser performance of two kinds of ultra-wideband (UWB) systems, namely, multi-carrier frequency-hopping-UWB and time-hopping-UWB, is evaluated. We derive the bit error rate of these systems in both AWGN and fading channels. Our numerical results show that the TH-UWB system always outperforms the MC-FH-UWB system with non-coherent detection. However, the MC-FH-UWB system with coherent detection presents a better performance than TH-UWB in a very few cases. Then, we use a practical low-rate convolutional error correcting code, which does not require any extra bandwidth further than that needed by the uncoded scheme, to improve the system performance. The results show that the coded scheme significantly outperforms the uncoded scheme in both AWGN and fading channels. Furthermore, the results indicate that, like in the uncoded scheme, in the coded scheme the TH-UWB system performs better than the MC-FH-UWB system. - Author(s): T. Liu and S. Gazor
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 719 –724
- DOI: 10.1049/ip-com:20060027
- Type: Article
- + Show details - Hide details
-
p.
719
–724
(6)
A per-survivor processing (PSP) maximum likelihood sequence detection (MLSD) receiver is developed for a fast time-varying frequency-selective Rayleigh fading channel with coloured additive noise, which follows an autoregressive (AR) model with unknown parameters. The correlation between noise samples is exploited to considerably enhance the performance of the communications. The maximum likelihood criterion is employed based on unknown noise parameters. This criterion has some desired properties, e.g. it has a unique joint minimum at the true values of the channel and the noise parameters. The new PSP–MLSD algorithm detects the input data and jointly estimates the noise and the channel parameters all together. The proposed structure can be viewed as a traditional PSP–MLSD receiver combined with an adaptive whitening filter. In a coloured noise environment, this scheme offers a faster tracking property, more accurate estimation of the channel and a substantially lower error probability compared with the traditional PSP–MLSD structure. The signal-to-noise ratio (SNR) improvement achieved by the proposed receiver, which can be called the noise whitening gain (NWG), is almost equal to the ratio of the energy of the additive noise to the energy of the unpredictable noise component. The square of the NWG gives also an accurate approximation for the bit error rate (BER) improvement ratio obtained by using the proposed algorithm compared with the traditional one. - Author(s): R. Liu ; X. Ren ; E.G. Chester ; B.S. Sharif ; S. Zhou ; Z. Zhou
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 725 –732
- DOI: 10.1049/ip-com:20045068
- Type: Article
- + Show details - Hide details
-
p.
725
–732
(8)
The asymptotic spectral efficiency of multicarrier CDMA (MC-CDMA) with multiple transmit and receive antennas is analysed in this paper. The closed-form spectral efficiency is derived when matched filter and minimum mean square error (MMSE) front ends are employed. We consider the effect of the number of transmit and receive antennas on the performance of spectral efficiency. The spectral efficiency can be improved by choosing an appropriate loading factor and number of antennas in the transmitter and receiver. We also compare the spectral efficiency of MC-CDMA with that of SC-CDMA (single-carrier CDMA). - Author(s): W.Y. Leong and J. Homer
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 733 –739
- DOI: 10.1049/ip-com:20045256
- Type: Article
- + Show details - Hide details
-
p.
733
–739
(7)
We consider blind signal detection in an asynchronous code-division multiple-access (CDMA) system employing short spreading sequences in the presence of unknown multipath fading. This approach is capable of countering the presence of multiple-access interference (MAI) in CDMA fading channels. The proposed blind multiuser detector is based on an independent component analysis (ICA) to mitigate both MAI and noise. This algorithm has been utilised in blind source separation (BSS) of unknown sources from their mixtures. It can also be used for estimating the basis vectors of BSS. The aim is to include an ICA algorithm within a wireless receiver in order to reduce the level of interference in wideband systems. This blind multiuser detector requires no training sequence compared with the conventional multiuser detection receiver. The proposed ICA blind multiuser detector is made robust with respect to knowledge of signature waveforms and the timing of the user of interest. Several experiments are performed in order to verify the validity of the proposed ICA algorithm. - Author(s): J. Kim and C.-K. Lee
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 740 –745
- DOI: 10.1049/ip-com:20050301
- Type: Article
- + Show details - Hide details
-
p.
740
–745
(6)
In frequency-hopping one-coincidence sequences, a specified distance between two adjacent symbols is usually employed to reduce the interference among sequences. We propose a new algorithm to construct one-coincidence sequence sets satisfying distance constraints. Compared to the conventional method, our approach provides a more flexible and general way to generate one-coincidence sequences of variable lengths. We also obtain a tighter upper bound for one-coincidence sequences of odd length, which is independent of code lengths. - Author(s): T.X. Lai ; T.A. Tran ; A.B. Sesay
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 746 –754
- DOI: 10.1049/ip-com:20050329
- Type: Article
- + Show details - Hide details
-
p.
746
–754
(9)
We propose a multi-stage successive interference cancellation (SIC) receiver for arbitrary linear space–time block codes (STBCs) over general time–frequency selective fading channels with single-carrier (SC) transmissions. The proposed receiver adopts the SIC approach to handle inter-symbol interference (ISI) owing to multipath propagation. Simulation results show that the proposed receiver outperforms the OFDM system after a few iterations in the BER range 10−3 to 10−5. We also propose a diversity enhancement space–time signalling scheme for four transmit antennas with an increased diversity order. Simulation results show that the proposed diversity enhancement scheme outperforms the OFDM system even at the first iteration. - Author(s): D.B. Smith and T.D. Abhayapala
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 755 –761
- DOI: 10.1049/ip-com:20050222
- Type: Article
- + Show details - Hide details
-
p.
755
–761
(7)
The authors present a novel theoretical method to analyse the maximal ratio combining (MRC) receivers using BPSK and M-PSK modulation in spatially correlated Rayleigh fading channels, with perfect and imperfect channel knowledge, in terms of antenna array configuration and parameters of scatterer distributions. In this analysis closed form expressions for error probabilities of these modulations with MRC are derived, allowing for non-distinct eigenvalues from the channel gain correlation matrix. The results of performance analysis assuming different receiver configurations and scattering scenarios presented give valuable insight into the performance of MRC in practical Rayleigh fading scenarios for isotropic and non-isotropic scatterer distributions. - Author(s): L. Zhao ; G. Yao ; J.W. Mark
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 762 –770
- DOI: 10.1049/ip-com:20050142
- Type: Article
- + Show details - Hide details
-
p.
762
–770
(9)
A novel mobile position location procedure, based on the relaying capability of the mobile stations in a hybrid cellular/peer-to-peer ad hoc network to improve positioning coverage and accuracy, is proposed. The proposed mobile location scheme is a hierarchical-structured flooding procedure, making use of the relaying capability of mobile stations to achieve location diversity. Simulation results show that the proposed positioning scheme offers improvement in coverage and accuracy compared to conventional positioning methods reported in the literature. With the increase of the mobiles in the system, the coverage of the conventional system does not change. However, the coverage of the proposed discovery mechanism monotonically increases towards 100% by exploiting location diversity. The gain of the coverage is also promising when cell size is large, where the conventional methods suffer the hearability problem. - Author(s): J.K.L. Wong ; A.J. Mason ; M.J. Neve ; K.W. Sowerby
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 771 –778
- DOI: 10.1049/ip-com:20050013
- Type: Article
- + Show details - Hide details
-
p.
771
–778
(8)
The placement of base stations is an important issue in planning wireless systems because it can have a significant influence on the overall system performance. In this paper, we propose a novel binary integer programming formulation of the base station placement problem that allows the user to find an optimal base station configuration in an interference-limited CDMA system using the branch-and-bound (B&B) method. The results are compared to those obtained from a customised version of genetic algorithm (GA). It is shown that although the B&B method guarantees an optimal solution, its computational time increases dramatically with the size of the problem and hence its application may be restricted to small problems. In contrast, although the customised GA method does not guarantee an optimal solution, it is shown to be effective in solving the base station placement problem in most cases and its computational time does not increase as dramatically as the B&B method. This observation suggests that the GA may be useful for solving larger problems where the B&B method fails to find a solution within a reasonable time. - Author(s): H. Kong and C. Phillips
- Source: IEE Proceedings - Communications, Volume 153, Issue 5, p. 779 –786
- DOI: 10.1049/ip-com:20050285
- Type: Article
- + Show details - Hide details
-
p.
779
–786
(8)
In future wavelength-division multiplexed (WDM) networks, traffic flows are likely to be delivered via dynamic lightpath provisioning with end-to-end quality of service (QoS) support. Typically for guaranteed services, two-way acknowledged lightpath setup protocols are preferred rather than one-way unacknowledged protocols. However, in large backbones, the overhead in two-way reservation mechanisms is high due to the latencies involved, thus limiting the support for latency-sensitive applications. The authors propose a pre-booking mechanism to overcome the high reservation overhead in traditional reactive two-way reservation protocols. It excludes lightpath acknowledgment delay from the lightpath holding time by ‘pre-booking’ each burst/flow based on the estimated characteristics of the arriving traffic, thus empirically improving resource utilisation. The proposed mechanism is investigated with both constant bit rate and self-similar traffic. The results demonstrate that in large networks, such as NSFNET, the proposed pre-booking mechanism is able to bring significant benefits in terms of blocking probability and lightpath bandwidth efficiency. For example, with a maximum acceptable end-to-end delay of 90 milliseconds and a 1 in 10−4bit loss tolerance, our pre-booking mechanism yields approximately double the supported traffic load relative to the familiar wavelength-routed optical burst switching architecture.
New linear codes derived from binary cyclic codes of length 151
Improved performance SOVA turbo decoder
Geometric augmented product codes
Hybrid list decoding and Kaneko algorithm of Reed–Solomon codes
Asymmetric rate compatible turbo codes in hybrid automatic repeat request schemes
ARQ scheme with adaptive block size for bidirectional wireless endoscopy system
Multi-interval line coding technique for high speed transmissions
Tight lower bounds on the symbol error rate of uncoded nonuniform signalling over AWGN channel
Time domain implementation of space-time/frequency block codes for OFDM systems
GDH group-based signature scheme with linkability
Low complexity LMMSE channel estimation for OFDM
Estimating errors in transmission systems due to impulse noise
Adaptive channel aided decision feedback equalisation for SISO and MIMO systems
Constant hardware delay in integrated switching elements with multiserver output queues
Fast bandwidth-constrained shortest path routing algorithm
Effective congestion control for QoS enhancement of self-similar multimedia traffic
Traffic characteristics of aggregated module downloads for mobile terminal reconfiguration
End-point synchronisation and handover for multi-homed services
Performance analysis of an improved power-saving medium access protocol for IEEE 802.11 point coordination function WLAN
Performance analysis and comparisons of different ultra-wideband multiple access modulation schemes
Adaptive MLSD receiver employing noise correlation
Asymptotic spectral efficiency of MC-CDMA with multiple antennas
Blind multiuser receiver for DS-CDMA wireless system
Generation and upper bound of one-coincidence sequences in frequency-hopping multiple-access systems
Single-carrier and multi-carrier space–time block coded transmissions over doubly selective fading channels
Maximal ratio combining performance analysis in practical Rayleigh fading channels
Mobile positioning based on relaying capability of mobile stations in hybrid wireless networks
Base station placement in indoor wireless systems using binary integer programming
Pre-booking for reduced reservation overhead in long haul wavelength-division multiplexed (WDM) networks
Most viewed content for this Journal
Article
content/journals/ip-com
Journal
5
Most cited content for this Journal
We currently have no most cited data available for this content.
