三维（3—D）封装技术

3-D多芯片组件（MCM）是未来微电子封装的发展趋势。本文介绍了超大规模集成（VLSI）用的3-D封装技术的最新进展,详细报导了垂直互连技术,概括讨论了选择3-D叠层技术的一些关键问题,并对3-D封装和2-D封装及分立器件进行了对比。     

高密度3-D封装技术的应用与发展趋势

高密度3-D封装技术是国内外近几年飞速发展的微电子封装技术。它在2-D平面基础上向立体化发展,实现了一种新的更高层次的混合集成,因而具有更高的组装密度、更强的功能、更优的性能、更小的体积、更低的功耗、更快的速度、更小的延迟等优势。该技术正在加速未来电子整机系统的微小型化。主要介绍了近年来3-D封装应用状况和一种新型的封装技术——系统上封装SOP(System-on-Package)。     

3-D MCM封装技术及其应用

介绍了超大规模集成电路（VLSI）用的3-D MCM封装技术的最新发展，重点介绍了3-D MCM封装垂直互连工艺，分析了3-D MCM封装技术的硅效率、复杂程度、热处理、互连密度、系统功率与速度等问题，并对3-D MCM封装的应用作了简要说明。     

3-D MCM 的种类

介绍了3-D MCM封装的种类,其中包括芯片垂直互连和2-D MCM的垂直互连。芯片的垂直互连,包括芯片之间通过周边进行互连,以及芯片之间通过贯穿芯片进行垂直互连(面互连);2-D MCM模块垂直互连,包括2-D MCM之间通过周边进行互连,以及面互连的模式。     

WLP与3-D集成：界限何在？

你将如何在晶圆级封装（WLP）和3-D集成之间划线分界呢？向不同的人请教这一问题，很可能你会得到一些完全不同的回答。     

3-D叠层芯片封装技术

超大规模集成电路(VLSI)技术的不断革新要求 IC 产品和其它系统元素之间的互连数目不断增长,而且互连线要短,电信号线仍将维持大容量和高速度。为了跟上 IC 对封装的速度和密度增长的要求,需要更多地使用薄膜多芯片组件。这里推荐一种既能满足将来的要求又能突破先前已有方法的局限性的3-D 叠层技术。     

3-D封装时代拉开帷幕

正如Joseph Fjelstad（SiliconPipe的创始人和CEO）在SEMICON West 2007所做的一个关于先进封装的报告中所指出的，在电子封装发展史上有着三个显著的时期（图）。这些时期包括通孔、表面组装和芯片级封装。我们目前的许多技术仍处于芯片级时代，但是封装领域的新纪元将是3-D技术——虽然它几年前才刚刚开始。     

厚积而薄发的3-D立体影视

3-D立体影视已有70多年的历史,近年数字技术推动3-D立体影视技术突飞猛进,3-D立体影视开始大行其道.本文在系统阐述国内外3-D立体影视现状的基础上,对3-D立体影视的发展态势进行了深入的分析.     

3D-TSV技术——延续摩尔定律的有效通途

对于堆叠器件的3-D封装领域而言,硅通孔技术(TSV)是一种新兴的技术解决方案.将器件3D层叠和互连可以进一步加快产品的时钟频率、降低能耗和提高集成度.为了在容许的成本范围内跟上摩尔定律的步伐,在主流器件设计和生产过程中采用三维互联技术将会成为必然.介绍了TSV技术的潜在优势,和制约该技术发展的一些不利因素及业界新的举...     

用统一的时域近场—远场变换求解目标瞬态散射特性

利用拉氏变换和卷积的方法,导出了求解3-D和2-D时域散射远场的形式上统一的公式,使得2-D情况成为3-D的一个特例,这给编制求解时域散射远场的通用程序带来方便.同时这种3-D的近场-远场变换算法和原来的算法比较并没有增加计算量.对简单形体的计算验证了算法的可行性.     

2010年SID关于三维显示的报道

近年来,Display Week（SID会展）已设立了三维显示相关的分会。2010年随着三维显示技术已达到商业化水平,SID为三维显示设立了专场。2010年有9场关于三维显示技术的分会：以偏振为基础的立体投影显示、立体显示中的串扰问题、裸眼立体显示、裸眼立体显示测试、裸眼立体显示中二维／三维的切换、三维显示中的人机工程、立体和整体成像、三维电视和三维影像、新型三维技术。     

3-D discrete analytical ridgelet transform.

In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines: 3-D discrete radial lines going through the origin defined from their orthogonal projections and 3-D planes covered with 2-D discrete line segments. These discrete analytical lines have a parameter called arithmetical thickness, allowing us to define a 3-D DART adapted to a specific application. Indeed, the 3-D DART representation is not orthogonal, It is associated with a flexible redundancy factor. The 3-D DART has a very simple forward/inverse algorithm that provides an exact reconstruction without any iterative method. In order to illustrate the potentiality of this new discrete transform, we apply the 3-D DART and its extension to the Local-DART (with smooth windowing) to the denoising of 3-D image and color video. These experimental results show that the simple thresholding of the 3-D DART coefficients is efficient.     

Fast algorithm for the 3-D DCT-II

Recently, many applications for three-dimensional (3-D) image and video compression have been proposed using 3-D discrete cosine transforms (3-D DCTs). Among different types of DCTs, the type-II DCT (DCT-II) is the most used. In order to use the 3-D DCTs in practical applications, fast 3-D algorithms are essential. Therefore, in this paper, the 3-D vector-radix decimation-in-frequency (3-D VR DIF) algorithm that calculates the 3-D DCT-II directly is introduced. The mathematical analysis and the implementation of the developed algorithm are presented, showing that this algorithm possesses a regular structure, can be implemented in-place for efficient use of memory, and is faster than the conventional row-column-frame (RCF) approach. Furthermore, an application of 3-D video compression-based 3-D DCT-II is implemented using the 3-D new algorithm. This has led to a substantial speed improvement for 3-D DCT-II-based compression systems and proved the validity of the developed algorithm.     

Three-dimensional face reconstruction from a single image by a coupled RBF network

Reconstruction of a 3-D face model from a single 2-D face image is fundamentally important for face recognition and animation because the 3-D face model is invariant to changes of viewpoint, illumination, background clutter, and occlusions. Given a coupled training set that contains pairs of 2-D faces and the corresponding 3-D faces, we train a novel coupled radial basis function network (C-RBF) to recover the 3-D face model from a single 2-D face image. The C-RBF network explores: 1) the intrinsic representations of 3-D face models and those of 2-D face images; 2) mappings between a 3-D face model and its intrinsic representation; and 3) mappings between a 2-D face image and its intrinsic representation. Since a particular face can be reconstructed by its nearest neighbors, we can assume that the linear combination coefficients for a particular 2-D face image reconstruction are identical to those for the corresponding 3-D face model reconstruction. Therefore, we can reconstruct a 3-D face model by using a single 2-D face image based on the C-RBF network. Extensive experimental results on the BU3D database indicate the effectiveness of the proposed C-RBF network for recovering the 3-D face model from a single 2-D face image.     

Rigid-motion-invariant classification of 3-D textures

This paper studies the problem of 3-D rigid-motion-invariant texture discrimination for discrete 3-D textures that are spatially homogeneous by modeling them as stationary Gaussian random fields. The latter property and our formulation of a 3-D rigid motion of a texture reduce the problem to the study of 3-D rotations of discrete textures. We formally develop the concept of 3-D texture rotations in the 3-D digital domain. We use this novel concept to define a "distance" between 3-D textures that remains invariant under all 3-D rigid motions of the texture. This concept of "distance" can be used for a monoscale or a multiscale 3-D rigid-motion-invariant testing of the statistical similarity of the 3-D textures. To compute the "distance" between any two rotations R(1) and R(2) of two given 3-D textures, we use the Kullback-Leibler divergence between 3-D Gaussian Markov random fields fitted to the rotated texture data. Then, the 3-D rigid-motion-invariant texture distance is the integral average, with respect to the Haar measure of the group SO(3), of all of these divergences when rotations R(1) and R(2) vary throughout SO(3). We also present an algorithm enabling the computation of the proposed 3-D rigid-motion-invariant texture distance as well as rules for 3-D rigid-motion-invariant texture discrimination/classification and experimental results demonstrating the capabilities of the proposed 3-D rigid-motion texture discrimination rules when applied in a multiscale setting, even on very general 3-D texture models.     

脉冲激光辐照下材料的光热特性研究

建立了单脉冲激光加热下材料温度场的三维和一维理论模型，并将其进行比较，存在较大的差异。通过改变多种参数对三维模型进行研究，给出何时三维模型可以用一维模型代替，以及用无限大边界条件下得到的三维温度场模型来处理实际问题的不足。     

A Fully Multiplexed First-Order Frequency-Planar Module for Fan, Beam, and Cone Plane-Wave Filters

A VLSI architecture for the on-chip realization of a first-order two-dimensional (2-D) or three-dimensional (3-D) infinte impulse response (IIR) fully multiplexed frequency-planar filter module (FMFPM) is proposed. Such filter modules may be used in 3-D video processing and 2-D/3-D plane-wave filtering using sensor arrays. The proposed FMFPM can potentially be used as a 2-D/3-D IIR building block circuit for the on-chip realization of second- (or higher) order frequency-planar filters, 3-D IIR beam filters, 2-D IIR fan filter banks and 3-D IIR cone filter banks.     

Model Specification of a Noncausal 3-D AR Process Using a Causal 3-D AR Model on the Nonsymmetric Half-Space

There exists a causal 3-D AR process on the nonsymmetric half-space having the same autocorrelations as a noncausal 3-D AR process. A formula is presented to relate the AR coefficients of the noncausal 3-D AR process with those of the causal 3-D AR process on the nonsymmetric half-space. The 3-D Yule-Walker equations are derived for causal 3-D AR models on the nonsymmetric half-space, and a computationally efficient order-recursive algorithm is proposed to solve the 3-D Yule-Walker equations. We can easily specify a noncausal 3-D AR process from its autocorrelations using the autocorrelation equivalence relation, the formula of the AR coefficients and the order-recursive algorithm.     

基于造影图像的冠状动脉三维定量分析的研究

由于X射线造影成像把血管三维空间结构投影到二维图像上,基于二维造影图像的传统诊治方法存在很大局限性.本文在冠状动脉树三维重建的基础上,研究了冠状动脉的三维定量分析方法,提出血管直径、分支夹角和血管段长度的三维测量方法.并利用冠状动脉树实物模型进行实验,对二维和三维定量分析结果进行了比较.实验结果表明,三维定量分析能够有效地提高临床医学参数的测量精度.因此,在冠心病的临床诊断和介入治疗中,该方法能够可靠地诊断血管狭窄及选择和放置支架.     

A computational framework for approximating boundary surfaces in 3-D biomedical images.

We propose a new method for detecting and approximating the boundary surfaces in three-dimensional (3-D) biomedical images. Using this method, each boundary surface in the original 3-D image is normalized as a zero-value isosurface of a new 3-D image transformed from the original 3-D image. A novel computational framework is proposed to perform such an image transformation. According to this framework, we first detect boundary surfaces from the original 3-D image and compute discrete samplings of the boundary surfaces. Based on these discrete samplings, a new 3-D image is constructed for each boundary surface such that the boundary surface can be well approximated by a zero-value isosurface in the new 3-D image. In this way, the complex problem of reconstructing boundary surfaces in the original 3-D image is converted into a task to extract a zero-value isosurface from the new 3-D image. The proposed technique is not only capable of adequately reconstructing complex boundary surfaces in 3-D biomedical images, but it also overcomes vital limitations encountered by the isosurface-extracting method when the method is used to reconstruct boundary surfaces from 3-D images. The performances and advantages of the proposed computational framework are illustrated by many examples from different 3-D biomedical images.