In a power grid used to distribute electricity, optical fibers can be inserted inside overhead ground wires to form an optical network infrastructure for data communications. Dense wavelength division multiplexing (DWDM)-based optical networks present a promising approach to achieve a scalable backbone network for power grids. This paper proposes a complete optimization procedure for optical network designs based on an existing power grid. We design a network as a subgraph of the power grid and divide the network topology into two layers: backbone and access networks. The design procedure includes physical topology design, routing and wavelength assignment (RWA) and optical amplifier placement. We formulate the problem of topology design into two steps: selecting the concentrator nodes and their node members, and finding the connections among concentrators subject to the two-connectivity constraint on the backbone topology. Selection and connection of concentrators are done using integer linear programming (ILP). For RWA and optical amplifier placement problem, we solve these two problems together since they are closely related. Since the ILP for solving these two problems becomes intractable with increasing network size, we propose a simulated annealing approach. We choose a neighborhood structure based on path-switching operations using k shortest paths for each source and destination pair. The optimal number of optical amplifiers is solved based on local search among these neighbors. We solve and present some numerical results for several randomly generated power grid topologies.

View full abstract

In this paper, we propose a mitigation system of high-level multiple access interference (MAI) for multimedia optical Code-Division Multiple-Access (CDMA) systems using the optical power selector (OPS). The proposed system can eliminate high-intensity MAI at the receiver for low-priority users. Moreover, the proposed system can reduce by half the required number of code sequences compared to the conventional scheme. As a result, the proposed system can increase the number of weights at the same code-length and, thus, obtain higher code spreading gain. We analyze performances of the proposed system and show that both high-priority users and low-priority users achieve lower bit error rates in comparison to the conventional scheme.

View full abstract

In optical burst switching (OBS) networks, burst with different numbers of hops experience unfairness in terms of the burst loss probability. In this paper, we propose a preemptive scheme based on the number of transit hops in OBS networks. In our proposed scheme, preemption is performed with two thresholds; one is for the total number of hops of a burst and the other is for the number of transit hops the burst has passed through. We evaluate the performance of the scheme by simulation, and numerical examples show that the proposed scheme improves the fairness among the bursts with different numbers of hops, keeping the overall burst loss probability the same as that for the conventional OBS transmission without preemption.

View full abstract

Delay jitter degrades the quality of delay-sensitive live media streaming. We investigate the use of multipath transmission with two paths to reduce delay jitter and, in this paper, propose a nearly equal delay path set configuration (NEED-PC) scheme that further improves the performance of the multipath delay jitter reduction method for delay-sensitive live media streaming. The NEED-PC scheme configures a pair of a maximally node-disjoint paths that have nearly equal path delays and satisfy a given delay constraint. The results of our simulation experiments show that path sets configured by the NEED-PC scheme exhibit better delay jitter reduction characteristics than a conventional scheme that chooses the shortest path as the primary path. We evaluate the performance of path sets configured by the NEED-PC scheme and find that the NEED-PC scheme reduces delay jitter when it is applied to a multipath delay jitter reduction method. We also investigate the trade-off between reduced delay jitter and the increased traffic load incurred by applying multipath transmission to more flows. The results show that the NEED-PC scheme is practically effective even if the amount of additional redundant traffic caused by using multipath transmission is taken into account.

View full abstract

To guarantee strict Quality of Service (QoS) for real-time applications, we have previously proposed an output buffer control mechanism in IP routers, confirmed its effectiveness through simulations, and implemented a prototype. This mechanism can guarantee strict QoS within a single router. In this paper, we propose a control scheme of cooperation between IP routers equipped with this mechanism by using one of the signaling protocols. Our proposed scheme aims to stabilize End-to-End (E2E) flow delay within the target delay. In addition, our mechanism dynamically updates reserved resources between IP routers to improve E2E packet loss rate. We present an implemented design of our scheme and an empirical evaluation of the implementation. These results show quantitatively how our scheme improves the quality of video pictures.

View full abstract

In this paper, proactive data filtering (PDF) algorithm is proposed for data aggregation (or data fusion) in wireless sensor networks. The objective of the algorithm is to further reduce the energy consumption when sensor nodes perform data aggregation. In many applications, the sensor field will be overwhelmed by unnecessary and redundant sensory information when the sink node disseminates a query throughout the sensor field. In order to reduce the energy consumption, our scheme employs intelligent decision logic in the sensor node which delays or deactivates the transmission of its response. A performance evaluation shows that data aggregation with the PDF significantly improves energy-efficiency.

View full abstract

This paper proposes a scheme for hard handover (HO) between base stations (BSs) that combines bicast with forwarding; it realizes packet-lossless HO as well as low HO control delay. The proposed scheme observes the status of the current channel condition and initiates bicasting, the simultaneous transfer of IP packets from the access router to both the old BS and the new BS, when the probability of HO becomes high; this reduces the control delay imposed by hard HO. When HO becomes unavoidable, only those IP packets remaining in the old BS buffer that are not shared with the new BS are forwarded to the MS; this prevents the loss of IP packets. Computer simulations show that the proposed scheme reduces the HO control delay at 95% cumulative distribution function (CDF) by approximately 1700 (300) msec, 340 (320) msec, and 170 (330) msec compared to the conventional forwarding scheme (the conventional bicast scheme) when the number of users is 80 and the maximum Doppler frequency (fd_max) is 5.55Hz and data rate (D) on the wired propagation channel is 10, 50, and 100Mbps, respectively. The results confirm the superiority of the proposed scheme as an IP packet loss prevention scheme for hard HO.

View full abstract

We present a TCP flow level performance evaluation on error rate aware scheduling algorithms in Evolved UTRA and UTRAN networks. With the introduction of the error rate, which is the probability of transmission failure under a given wireless condition and the instantaneous transmission rate, the transmission efficiency can be improved without sacrificing the balance between system performance and user fairness. The performance comparison with and without error rate awareness is carried out dependant on various TCP traffic models, user channel conditions, schedulers with different fairness constraints, and automatic repeat request (ARQ) types. The results indicate that error rate awareness can make the resource allocation more reasonable and effectively improve the system and individual performance, especially for poor channel condition users.

View full abstract

This paper proposes a novel technique in designing the optimum pulse shape for ultra wideband (UWB) systems under the presence of timing jitter. In the UWB systems, pulse transmission power and timing jitter tolerance are crucial keys to communications success. While there is a strong desire to maximize both of them, one must be traded off against the other. In the literature, much effort has been devoted to separately optimize each of them without considering the drawback to the other. In this paper, both factors are jointly considered. The proposed pulse attains the adequate power to survive the noise floor and at the same time provides good resistance to the timing jitter. The proposed pulse also meets the power spectral mask restriction as prescribed by the Federal Communications Commission (FCC) for indoor UWB systems. Simulation results confirm the advantages of the proposed pulse over other previously known UWB pulses. Parameters of the proposed optimization algorithm are also investigated in this paper.

View full abstract

One of the disadvantages of using OFDM is the larger peak to averaged power ratio (PAPR) in its time domain signal as compared with the conventional single carrier modulation method. The larger PAPR signal would course the fatal degradation of bit error rate (BER) performance due to the inter-modulation noise occurring in the non-linear amplifier. To overcome this problem, this paper proposes a simple PAPR reduction method by using dummy sub-carriers, which can achieve the better PAPR performance with less computational complexity than the conventional method. This paper presents various computer simulation results to verify the effectiveness of proposed method as comparing with the conventional method in the non-linear channel.

View full abstract

Recently, multi-carrier code division multiple access (MC-CDMA) has been attracting much attention as a broadband wireless access technique for the next generation mobile communication systems. Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can take advantage of the channel frequency-selectivity and improve the average bit error rate (BER) performance due to frequency-diversity gain. The conventional FDE requires the insertion of the guard interval (GI) to avoid the inter-block interference (IBI), resulting in the transmission efficiency loss. In this paper, an overlap FDE technique, which requires no GI insertion, is presented for MC-CDMA transmission. An expression for the conditional BER is derived for the given set of channel gains. The average BER performance in a frequency-selective Rayleigh fading channel is evaluated by Monte-Carlo numerical computation method using the derived conditional BER and is confirmed by computer simulation of the signal transmission.

