Toward a Random Operation of Networks

Wire bonding is eliminated in the assembly of microelectronic devices, by a process involving the direct bonding of circuit electrodes to an unsupported metallic sheet-frame member having a plurality of inwardly extending leads. A single-step vibratory pressure welding technique is employed for the simultaneous bonding of all leads to a semiconductor integrated circuit chip. Lateral confinement of the leads during the bonding steps causes a buckling action to introduce a small but critical loop in each lead to ensure clearance between the lead fingers and the perimeter of the semiconductor chip, whereby electrical shorting is avoided. The loop also provides a structural flexibility in the leads, which tends to protect the bonding sites from excessive stresses. Subsequently, the first frame member including the bonded circuit is attached, preferably by resistance welding, to a second lead frame member of heavier gage and increased dimensions, suitable for connection with external circuitry. Excess portions of the first frame member are then removed, providing a completed assembly for packaging; e.g., plastic encapsulation or hermetic sealing, as in a ceramic-glass flat package.

[1]  Imre Csiszár Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[2]  Sergio D. Servetto,et al.  Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks , 2002, WSNA '02.

[3]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[4]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[5]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[6]  Dana Ron,et al.  Bounds on Linear Codes for Network Multicast , 2003, Electron. Colloquium Comput. Complex..

[7]  R. Koetter,et al.  Network Coding for Correlated Sources , 2004 .

[8]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[9]  Takahiro Matsuda,et al.  Performance evaluation of new multicast architecture with network coding , 2003 .

[10]  D. Karger,et al.  On Coding for Non-Multicast Networks ∗ , 2003 .

[11]  Randall Dougherty,et al.  Linearity and solvability in multicast networks , 2004, IEEE Transactions on Information Theory.

[12]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[13]  R. Koetter,et al.  Network coding from a network flow perspective , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[14]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[15]  Murali S. Kodialam,et al.  Online multicast routing with bandwidth guarantees: a new approach using multicast network flow , 2003, TNET.

[16]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[17]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[18]  K. Jain,et al.  Practical Network Coding , 2003 .

[19]  Ying Zhu,et al.  Multicast with network coding in application-layer overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[20]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[21]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .