SENSITIVITY OF TIME-DIVISION MULTIPLEXING PARALLEL A/D CONVERTERS TO ANALOG IMPERFECTION
|
|
- Aleesha Hubbard
- 5 years ago
- Views:
Transcription
1 SENSITIVITY OF TIME-DIVISION MULTIPLEXING PARALLEL A/D CONVERTERS TO ANALOG IMPERFECTION Davud Asemani, Jacques Oksman To cite this version: Davud Asemani, Jacques Oksman. SENSITIVITY OF TIME-DIVISION MULTIPLEX- ING PARALLEL A/D CONVERTERS TO ANALOG IMPERFECTION. IEEE Workshop on Signal Processing Systems, Oct 2007, Shanghai, China. pp , 2007, <0.09/SIPS >. <hal > HAL Id: hal Submitted on 6 Mar 2008 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
2 SENSITIVITY OF TIME-DIVISION MULTIPLEXING PARALLEL A/D CONVERTERS TO ANALOG IMPERFECTION Davud Asemani and Jacques Oksman Supelec, Department of signal processing and electronic systems 3, Rue Joliot Curie, Gif-sur-Yvette, 992, France ABSTRACT In this paper, the Time-Division Multiplexing (TDM) architecture for the Hybrid Filter Bank (HFB) A/D Converters (ADCs) is studied in the time domain. Giving a brief survey on the TDM structure, the classical and TDM HFB-based ADCs are compared in terms of the output resolution for some input signals. To study the sensitivity to the realization errors, both structures are simulated assuming the same realization errors in the analysis filter banks. The TDM HFBbased ADC exhibits a better performance either in the presence or in the absence of realization errors than the classical one. Besides, the input-output relationship is demonstrated to be Linear Time-Invariant (LTI) for the TDM HFB, but it is non-lti in the the classical HFB case. Thus, it is possible only in the TDM case that a blind deconvolution method is employed for adaptively compensating the realization errors. Index Terms Hybrid Filter Bank, Time-division Multiplexing, A/D converter, Software-Defined Radio systems I. INTRODUCTION The important challenge in A/D and D/A conversion is to achieve both factors of high-speed and high-resolution conversion at the same time. The delta-sigma ( Σ) converters may provide the best resolution, but are so limited in the band-width of conversion []. The demand for A/D or D/A converters with higher speeds has dramatically increased for realizing the new communications concepts such as Software-Defined Radio (SDR) approach which will form a new industry on an even larger scale than the personal computer industry [2]. Putting the high-precision ADCs in Parallel, a wide-band ADC may be obtained. The timeinterleaving and discrete-time HFB structures have already been proposed in this regard. They encounter nevertheless with the problems of an extremely-high sensitivity to the mismatch of converters and practical speed limitation respectively [3]. The continuous-time HFB structure using analog analysis filters has been proposed as a suitable candidate for realizing the wide-band ADCs. Figure shows the classical HFB structure for A/D conversion where M and T are associated with the number of branches and Nyquist sampling period respectively [4]. Employing this parallel Fig.. The classical HFB-based A/D converter. Fig. 2. The TDM architecture of HFB-based ADC for estimating the TDM components of the input signal. The outputs ŝ 0 [n], ŝ [n],..., and ŝ M [n] are the estimated TDM signals. structure, M A/D converters are now used in parallel working at MT whereas the original analog input is supposed to be limited to the frequency interval [ π T, π T ]. An M-
3 branch HFB ADC exhibits M interference terms called aliasing at the output which restrict the output resolution like the quantization noise. The analog HFB-based A/D converters have exhibited a good performance (low aliasing terms) using simply-realizable first- and second-order analysis filters and FIR digital synthesis filters if a small ratio of oversampling is considered. However, the related performance in the presence of even small realization errors degrades so much [5]. It is then necessary to somehow mitigate or compensate the realization errors for having a useful HFB-based ADC. Digital techniques have been dealt with for managing the problem of high sensitivity to the realization errors. However, the proposed methods are limited to some specific errors or cases [6]. Pinheiro et. al. tried to optimize the design of HFB structures in terms of realization errors [7], but their proposed solution does not include a compensation technique. They have only proposed a weighted criterion of distortion and aliasing terms which only leads to less than five db of improvement. Besides, this improvement is reported for the classical HFB-based ADC without any oversampling process. When no oversampling is used, the HFB structure is relatively robust versus realization errors [5], but the related performance is not acceptable for the practical applications unless a small oversampling ratio is considered. The blind deconvolution techniques as a candidate for handling the sensitivity of HFB structures to the realization errors are applicable for LTI systems. However, the classical HFB architecture is associated with a time-variant relation between its input and output because of decimation process implied in the sampling at MT. Therefore, it is not possible to directly apply a blind deconvolution technique to the classical HFB ADC. A new HFB structure called Time- Division Multiplexing (TDM) architecture has recently been offered that provides an LTI input-output relationship [8]. Figure 2 shows the TDM HFB-based ADC. It may be seen that a matrix F(z) of M 2 digital filters is considered in the synthesis stage for an M-branch HFB structure, instead of M ones required for the classical one (compare figures and 2). In the TDM HFB architecture, M consecutive samples (at the Nyquist rate T ) of the original input x(t) are supposed as the input vector s[n]: s[n] = s 0 [n] s [n]. s M [n] = x(n T) x((n )T). x((n (M ))T) n =nm () where n and n may be supposed as the discrete-time indices associated with the sampling rates MT and T respectively. The TDM HFB-based ADC tries to approximate the input vector s[n] at the output ŝ[n]. A blind deconvolution technique may be applied to the TDM HFB-based ADC to correct the analog imperfections, but this is not possible for the classical HFB. Moreover, the spectral simulations have shown that the TDM HFB-based ADC may result in a better performance than the classical one in the absence of realization errors [8]. In this paper, the TDM HFB-based ADC is simulated in the time-domain to demonstrate the validity of proposed model in terms of output resolution. The performance of the TDM HFB is also studied in the presence of realization errors for comparing with the one associated with the classical HFB. The respective sensitivities to the realization errors are compared as well. For this purpose, the TDM HFB architecture is briefly described and the related Perfect Reconstruction (PR) equations are presented in the next section II. Then, an eight-branch structure is assumed for simulating in the time domain for both the classical and TDM architectures. The related output resolutions and sensitivities to the analog imperfections are discussed in the section III. At last, the results of simulations and the comparison are summarized in the section of conclusion IV. II. TDM HFB ARCHITECTURE II-A. MIMO model of TDM HFB ADC In the previous section, it was mentioned that the TDM architecture provides an Multiple-Input Multiple-Output (MIMO) structure for the parallel HFB-based ADC. For better following the TDM structure, a MIMO model has been proposed for the TDM HFB-based ADC so that the input vector s[n] is apparent [8]. Figure 3 shows this MIMO model Fig. 3. The MIMO model of TDM HFB-based A/D converter using the TDM signals s 0 [n], s [n],..., and s M [n]. n and n represent the discrete-time indices related to the rates T and MT respectively. of TDM HFB-based ADC neglecting the quantization noise of ADCs. For convenience, the original analog input x(t) has been replaced by x[n ] which is obtained by sampling x(t) at T (x[n ] = x(n T)). It is desired to reconstruct the sequence x[n ] at the output. Invoking this MIMO model, the decimators exist no longer between the input s[n] and output ŝ[n] vectors. Then, the input and output vectors are associated to each other through an LTI relationship. The
4 (virtual) analysis filters matrix H(z) used in the model includes M 2 filters. Each element H kr (e jω ) may be obtained from the k th analog analysis filter H k (jω) as following [8]: H kr (e jω ) = M M ej ω M r m=0 e j 2π M rm Hk (j ω M j 2π m) (2) M where H k (jω) stands for the periodic extension of H k (jω) considering the interval [ π T, π T ]. Ω and ω stand for the frequencies related to the analog and discrete-time signals respectively. It has been shown that all the elements of H(z) are causal and stable if and only if the analog analysis filters are all causal and stable [8]. According to the practical architecture 2, there are only M signals [x 0 [n], x [n],..., x M [n]] T available for reconstructing the original input (the outputs of analysis part). According to this model, the outputs x[n]= [x 0 [n], x [n],..., x M [n]] T of analysis part may be described in terms of the TDM input vector s[n] in the frequency domain as following: X(e jω ) = H(e jω )S(e jω ) (3) It is apparently associated with an LTI relationship. The input vector S(e jω ) may be reconstructed through a synthesis stage including the synthesis filters matrix F(e jω ). Therefore, the output vector Ŝ(ejω ) can be obtained in the frequency domain as follows: Ŝ(e jω ) = F(e jω )X(e jω ) = F(e jω )H(e jω )S(e jω ) (4) II-B. Design of synthesis filters matrix The TDM architecture of HFB-based ADC is considered (Fig. 2). In the previous section, it was explained that M input samples s 0 [n], s [n],..., and s M [n] are approximated at the output. If one of the analysis or synthesis filters matrices is known, the other one may be calculated. In practice, it is preferable to assume the analog analysis filters a priori regarding to the constraints of analog circuits. Thus, it is here desired to design the synthesis filters assuming a priori M analog circuits as the analysis filters. For conveniently obtaining the synthesis filters matrix F(e jω ), the quantization noise of A/D converters is again neglected. Invoking the MIMO model of TDM HFB-based ADC (Fig. 3), the PR equations will be: F(e jω ).H(e jω ) = I.e jωn d (5) where I represents the identity matrix (M M) and n d stands for an arbitrary delay. n d is considered for holding the causality. Using the Least Squares (LS) optimization, the equation 5 leads to the following solution at each frequency ω: ( F(e jω ) = e jωn d H H (e jω ) H(e jω )H H (e )) jω (6) where the superscript (.) H stands for the conjugate-transpose operation. This relation may be established for N frequency points (N M for a suitable interpolation). Thus, the frequency response of each synthesis filter F ij (e jω ) can be achieved using (6). A Finite-Impulse Response (FIR) filter may approximate the (i,j) th element of synthesis filters matrix. Using FIR estimations of synthesis filters, some distortion and interferences may appear. Results may be interpreted in terms of distortion and Inter-Channel Interference (ICI) terms. ICI terms are equivalent for the aliasing terms considered in the classical HFB structure [9]. Supposing FIR synthesis filters, T(e jω ) is defined as following: T(e jω ) = F(e jω )H(e jω ) T(e jω ) is a matrix containing distortion and ICI terms. It shows that the estimated value ŝ k [n] of k th TDM signal s k [n] may be developed in the frequency domain as: Ŝ k (e jω ) = T k,k (e jω )S k (e jω ) + }{{} distortion M m=0,m k T k,m (e jω )S m (e jω ) } {{ } ICI (7) The (k) th diagonal element T (k+)(k+) (e jω ) of T(e jω ) describes the distortion function related to the TDM component S k (e jω ). The other M elements of (k) th row of the T(e jω ) represent the related ICI terms. e jωn d is the ideal value of the distortion function and the ICI elements are ideally desired to be null. III. SIMULATIONS OF AN EIGHT-BRANCH TDM HFB ADC III-A. Implementation of TDM HFB ADC in the time domain Using MATLAB/Simulink environment, an eight-branch TDM HFB architecture is simulated in the time domain. A simply-realizable bank of analysis filters is regarded including an RC and 7 RLC circuits. The outputs follow the input signals with a delay. It is reminded that the delay would be Mn d T in the TDM HFB case where M, n d and T represent the number of branches, the delay considered at each branch and Nyquist sampling period respectively. It is M times larger than the delay n d T related to the classical HFB. To obtain an acceptable performance with the FIR synthesis filters, a small ratio of each TDM signal spectrum is considered as Guard Band (GB) [8]. Equivalently, an oversampling ratio is used in the classical HFB case. Both the GB and oversampling ratios are here supposed to be 7%. Figure 4 shows the error spectrum when the input is a sinusoidal signal at the frequency ω = 0.5π 8T. For this sinusoidal input, no signal appears at the guard bands of eight TDM components. A parallel to serial operation has been applied to the TDM components for reconstructing the original input. It may be seen that the TDM HFB exhibits clearly a better performance than the classical HFB for this sinusoidal input. An important signal appear at the oversampling spectral area for the classical HFB so that a
5 db Classical HFB Error spectrum normalized to input variance Oversampling area 80 TDM HFB Normalized frequency Fig. 4. The error spectrum associated with the TDM (blue) and classical (red) HFB structures for a sinusoidal input. db Error spectrum normalized to input variance (chirp input) Oversampling area Classical HFB GB peak classical HFB has to be filtered to the frequency interval [ ( α)π,( α)π]. The output of each branch of the TDM HFB is to be post-filtered with the same filter. Thus, the TDM HFB would need M digital filtering process applied to the outputs of M branches. Finally, the simulations in time domain exhibit that the TDM HFB architecture may lead to a better performance than the classical one in the absence of realization errors with respect to the ICI (versus aliasing in the classical case) interference terms. III-B. Sensitivity to the analog imperfections For studying the sensitivity to the realization errors, both the classical and TDM HFB structures are simulated in the presence of analog imperfections. The same eight-branch HFB architectures of the previous section are considered. To observe the effects of realization errors, all electronic elements (R, C and L) included in the analysis filter bank are considered with a Gaussian profile. The STandard Deviation (STD) of Gaussian distribution is employed for representing the analog imperfections. The simulations are repeated for 000 trials of each value of realization error. The output resolution of HFB structures are used for comparison. Firstly, the input is assumed to be a sinusoidal signal at the frequency ω = 0.5π 8T. Figure 6 shows the output resolution (in bits) of the classical and TDM HFBs versus the realization errors. If TDM HFB Normalized frequency Fig. 5. The error spectrum associated with the TDM (blue) and classical (red) HFB structures for a chirp input. Resolution (bits) Resolution for TDM and claasical HFBs (sinusoidal input) TDM with PF TDM without PF Classical with PF Classical without PF Post-Filtering (PF) is necessary to omit this part of output signal. For example, Signal-to-Noise Ratio (SNR) at the output of classical HFB structure remains at 49dB without the PF process. If the oversampling spectral area is filtered out, the output SNR would be 73dB for the classical HFB. In return, no signal appears at the guard bands of TDM HFB structure for this sinusoidal input signal. The TDM HFB provides a SNR of 23dB in this case which is 50dB better than the classical architecture. Figure 5 provides a comparison between the TDM and classical HFBs supposing a chirp input signal. The input chirp sweeps the spectrum at the interval [0, π T ( α)] that α is supposed to be the oversampling ratio of 7% (α = 0.07). As figure 5 shows, the oversampling area has not been filtered out for the classical HFB neither the GB peaks due to the TDM HFB. Neglecting the oversampling and GB spectral regions, the classical and TDM architectures provide the output SNR of 63dB and 9dB respectively. However, the output of the STD of realization errors (%) Fig. 6. The output resolution of the classical (in red) and TDM (in blue) HFB architectures versus the relative realization errors. A sinusoidal signal has been applied to the input. Post-Filtering (PF) is applied for eliminating the oversampling and GB spectral areas in the classical and TDM cases respectively, the TDM HFB architecture is associated with a performance of 3 bits better than the one related to the classical HFB in the presence of realization errors. It means that the TDM HFB is less sensitive than the classical one to the realization errors in the case of sinusoidal input. In other words, the SNR at the output of this eight-branch TDM HFB is about 20dB better than the one related to the classical
6 HFB. If GB spectral areas are not filtered out in the TDM HFB, it leads to the same resolution that a classical HFB may provide with eliminating the oversampling band. This shows that the TDM HFB architecture may provide at worst case (meaning without PF) the same performance that the classical one. To have a comparison in the whole spectrum, a chirp input sweeping the frequency interval [0, π T ( α)] is applied to both the TDM and classical structures. α stands for the oversampling ratio of 7% (α = 0.07). Like to the sinusoidal case, a similar procedure is applied to obtain the sensitivity to the realization errors. Figure 7 illustrates the output resolution of TDM and classical HFBs versus the STD of realization errors. For the chirp input signal, Resolution (bits) Resolution for TDM and claasical HFBs (chirp input) TDM with PF TDM without PF Classical with PF Classical without PF STD of realization errors (%) Fig. 7. The output resolution of the classical (in red) and TDM (in blue) HFB architectures versus the relative realization errors. A chirp signal is considered as the input. the TDM HFB architecture exhibits a better performance about bit in the presence of analog imperfections than the classical HFB. It is reminded that the performance of TDM HFB is much better than the one related to the classical HFB in the absence of realization errors (refer to Fig. 7 at the STD of errors equal to zero). Another interesting result may be deducted from these two simulations. According to figures 6 and 7, the TDM HFB may provide a performance approximately equal to the classical HFB even if no Post- Filtering (PF) is considered to eliminate the GB spectral areas. However, if the oversampling spectral area is not postfiltered out in the classical HFB, the performance degrades so much. IV. CONCLUSION The simulations of TDM HFB-based ADCs in the time domain (using MATLAB/Simulink) show that the mathematical equations for the TDM architecture in the frequency domain are valid in the time domain. It is also shown that the TDM architecture may provide much better performance in terms of the output resolution than the classical HFB in the absence of realization errors (about 0 and 6 bits improvement for the sinusoidal and chirp inputs respectively). In the presence of realization errors, the TDM HFB leads to a larger resolution (3 and one bits) than the classical one (for the sinusoidal and chirp inputs respectively). The Post-Filtering process seems to always be necessary for the classical HFB for eliminating the oversampling spectral area. Although the TDM HFB requires M 2 digital synthesis filters compared to M ones of classical case, the computation complexity per each output sample is the same for both structures because the TDM HFB provides M output samples at each cycle. Finally, an LTI relationship governs between the input and outputs of the TDM HFB but it is not LTI for the classical case. Thus, a blind deconvolution may be applied only to the TDM architecture for adaptively correcting the realization errors. This is not possible for the classical HFB-based ADC. V. REFERENCES [] Schreier R., Temes G.C., Understanding Delta-sigma data converters, Wiley-IEEE Press, [2] Tuttlebee W., Manor R., The Software radio technology: a european perspective, IEEE Communications Magazine, Feb., 999, pp [3] Franca J., Petraglia A., Mitra S. K., Multirate Analog- Digital systems for signal processing and conversion, Proceedings of the IEEE, vol.65, no.2, Feb., 997, pp [4] Velazquez S.R., Nguyen T.Q., Broadstone, S.R., Design of Hybrid Filter Banks for Analog/Digital conversion, IEEE Transactions On Signal Processing, vol.46, no.4, Apr., 998, pp [5] Asemani D., Oksman J., Influences of oversampling and analog imperfections on hybrid filter bank A/D converters, IEEE MWSCAS, San Juan, Puerto Rico, Aug., [6] Sanada Y., Ikehara M., Digital compensation scheme for coefficient errors of complex filter bank parallel A/D converter in low-if receivers, Proceedings of 55th IEEE Vehicular Technology Conference, vol. 4, May, 200, pp [7] Pinheiro M. et. al., Improving the near-perfect HFB performance in the presence of realization errors, ICASSP, 200, vol. 2, pp [8] Asemani D., Oksman J., Time-Division Multiplexing architecture for Hybrid Filter Bank A/D converters, submitted to IEEE MWSCAS, Montreal, Canada, Aug., [9] Lowenborg P., Johansson H., Wanhammar L., Twochannel digital and hybrid Analog/Digital multirate filter banks with very low-complexity analysis or synthesis filters, IEEE Transactions on circuits and Systems, vol.50, no.7, July, 2003, pp
Time-Division Multiplexing Architecture for Hybrid Filter Bank A/D converters
Time-Division Multiplexing Architecture for Hybrid Filter Bank A/D converters Davud Asemani, Jacques Oksman To cite this version: Davud Asemani, Jacques Oksman Time-Division Multiplexing Architecture for
More informationRegularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material
Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material Yingying Song, David Brie, El-Hadi Djermoune, Simon Henrot To cite this version: Yingying Song,
More informationlambda-min Decoding Algorithm of Regular and Irregular LDPC Codes
lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes Emmanuel Boutillon, Frédéric Guillou, Jean-Luc Danger To cite this version: Emmanuel Boutillon, Frédéric Guillou, Jean-Luc Danger lambda-min
More informationBoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm
BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard To cite this version: Zeina Azmeh, Fady Hamoui, Marianne Huchard. BoxPlot++. RR-11001, 2011. HAL Id: lirmm-00557222 https://hal-lirmm.ccsd.cnrs.fr/lirmm-00557222
More informationThe Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks
The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks Florian Huc, Claudia Linhares Sales, Hervé Rivano To cite this version: Florian Huc, Claudia Linhares Sales, Hervé Rivano.
More informationLossless and Lossy Minimal Redundancy Pyramidal Decomposition for Scalable Image Compression Technique
Lossless and Lossy Minimal Redundancy Pyramidal Decomposition for Scalable Image Compression Technique Marie Babel, Olivier Déforges To cite this version: Marie Babel, Olivier Déforges. Lossless and Lossy
More informationRobust IP and UDP-lite header recovery for packetized multimedia transmission
Robust IP and UDP-lite header recovery for packetized multimedia transmission Michel Kieffer, François Mériaux To cite this version: Michel Kieffer, François Mériaux. Robust IP and UDP-lite header recovery
More informationTraffic Grooming in Bidirectional WDM Ring Networks
Traffic Grooming in Bidirectional WDM Ring Networks Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau To cite this version: Jean-Claude Bermond, David Coudert, Xavier Munoz, Ignasi Sau. Traffic
More informationA N-dimensional Stochastic Control Algorithm for Electricity Asset Management on PC cluster and Blue Gene Supercomputer
A N-dimensional Stochastic Control Algorithm for Electricity Asset Management on PC cluster and Blue Gene Supercomputer Stéphane Vialle, Xavier Warin, Patrick Mercier To cite this version: Stéphane Vialle,
More informationDANCer: Dynamic Attributed Network with Community Structure Generator
DANCer: Dynamic Attributed Network with Community Structure Generator Oualid Benyahia, Christine Largeron, Baptiste Jeudy, Osmar Zaïane To cite this version: Oualid Benyahia, Christine Largeron, Baptiste
More informationHow to simulate a volume-controlled flooding with mathematical morphology operators?
How to simulate a volume-controlled flooding with mathematical morphology operators? Serge Beucher To cite this version: Serge Beucher. How to simulate a volume-controlled flooding with mathematical morphology
More informationA Methodology for Improving Software Design Lifecycle in Embedded Control Systems
A Methodology for Improving Software Design Lifecycle in Embedded Control Systems Mohamed El Mongi Ben Gaïd, Rémy Kocik, Yves Sorel, Rédha Hamouche To cite this version: Mohamed El Mongi Ben Gaïd, Rémy
More informationHySCaS: Hybrid Stereoscopic Calibration Software
HySCaS: Hybrid Stereoscopic Calibration Software Guillaume Caron, Damien Eynard To cite this version: Guillaume Caron, Damien Eynard. HySCaS: Hybrid Stereoscopic Calibration Software. SPIE newsroom in
More informationComparison of radiosity and ray-tracing methods for coupled rooms
Comparison of radiosity and ray-tracing methods for coupled rooms Jimmy Dondaine, Alain Le Bot, Joel Rech, Sébastien Mussa Peretto To cite this version: Jimmy Dondaine, Alain Le Bot, Joel Rech, Sébastien
More informationBlind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better
Blind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better Waseem Safi Fabrice Maurel Jean-Marc Routoure Pierre Beust Gaël Dias To cite this version: Waseem Safi Fabrice Maurel Jean-Marc
More informationAn Experimental Assessment of the 2D Visibility Complex
An Experimental Assessment of the D Visibility Complex Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang To cite this version: Hazel Everett, Sylvain Lazard, Sylvain Petitjean, Linqiao Zhang.
More informationMoveability and Collision Analysis for Fully-Parallel Manipulators
Moveability and Collision Analysis for Fully-Parallel Manipulators Damien Chablat, Philippe Wenger To cite this version: Damien Chablat, Philippe Wenger. Moveability and Collision Analysis for Fully-Parallel
More informationTacked Link List - An Improved Linked List for Advance Resource Reservation
Tacked Link List - An Improved Linked List for Advance Resource Reservation Li-Bing Wu, Jing Fan, Lei Nie, Bing-Yi Liu To cite this version: Li-Bing Wu, Jing Fan, Lei Nie, Bing-Yi Liu. Tacked Link List
More informationAn Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions
An Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions Huaibin Tang, Qinghua Zhang To cite this version: Huaibin Tang, Qinghua Zhang.
More informationService Reconfiguration in the DANAH Assistive System
Service Reconfiguration in the DANAH Assistive System Said Lankri, Pascal Berruet, Jean-Luc Philippe To cite this version: Said Lankri, Pascal Berruet, Jean-Luc Philippe. Service Reconfiguration in the
More informationStudy on Feebly Open Set with Respect to an Ideal Topological Spaces
Study on Feebly Open Set with Respect to an Ideal Topological Spaces Yiezi K. Al Talkany, Suadud H. Al Ismael To cite this version: Yiezi K. Al Talkany, Suadud H. Al Ismael. Study on Feebly Open Set with
More informationRelabeling nodes according to the structure of the graph
Relabeling nodes according to the structure of the graph Ronan Hamon, Céline Robardet, Pierre Borgnat, Patrick Flandrin To cite this version: Ronan Hamon, Céline Robardet, Pierre Borgnat, Patrick Flandrin.
More informationEfficient Gradient Method for Locally Optimizing the Periodic/Aperiodic Ambiguity Function
Efficient Gradient Method for Locally Optimizing the Periodic/Aperiodic Ambiguity Function F Arlery, R assab, U Tan, F Lehmann To cite this version: F Arlery, R assab, U Tan, F Lehmann. Efficient Gradient
More informationA Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications
A Generic Architecture of CCSDS Low Density Parity Check Decoder for Near-Earth Applications Fabien Demangel, Nicolas Fau, Nicolas Drabik, François Charot, Christophe Wolinski To cite this version: Fabien
More informationKeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard
KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard Mathieu Raynal, Nadine Vigouroux To cite this version: Mathieu Raynal, Nadine Vigouroux. KeyGlasses : Semi-transparent keys
More informationSDLS: a Matlab package for solving conic least-squares problems
SDLS: a Matlab package for solving conic least-squares problems Didier Henrion, Jérôme Malick To cite this version: Didier Henrion, Jérôme Malick. SDLS: a Matlab package for solving conic least-squares
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Ju Zhou, Hehui Wu To cite this version: Hong-Jian Lai, Yehong Shao, Ju Zhou, Hehui Wu. Every 3-connected,
More informationBranch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows
Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu To cite this version: Estèle Glize, Nicolas Jozefowiez,
More informationSetup of epiphytic assistance systems with SEPIA
Setup of epiphytic assistance systems with SEPIA Blandine Ginon, Stéphanie Jean-Daubias, Pierre-Antoine Champin, Marie Lefevre To cite this version: Blandine Ginon, Stéphanie Jean-Daubias, Pierre-Antoine
More informationSliding HyperLogLog: Estimating cardinality in a data stream
Sliding HyperLogLog: Estimating cardinality in a data stream Yousra Chabchoub, Georges Hébrail To cite this version: Yousra Chabchoub, Georges Hébrail. Sliding HyperLogLog: Estimating cardinality in a
More informationEfficient implementation of interval matrix multiplication
Efficient implementation of interval matrix multiplication Hong Diep Nguyen To cite this version: Hong Diep Nguyen. Efficient implementation of interval matrix multiplication. Para 2010: State of the Art
More informationVery Tight Coupling between LTE and WiFi: a Practical Analysis
Very Tight Coupling between LTE and WiFi: a Practical Analysis Younes Khadraoui, Xavier Lagrange, Annie Gravey To cite this version: Younes Khadraoui, Xavier Lagrange, Annie Gravey. Very Tight Coupling
More informationFuzzy sensor for the perception of colour
Fuzzy sensor for the perception of colour Eric Benoit, Laurent Foulloy, Sylvie Galichet, Gilles Mauris To cite this version: Eric Benoit, Laurent Foulloy, Sylvie Galichet, Gilles Mauris. Fuzzy sensor for
More informationLinked data from your pocket: The Android RDFContentProvider
Linked data from your pocket: The Android RDFContentProvider Jérôme David, Jérôme Euzenat To cite this version: Jérôme David, Jérôme Euzenat. Linked data from your pocket: The Android RDFContentProvider.
More informationSynthesis of fixed-point programs: the case of matrix multiplication
Synthesis of fixed-point programs: the case of matrix multiplication Mohamed Amine Najahi To cite this version: Mohamed Amine Najahi. Synthesis of fixed-point programs: the case of matrix multiplication.
More informationKernel perfect and critical kernel imperfect digraphs structure
Kernel perfect and critical kernel imperfect digraphs structure Hortensia Galeana-Sánchez, Mucuy-Kak Guevara To cite this version: Hortensia Galeana-Sánchez, Mucuy-Kak Guevara. Kernel perfect and critical
More informationSpectral Active Clustering of Remote Sensing Images
Spectral Active Clustering of Remote Sensing Images Zifeng Wang, Gui-Song Xia, Caiming Xiong, Liangpei Zhang To cite this version: Zifeng Wang, Gui-Song Xia, Caiming Xiong, Liangpei Zhang. Spectral Active
More informationThe Connectivity Order of Links
The Connectivity Order of Links Stéphane Dugowson To cite this version: Stéphane Dugowson. The Connectivity Order of Links. 4 pages, 2 figures. 2008. HAL Id: hal-00275717 https://hal.archives-ouvertes.fr/hal-00275717
More informationChange Detection System for the Maintenance of Automated Testing
Change Detection System for the Maintenance of Automated Testing Miroslav Bures To cite this version: Miroslav Bures. Change Detection System for the Maintenance of Automated Testing. Mercedes G. Merayo;
More informationRepresentation of Finite Games as Network Congestion Games
Representation of Finite Games as Network Congestion Games Igal Milchtaich To cite this version: Igal Milchtaich. Representation of Finite Games as Network Congestion Games. Roberto Cominetti and Sylvain
More informationA Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme
A Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme Yue Zhang, Yunxia Pei To cite this version: Yue Zhang, Yunxia Pei. A Resource Discovery Algorithm in Mobile Grid Computing
More informationNatural Language Based User Interface for On-Demand Service Composition
Natural Language Based User Interface for On-Demand Service Composition Marcel Cremene, Florin-Claudiu Pop, Stéphane Lavirotte, Jean-Yves Tigli To cite this version: Marcel Cremene, Florin-Claudiu Pop,
More informationMokka, main guidelines and future
Mokka, main guidelines and future P. Mora De Freitas To cite this version: P. Mora De Freitas. Mokka, main guidelines and future. H. Videau; J-C. Brient. International Conference on Linear Collider, Apr
More informationSimulations of VANET Scenarios with OPNET and SUMO
Simulations of VANET Scenarios with OPNET and SUMO Florent Kaisser, Christophe Gransart, Marion Berbineau To cite this version: Florent Kaisser, Christophe Gransart, Marion Berbineau. Simulations of VANET
More informationFault-Tolerant Storage Servers for the Databases of Redundant Web Servers in a Computing Grid
Fault-Tolerant s for the Databases of Redundant Web Servers in a Computing Grid Minhwan Ok To cite this version: Minhwan Ok. Fault-Tolerant s for the Databases of Redundant Web Servers in a Computing Grid.
More informationLaHC at CLEF 2015 SBS Lab
LaHC at CLEF 2015 SBS Lab Nawal Ould-Amer, Mathias Géry To cite this version: Nawal Ould-Amer, Mathias Géry. LaHC at CLEF 2015 SBS Lab. Conference and Labs of the Evaluation Forum, Sep 2015, Toulouse,
More informationOverlay of Multicast Service in WDM-PON Based on Dynamic Wavelength Reflection Scheme
Overlay of Multicast Service in WDM-PON Based on Dynamic Wavelength Reflection Scheme Min Zhu, Shilin Xiao, Wei Guo, He Chen, Anne Wei, Yaohui Jin, Weisheng Hu, Benoit Geller To cite this version: Min
More informationA Practical Approach for 3D Model Indexing by combining Local and Global Invariants
A Practical Approach for 3D Model Indexing by combining Local and Global Invariants Jean-Philippe Vandeborre, Vincent Couillet, Mohamed Daoudi To cite this version: Jean-Philippe Vandeborre, Vincent Couillet,
More informationAccurate Conversion of Earth-Fixed Earth-Centered Coordinates to Geodetic Coordinates
Accurate Conversion of Earth-Fixed Earth-Centered Coordinates to Geodetic Coordinates Karl Osen To cite this version: Karl Osen. Accurate Conversion of Earth-Fixed Earth-Centered Coordinates to Geodetic
More informationA Multi-purpose Objective Quality Metric for Image Watermarking
A Multi-purpose Objective Quality Metric for Image Watermarking Vinod Pankajakshan, Florent Autrusseau To cite this version: Vinod Pankajakshan, Florent Autrusseau. A Multi-purpose Objective Quality Metric
More informationPrototype Selection Methods for On-line HWR
Prototype Selection Methods for On-line HWR Jakob Sternby To cite this version: Jakob Sternby. Prototype Selection Methods for On-line HWR. Guy Lorette. Tenth International Workshop on Frontiers in Handwriting
More informationQuasi-tilings. Dominique Rossin, Daniel Krob, Sebastien Desreux
Quasi-tilings Dominique Rossin, Daniel Krob, Sebastien Desreux To cite this version: Dominique Rossin, Daniel Krob, Sebastien Desreux. Quasi-tilings. FPSAC/SFCA 03, 2003, Linkoping, Sweden. 2003.
More informationComparator: A Tool for Quantifying Behavioural Compatibility
Comparator: A Tool for Quantifying Behavioural Compatibility Meriem Ouederni, Gwen Salaün, Javier Cámara, Ernesto Pimentel To cite this version: Meriem Ouederni, Gwen Salaün, Javier Cámara, Ernesto Pimentel.
More informationFrom medical imaging to numerical simulations
From medical imaging to numerical simulations Christophe Prud Homme, Vincent Chabannes, Marcela Szopos, Alexandre Ancel, Julien Jomier To cite this version: Christophe Prud Homme, Vincent Chabannes, Marcela
More informationMapping classifications and linking related classes through SciGator, a DDC-based browsing library interface
Mapping classifications and linking related classes through SciGator, a DDC-based browsing library interface Marcin Trzmielewski, Claudio Gnoli, Marco Lardera, Gaia Heidi Pallestrini, Matea Sipic To cite
More informationTaking Benefit from the User Density in Large Cities for Delivering SMS
Taking Benefit from the User Density in Large Cities for Delivering SMS Yannick Léo, Anthony Busson, Carlos Sarraute, Eric Fleury To cite this version: Yannick Léo, Anthony Busson, Carlos Sarraute, Eric
More informationInverting the Reflectance Map with Binary Search
Inverting the Reflectance Map with Binary Search François Faure To cite this version: François Faure. Inverting the Reflectance Map with Binary Search. Lecture Notes in Computer Science, Springer, 1995,
More informationThroughput prediction in wireless networks using statistical learning
Throughput prediction in wireless networks using statistical learning Claudina Rattaro, Pablo Belzarena To cite this version: Claudina Rattaro, Pablo Belzarena. Throughput prediction in wireless networks
More informationA case-based reasoning approach for unknown class invoice processing
A case-based reasoning approach for unknown class invoice processing Hatem Hamza, Yolande Belaïd, Abdel Belaïd To cite this version: Hatem Hamza, Yolande Belaïd, Abdel Belaïd. A case-based reasoning approach
More informationA 64-Kbytes ITTAGE indirect branch predictor
A 64-Kbytes ITTAGE indirect branch André Seznec To cite this version: André Seznec. A 64-Kbytes ITTAGE indirect branch. JWAC-2: Championship Branch Prediction, Jun 2011, San Jose, United States. 2011,.
More informationReal-Time Collision Detection for Dynamic Virtual Environments
Real-Time Collision Detection for Dynamic Virtual Environments Gabriel Zachmann, Matthias Teschner, Stefan Kimmerle, Bruno Heidelberger, Laks Raghupathi, Arnulph Fuhrmann To cite this version: Gabriel
More informationAnu Kalidas Muralidharan Pillai and Håkan Johansson
2014 IEEE International Conference on Acoustic, Speech and Signal Processing (ICASSP) A SUB-BAND BASED RECONSTRUCTOR FOR M-CHANNEL TIME-INTERLEAVED ADCS WITH MISSING SAMPLES Anu Kalidas Muralidharan Pillai
More informationFramework for Hierarchical and Distributed Smart Grid Management
Framework for Hierarchical and Distributed Smart Grid Management Rémi Bonnefoi, Christophe Moy, Jacques Palicot To cite this version: Rémi Bonnefoi, Christophe Moy, Jacques Palicot. Framework for Hierarchical
More informationProactive Small Cell Networks
Proactive Small Cell Networks Ejder Bastug, Jean-Louis Guénégo, Mérouane Debbah To cite this version: Ejder Bastug, Jean-Louis Guénégo, Mérouane Debbah Proactive Small Cell Networks ICT 23, May 23, Casablanca,
More informationQuickRanking: Fast Algorithm For Sorting And Ranking Data
QuickRanking: Fast Algorithm For Sorting And Ranking Data Laurent Ott To cite this version: Laurent Ott. QuickRanking: Fast Algorithm For Sorting And Ranking Data. Fichiers produits par l auteur. 2015.
More informationOptimization Methods for Solving the Low Autocorrelation Sidelobes Problem
Optimization Methods for Solving the Low Autocorrelation Sidelobes Problem U. Tan, O Rabaste, C Adnet, F Arlery, J.-P Ovarlez To cite this version: U. Tan, O Rabaste, C Adnet, F Arlery, J.-P Ovarlez. Optimization
More informationA Voronoi-Based Hybrid Meshing Method
A Voronoi-Based Hybrid Meshing Method Jeanne Pellerin, Lévy Bruno, Guillaume Caumon To cite this version: Jeanne Pellerin, Lévy Bruno, Guillaume Caumon. A Voronoi-Based Hybrid Meshing Method. 2012. hal-00770939
More informationDSM GENERATION FROM STEREOSCOPIC IMAGERY FOR DAMAGE MAPPING, APPLICATION ON THE TOHOKU TSUNAMI
DSM GENERATION FROM STEREOSCOPIC IMAGERY FOR DAMAGE MAPPING, APPLICATION ON THE TOHOKU TSUNAMI Cyrielle Guérin, Renaud Binet, Marc Pierrot-Deseilligny To cite this version: Cyrielle Guérin, Renaud Binet,
More informationComparison of spatial indexes
Comparison of spatial indexes Nathalie Andrea Barbosa Roa To cite this version: Nathalie Andrea Barbosa Roa. Comparison of spatial indexes. [Research Report] Rapport LAAS n 16631,., 13p. HAL
More informationAn FCA Framework for Knowledge Discovery in SPARQL Query Answers
An FCA Framework for Knowledge Discovery in SPARQL Query Answers Melisachew Wudage Chekol, Amedeo Napoli To cite this version: Melisachew Wudage Chekol, Amedeo Napoli. An FCA Framework for Knowledge Discovery
More informationSIM-Mee - Mobilizing your social network
SIM-Mee - Mobilizing your social network Jérémie Albert, Serge Chaumette, Damien Dubernet, Jonathan Ouoba To cite this version: Jérémie Albert, Serge Chaumette, Damien Dubernet, Jonathan Ouoba. SIM-Mee
More informationAssisted Policy Management for SPARQL Endpoints Access Control
Assisted Policy Management for SPARQL Endpoints Access Control Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien Gandon To cite this version: Luca Costabello, Serena Villata, Iacopo Vagliano, Fabien
More informationImplementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context
Implementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context Bertrand Gilles, Laurent Tchamnda Nana, Valérie-Anne Nicolas To cite this version: Bertrand
More informationReverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces
Reverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces Romain Delamare, Benoit Baudry, Yves Le Traon To cite this version: Romain Delamare, Benoit Baudry, Yves Le Traon. Reverse-engineering
More informationMotion-based obstacle detection and tracking for car driving assistance
Motion-based obstacle detection and tracking for car driving assistance G. Lefaix, E. Marchand, Patrick Bouthemy To cite this version: G. Lefaix, E. Marchand, Patrick Bouthemy. Motion-based obstacle detection
More informationThe optimal routing of augmented cubes.
The optimal routing of augmented cubes. Meirun Chen, Reza Naserasr To cite this version: Meirun Chen, Reza Naserasr. The optimal routing of augmented cubes.. Information Processing Letters, Elsevier, 28.
More informationZigbee Wireless Sensor Network Nodes Deployment Strategy for Digital Agricultural Data Acquisition
Zigbee Wireless Sensor Network Nodes Deployment Strategy for Digital Agricultural Data Acquisition Xinjian Xiang, Xiaoqing Guo To cite this version: Xinjian Xiang, Xiaoqing Guo. Zigbee Wireless Sensor
More informationLinux: Understanding Process-Level Power Consumption
Linux: Understanding Process-Level Power Consumption Aurélien Bourdon, Adel Noureddine, Romain Rouvoy, Lionel Seinturier To cite this version: Aurélien Bourdon, Adel Noureddine, Romain Rouvoy, Lionel Seinturier.
More informationType Feedback for Bytecode Interpreters
Type Feedback for Bytecode Interpreters Michael Haupt, Robert Hirschfeld, Marcus Denker To cite this version: Michael Haupt, Robert Hirschfeld, Marcus Denker. Type Feedback for Bytecode Interpreters. ICOOOLPS
More informationYAM++ : A multi-strategy based approach for Ontology matching task
YAM++ : A multi-strategy based approach for Ontology matching task Duy Hoa Ngo, Zohra Bellahsene To cite this version: Duy Hoa Ngo, Zohra Bellahsene. YAM++ : A multi-strategy based approach for Ontology
More informationTHE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS
THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS Antoine Mhanna To cite this version: Antoine Mhanna. THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS. 016. HAL Id: hal-0158188
More informationMUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor
MUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor Matthieu Nicolas, Victorien Elvinger, Gérald Oster, Claudia-Lavinia Ignat, François Charoy To cite this version: Matthieu Nicolas, Victorien
More informationAcyclic Coloring of Graphs of Maximum Degree
Acyclic Coloring of Graphs of Maximum Degree Guillaume Fertin, André Raspaud To cite this version: Guillaume Fertin, André Raspaud. Acyclic Coloring of Graphs of Maximum Degree. Stefan Felsner. 005 European
More informationContinuous Control of Lagrangian Data
Continuous Control of Lagrangian Data Pierre Allain, Nicolas Courty, Thomas Corpetti To cite this version: Pierre Allain, Nicolas Courty, Thomas Corpetti. Continuous Control of Lagrangian Data. 3rd International
More informationA case-based reasoning approach for invoice structure extraction
A case-based reasoning approach for invoice structure extraction Hatem Hamza, Yolande Belaïd, Abdel Belaïd To cite this version: Hatem Hamza, Yolande Belaïd, Abdel Belaïd. A case-based reasoning approach
More informationA Practical Evaluation Method of Network Traffic Load for Capacity Planning
A Practical Evaluation Method of Network Traffic Load for Capacity Planning Takeshi Kitahara, Shuichi Nawata, Masaki Suzuki, Norihiro Fukumoto, Shigehiro Ano To cite this version: Takeshi Kitahara, Shuichi
More informationReal-time tracking of multiple persons by Kalman filtering and face pursuit for multimedia applications
Real-time tracking of multiple persons by Kalman filtering and face pursuit for multimedia applications Vincent Girondel, Alice Caplier, Laurent Bonnaud To cite this version: Vincent Girondel, Alice Caplier,
More informationOptimization of an Offset Reflector Antenna Using Genetic Algorithms
Optimization of an Offset Reflector Antenna Using Genetic Algorithms Sergio Avila, Walter Carpes, Joao Vasconcelos To cite this version: Sergio Avila, Walter Carpes, Joao Vasconcelos Optimization of an
More informationUsing a Medical Thesaurus to Predict Query Difficulty
Using a Medical Thesaurus to Predict Query Difficulty Florian Boudin, Jian-Yun Nie, Martin Dawes To cite this version: Florian Boudin, Jian-Yun Nie, Martin Dawes. Using a Medical Thesaurus to Predict Query
More informationQuality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment
Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment Kuo-Qin Yan, Yung-Hsiang Su, Hsin-Met Chuan, Shu-Ching Wang, Bo-Wei Chen
More informationROBUST MOTION SEGMENTATION FOR HIGH DEFINITION VIDEO SEQUENCES USING A FAST MULTI-RESOLUTION MOTION ESTIMATION BASED ON SPATIO-TEMPORAL TUBES
ROBUST MOTION SEGMENTATION FOR HIGH DEFINITION VIDEO SEQUENCES USING A FAST MULTI-RESOLUTION MOTION ESTIMATION BASED ON SPATIO-TEMPORAL TUBES Olivier Brouard, Fabrice Delannay, Vincent Ricordel, Dominique
More informationStructuring the First Steps of Requirements Elicitation
Structuring the First Steps of Requirements Elicitation Jeanine Souquières, Maritta Heisel To cite this version: Jeanine Souquières, Maritta Heisel. Structuring the First Steps of Requirements Elicitation.
More informationAn Object Oriented Finite Element Toolkit
An Object Oriented Finite Element Toolkit Rachid Touzani To cite this version: Rachid Touzani. An Object Oriented Finite Element Toolkit. Mang, H.A.; Rammerstorfer, F.G.; Eberhardsteiner, J. Fifth World
More informationNP versus PSPACE. Frank Vega. To cite this version: HAL Id: hal https://hal.archives-ouvertes.fr/hal
NP versus PSPACE Frank Vega To cite this version: Frank Vega. NP versus PSPACE. Preprint submitted to Theoretical Computer Science 2015. 2015. HAL Id: hal-01196489 https://hal.archives-ouvertes.fr/hal-01196489
More informationMultimedia CTI Services for Telecommunication Systems
Multimedia CTI Services for Telecommunication Systems Xavier Scharff, Pascal Lorenz, Zoubir Mammeri To cite this version: Xavier Scharff, Pascal Lorenz, Zoubir Mammeri. Multimedia CTI Services for Telecommunication
More informationCatalogue of architectural patterns characterized by constraint components, Version 1.0
Catalogue of architectural patterns characterized by constraint components, Version 1.0 Tu Minh Ton That, Chouki Tibermacine, Salah Sadou To cite this version: Tu Minh Ton That, Chouki Tibermacine, Salah
More informationMulti-atlas labeling with population-specific template and non-local patch-based label fusion
Multi-atlas labeling with population-specific template and non-local patch-based label fusion Vladimir Fonov, Pierrick Coupé, Simon Eskildsen, Jose Manjon, Louis Collins To cite this version: Vladimir
More informationA Fuzzy Approach for Background Subtraction
A Fuzzy Approach for Background Subtraction Fida El Baf, Thierry Bouwmans, Bertrand Vachon To cite this version: Fida El Baf, Thierry Bouwmans, Bertrand Vachon. A Fuzzy Approach for Background Subtraction.
More informationPrimitive roots of bi-periodic infinite pictures
Primitive roots of bi-periodic infinite pictures Nicolas Bacquey To cite this version: Nicolas Bacquey. Primitive roots of bi-periodic infinite pictures. Words 5, Sep 5, Kiel, Germany. Words 5, Local Proceedings.
More informationTemperature measurement in the Intel CoreTM Duo Processor
Temperature measurement in the Intel CoreTM Duo Processor E. Rotem, J. Hermerding, A. Cohen, H. Cain To cite this version: E. Rotem, J. Hermerding, A. Cohen, H. Cain. Temperature measurement in the Intel
More information