View full abstract

It is well known that cooperative transmission among the single antenna wireless nodes and a proper combining at destination can obtain spatial diversity. In this paper, we introduce a new form of combining technique in cooperative communication. For a coded transmission scheme code-combining can obtain a near optimal low rate code by combining repeated codewords. Instead of MRC (maximal ratio combining) based combining of received coded packets from source and relays, we propose a simple code-combining at destination. For same data, rate and power consumption code-combining offers better or similar performance with less complexity than MRC. Moreover using a puncturing technique at the relay we can get a same diversity order as MRC with reduced packet relaying time; equivalently, with higher data rate for over all system. This reduction of transmission time at relay allows us to increase the diversity order by using more than one relay for one source; where each relay forwards a punctured portion of received data. Alternatively, when the relays are not available to improve diversity order, we can use only one relay to cooperate M source nodes where all sources obtain a diversity order of 2 with a higher data rate.

View full abstract

In this paper, we analyze the effects of IQ (In-phase/Quadrature-phase) imbalance at both transmitter and receiver of OFDM (Orthogonal Frequency Division Multiplexing) system and show that more diversity gain can be achieved even though there are unwanted IQ imbalance. When mixed sub-carriers within an OFDM symbol due to the IQ imbalance undergo frequency selective channels, additional diversity effects are expected during the demodulation process. Simulation results on the symbol error rate (SER) performance with ML (Maximum Likelihood) and OSIC (Ordered Successive Interference Cancellation) receiver show that significant performance gain can be achieved with the diversity gain caused by the IQ imbalance combined with the frequency selective channels.

View full abstract

This study deals with two linear precoders: the maximization of the minimum Euclidean distance between received symbol-vectors, called here max-d_min, and the maximization of the post-processing signal-to-noise ratio termed max-SNR or beamforming. Both have been designed for reliable MIMO transmissions operating over uncorrelated Rayleigh fading channels. Here, we will explain why performances in terms of bit error rates show a significant enhancement of the max-d_min over the max-SNR whenever the number of antennas is increased. Then, from theoretical developments, we will demonstrate that, like the max-SNR precoder, the max-d_min precoder achieves the maximum diversity order, which is warrant of reliable transmissions. The current theoretical knowledge will be applied to the case-study of a system with two transmit- or two receive-antennas to calculate the probability density functions of two channel parameters directly linked to precoder performances for uncorrelated Rayleigh fading channels. At last, this calculation will allow us to quickly get the BER of the max-d_min precoder further to the derivation of a tight semi-theoretical approximation.

View full abstract

Multiple-Input Multiple-Output (MIMO) systems can achieve high data-rate and high capacity transmission. In MIMO systems, eigen-beam space division multiplexing (E-SDM) that achieves much higher capacity by weighting at the transmitter based on feedback channel state information (CSI) has been studied. Early studies for E-SDM have assumed perfect CSI at the transmitter. However, in practice, the CSI fed back to the transmitter from the receiver becomes outdated due to the time-varying nature of the channels and feedback delay. Therefore, an outdated E-SDM cannot achieve the full performance possible. In this paper, we evaluate the performance of E-SDM with methods for reducing performance degradation due to feedback delay. We use three methods; 1) method that predicts CSI at future times when it will be used and feeds the predicted CSI back to the transmitter (denoted hereafter as channel prediction); 2), 3) method that uses the receive weight based on zero-forcing (ZF) or minimum mean square error (MMSE) criterion instead of those based on singular value decomposition (SVD) criterion (denoted hereafter as ZF or MMSE-based receive weight). We also propose methods that combine channel prediction with ZF or MMSE-based receive weight. Simulation results show that bit error rate (BER) degradation of E-SDM in the presence of feedback delay is reduced by using methods for reducing performance degradation due to feedback delay. We also show that methods that combine channel prediction with ZF or MMSE-based receive weight can achieve good BER even when the large feedback delay exists.

View full abstract

