The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] channel(1697hit)

721-740hit(1697hit)

  • Adaptive Pre-FFT Equalizer with High-Precision Channel Estimator for ISI Channels

    Makoto YOSHIDA  

     
    PAPER

      Vol:
    E92-A No:11
      Page(s):
    2669-2678

    We present an attractive approach for OFDM transmission using an adaptive pre-FFT equalizer, which can select ICI reduction mode according to channel condition, and a degenerated-inverse-matrix-based channel estimator (DIME), which uses a cyclic sinc-function matrix uniquely determined by transmitted subcarriers. In addition to simulation results, the proposed system with an adaptive pre-FFT equalizer and DIME has been laboratory tested by using a software defined radio (SDR)-based test bed. The simulation and experimental results demonstrated that the system at a rate of more than 100 Mbps can provide a bit error rate of less than 10-3 for a fast multi-path fading channel that has a moving velocity of more than 200 km/h with a delay spread of 1.9 µs (a maximum delay path of 7.3 µs) in the 5-GHz band.

  • A New User Selection Measure in Block Diagonalization Algorithm for Multiuser MIMO Systems Open Access

    Riichi KUDO  Yasushi TAKATORI  Kentaro NISHIMORI  Atsushi OHTA  Shuji KUBOTA  Masato MIZOGUCHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:10
      Page(s):
    3206-3218

    Multiuser -- Multiple Input Multiple Output (MU-MIMO) techniques were proposed to increase spectrum efficiency; a key assumption was that the Mobile Terminals (MTs) were simple with only a few antennas. This paper focuses on the Block Diagonalization algorithm (BD) based on the equal power allocation strategy as a practical MU-MIMO technique. When there are many MTs inside the service area of the access point (AP), the AP must determine, at each time slot, the subset of the MTs to be spatially multiplexed. Since the transmission performance depends on the subsets of MTs, the user selection method needs to use the Channel State Information (CSI) obtained in the physical layer to maximize the Achievable Transmission Rate (ATR). In this paper, we clarify the relationship between ATR with SU-MIMO and that with MU-MIMO in a high eigenvalue channel. Based on the derived relationship, we propose a new measure for user selection. The new measure, the eigenvalue decay factor, represents the degradation of the eigenvalues in null space compared to those in SU-MIMO; it is obtained from the signal space vectors of the MTs. A user selection method based on the proposed measure identifies the combination of MTs that yields the highest ATR; our approach also reduces the computational load of user selection. We evaluate the effectiveness of user selection with the new measure using numerical formulations and computer simulations.

  • Antenna Array Calibration Based on Frequency Selection in OFDMA/TDD Systems Open Access

    Yoshitaka HARA  Yasuhiro YANO  Hiroshi KUBO  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:10
      Page(s):
    3195-3205

    This paper proposes a new antenna array calibration technique which uses frequency selection in orthogonal frequency division multiple access (OFDMA)/time division duplexing (TDD) systems. In the proposed method, subbands or frequencies of good channel conditions are initially selected for channel measurements. The relative calibration is performed at the selected subbands, which compensates for mismatch of analogue gains in multiple antennas using the measured uplink and downlink channel parameters. Furthermore, the calibration parameters are interpolated in the frequency domain for the whole bandwidth. The proposed calibration maintains accurate channel reciprocity for the whole bandwidth compared to the conventional calibration which does not use the frequency selection. The proposed calibration technique is effective in exploiting channel reciprocity at both base station and terminals with feasible amount of feedback and low-cost operation.

  • Adaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel

    Gou HOSOYA  Hideki YAGI  Manabu KOBAYASHI  Shigeichi HIRASAWA  

     
    PAPER-Coding Theory

      Vol:
    E92-A No:10
      Page(s):
    2418-2430

    Two decoding procedures combined with a belief-propagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by simulation results that the performance of our decoding algorithms is enhanced compared with that of the BP decoding algorithm with little increase of the decoding complexity.

  • MAP Source-Controlled Channel Decoding with Interleavers for MPEG-4 Image Indoor Wireless Transmission Systems

    Srijidtra MAHAPAKULCHAI  Chalie CHAROENLARPNOPPARUT  

     
    PAPER

      Vol:
    E92-B No:10
      Page(s):
    3052-3059

    In the modern day, MPEG-4 image compression technique have been commonly applied in various indoor wireless communication systems. The efficient system design mostly relies on the joint source channel coding algorithms, which aim to reduce the complexity of channel coding process, while maintaining the quality of the receiving images. In this paper, we design the MAP source-controlled channel decoders with both random and semirandom interleavers for Rician slow flat block-fading channels. The MAP-Viterbi decoder employs the residual redundancy from zerotree symbol sequences of MPEG-4 HFS packets. The interleaving processes are done after the overall channel coding process to combat the block-fading effects. The computer simulations summarize the system performance in terms of average WER and PSNR (dB). With the interleavers, the significant improvement in PSNR of about 15-17 dB is obtained for both ML and MAP decoding. Also in many cases, we obtain more improvement of about 0.2-0.4 dB for using MAP decoding with the interleavers.

  • Sample-Adaptive Product Quantizers with Affine Index Assignments for Noisy Channels

    Dong Sik KIM  Youngcheol PARK  

     
    PAPER-Fundamental Theories for Communications

      Vol:
    E92-B No:10
      Page(s):
    3084-3093

    When we design a robust vector quantizer (VQ) for noisy channels, an appropriate index assignment function should be contrived to minimize the channel-error effect. For relatively high rates, the complexity for finding an optimal index assignment function is too high to be implemented. To overcome such a problem, we use a structurally constrained VQ, which is called the sample-adaptive product quantizer (SAPQ) [12], for low complexities of quantization and index assignment. The product quantizer (PQ) and its variation SAPQ [13], which are based on the scalar quantizer (SQ) and thus belong to a class of the binary lattice VQ [16], have inherent error resilience even though the conventional affine index assignment functions, such as the natural binary code, are employed. The error resilience of SAPQ is observed in a weak sense through worst-case bounds. Using SAPQ for noisy channels is useful especially for high rates, e.g., > 1 bit/sample, and it is numerically shown that the channel-limit performance of SAPQ is comparable to that of the best codebook permutation of binary switching algorithm (BSA) [23]. Further, the PQ or SAPQ codebook with an affine index assignment function is used for the initial guess of the conventional clustering algorithm, and it is shown that the performance of the best BSA can be easily achieved.

  • A Fixed Point Theorem in Weak Topology for Successively Recurrent System of Set-Valued Mapping Equations and Its Applications

    Kazuo HORIUCHI  

     
    PAPER-Nonlinear Problems

      Vol:
    E92-A No:10
      Page(s):
    2554-2559

    Let us introduce n ( ≥ 2) mappings fi (i=1,,n ≡ 0) defined on reflexive real Banach spaces Xi-1 and let fi:Xi-1 → Yi be completely continuous on bounded convex closed subsets Xi-1(0) ⊂ Xi-1. Moreover, let us introduce n set-valued mappings Fi : Xi-1 Yi → Fc(Xi) (the family of all non-empty compact subsets of Xi), (i=1,,n ≡ 0). Here, we have a fixed point theorem in weak topology on the successively recurrent system of set-valued mapping equations:xi ∈ Fi(xi-1, fi(xi-1)), (i=1,,n ≡ 0). This theorem can be applied immediately to analysis of the availability of system of circular networks of channels undergone by uncertain fluctuations and to evaluation of the tolerability of behaviors of those systems.

  • An Approximation of the Average BER Performance of Multi-Hop AF Relaying Systems with Fixed Gain

    JunKyoung LEE  SeungHun JANG  JangHoon YANG  DongKu KIM  

     
    LETTER-Broadcast Systems

      Vol:
    E92-B No:10
      Page(s):
    3280-3284

    In this letter, we present a closed-form bound of the average bit error rate (BER) performance for the multi-hop amplify-and-forward (AF) relaying systems with fixed gain in Rayleigh fading channel. The proposed bound is derived from the probability density function (PDF) of the overall multi-hop relay channel under the assumption of asymptotic high signal-to-noise ratio (SNR) at every intermediate relays. When intermediate relays actually operate at finite SNR, the proposed BER bound becomes looser as the SNR of the last hop increases. In order to reflect the effect of all the noise variances of relay links to the BER evaluation, a hop-indexed recursive BER approximation is proposed, in which the proposed bound of BER under asymptotic high SNR is used. The simulation results manifest that the proposed hop-indexed recursive BER approximation can not only guarantee accuracy regardless of the SNR of the last hop but also provide higher accuracy than the previous works.

  • An Improved Design of Block-Coded Modulation for the Rayleigh Fading Channel

    Shang-Chih MA  

     
    LETTER-Coding Theory

      Vol:
    E92-A No:9
      Page(s):
    2385-2387

    In this letter, we propose an improved block-coded modulation scheme for the Rayleigh fading channel. The proposed coding structure is constructed by providing interblock coding between adjacent blocks. The error performance of an example is simulated. The simulation results show that the proposed method can achieve large coding gain with reasonable decoding complexity.

  • Overall Resource Efficiency Measure of Digital Modulation Methods

    Jinzhu LIU  Lianfeng SHEN  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E92-B No:9
      Page(s):
    2948-2950

    A coordinate plane representation of the resource requirements of digital modulation methods is presented, and an overall resource efficiency measure is proposed. This measure can be used for the comparison of digital modulation methods and the evaluation of an emerging modulation technique. Several typical digital modulation methods are compared based on this measure to show its validity.

  • Performance Improvement of Proportional Fairness-Based Resource Allocation in OFDMA Downlink Systems

    Nararat RUANGCHAIJATUPON  Yusheng JI  

     
    PAPER-Broadband Wireless Access System

      Vol:
    E92-A No:9
      Page(s):
    2191-2199

    We have developed a novel downlink packet scheduling scheme for a multiuser OFDMA system in which a subchannel can be time-multiplexed among multiple users. This scheme which is called Matrixed-based Proportional Fairness can provide a high system throughput while ensuring fairness. The scheme is based on a Proportional Fairness (PF) utility function and can be applied to any of the PF-based schedulers. Our scheduler explores multichannel multiuser diversity by using a two-dimensional matrix combining user selection, subchannel assignment, and time slot allocation. Furthermore, unlike other PF-based schemes, our scheme considers finitely backlogged queues during the time slot allocation. By doing so, it can exploit multichannel multiuser diversity to utilize bandwidth efficiently and with throughput fairness. Additionally, fairness in the time domain is enhanced by limiting the number of allocated time slots. Intensive simulations considering finitely backlogged queues and user mobility prove the scheme's effectiveness.

  • Introduction of Frequency-Domain Signal Processing to Broadband Single-Carrier Transmissions in a Wireless Channel Open Access

    Fumiyuki ADACHI  Hiromichi TOMEBA  Kazuki TAKEDA  

     
    INVITED SURVEY PAPER

      Vol:
    E92-B No:9
      Page(s):
    2789-2808

    Recently, frequency-domain equalization (FDE) has been attracting much attention as a way to improve single-carrier (SC) signal transmission in a frequency-selective wireless channel. Since the SC signal spectrum is spread over the entire signal bandwidth, FDE can take advantage of channel frequency-selectivity and achieve the frequency diversity gain. SC with FDE is a promising wireless signal transmission technique. In this article, we review the pioneering research done on SC with FDE. The principles of simple one-tap FDE, channel estimation, and residual inter-symbol interference (ISI) cancellation are presented. Multi-input/multi-output (MIMO) is an important technique to improve the transmission performance. Some of the studies on MIMO/SC with FDE are introduced.

  • Downlink Beamforming with Imperfect Channel Information for a TDD-Based OFDMA System

    Eunchul YOON  Joontae KIM  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E92-B No:9
      Page(s):
    2967-2971

    The beamforming weights which can suppress the interfering signal toward out-of-cell mobile stations in downlink are designed for a time division duplexing based OFDMA system when the channel information is not perfect. The derived beamforming weights do not improve the average SINR performance monotonously with the increased transmit SNR if the inverse of the transmit SNR is used as the regularization factor of the beamforming weights and the channel information obtained by the BS to design the BF weights is not perfect. Therefore, we suggest a simple scheme to select the regularization factor. The proposed beamforming weights improve the performance monotonously with the increased transmit SNR and achieve near-optimal performance. The performance achieved by applying the beamforming weights used in uplink to downlink beamforming is also investigated.

  • Pilot-Assisted Channel Estimation for Orthogonal Multi-Carrier DS-CDMA with Frequency-Domain Equalization

    Tomoyuki SHIMA  Hiromichi TOMEBA  Fumiyuki ADACHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:9
      Page(s):
    2874-2881

    Orthogonal multi-carrier direct sequence code division multiple access (orthogonal MC DS-CDMA) is a combination of time-domain spreading and orthogonal frequency division multiplexing (OFDM). In orthogonal MC DS-CDMA, the frequency diversity gain can be obtained by applying frequency-domain equalization (FDE) based on minimum mean square error (MMSE) criterion to a block of OFDM symbols and can improve the bit error rate (BER) performance in a severe frequency-selective fading channel. FDE requires an accurate estimate of the channel gain. The channel gain can be estimated by removing the pilot modulation in the frequency domain. In this paper, we propose a pilot-assisted channel estimation suitable for orthogonal MC DS-CDMA with FDE and evaluate, by computer simulation, the BER performance in a frequency-selective Rayleigh fading channel.

  • A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels Using Sparse Matrices

    Shigeki MIYAKE  Jun MURAMATSU  

     
    PAPER-Information Theory

      Vol:
    E92-A No:9
      Page(s):
    2333-2344

    A channel code is constructed using sparse matrices for stationary memoryless channels that do not necessarily have a symmetric property like a binary symmetric channel. It is also shown that the constructed code has the following remarkable properties. 1. Joint source-channel coding: Combining channel code with lossy source code, which is also constructed by sparse matrices, a simpler joint source-channel code can be constructed than that constructed by the ordinary block code. 2. Universal coding: The constructed channel code has a universal property under a specified condition.

  • Ultra-Wideband Indoor Double-Directional Channel Estimation Using Transformation between Frequency and Time Domain Signals

    Naohiko IWAKIRI  Takehiko KOBAYASHI  

     
    PAPER-Ultra Wideband System

      Vol:
    E92-A No:9
      Page(s):
    2159-2166

    This paper proposes an ultra-wideband double-directional spatio-temporal channel sounding technique using transformation between frequency- and time-domain (FD and TD) signals. Virtual antenna arrays, composed of omnidirectional antennas and scanners, are used for transmission and reception in the FD. After Fourier transforming the received FD signals to TD ones, time of arrival (TOA) is estimated using a peak search over the TD signals, and then angle of arrivals (AOA) and angle of departure (AOD) are estimated using a weighted angle histogram with a multiple signal classification (MUSIC) algorithm applied to the FD signals, inverse-Fourier transformed from the TD signals divided into subregions. Indoor channel sounding results validated that an appropriate weighting reduced a spurious level in the angle histogram by a factor of 0.1 to 0.2 in comparison with that of non-weighting. The proposed technique successfully resolved dominant multipath components, including a direct path, a single reflection, and a single diffraction, in line-of-sight (LOS) and non-LOS environments. Joint TOA and AOA/AOD spectra were also derived from the sounding signals. The spectra illustrated the dominant multipath components (agreed with the prediction by ray tracing) as clusters.

  • Evolution Trends of Wireless MIMO Channel Modeling towards IMT-Advanced Open Access

    Chia-Chin CHONG  Fujio WATANABE  Koshiro KITAO  Tetsuro IMAI  Hiroshi INAMURA  

     
    INVITED SURVEY PAPER

      Vol:
    E92-B No:9
      Page(s):
    2773-2788

    This paper describes an evolution and standardization trends of the wireless channel modeling activities towards IMT-Advanced. After a background survey on various channel modeling approaches is introduced, two well-known multiple-input-multiple-output (MIMO) channel models for cellular systems, namely, the 3GPP/3GPP2 Spatial Channel Model (SCM) and the IMT-Advanced MIMO Channel Model (IMT-Adv MCM) are compared, and their main similarities are pointed out. The performance of MIMO systems is greatly influenced by the spatial-temporal correlation properties of the underlying MIMO channels. Here, we investigate the spatial-temporal correlation characteristics of the 3GPP/3GPP2 SCM and the IMT-Adv MCM in term of their spatial multiplexing and spatial diversity gains. The main goals of this paper are to summarize the current state of the art, as well as to point out the gaps in the wireless channel modeling works, and thus hopefully to stimulate research in these areas.

  • Robust Channel Order Selection Based on Spectral Matching

    Koji HARADA  Hideaki SAKAI  

     
    PAPER-Communications

      Vol:
    E92-A No:8
      Page(s):
    1898-1904

    In this paper, a new approach to channel order selection of single-input multiple-output (SIMO), finite impulse response (FIR) channels is proposed for blind channel estimation. The approach utilizes cross spectral density (CSD) of the channel outputs, and minimizes the distance between two CSD's, one calculated non-parametrically from the observed output data, and the other calculated from the blindly estimated channel parameters. The CSD criterion is numerically tested on randomly generated SIMO-FIR channels, and shown to be very effective compared to existing channel order selection methods especially under low SNR settings. Blind estimates of the channels with the selected channel order also show superiority of the CSD criterion.

  • Modifying the Turbo Decoder for DVC over Wireless Channels

    Rajitha WEERAKKODY  Anil FERNANDO  Ahmet M. KONDOZ  

     
    PAPER-Digital Signal Processing

      Vol:
    E92-A No:8
      Page(s):
    2009-2016

    Distributed Video Coding (DVC) is an emerging video coding approach, particularly attractive due to its flexibility to implement low complex encoders. This feature could be very effectively utilized in a number of video sensor based application scenarios. However, DVC is still in the process of development and currently available codec implementations are based on a number of hypothetical models and assumptions. In DVC, the effects of noise and fading on the compressed payload (parity bit stream) in real video communications and the resultant modified channel model scenario have not been discussed in literature. In this paper, a solution to the above problem in turbo coding based DVC is discussed incorporating a novel dual channel model for the maximum a-posteriori (MAP) algorithm for turbo decoding. The simulations for AWGN and wireless channels at different group of picture (GOP) sizes show that the proposed algorithm improves the rate distortion performance compared to the existing decoding algorithm. It also outperforms the H.264/AVC I-P-I-P codec (v10.1/baseline profile); particularly at low Signal to Noise Ratio (SNR) levels of the channel, thus enabling DVC as a viable and efficient option for video communications.

  • Performance Enhancement of MQRD-PCM/MIMO-OFDM Using Channel Ranking Based Joint Symbols Detection

    Chang-Jun AHN  

     
    PAPER-Communications

      Vol:
    E92-A No:8
      Page(s):
    1913-1919

    MIMO-OFDM is considered a key technology in emerging high-data rate systems. With MIMO techniques, the transmission quality deteriorates due to inter-antenna interference (IAI). Several signal detection schemes have been proposed to mitigate this problem. However, it is impractical to use the conventional methods without reducing theirs computational complexity. Previously, we have proposed a parallel detection algorithm using multiple QR decompositions with permuted channel matrix (MQRD-PCM) for MIMO-OFDM to reduce the system complexity. This method achieves a good BER performance with low system complexity. However, since MQRD-PCM is a kind of parallel detection method, the wrong detection probability is increased due to the bad channel SINR of the transmitted signal. As a result, the average BER performance is influenced by the wrong detection probability of the bad channel SINR. To overcome this problem, in this paper, we propose the channel ranking based joint symbols detection for MQRD-PCM/MIMO-OFDM.

721-740hit(1697hit)