The search functionality is under construction.

Keyword Search Result

[Keyword] interleaving(59hit)

1-20hit(59hit)

  • New Binary Sequences with Low Odd Correlation via Interleaving Technique

    Bing LIU  Rong LUO  Yong WANG  

     
    LETTER-Coding Theory

      Pubricized:
    2023/08/08
      Vol:
    E106-A No:12
      Page(s):
    1516-1520

    Even correlation and odd correlation of sequences are two kinds of measures for their similarities. Both kinds of correlation have important applications in communication and radar. Compared with vast knowledge on sequences with good even correlation, relatively little is known on sequences with preferable odd correlation. In this paper, a generic construction of sequences with low odd correlation is proposed via interleaving technique. Notably, it can generate new sets of binary sequences with optimal odd correlation asymptotically meeting the Sarwate bound.

  • Construction of Near-Optimal Frequency Hopping Sequence Set with Low-Hit-Zone

    Xinyu TIAN  Hongyu HAN  Limengnan ZHOU  Hanzhou WU  

     
    LETTER-Spread Spectrum Technologies and Applications

      Pubricized:
    2023/04/13
      Vol:
    E106-A No:10
      Page(s):
    1362-1365

    The low-hit-zone (LHZ) frequency hopping sequence (FHS) sets are widely applicable in quasi-synchronous frequency hopping multiple-access (QS-FHMA) systems. In order to reduce mutual interference (MI) in the zone around the signal origin between different users, we recommend the LHZ FHS set instead of the conventional FHS set. In this letter, we propose a design of LHZ FHS sets via interleaving techniques. The obtained sequences can be confirmed that they are near-optimal in relation to the Peng-Fan-Lee bound.

  • A Construction of Inter-Group Complementary Sequence Set Based on Interleaving Technique

    Xiaoyu CHEN  Huanchang LI  Yihan ZHANG  Yubo LI  

     
    LETTER-Coding Theory

      Pubricized:
    2021/07/12
      Vol:
    E105-A No:1
      Page(s):
    68-71

    A new construction of shift sequences is proposed under the condition of P|L, and then the inter-group complementary (IGC) sequence sets are constructed based on the shift sequence. By adjusting the parameter q, two or three IGC sequence sets can be obtained. Compared with previous methods, the proposed construction can provide more sequence sets for both synchronous and asynchronous code-division multiple access communication systems.

  • DFE Error Propagation and FEC Interleaving for 400GbE PAM4 Electrical Lane Open Access

    Yongzheng ZHAN  Qingsheng HU  Yinhang ZHANG  

     
    PAPER-Integrated Electronics

      Pubricized:
    2019/08/05
      Vol:
    E103-C No:2
      Page(s):
    48-58

    This paper analyzes the effect of error propagation of decision feedback equalizer (DFE) for PAM4 based 400Gb/s Ethernet. First, an analytic model for the error propagation is proposed to estimate the probability of different burst error length due to error propagation for PAM4 link system with multi-tap TX FFE (Feed Forward Equalizer) + RX DFE architecture. After calculating the symbol error rate (SER) and bit error rate (BER) based on the probability model, the theoretical analysis about the impact of different equalizer configurations on BER is compared with the simulation results, and then BER performance with FEC (Forward Error Correction) is analyzed to evaluate the effect of DFE error propagation on PAM4 link. Finally, two FEC interleaving schemes, symbol and bit interleaving, are employed in order to reduce BER further and then the theoretical analysis and the simulation result of their performance improvement are also evaluated. Simulation results show that at most 0.52dB interleaving gain can be achieved compared with non-interleaving scheme just at a little cost in storing memory and latency. And between the two interleaving methods, symbol interleaving performs better compared with the other one from the view of tradeoff between the interleaving gain and the cost and can be applied for 400Gb/s Ethernet.

  • Construction of Asymmetric Gaussian Integer ZCZ Sequence Sets

    Xiaoyu CHEN  Heru SU  Yubo LI  Xiuping PENG  

     
    LETTER-Coding Theory

      Vol:
    E102-A No:2
      Page(s):
    471-475

    In this letter, a construction of asymmetric Gaussian integer zero correlation zone (ZCZ) sequence sets is presented based on interleaving and filtering. The proposed approach can provide optimal or almost optimal single Gaussian integer ZCZ sequence sets. In addition, arbitrary two sequences from different sets have inter-set zero cross-correlation zone (ZCCZ). The resultant sequence sets can be used in the multi-cell QS-CDMA system to reduce the inter-cell interference and increase the transmission data.

  • Low-Hit-Zone Frequency-Hopping Sequence Sets with Optimal Periodic Partial Hamming Correlation Properties

    Limengnan ZHOU  Hongyu HAN  Xing LIU  

     
    LETTER-Spread Spectrum Technologies and Applications

      Vol:
    E102-A No:1
      Page(s):
    316-319

    Frequency-hopping sequence (FHS) sets with low-hit-zone (LHZ) have Hamming correlations maintained at a low level as long as the relative time delay between different sequences are limited in a zone around the origin, and thus can be well applied in quasi-synchronous (QS) frequency-hopping multiple-access (FHMA) systems to reduce the mutual interference between different users. Moreover, the periodic partial Hamming correlation (PPHC) properties of employed LHZ-FHS sets usually act as evaluation criterions for the performances of QS-FHMA systems in practice. In this letter, a new class of LHZ-FHS sets is constructed via interleaving techniques. Furthermore, these new LHZ-FHS sets also possess optimal PPHC properties and parameters not included in the related literature.

  • New Classes of Optimal Low Hit Zone Frequency Hopping Sequence Set with Large Family Size

    Long LING  Xianhua NIU  Bosen ZENG  Xing LIU  

     
    LETTER-Sequence

      Vol:
    E101-A No:12
      Page(s):
    2213-2216

    The construction of frequency hopping sequences with good Hamming correlation is the foundation of research in frequency hopping communication. In this letter, classes of optimal low hit zone frequency hopping sequence set are constructed based on the interleaving technology. The results of the study show that the sequence set with large family size is optimal for the Peng-Fan-Lee bound. And all the sequences in the set are inequivalent.

  • Multiport Signal-Flow Analysis to Improve Signal Quality of Time-Interleaved Digital-to-Analog Converters

    Youngcheol PARK  

     
    PAPER-Electronic Instrumentation and Control

      Vol:
    E101-C No:8
      Page(s):
    685-689

    This letter describes a method that characterizes and improves the performance of a time-interleaved (TI) digital-to-analog converter (DAC) system by using multiport signal-flow graphs at microwave frequencies. A commercial signal generator with two TI DACs was characterized through s-parameter measurements and was compared to the conventional method. Moreover, prefilters were applied to correct the response, resulting in an error-vector magnitude improvement of greater than 8 dB for a 64-quadrature-amplitude-modulated signal of 4.8 Gbps. As a result, the bandwidth limitation and the complex post processing of the conventional method could be minimized.

  • Multipermutation Codes Correcting a Burst of Deletions

    Peng ZHAO  Jianjun MU  Yucheng HE  Xiaopeng JIAO  

     
    LETTER-Coding Theory

      Vol:
    E101-A No:2
      Page(s):
    535-538

    Codes over permutations and multipermutations have received considerable attention since the rank modulation scheme is presented for flash memories. Deletions in multipermutations often occur due to data synchronization errors. Based on the interleaving of several single-deletion-correcting multipermutation codes, we present a construction of multipermutation codes for correcting a burst of at most t deletions with shift magnitude one for t ≥2. The proposed construction is proved with including an efficient decoding method. A calculation example is provided to validate the construction and its decoding method.

  • A Class of Optimal One-Coincidence Frequency-Hopping Sequence Sets with Composite Length

    Wenli REN  Fang-Wei FU  Feng WANG  Jian GAO  

     
    LETTER-Communication Theory and Signals

      Vol:
    E100-A No:11
      Page(s):
    2528-2533

    In this letter, we first investigate some new properties of a known power residue frequency-hopping sequence (FHS) set which is established as an optimal one-coincidence frequency-hopping sequence (OC-FHS) set with near-optimal set size. Next, combining the mathematical structure of power residue theory with interleaving technique, we present a new class of optimal OC-FHS set, using the Chinese Remainder Theorem (CRT). As a result, one optimal OC-FHS set with prime length is extended to another optimal OC-FHS set with composite length in which the construction preserves the maximum Hamming correlation (MHC) and the set size as well as the optimality of the Lempel-Greenberger bound.

  • Multipermutation Codes Correcting a Predetermined Number of Adjacent Deletions

    Peng ZHAO  Jianjun MU  Xiaopeng JIAO  

     
    LETTER-Coding Theory

      Vol:
    E100-A No:10
      Page(s):
    2176-2179

    In this letter, three types of constructions for multipermutation codes are investigated by using interleaving technique and single-deletion permutation codes to correct a predetermined number of adjacent deletions. The decoding methods for the proposed codes are provided in proofs and verified with examples. The rates of these multipermutation codes are also compared.

  • Construction of Optimal or Near Optimal Frequency-Hopping Sequence Set with Low Hit Zone

    Limengnan ZHOU  Daiyuan PENG  Changyuan WANG  Hongyu HAN  

     
    LETTER-Coding Theory

      Vol:
    E99-A No:5
      Page(s):
    983-986

    In quasi-synchronous frequency-hopping multiple access (QS-FHMA) systems, relative delays are allowed to vary in a domain around the origin. Under such condition, the low hit zone (LHZ) frequency-hopping sequence (FHS) set is more propitious than the conventional FHS set to be applied by the systems. In this paper, a construction based on the interleaving techniques of FHS set with LHZ is proposed. Besides the requirement for this constructed LHZ FHS set to get the optimality or the near optimality with respect to the Peng-Fan-Lee bound is also given. It turns out that the constructed LHZ FHS set has new parameters not covered in the literature, thus it does have great significance in practice.

  • Designs of Inter-Group Complementary Sequence Set from Interleaving Z-Periodic Complementary Sequences

    Longye WANG  Xiaoli ZENG  Hong WEN  

     
    LETTER-Coding Theory

      Vol:
    E99-A No:5
      Page(s):
    987-993

    Novel constructions of inter-group complementary (IGC) sequences are proposed based on Z-periodic complementary (ZPC) sequences and uncorrelated sequence set by taking advantages of interleaved operation. The presented methods can get IGC sequences from interleaving ZPC sequence set. The proposed methods not only can get polyphase IGC sequence set, but also can obtain binary and ternary IGC sequence set. In particular, with the aid of uncorrelated sequence, the number of available groups of IGC sequences from interleaving ZPC sequence set can be chosen with flexibility compared to the existed IGC sequences. The IGC sequences based code division multiple access (CDMA) systems may perform better on bit error rates than conventional sequences based interference-limited CDMA systems. Moreover, the novel IGC sequences may work well in both synchronous and asynchronous operational modes.

  • Application Prefetcher Design Using both I/O Reordering and I/O Interleaving

    Yongsoo JOO  Sangsoo PARK  Hyokyung BAHN  

     
    LETTER-Computer System

      Pubricized:
    2015/08/20
      Vol:
    E98-D No:12
      Page(s):
    2317-2321

    Application prefetchers improve application launch performance on HDDs through either I/O reordering or I/O interleaving, but there has been no proposal to combine the two techniques. We present a new algorithm to combine both approaches, and demonstrate that it reduces cold start launch time by 50%.

  • New Construction of Optimal p2-Ary Low Correlation Zone Sequence Sets

    Yubo LI  Kai LIU  Chengqian XU  

     
    PAPER-Information Theory

      Vol:
    E98-A No:6
      Page(s):
    1288-1294

    In this correspondence, a generic method of constructing optimal p2-ary low correlation zone sequence sets is proposed. Firstly p2-ary column sequence sets are constructed, then p2-ary LCZ sequence sets with parameters (pn-1, pm-1, (pn-1)/(pm-1),1) are constructed by using column sequences and interleaving technique. The resultant p2-ary LCZ sequence sets are optimal with respect to the Tang-Fan-Matsufuji bound.

  • A Novel Method of Deinterleaving Pulse Repetition Interval Modulated Sparse Sequences in Noisy Environments

    Mahmoud KESHAVARZI  Delaram AMIRI  Amir Mansour PEZESHK  Forouhar FARZANEH  

     
    LETTER-Digital Signal Processing

      Vol:
    E97-A No:5
      Page(s):
    1136-1139

    This letter presents a novel method based on sparsity, to solve the problem of deinterleaving pulse trains. The proposed method models the problem of deinterleaving pulse trains as an underdetermined system of linear equations. After determining the mixing matrix, we find sparsest solution of an underdetermined system of linear equations using basis pursuit denoising. This method is superior to previous ones in a number of aspects. First, spurious and missing pulses would not cause any performance reduction in the algorithm. Second, the algorithm works well despite the type of pulse repetition interval modulation that is used. Third, the proposed method is able to separate similar sources.

  • Coordinated Interleaving Access Scheme for IEEE 802.11p Wireless Vehicular Networks

    Shiann-Tsong SHEU  Yen-Chieh CHENG  Jung-Shyr WU  Frank Chee-Da TSAI  Luwei CHEN  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E97-B No:4
      Page(s):
    826-842

    The emerging Wireless Access in Vehicular Environment (WAVE) architecture, which aims to provide critical traffic information and Internet services, has recently been standardized in the IEEE 802.11p specification. A typical WAVE network consists of one road-side-unit (RSU) and one or more on-board-units (OBUs), wherein the RSU supports one control channel (CCH) and one or more service channels (SCH) for the OBUs to access. Generally, an OBU is equipped with a single transceiver and needs to periodically switch between the CCH and one of the SCHs in order to receive emergency messages and service information from the CCH and to deliver Internet traffic over an SCH. Synchronizing all OBUs to alternatively access the CCH and SCHs is estimated to waste as much as 50% of the channel's resources. To improve efficiency, we propose an innovative scheme, namely coordinated interleaving access (CIA) scheme, which optimizes the SCH throughput by smartly grouping the OBUs to let them access the CCH and SCHs in an interleaved and parallel manner. To further the capability of CIA scheme, an enhanced version is also proposed to handle the case where OBUs with multiple transceivers. Performance analysis and evaluation indicates that the proposed CIA scheme achieves a significant improvement in resource. Thus it can be advantageous to adapt it into the IEEE 802.11p protocol for its adoption in multi-channel wireless vehicular networks.

  • A Time-Domain Architecture and Design Method of High Speed A-to-D Converters with Standard Cells

    Masao TAKAYAMA  Shiro DOSHO  Noriaki TAKEDA  Masaya MIYAHARA  Akira MATSUZAWA  

     
    PAPER

      Vol:
    E96-C No:6
      Page(s):
    813-819

    In this paper, we describe a new method to deal with analog signal in time domain. The method converts voltage signal to time-interleaved phase modulation signal of clock edge. After being amplified by a new time amplifier (TA), phases of the signal are converted to digital codes by successive approximation time-to-digital converter (SA-TDC). The test chip includes 8 interleaved 4 bit SA-TDCs with short latency. The chip operates up to 4.4 GHz. The measured ENOB is 3.51 bit and FOM is 0.49 pJ/conv.

  • Construction of Shift Distinct Sequence Sets with Zero or Low Correlation Zone

    Xiaoyu CHEN  Chengqian XU  Yubo LI  Kai LIU  

     
    LETTER-Coding Theory

      Vol:
    E96-A No:1
      Page(s):
    377-382

    A construction of shift sequence sets is proposed. Multiple distinct shift sequence sets are obtained by changing the parameters of the shift sequences. The shift sequences satisfy the conditions that P|L and P ≥ 2, where P is the length of the shift sequences, L is the length of the zero-correlation zone or low-correlation zone (ZCZ/LCZ). Then based on these shift sequence sets, many shift distinct ZCZ/LCZ sequence sets are constructed by using interleaving technique and complex Hadamard matrices. Furthermore, the new construction is optimal under the conditions proposed in this paper. Compared with previous constructions, the proposed construction extends the number of shift distinct ZCZ/LCZ sequence sets, so that more sequence sets are obtained for multi-cell quasi-synchronous code-division multiple access (QS-CDMA) systems.

  • An Interleaving Updating Framework of Disparity and Confidence Map for Stereo Matching

    Chenbo SHI  Guijin WANG  Xiaokang PEI  Bei HE  Xinggang LIN  

     
    LETTER-Image Recognition, Computer Vision

      Vol:
    E95-D No:5
      Page(s):
    1552-1555

    In this paper, we propose an interleaving updating framework of disparity and confidence map (IUFDCM) for stereo matching to eliminate the redundant and interfere information from unreliable pixels. Compared with other propagation algorithms using matching cost as messages, IUFDCM updates the disparity map and the confidence map in an interleaving manner instead. Based on the Confidence-based Support Window (CSW), disparity map is updated adaptively to alleviate the effect of input parameters. The reassignment for unreliable pixels with larger probability keeps ground truth depending on reliable messages. Consequently, the confidence map is updated according to the previous disparity map and the left-right consistency. The top ranks on Middlebury benchmark corresponding to different error thresholds demonstrate that our algorithm is competitive with the best stereo matching algorithms at present.

1-20hit(59hit)