This paper proposes a likelihood estimation method for reduced-complexity maximum-likelihood (ML) detectors in a multiple-input multiple-output (MIMO) spatial-multiplexing (SM) system. Reduced-complexity ML detectors, e. g., Sphere Decoder (SD) and QR decomposition (QRD)-M algorithm, are very promising as MIMO detectors because they can estimate the ML or a quasi-ML symbol with very low computational complexity. However, they may lose likelihood information about signal vectors having the opposite bit to the hard decision and bit error rate performance of the reduced-complexity ML detectors are inferior to that of the ML detector when soft-decision decoding is employed. This paper proposes a simple estimation method of the lost likelihood information suitable for the reduced-complexity ML detectors. The proposed likelihood estimation method is applicable to any reduced-complexity ML detectors and produces accurate soft-decision bits. Computer simulation confirms that the proposed method provides excellent decoding performance, keeping the advantage of low computational cost of the reduced-complexity ML detectors.

View full abstract

A radio-on-dense-wavelength-division-multiplexing (DWDM) transport system based on injection-locked Fabry-Perot laser diodes (FP LDs) with four microwave carriers and large effective area fiber (LEAF) transmission was proposed and demonstrated. Good performance of bit error rate (BER) and intermodulation distortion to carrier ratio (IMD/C) over a-50km of LEAF was obtained. Signal quality meets the demands of personal handy system (PHS)/vehicle information and communication system (VICS)/electronic toll collection (ETC)/satellite broadcasting (SB).

View full abstract

Much research has shown that a carefully designed auto rate medium access control can utilize the underlying physical multi-rate capability to exploit the time-variation of the channel. In this paper, we develop a simple analytical model to elucidate the rule that maximizes the throughput of RTS/CTS based multi-rate wireless local area networks. Based on the discovered rule, we propose two distributed fair auto rate medium access control schemes called FARM and FARM+ from the view-point of throughput fairness and time-share fairness, respectively. With the proposed schemes, after receiving a RTS frame, the receiver selectively returns the CTS frame to inform the transmitter the maximum feasible rate probed by the signal-to-noise ratio of the received RTS frame. The key feature of the proposed schemes is that they are capable of maintaining throughput/time-share fairness in asymmetric situation where the distribution of SNR varies with stations. Extensive simulation results show that the proposed schemes outperform the existing throughput/time-share fair auto rate schemes in time-varying channel conditions.

View full abstract

In order to achieve the prioritized quality of service (QoS) guarantee, the IEEE 802.11e EDCAF (the enhanced distributed channel access function) provides the distinguished services by configuring the different QoS parameters to different access categories (ACs). An admission control scheme is needed to maximize the utilization of wireless channel. Most of papers study throughput improvement by solving the complicated multidimensional Markov-chain model. In this paper, we introduce a back-off model to study the transmission probability of the different arbitration interframe space number (AIFSN) and the minimum contention window size (CW_min). We propose an adaptive control scheme (ACS) to dynamically update AIFSN and CW_min based on the periodical monitoring of current channel status and QoS requirements to achieve the specific service differentiation at access points (AP). This paper provides an effective tuning mechanism for improving QoS in WLAN. Analytical and simulation results show that the proposed scheme outperforms the basic EDCAF in terms of throughput and service differentiation especially at high collision rate.

View full abstract

A lightweight and high gain planar antenna for space use is realized with radial waveguide slotted array and honeycomb structure with the weight of 1.16kg and the diameter of 920.5mm. The slot coupling is analyzed by method of moments considering the hybrid mode in the multi-layer waveguide structure. The propagation constant of the honeycomb structure is measured and the low-loss property is obtained at the frequency range of 8GHz. The fabricated RLSA is measured and the reflection is around -10dB in 8GHz band. The measured aperture fields agree with the calculation in the radial direction. In the azimuthal direction, on the other hand, the fields show ripples of 6dB and 60 degree. The gain of 35.9dBi with the efficiency of 58.7% is obtained at 8.6GHz.

View full abstract

This paper presents a target location estimation method that can use a pair of leaky coaxial cables to determine the 2D coordinates of the target. Since convention location techniques using leaky coaxial cables can find a target location along the cable in 1D, they have been unable to locate it in 2D planes. The proposed method enables us to estimate target on a 2D plane using; 1) a beam-forming technique and 2) a reconstruction technique based on Hough transform. Leaky coaxial cables are equipped with numerous slots at regular interval, which can be utilized as antenna arrays that acts both as transmitters and receivers. By completely exploiting this specific characteristic of leaky coaxial cables, we carried out an antenna array analysis that performs in a beam-forming fashion. Simulation and experimental results support the effectiveness of the proposed target location method.

View full abstract

Orbit estimation of space debris, objects of no inherent value orbiting the earth, is a task that is important for avoiding collisions with spacecraft. The Kamisaibara Spaceguard Center radar system was built in 2004 as the first radar facility in Japan devoted to the observation of space debris. In order to detect the smaller debris, coherent integration is effective in improving SNR (Signal-to-Noise Ratio). However, it is difficult to apply coherent integration to real data because the motions of the targets are unknown. An effective algorithm is proposed for echo detection and orbit estimation of the faint echoes from space debris. The characteristics of the evaluation function are utilized by the algorithm. Experiments show the proposed algorithm improves SNR by 8.32dB and enables estimation of orbital parameters accurately to allow for re-tracking with a single radar.

View full abstract

This letter propose a new H_∞ smoother (HIS) with a finite impulse response (FIR) structure for discrete-time state-space models. This smoother is called an H_∞ FIR smoother (HIFS). Constraints such as linearity, quasi-deadbeat property, FIR structure, and independence of the initial state information are required in advance. Among smoothers with these requirements, we choose the HIFS to optimize H_∞ performance criterion. The HIFS is obtained by solving the linear matrix inequality (LMI) problem with a parametrization of a linear equality constraint. It is shown through simulation that the proposed HIFS is more robust against uncertainties and faster in convergence than the conventional HIS.

View full abstract

Hwang-Lo-Lin proposed a user identification scheme [3] based on the Maurer-Yacobi scheme [6] that is suitable for application to the mobile environment. Hwang-Lo-Lin argued that their scheme is secure against any attack. Against the Hwang-Lo-Lin argument, Liu-Horng-Liu showed that the Hwang-Lo-Lin scheme is insecure against a Liu-Horng-Liu attack mounted by an eavesdrop attacker. However, Liu-Horng-Liu did not propose any improved version of the original identification scheme which is still secure against the Liu-Horng-Liu attack. In this paper, we propose an identification scheme that can solve this problem and a non-interactive public key distribution scheme also.

View full abstract

Formulae required for accurate approximate calculation of transition probabilities of embedded Markov chain for single-server queues of the GI/M/1, GI/M/1/K, M/G/1, M/G/1/K type with heavy-tail lognormal distribution of inter-arrival or service time are given.

View full abstract

This letter presents low-complexity digital pulse shaping filter structures of a direct sequence code division multiple access (DS-CDMA) ultra wide-band (UWB) modem transmitter with a ternary spreading code. The proposed finite impulse response (FIR) filter structures using a look-up table (LUT) have the effect of saving the amount of memory by about 50% to 80% in comparison to the conventional FIR filter structures, and consequently are suitable for a high-speed parallel data process.

View full abstract

New multimedia services over cellular/WLAN overlay networks require different Quality of Service (QoS) levels. Therefore, an efficient network management system is necessary in order to realize QoS sensitive multimedia services while enhancing network performance. In this paper, we propose a new online network management framework for overlay networks. Our online approach to network management exhibits dynamic adaptability, flexibility, and responsiveness to the traffic conditions in multimedia networks. Simulation results indicate that our proposed framework can strike the appropriate balance between performance criteria under widely varying diverse traffic loads.

View full abstract

Optimal saving in TCAM search power can be achieved with the combined strategy of both hardware-based techniques and a power friendly TCAM configuration. This letter proposes that a conditional precharging hardware scheme is used with a power aware TCAM configuration. In the traffic simulation results, the proposed scheme conservatively saved 72% of energy with unbiased traffic compared to no energy saving schemes for a sample design of 512×72 TCAM block.

View full abstract

In this paper, a novel user scheduling algorithm for maximizing the sum-rate capacity of inhomogeneous network is investigated. In order to extract the multi-user diversity order and reduce the feedback quantity, selective feedback scheme is adopted. An algorithm of key parameter, the prescribed threshold, is proposed. Numerical simulations show that when adopted the proposed threshold in the inhomogeneous networks, selective feedback scheme can still preserve the majority of the sum-rate capacity of the full back scheme, while the feedback load is significantly reduced.

View full abstract

Analytical expressions based on the Gauss-Chebyshev quadrature (GCQ) rule technique are derived to evaluate the bit-error rate (BER) for the time-hopping pulse position modulation (TH-PPM) ultra-wide band (UWB) systems under a Nakagami-m fading channel. The analyses are validated by the simulation results and adopted to assess the accuracy of the commonly used Gaussian approximation (GA) method. The influence of the fading severity on the BER performance of TH-PPM UWB system is investigated.

View full abstract

This paper presents a low complexity algorithmic framework for finding a broadcasting schedule in a low-altitude satellite system, i. e., the satellite broadcast scheduling (SBS) problem, based on the recent modeling and computational methodology of factor graphs. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, in this paper, we transform the SBS problem into an LDPC-like problem through a factor graph instead of using the conventional neural network approaches to solve the SBS problem. Based on a factor graph framework, the soft-information, describing the probability that each satellite will broadcast information to a terminal at a specific time slot, is exchanged among the local processing in the proposed framework via the sum-product algorithm to iteratively optimize the satellite broadcasting schedule. Numerical results show that the proposed approach not only can obtain optimal solution but also enjoys the low complexity suitable for integral-circuit implementation.

View full abstract

OFDM combined with TDM (OFDM/TDM) can be used to reduce a high peak-to-average power ratio (PAPR) of OFDM, but the PAPR reduction is not sufficient. To further reduce the PAPR, an amplitude clipping can be applied. In this letter, we investigate the effect of clipping on OFDM/TDM with and without channel coding. It is shown that amplitude clipped OFDM/TDM has an advantage over clipped OFDM with respect to the PAPR.

View full abstract

A companding technique using the hyperbolic tangent transform is proposed for reducing the peak-to-average-power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. This technique is practical and can be implemented easily in integrated circuit design. The PAPR value of an OFDM system and the optimal companding coefficient to attain the minimum quantization error are derived. Error probability performance of the system after the companding is evaluated. Our simulation results exhibits that the system with the suggested scheme has nearly the same performance as the systems with the μ-law or A-law companding techniques.

View full abstract

In this letter, an efficient hardware platform for the digital signal processing for OFDM communication systems is presented. The hardware platform consists of a single FPGA having 900K gates, two DSPs with maximum 8,000 MIPS at 1GHz clock, 2-channel ADC and DAC supporting maximum 125MHz sampling rate, and flexible data bus architecture, so that a wide variety of baseband signal processing algorithms for practical OFDM communication systems may be implemented and tested. The IEEE 802.16d software modem is also presented in order to verify the effectiveness and usefulness of the designed platform.

View full abstract

The conventional AOA estimation schemes assume multiple antennas, which usually causes high-cost estimation systems. More-over, the schemes are very vulnerable to multi-path interferences. In this letter, a novel scheme is proposed for the efficient AOA estimation. The scheme is based on cyclic pilot symbols, which guarantees the use of a single antenna and the robustness over multi-path interferences.

View full abstract

In MC-CDMA systems, subcarriers can be shared by different users. In this letter, we exploit the shared nature of subcarriers and propose a user grouping and subcarrier allocation algorithm for grouped MC-CDMA systems. The scheme aims at maximizing the total system throughput while providing bandwidth-fairness among groups. Simulation results are given to demonstrate the performance of the proposed algorithm in terms of sum capacity and per-user throughput.

View full abstract

The depth-first sphere decoder (SD) and the K-best algorithm have been widely studied as near optimum detectors. Depth-first SD has a non-deterministic computational throughput and K-best requires a sorting unit whose complexity is significant when a large K is used together with high modulation constellations. In this letter, we propose a MIMO detector that employs the trellis structure instead of the conventional tree searching. This detector can keep the computational throughput constant and reduce the complexity because the sorting is not required. From the simulation and complexity analysis, we investigate the advantage and drawback of the proposed detector.

View full abstract

We investigate the MIMO broadcast channels with imperfect channel knowledge due to estimation error and much more users than transmit antennas to exploit multiuser diversity. The channel estimation error causes the interference among users, resulting in the sum-rate loss. A tight upper bound of this sum-rate loss based on zeroforcing beamforming is derived theoretically. This bound only depends on the channel estimation quality and transmit antenna number, but not on the user number. Based on this upper bound, we show this system maintains full multiuser diversity, and always benefits from the increasing transmit power.

View full abstract

We present a low-complexity maximum likelihood (ML) detector for a coded double space-time transmit diversity-orthogonal frequency division multiplexing (DSTTD-OFDM) system. The proposed ML detector exploits properties of two permuted equivalent channel matrices and multiple decision-feedback (DF) detections. This can reduce computational efforts from O(|A|⁴) to O(2|A|²) with maintaining ML performance, where |A| is the modulation order. Numerical results shows that the proposed ML detector obtains ML performance and requires remarkably lower computational loads compared with the conventional ML detector.

View full abstract

This paper includes different approaches for analysis of a thin-wire antenna in the presence of de-ionized water box at different temperatures as a high-permittivity three-dimensional dielectric body. In continuation with the previous work of authors, first, the coupled tensorvolume/line integral equations is solved by using Galerkin-based moment method (MoM) consisting of a combination of entire-domain and subdomain basis functions including three-dimensional polynomials with different degrees. Then, the accuracy of such MoM, specifically for a highpermittivity dielectric scatterer, is substantiated by comparing its numerical results with that of FDTD method and some experimental data.

View full abstract

In this letter, we propose a new type of recursive least squares (RLS) algorithms without using the initial information of a parameter or a state to be estimated. The proposed RLS algorithm is first obtained for a generic linear model and is then extended to a state estimator for a stochastic state-space model. Compared with the existing algorithms, the proposed RLS, algorithms are simpler and more numerically stable. It is shown through simulation that the proposed RLS algorithms have better numerical stability for digital computations than existing algorithms.

View full abstract

In this paper, a block-constrained trellis coded quantization (BC-TCQ) algorithm is combined with an algebraic codebook to produce an algebraic trellis code (ATC) to be used in ACELP coding. In ATC, the set of allowed algebraic codebook pulse positions is expanded, and the expanded set is partitioned into subsets of pulse positions; the trellis branches are labeled with these subsets. The list Viterbi algorithm (LVA) is used to select the excitation codevector. The combination of an ATC codebook and LVA trellis search algorithm is denoted as an ATC-LVA block code. The ATC-LVA block code is used as the fixed codebook of the AMRWB 8.85kbps mode, reducing complexity compared to the conventional algebraic codebook.

View full abstract

This letter mainly focuses on improving current noise reduction methods to solve the critical speech distortion problems with robust noise reduction in noisy speech signals for speech enhancement over IP networks. For robust noise reduction with packet loss recovery, we propose a novel optimized Wiener filtering technique that uses the estimated SNR (Signal-to-Noise Ratio) with packet loss recovery method which is applied as post-filtering over IP-networks. Simulation results demonstrate that the proposed scheme provides better reduction and recovery rates with considering packet loss and SNR environment than other methods.

View full abstract

Digital TV (DTV) protection from the potential interference caused to a communication system using the cognitive radio (CR) technologies is so important for the frequency sharing between a DTV station and a communication system. In this letter, two results of the interference analysis at the co-channel bandwidth of 6MHz are provided. One is the requirement of the protection ratio (PR) to a DTV station, which means the received signal strength of a DTV station to the interfering signal strength of a communication system ratio. The other shows the interference effect to the service area of a DTV station, when the transmit power of a communication system is either 100W or 4W, and the PR of a DTV station is 15dB. Their results describe that an interferer's transmit power should be limited, because of protecting DTV station and sharing co-channel frequencies.

View full abstract